java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.trace.refinement.strategy SIFA_TAIPAN --sifa.abstract.domain CompoundDomain --rcfgbuilder.size.of.a.code.block LoopFreeBlock --sifa.call.summarizer TopInputCallSummarizer --sifa.fluid SizeLimitFluid --sifa.simplification.technique SIMPLIFY_QUICK -i ../../../trunk/examples/svcomp/array-crafted/zero_sum_m5.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-06 23:16:10,839 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-06 23:16:10,842 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-06 23:16:10,854 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-06 23:16:10,854 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-06 23:16:10,856 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-06 23:16:10,857 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-06 23:16:10,859 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-06 23:16:10,861 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-06 23:16:10,862 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-06 23:16:10,863 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-06 23:16:10,864 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-06 23:16:10,864 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-06 23:16:10,865 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-06 23:16:10,867 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-06 23:16:10,868 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-06 23:16:10,868 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-06 23:16:10,869 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-06 23:16:10,871 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-06 23:16:10,873 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-06 23:16:10,875 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-06 23:16:10,876 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-06 23:16:10,877 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-06 23:16:10,878 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-06 23:16:10,880 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-06 23:16:10,880 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-06 23:16:10,880 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-06 23:16:10,881 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-06 23:16:10,882 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-06 23:16:10,883 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-06 23:16:10,883 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-06 23:16:10,884 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-06 23:16:10,884 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-06 23:16:10,885 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-06 23:16:10,886 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-06 23:16:10,886 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-06 23:16:10,887 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-06 23:16:10,887 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-06 23:16:10,887 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-06 23:16:10,888 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-06 23:16:10,889 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-06 23:16:10,890 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-06 23:16:10,904 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-06 23:16:10,905 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-06 23:16:10,906 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-06 23:16:10,906 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-06 23:16:10,906 INFO L138 SettingsManager]: * Use SBE=true [2019-10-06 23:16:10,906 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-06 23:16:10,907 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-06 23:16:10,907 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-06 23:16:10,907 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-06 23:16:10,907 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-06 23:16:10,907 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-06 23:16:10,908 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-06 23:16:10,908 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-06 23:16:10,908 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-06 23:16:10,908 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-06 23:16:10,908 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-06 23:16:10,909 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-06 23:16:10,909 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-06 23:16:10,909 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-06 23:16:10,909 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-06 23:16:10,910 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-06 23:16:10,910 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-06 23:16:10,910 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-06 23:16:10,910 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-06 23:16:10,910 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-06 23:16:10,911 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-06 23:16:10,911 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-06 23:16:10,911 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-06 23:16:10,911 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-06 23:16:11,208 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-06 23:16:11,226 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-06 23:16:11,230 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-06 23:16:11,232 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-06 23:16:11,232 INFO L275 PluginConnector]: CDTParser initialized [2019-10-06 23:16:11,233 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-crafted/zero_sum_m5.c [2019-10-06 23:16:11,305 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d00c8581e/b650a0a7787644d39f2a74e6e4e7c9ef/FLAGdf0f8acf2 [2019-10-06 23:16:11,789 INFO L306 CDTParser]: Found 1 translation units. [2019-10-06 23:16:11,790 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-crafted/zero_sum_m5.c [2019-10-06 23:16:11,798 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d00c8581e/b650a0a7787644d39f2a74e6e4e7c9ef/FLAGdf0f8acf2 [2019-10-06 23:16:12,163 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d00c8581e/b650a0a7787644d39f2a74e6e4e7c9ef [2019-10-06 23:16:12,179 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-06 23:16:12,180 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-06 23:16:12,182 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-06 23:16:12,182 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-06 23:16:12,185 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-06 23:16:12,186 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.10 11:16:12" (1/1) ... [2019-10-06 23:16:12,190 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43cf2eda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:16:12, skipping insertion in model container [2019-10-06 23:16:12,190 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.10 11:16:12" (1/1) ... [2019-10-06 23:16:12,198 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-06 23:16:12,219 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-06 23:16:12,481 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-06 23:16:12,485 INFO L188 MainTranslator]: Completed pre-run [2019-10-06 23:16:12,594 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-06 23:16:12,623 INFO L192 MainTranslator]: Completed translation [2019-10-06 23:16:12,624 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:16:12 WrapperNode [2019-10-06 23:16:12,624 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-06 23:16:12,624 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-06 23:16:12,625 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-06 23:16:12,625 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-06 23:16:12,634 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:16:12" (1/1) ... [2019-10-06 23:16:12,635 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:16:12" (1/1) ... [2019-10-06 23:16:12,643 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:16:12" (1/1) ... [2019-10-06 23:16:12,644 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:16:12" (1/1) ... [2019-10-06 23:16:12,654 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:16:12" (1/1) ... [2019-10-06 23:16:12,663 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:16:12" (1/1) ... [2019-10-06 23:16:12,666 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:16:12" (1/1) ... [2019-10-06 23:16:12,673 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-06 23:16:12,676 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-06 23:16:12,677 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-06 23:16:12,677 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-06 23:16:12,678 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:16:12" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-06 23:16:12,745 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-06 23:16:12,745 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-06 23:16:12,745 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-06 23:16:12,745 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-06 23:16:12,746 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-06 23:16:12,746 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-06 23:16:12,746 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-06 23:16:12,746 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_short [2019-10-06 23:16:12,746 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-06 23:16:12,747 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-06 23:16:12,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-06 23:16:12,747 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-06 23:16:12,747 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-06 23:16:12,747 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-06 23:16:12,747 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-06 23:16:13,372 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-06 23:16:13,373 INFO L284 CfgBuilder]: Removed 11 assume(true) statements. [2019-10-06 23:16:13,374 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.10 11:16:13 BoogieIcfgContainer [2019-10-06 23:16:13,374 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-06 23:16:13,376 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-06 23:16:13,376 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-06 23:16:13,379 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-06 23:16:13,380 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.10 11:16:12" (1/3) ... [2019-10-06 23:16:13,381 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d5497bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.10 11:16:13, skipping insertion in model container [2019-10-06 23:16:13,381 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:16:12" (2/3) ... [2019-10-06 23:16:13,382 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d5497bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.10 11:16:13, skipping insertion in model container [2019-10-06 23:16:13,382 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.10 11:16:13" (3/3) ... [2019-10-06 23:16:13,384 INFO L109 eAbstractionObserver]: Analyzing ICFG zero_sum_m5.c [2019-10-06 23:16:13,394 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-06 23:16:13,403 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-06 23:16:13,415 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-06 23:16:13,440 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-06 23:16:13,441 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-06 23:16:13,441 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-06 23:16:13,441 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-06 23:16:13,442 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-06 23:16:13,442 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-06 23:16:13,442 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-06 23:16:13,442 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-06 23:16:13,461 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2019-10-06 23:16:13,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-06 23:16:13,468 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:16:13,469 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:16:13,471 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:16:13,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:16:13,478 INFO L82 PathProgramCache]: Analyzing trace with hash -205990741, now seen corresponding path program 1 times [2019-10-06 23:16:13,487 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:16:13,488 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:16:13,488 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:16:13,488 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:16:13,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:16:13,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:16:13,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-06 23:16:13,752 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:16:13,753 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-06 23:16:13,754 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-06 23:16:13,760 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-06 23:16:13,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-06 23:16:13,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-06 23:16:13,782 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 5 states. [2019-10-06 23:16:13,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:16:13,966 INFO L93 Difference]: Finished difference Result 56 states and 79 transitions. [2019-10-06 23:16:13,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-06 23:16:13,969 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-10-06 23:16:13,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:16:13,981 INFO L225 Difference]: With dead ends: 56 [2019-10-06 23:16:13,981 INFO L226 Difference]: Without dead ends: 32 [2019-10-06 23:16:13,988 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-06 23:16:14,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-10-06 23:16:14,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-10-06 23:16:14,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-10-06 23:16:14,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 51 transitions. [2019-10-06 23:16:14,047 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 51 transitions. Word has length 21 [2019-10-06 23:16:14,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:16:14,048 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 51 transitions. [2019-10-06 23:16:14,050 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-06 23:16:14,050 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 51 transitions. [2019-10-06 23:16:14,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-06 23:16:14,053 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:16:14,053 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:16:14,054 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:16:14,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:16:14,055 INFO L82 PathProgramCache]: Analyzing trace with hash 940905143, now seen corresponding path program 1 times [2019-10-06 23:16:14,056 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:16:14,056 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:16:14,056 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:16:14,056 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:16:14,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:16:14,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:16:14,167 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-06 23:16:14,167 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:16:14,168 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-06 23:16:14,168 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-06 23:16:14,170 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-06 23:16:14,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-06 23:16:14,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-06 23:16:14,171 INFO L87 Difference]: Start difference. First operand 32 states and 51 transitions. Second operand 3 states. [2019-10-06 23:16:14,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:16:14,225 INFO L93 Difference]: Finished difference Result 58 states and 96 transitions. [2019-10-06 23:16:14,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-06 23:16:14,226 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-10-06 23:16:14,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:16:14,227 INFO L225 Difference]: With dead ends: 58 [2019-10-06 23:16:14,228 INFO L226 Difference]: Without dead ends: 33 [2019-10-06 23:16:14,229 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-06 23:16:14,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-10-06 23:16:14,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-10-06 23:16:14,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-10-06 23:16:14,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 52 transitions. [2019-10-06 23:16:14,237 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 52 transitions. Word has length 22 [2019-10-06 23:16:14,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:16:14,238 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 52 transitions. [2019-10-06 23:16:14,238 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-06 23:16:14,238 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 52 transitions. [2019-10-06 23:16:14,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-06 23:16:14,239 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:16:14,239 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:16:14,240 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:16:14,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:16:14,240 INFO L82 PathProgramCache]: Analyzing trace with hash 1041186174, now seen corresponding path program 1 times [2019-10-06 23:16:14,241 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:16:14,241 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:16:14,241 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:16:14,241 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:16:14,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:16:14,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:16:14,318 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-06 23:16:14,319 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:16:14,320 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-06 23:16:14,320 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-06 23:16:14,321 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-06 23:16:14,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-06 23:16:14,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-06 23:16:14,322 INFO L87 Difference]: Start difference. First operand 33 states and 52 transitions. Second operand 4 states. [2019-10-06 23:16:14,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:16:14,501 INFO L93 Difference]: Finished difference Result 56 states and 92 transitions. [2019-10-06 23:16:14,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-06 23:16:14,502 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2019-10-06 23:16:14,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:16:14,503 INFO L225 Difference]: With dead ends: 56 [2019-10-06 23:16:14,504 INFO L226 Difference]: Without dead ends: 33 [2019-10-06 23:16:14,504 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-06 23:16:14,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-10-06 23:16:14,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-10-06 23:16:14,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-10-06 23:16:14,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 43 transitions. [2019-10-06 23:16:14,523 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 43 transitions. Word has length 23 [2019-10-06 23:16:14,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:16:14,524 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 43 transitions. [2019-10-06 23:16:14,524 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-06 23:16:14,524 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2019-10-06 23:16:14,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-06 23:16:14,526 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:16:14,526 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:16:14,527 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:16:14,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:16:14,527 INFO L82 PathProgramCache]: Analyzing trace with hash 608840992, now seen corresponding path program 1 times [2019-10-06 23:16:14,527 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:16:14,527 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:16:14,528 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:16:14,528 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:16:14,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:16:14,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:16:14,646 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-06 23:16:14,647 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:16:14,647 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:16:14,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:16:14,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:16:14,736 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-06 23:16:14,745 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:16:14,810 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-06 23:16:14,810 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:16:14,849 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-06 23:16:14,850 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:16:14,908 INFO L162 IcfgInterpreter]: Started Sifa with 22 locations of interest [2019-10-06 23:16:14,908 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:16:14,915 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:16:14,924 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:16:14,925 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:16:15,087 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 25 for LOIs [2019-10-06 23:16:15,712 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-06 23:16:15,741 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 13 for LOIs [2019-10-06 23:16:15,748 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:16:15,749 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:16:15,750 INFO L193 IcfgInterpreter]: Reachable states at location L11 satisfy 38#(and (= |old(~SIZE~0)| 0) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |old(~SIZE~0)|) (= |#valid| |old(#valid)|) (<= 0 (+ ~SIZE~0 32768)) (<= |old(~SIZE~0)| 0) (<= ~SIZE~0 32767) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|)) [2019-10-06 23:16:15,750 INFO L193 IcfgInterpreter]: Reachable states at location L3-1 satisfy 473#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:16:15,751 INFO L193 IcfgInterpreter]: Reachable states at location L57-3 satisfy 377#(<= 0 main_~i~0) [2019-10-06 23:16:15,751 INFO L193 IcfgInterpreter]: Reachable states at location L47-3 satisfy 301#(<= 0 main_~i~0) [2019-10-06 23:16:15,752 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 482#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~SIZE~0)| ~SIZE~0)) [2019-10-06 23:16:15,752 INFO L193 IcfgInterpreter]: Reachable states at location L37-3 satisfy 225#(<= 0 main_~i~0) [2019-10-06 23:16:15,752 INFO L193 IcfgInterpreter]: Reachable states at location L27-3 satisfy 149#(<= 0 main_~i~0) [2019-10-06 23:16:15,753 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 73#true [2019-10-06 23:16:15,753 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 478#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:16:15,754 INFO L193 IcfgInterpreter]: Reachable states at location L3 satisfy 468#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-06 23:16:15,754 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (= ~SIZE~0 0) (<= 0 |#NULL.base|) (<= 0 ~SIZE~0) (= |#NULL.offset| 0) (<= ~SIZE~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:16:15,754 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= |old(~SIZE~0)| 0) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |old(~SIZE~0)|) (= |#valid| |old(#valid)|) (<= |old(~SIZE~0)| 0) (<= 0 ~SIZE~0) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (<= ~SIZE~0 0) (= |old(~SIZE~0)| ~SIZE~0)) [2019-10-06 23:16:15,755 INFO L193 IcfgInterpreter]: Reachable states at location L62-3 satisfy 415#(<= 0 main_~i~0) [2019-10-06 23:16:15,755 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 487#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= ~SIZE~0 0) (<= 0 |#NULL.base|) (<= 0 ~SIZE~0) (= |#NULL.offset| 0) (<= ~SIZE~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:16:15,756 INFO L193 IcfgInterpreter]: Reachable states at location L52-3 satisfy 339#(<= 0 main_~i~0) [2019-10-06 23:16:15,757 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:16:15,757 INFO L193 IcfgInterpreter]: Reachable states at location L42-3 satisfy 263#(<= 0 main_~i~0) [2019-10-06 23:16:15,758 INFO L193 IcfgInterpreter]: Reachable states at location L32-3 satisfy 187#(<= 0 main_~i~0) [2019-10-06 23:16:15,758 INFO L193 IcfgInterpreter]: Reachable states at location L22-3 satisfy 111#(<= 0 main_~i~0) [2019-10-06 23:16:15,758 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 463#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| 0))) [2019-10-06 23:16:15,759 INFO L193 IcfgInterpreter]: Reachable states at location L67-4 satisfy 458#(and (not (< main_~i~0 ~SIZE~0)) (<= 0 main_~i~0)) [2019-10-06 23:16:15,759 INFO L193 IcfgInterpreter]: Reachable states at location L67-3 satisfy 453#(<= 0 main_~i~0) [2019-10-06 23:16:16,214 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:16:16,214 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4, 11] total 19 [2019-10-06 23:16:16,216 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-06 23:16:16,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-06 23:16:16,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2019-10-06 23:16:16,217 INFO L87 Difference]: Start difference. First operand 33 states and 43 transitions. Second operand 19 states. [2019-10-06 23:16:16,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:16:16,829 INFO L93 Difference]: Finished difference Result 69 states and 99 transitions. [2019-10-06 23:16:16,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-06 23:16:16,830 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 32 [2019-10-06 23:16:16,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:16:16,831 INFO L225 Difference]: With dead ends: 69 [2019-10-06 23:16:16,831 INFO L226 Difference]: Without dead ends: 44 [2019-10-06 23:16:16,832 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=99, Invalid=551, Unknown=0, NotChecked=0, Total=650 [2019-10-06 23:16:16,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-10-06 23:16:16,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-10-06 23:16:16,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-10-06 23:16:16,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 54 transitions. [2019-10-06 23:16:16,845 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 54 transitions. Word has length 32 [2019-10-06 23:16:16,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:16:16,846 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 54 transitions. [2019-10-06 23:16:16,846 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-06 23:16:16,846 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 54 transitions. [2019-10-06 23:16:16,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-10-06 23:16:16,849 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:16:16,849 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:16:17,053 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:16:17,054 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:16:17,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:16:17,055 INFO L82 PathProgramCache]: Analyzing trace with hash -1666989621, now seen corresponding path program 2 times [2019-10-06 23:16:17,055 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:16:17,055 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:16:17,055 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:16:17,055 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:16:17,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:16:17,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:16:19,346 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-06 23:16:19,348 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:16:19,348 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:16:19,349 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:16:19,453 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-10-06 23:16:19,453 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:16:19,456 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 90 conjunts are in the unsatisfiable core [2019-10-06 23:16:19,468 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:16:20,567 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-06 23:16:20,567 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:16:22,509 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-06 23:16:22,510 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:16:22,512 INFO L162 IcfgInterpreter]: Started Sifa with 22 locations of interest [2019-10-06 23:16:22,512 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:16:22,513 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:16:22,513 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:16:22,514 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:16:22,551 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 25 for LOIs [2019-10-06 23:16:22,914 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-06 23:16:22,927 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 13 for LOIs [2019-10-06 23:16:22,931 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:16:22,931 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:16:22,931 INFO L193 IcfgInterpreter]: Reachable states at location L11 satisfy 38#(and (= |old(~SIZE~0)| 0) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0)) (<= 0 |old(~SIZE~0)|) (= |#valid| |old(#valid)|) (<= 0 (+ ~SIZE~0 32768)) (<= |old(~SIZE~0)| 0) (<= ~SIZE~0 32767) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|)) [2019-10-06 23:16:22,932 INFO L193 IcfgInterpreter]: Reachable states at location L3-1 satisfy 473#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:16:22,932 INFO L193 IcfgInterpreter]: Reachable states at location L57-3 satisfy 377#(<= 0 main_~i~0) [2019-10-06 23:16:22,932 INFO L193 IcfgInterpreter]: Reachable states at location L47-3 satisfy 301#(<= 0 main_~i~0) [2019-10-06 23:16:22,932 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 482#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~SIZE~0)| ~SIZE~0)) [2019-10-06 23:16:22,933 INFO L193 IcfgInterpreter]: Reachable states at location L37-3 satisfy 225#(<= 0 main_~i~0) [2019-10-06 23:16:22,933 INFO L193 IcfgInterpreter]: Reachable states at location L27-3 satisfy 149#(<= 0 main_~i~0) [2019-10-06 23:16:22,933 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 73#true [2019-10-06 23:16:22,933 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 478#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:16:22,934 INFO L193 IcfgInterpreter]: Reachable states at location L3 satisfy 468#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-06 23:16:22,934 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (= ~SIZE~0 0) (<= 0 |#NULL.base|) (<= 0 ~SIZE~0) (= |#NULL.offset| 0) (<= ~SIZE~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:16:22,934 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= |old(~SIZE~0)| 0) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0)) (<= 0 |old(~SIZE~0)|) (= |#valid| |old(#valid)|) (<= |old(~SIZE~0)| 0) (<= 0 ~SIZE~0) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (<= ~SIZE~0 0) (= |old(~SIZE~0)| ~SIZE~0)) [2019-10-06 23:16:22,934 INFO L193 IcfgInterpreter]: Reachable states at location L62-3 satisfy 415#(<= 0 main_~i~0) [2019-10-06 23:16:22,935 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 487#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= ~SIZE~0 0) (<= 0 |#NULL.base|) (<= 0 ~SIZE~0) (= |#NULL.offset| 0) (<= ~SIZE~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:16:22,935 INFO L193 IcfgInterpreter]: Reachable states at location L52-3 satisfy 339#(<= 0 main_~i~0) [2019-10-06 23:16:22,935 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:16:22,935 INFO L193 IcfgInterpreter]: Reachable states at location L42-3 satisfy 263#(<= 0 main_~i~0) [2019-10-06 23:16:22,936 INFO L193 IcfgInterpreter]: Reachable states at location L32-3 satisfy 187#(<= 0 main_~i~0) [2019-10-06 23:16:22,936 INFO L193 IcfgInterpreter]: Reachable states at location L22-3 satisfy 111#(<= 0 main_~i~0) [2019-10-06 23:16:22,936 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 463#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| 1))) [2019-10-06 23:16:22,936 INFO L193 IcfgInterpreter]: Reachable states at location L67-4 satisfy 458#(and (not (< main_~i~0 ~SIZE~0)) (<= 0 main_~i~0)) [2019-10-06 23:16:22,936 INFO L193 IcfgInterpreter]: Reachable states at location L67-3 satisfy 453#(<= 0 main_~i~0) [2019-10-06 23:16:23,886 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:16:23,887 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 27, 30, 11] total 76 [2019-10-06 23:16:23,888 INFO L442 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-10-06 23:16:23,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-10-06 23:16:23,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=240, Invalid=5460, Unknown=0, NotChecked=0, Total=5700 [2019-10-06 23:16:23,892 INFO L87 Difference]: Start difference. First operand 44 states and 54 transitions. Second operand 76 states. [2019-10-06 23:16:26,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:16:26,849 INFO L93 Difference]: Finished difference Result 77 states and 96 transitions. [2019-10-06 23:16:26,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-10-06 23:16:26,850 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 43 [2019-10-06 23:16:26,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:16:26,852 INFO L225 Difference]: With dead ends: 77 [2019-10-06 23:16:26,852 INFO L226 Difference]: Without dead ends: 72 [2019-10-06 23:16:26,857 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 68 SyntacticMatches, 23 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2067 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=327, Invalid=7505, Unknown=0, NotChecked=0, Total=7832 [2019-10-06 23:16:26,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-10-06 23:16:26,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2019-10-06 23:16:26,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-10-06 23:16:26,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 89 transitions. [2019-10-06 23:16:26,868 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 89 transitions. Word has length 43 [2019-10-06 23:16:26,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:16:26,868 INFO L462 AbstractCegarLoop]: Abstraction has 70 states and 89 transitions. [2019-10-06 23:16:26,869 INFO L463 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-10-06 23:16:26,869 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 89 transitions. [2019-10-06 23:16:26,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-06 23:16:26,870 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:16:26,870 INFO L385 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:16:27,075 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:16:27,076 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:16:27,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:16:27,077 INFO L82 PathProgramCache]: Analyzing trace with hash -893816937, now seen corresponding path program 3 times [2019-10-06 23:16:27,077 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:16:27,078 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:16:27,078 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:16:27,078 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:16:27,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:16:27,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:16:27,144 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-10-06 23:16:27,144 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:16:27,145 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:16:27,145 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:16:27,232 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-06 23:16:27,232 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:16:27,234 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-06 23:16:27,238 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:16:27,316 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-10-06 23:16:27,316 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:16:27,392 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-10-06 23:16:27,392 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:16:27,394 INFO L162 IcfgInterpreter]: Started Sifa with 22 locations of interest [2019-10-06 23:16:27,395 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:16:27,395 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:16:27,395 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:16:27,396 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:16:27,423 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 25 for LOIs [2019-10-06 23:16:27,697 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-06 23:16:27,712 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 13 for LOIs [2019-10-06 23:16:27,716 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:16:27,717 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:16:27,717 INFO L193 IcfgInterpreter]: Reachable states at location L11 satisfy 38#(and (= |old(~SIZE~0)| 0) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |old(~SIZE~0)|) (= |#valid| |old(#valid)|) (<= 0 (+ ~SIZE~0 32768)) (<= |old(~SIZE~0)| 0) (<= ~SIZE~0 32767) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|)) [2019-10-06 23:16:27,717 INFO L193 IcfgInterpreter]: Reachable states at location L3-1 satisfy 473#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:16:27,718 INFO L193 IcfgInterpreter]: Reachable states at location L57-3 satisfy 377#(<= 0 main_~i~0) [2019-10-06 23:16:27,718 INFO L193 IcfgInterpreter]: Reachable states at location L47-3 satisfy 301#(<= 0 main_~i~0) [2019-10-06 23:16:27,718 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 482#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~SIZE~0)| ~SIZE~0)) [2019-10-06 23:16:27,720 INFO L193 IcfgInterpreter]: Reachable states at location L37-3 satisfy 225#(<= 0 main_~i~0) [2019-10-06 23:16:27,721 INFO L193 IcfgInterpreter]: Reachable states at location L27-3 satisfy 149#(<= 0 main_~i~0) [2019-10-06 23:16:27,721 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 73#true [2019-10-06 23:16:27,721 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 478#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:16:27,722 INFO L193 IcfgInterpreter]: Reachable states at location L3 satisfy 468#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-06 23:16:27,722 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (= ~SIZE~0 0) (<= 0 |#NULL.base|) (<= 0 ~SIZE~0) (= |#NULL.offset| 0) (<= ~SIZE~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:16:27,722 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= |old(~SIZE~0)| 0) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |old(~SIZE~0)|) (= |#valid| |old(#valid)|) (<= |old(~SIZE~0)| 0) (<= 0 ~SIZE~0) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (<= ~SIZE~0 0) (= |old(~SIZE~0)| ~SIZE~0)) [2019-10-06 23:16:27,722 INFO L193 IcfgInterpreter]: Reachable states at location L62-3 satisfy 415#(<= 0 main_~i~0) [2019-10-06 23:16:27,723 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 487#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= ~SIZE~0 0) (<= 0 |#NULL.base|) (<= 0 ~SIZE~0) (= |#NULL.offset| 0) (<= ~SIZE~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:16:27,723 INFO L193 IcfgInterpreter]: Reachable states at location L52-3 satisfy 339#(<= 0 main_~i~0) [2019-10-06 23:16:27,723 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:16:27,723 INFO L193 IcfgInterpreter]: Reachable states at location L42-3 satisfy 263#(<= 0 main_~i~0) [2019-10-06 23:16:27,724 INFO L193 IcfgInterpreter]: Reachable states at location L32-3 satisfy 187#(<= 0 main_~i~0) [2019-10-06 23:16:27,724 INFO L193 IcfgInterpreter]: Reachable states at location L22-3 satisfy 111#(<= 0 main_~i~0) [2019-10-06 23:16:27,724 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 463#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| 0))) [2019-10-06 23:16:27,724 INFO L193 IcfgInterpreter]: Reachable states at location L67-4 satisfy 458#(and (not (< main_~i~0 ~SIZE~0)) (<= 0 main_~i~0)) [2019-10-06 23:16:27,724 INFO L193 IcfgInterpreter]: Reachable states at location L67-3 satisfy 453#(<= 0 main_~i~0) [2019-10-06 23:16:28,077 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:16:28,077 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9, 11] total 27 [2019-10-06 23:16:28,079 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-10-06 23:16:28,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-10-06 23:16:28,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=618, Unknown=0, NotChecked=0, Total=702 [2019-10-06 23:16:28,080 INFO L87 Difference]: Start difference. First operand 70 states and 89 transitions. Second operand 27 states. [2019-10-06 23:16:29,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:16:29,596 INFO L93 Difference]: Finished difference Result 179 states and 243 transitions. [2019-10-06 23:16:29,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-10-06 23:16:29,596 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 44 [2019-10-06 23:16:29,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:16:29,600 INFO L225 Difference]: With dead ends: 179 [2019-10-06 23:16:29,600 INFO L226 Difference]: Without dead ends: 146 [2019-10-06 23:16:29,601 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 110 SyntacticMatches, 4 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 548 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=271, Invalid=1891, Unknown=0, NotChecked=0, Total=2162 [2019-10-06 23:16:29,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-10-06 23:16:29,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 79. [2019-10-06 23:16:29,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-10-06 23:16:29,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 98 transitions. [2019-10-06 23:16:29,618 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 98 transitions. Word has length 44 [2019-10-06 23:16:29,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:16:29,618 INFO L462 AbstractCegarLoop]: Abstraction has 79 states and 98 transitions. [2019-10-06 23:16:29,618 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-10-06 23:16:29,618 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 98 transitions. [2019-10-06 23:16:29,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-06 23:16:29,620 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:16:29,620 INFO L385 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:16:29,832 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:16:29,832 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:16:29,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:16:29,833 INFO L82 PathProgramCache]: Analyzing trace with hash -1049065353, now seen corresponding path program 4 times [2019-10-06 23:16:29,834 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:16:29,834 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:16:29,834 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:16:29,834 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:16:29,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:16:29,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:16:29,910 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-10-06 23:16:29,910 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:16:29,911 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:16:29,911 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:16:30,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:16:30,034 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-06 23:16:30,037 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:16:30,088 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-10-06 23:16:30,088 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:16:30,127 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-10-06 23:16:30,127 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:16:30,129 INFO L162 IcfgInterpreter]: Started Sifa with 22 locations of interest [2019-10-06 23:16:30,129 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:16:30,130 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:16:30,130 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:16:30,131 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:16:30,151 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 27 for LOIs [2019-10-06 23:16:30,391 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-06 23:16:30,399 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 13 for LOIs [2019-10-06 23:16:30,402 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:16:30,402 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:16:30,402 INFO L193 IcfgInterpreter]: Reachable states at location L11 satisfy 38#(and (= |old(~SIZE~0)| 0) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |old(~SIZE~0)|) (= 0 (select |old(#valid)| 0)) (= |#valid| |old(#valid)|) (<= 0 (+ ~SIZE~0 32768)) (<= |old(~SIZE~0)| 0) (<= ~SIZE~0 32767) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|)) [2019-10-06 23:16:30,403 INFO L193 IcfgInterpreter]: Reachable states at location L3-1 satisfy 473#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:16:30,403 INFO L193 IcfgInterpreter]: Reachable states at location L57-3 satisfy 377#(<= 0 main_~i~0) [2019-10-06 23:16:30,403 INFO L193 IcfgInterpreter]: Reachable states at location L47-3 satisfy 301#(<= 0 main_~i~0) [2019-10-06 23:16:30,403 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 482#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~SIZE~0)| ~SIZE~0)) [2019-10-06 23:16:30,403 INFO L193 IcfgInterpreter]: Reachable states at location L37-3 satisfy 225#(<= 0 main_~i~0) [2019-10-06 23:16:30,404 INFO L193 IcfgInterpreter]: Reachable states at location L27-3 satisfy 149#(<= 0 main_~i~0) [2019-10-06 23:16:30,404 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 73#true [2019-10-06 23:16:30,404 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 478#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:16:30,404 INFO L193 IcfgInterpreter]: Reachable states at location L3 satisfy 468#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-06 23:16:30,405 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (= ~SIZE~0 0) (<= 0 |#NULL.base|) (<= 0 ~SIZE~0) (= |#NULL.offset| 0) (<= ~SIZE~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:16:30,405 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= |old(~SIZE~0)| 0) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |old(~SIZE~0)|) (= 0 (select |old(#valid)| 0)) (= |#valid| |old(#valid)|) (<= |old(~SIZE~0)| 0) (<= 0 ~SIZE~0) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (<= ~SIZE~0 0) (= |old(~SIZE~0)| ~SIZE~0)) [2019-10-06 23:16:30,405 INFO L193 IcfgInterpreter]: Reachable states at location L62-3 satisfy 415#(<= 0 main_~i~0) [2019-10-06 23:16:30,405 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 487#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= ~SIZE~0 0) (<= 0 |#NULL.base|) (<= 0 ~SIZE~0) (= |#NULL.offset| 0) (<= ~SIZE~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:16:30,405 INFO L193 IcfgInterpreter]: Reachable states at location L52-3 satisfy 339#(<= 0 main_~i~0) [2019-10-06 23:16:30,406 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:16:30,406 INFO L193 IcfgInterpreter]: Reachable states at location L42-3 satisfy 263#(<= 0 main_~i~0) [2019-10-06 23:16:30,406 INFO L193 IcfgInterpreter]: Reachable states at location L32-3 satisfy 187#(<= 0 main_~i~0) [2019-10-06 23:16:30,406 INFO L193 IcfgInterpreter]: Reachable states at location L22-3 satisfy 111#(<= 0 main_~i~0) [2019-10-06 23:16:30,406 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 463#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| 0))) [2019-10-06 23:16:30,407 INFO L193 IcfgInterpreter]: Reachable states at location L67-4 satisfy 458#(and (not (< main_~i~0 ~SIZE~0)) (<= 0 main_~i~0)) [2019-10-06 23:16:30,407 INFO L193 IcfgInterpreter]: Reachable states at location L67-3 satisfy 453#(<= 0 main_~i~0) [2019-10-06 23:16:30,740 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:16:30,740 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9, 11] total 24 [2019-10-06 23:16:30,741 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-10-06 23:16:30,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-06 23:16:30,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=464, Unknown=0, NotChecked=0, Total=552 [2019-10-06 23:16:30,743 INFO L87 Difference]: Start difference. First operand 79 states and 98 transitions. Second operand 24 states. [2019-10-06 23:16:31,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:16:31,330 INFO L93 Difference]: Finished difference Result 144 states and 179 transitions. [2019-10-06 23:16:31,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-06 23:16:31,330 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 44 [2019-10-06 23:16:31,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:16:31,332 INFO L225 Difference]: With dead ends: 144 [2019-10-06 23:16:31,332 INFO L226 Difference]: Without dead ends: 76 [2019-10-06 23:16:31,334 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 113 SyntacticMatches, 5 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=144, Invalid=786, Unknown=0, NotChecked=0, Total=930 [2019-10-06 23:16:31,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-10-06 23:16:31,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2019-10-06 23:16:31,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-10-06 23:16:31,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 94 transitions. [2019-10-06 23:16:31,345 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 94 transitions. Word has length 44 [2019-10-06 23:16:31,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:16:31,346 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 94 transitions. [2019-10-06 23:16:31,346 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-10-06 23:16:31,346 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 94 transitions. [2019-10-06 23:16:31,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-10-06 23:16:31,347 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:16:31,347 INFO L385 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:16:31,550 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:16:31,551 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:16:31,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:16:31,552 INFO L82 PathProgramCache]: Analyzing trace with hash 2141541374, now seen corresponding path program 5 times [2019-10-06 23:16:31,553 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:16:31,553 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:16:31,554 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:16:31,554 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:16:31,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:16:31,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:16:31,624 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-06 23:16:31,624 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:16:31,625 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:16:31,625 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:16:31,780 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-06 23:16:31,780 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:16:31,782 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-06 23:16:31,786 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:16:31,844 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-06 23:16:31,844 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:16:31,885 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-06 23:16:31,885 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:16:31,887 INFO L162 IcfgInterpreter]: Started Sifa with 22 locations of interest [2019-10-06 23:16:31,887 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:16:31,889 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:16:31,889 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:16:31,890 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:16:31,910 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 25 for LOIs [2019-10-06 23:16:32,124 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-06 23:16:32,132 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 13 for LOIs [2019-10-06 23:16:32,135 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:16:32,135 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:16:32,135 INFO L193 IcfgInterpreter]: Reachable states at location L11 satisfy 38#(and (= |old(~SIZE~0)| 0) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0)) (<= 0 |old(~SIZE~0)|) (= |#valid| |old(#valid)|) (<= 0 (+ ~SIZE~0 32768)) (<= |old(~SIZE~0)| 0) (<= ~SIZE~0 32767) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|)) [2019-10-06 23:16:32,136 INFO L193 IcfgInterpreter]: Reachable states at location L3-1 satisfy 473#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:16:32,136 INFO L193 IcfgInterpreter]: Reachable states at location L57-3 satisfy 377#(<= 0 main_~i~0) [2019-10-06 23:16:32,136 INFO L193 IcfgInterpreter]: Reachable states at location L47-3 satisfy 301#(<= 0 main_~i~0) [2019-10-06 23:16:32,136 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 482#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~SIZE~0)| ~SIZE~0)) [2019-10-06 23:16:32,137 INFO L193 IcfgInterpreter]: Reachable states at location L37-3 satisfy 225#(<= 0 main_~i~0) [2019-10-06 23:16:32,137 INFO L193 IcfgInterpreter]: Reachable states at location L27-3 satisfy 149#(<= 0 main_~i~0) [2019-10-06 23:16:32,137 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 73#true [2019-10-06 23:16:32,137 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 478#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:16:32,138 INFO L193 IcfgInterpreter]: Reachable states at location L3 satisfy 468#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-06 23:16:32,138 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (= ~SIZE~0 0) (<= 0 |#NULL.base|) (<= 0 ~SIZE~0) (= |#NULL.offset| 0) (<= ~SIZE~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:16:32,138 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= |old(~SIZE~0)| 0) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0)) (<= 0 |old(~SIZE~0)|) (= |#valid| |old(#valid)|) (<= |old(~SIZE~0)| 0) (<= 0 ~SIZE~0) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (<= ~SIZE~0 0) (= |old(~SIZE~0)| ~SIZE~0)) [2019-10-06 23:16:32,138 INFO L193 IcfgInterpreter]: Reachable states at location L62-3 satisfy 415#(<= 0 main_~i~0) [2019-10-06 23:16:32,138 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 487#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= ~SIZE~0 0) (<= 0 |#NULL.base|) (<= 0 ~SIZE~0) (= |#NULL.offset| 0) (<= ~SIZE~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:16:32,139 INFO L193 IcfgInterpreter]: Reachable states at location L52-3 satisfy 339#(<= 0 main_~i~0) [2019-10-06 23:16:32,139 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:16:32,139 INFO L193 IcfgInterpreter]: Reachable states at location L42-3 satisfy 263#(<= 0 main_~i~0) [2019-10-06 23:16:32,139 INFO L193 IcfgInterpreter]: Reachable states at location L32-3 satisfy 187#(<= 0 main_~i~0) [2019-10-06 23:16:32,139 INFO L193 IcfgInterpreter]: Reachable states at location L22-3 satisfy 111#(<= 0 main_~i~0) [2019-10-06 23:16:32,140 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 463#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| 1))) [2019-10-06 23:16:32,140 INFO L193 IcfgInterpreter]: Reachable states at location L67-4 satisfy 458#(and (not (< main_~i~0 ~SIZE~0)) (<= 0 main_~i~0)) [2019-10-06 23:16:32,140 INFO L193 IcfgInterpreter]: Reachable states at location L67-3 satisfy 453#(<= 0 main_~i~0) [2019-10-06 23:16:32,482 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:16:32,482 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8, 11] total 24 [2019-10-06 23:16:32,483 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-10-06 23:16:32,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-06 23:16:32,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=459, Unknown=0, NotChecked=0, Total=552 [2019-10-06 23:16:32,484 INFO L87 Difference]: Start difference. First operand 76 states and 94 transitions. Second operand 24 states. [2019-10-06 23:16:33,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:16:33,125 INFO L93 Difference]: Finished difference Result 120 states and 147 transitions. [2019-10-06 23:16:33,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-06 23:16:33,126 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 45 [2019-10-06 23:16:33,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:16:33,127 INFO L225 Difference]: With dead ends: 120 [2019-10-06 23:16:33,127 INFO L226 Difference]: Without dead ends: 55 [2019-10-06 23:16:33,128 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 121 SyntacticMatches, 4 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 308 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=158, Invalid=834, Unknown=0, NotChecked=0, Total=992 [2019-10-06 23:16:33,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-10-06 23:16:33,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-10-06 23:16:33,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-10-06 23:16:33,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 65 transitions. [2019-10-06 23:16:33,136 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 65 transitions. Word has length 45 [2019-10-06 23:16:33,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:16:33,137 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 65 transitions. [2019-10-06 23:16:33,137 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-10-06 23:16:33,137 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 65 transitions. [2019-10-06 23:16:33,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-06 23:16:33,138 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:16:33,138 INFO L385 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:16:33,343 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:16:33,349 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:16:33,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:16:33,349 INFO L82 PathProgramCache]: Analyzing trace with hash -1338189056, now seen corresponding path program 6 times [2019-10-06 23:16:33,350 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:16:33,350 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:16:33,350 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:16:33,350 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:16:33,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:16:33,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:16:34,226 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 14 [2019-10-06 23:16:34,424 WARN L191 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 33 [2019-10-06 23:16:34,606 WARN L191 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 33 [2019-10-06 23:16:34,783 WARN L191 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 28 [2019-10-06 23:16:34,964 WARN L191 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 33 [2019-10-06 23:16:35,171 WARN L191 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 37 [2019-10-06 23:16:35,364 WARN L191 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 35 [2019-10-06 23:16:35,539 WARN L191 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 34 [2019-10-06 23:16:35,767 WARN L191 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 35 [2019-10-06 23:16:35,991 WARN L191 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 37 [2019-10-06 23:16:36,205 WARN L191 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 34 [2019-10-06 23:16:36,379 WARN L191 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 29 [2019-10-06 23:16:36,604 WARN L191 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 37 [2019-10-06 23:16:36,826 WARN L191 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 42 [2019-10-06 23:16:37,030 WARN L191 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 39 [2019-10-06 23:16:37,223 WARN L191 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 35 [2019-10-06 23:16:37,429 WARN L191 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 38 [2019-10-06 23:16:37,638 WARN L191 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 42 [2019-10-06 23:16:37,855 WARN L191 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 38 [2019-10-06 23:16:38,095 WARN L191 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 34 [2019-10-06 23:16:38,288 WARN L191 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 36 [2019-10-06 23:16:38,494 WARN L191 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 41 [2019-10-06 23:16:38,683 WARN L191 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 37 [2019-10-06 23:16:38,976 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 39 [2019-10-06 23:16:39,151 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 36 [2019-10-06 23:16:39,323 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 34 [2019-10-06 23:16:39,519 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 38 [2019-10-06 23:16:40,843 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 1 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-06 23:16:40,844 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:16:40,844 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:16:40,844 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:16:40,993 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-06 23:16:40,993 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:16:40,995 WARN L254 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 130 conjunts are in the unsatisfiable core [2019-10-06 23:16:41,000 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:16:43,712 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-06 23:16:43,712 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:16:47,929 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 28 [2019-10-06 23:16:48,071 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-06 23:16:48,072 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:16:48,073 INFO L162 IcfgInterpreter]: Started Sifa with 22 locations of interest [2019-10-06 23:16:48,073 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:16:48,074 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:16:48,074 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:16:48,074 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:16:48,110 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 27 for LOIs [2019-10-06 23:16:48,418 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-06 23:16:48,431 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 13 for LOIs [2019-10-06 23:16:48,436 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:16:48,436 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:16:48,437 INFO L193 IcfgInterpreter]: Reachable states at location L11 satisfy 38#(and (= |old(~SIZE~0)| 0) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0)) (<= 0 |old(~SIZE~0)|) (= |#valid| |old(#valid)|) (<= 0 (+ ~SIZE~0 32768)) (<= |old(~SIZE~0)| 0) (<= ~SIZE~0 32767) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|)) [2019-10-06 23:16:48,437 INFO L193 IcfgInterpreter]: Reachable states at location L3-1 satisfy 473#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:16:48,437 INFO L193 IcfgInterpreter]: Reachable states at location L57-3 satisfy 377#(<= 0 main_~i~0) [2019-10-06 23:16:48,438 INFO L193 IcfgInterpreter]: Reachable states at location L47-3 satisfy 301#(<= 0 main_~i~0) [2019-10-06 23:16:48,438 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 482#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~SIZE~0)| ~SIZE~0)) [2019-10-06 23:16:48,438 INFO L193 IcfgInterpreter]: Reachable states at location L37-3 satisfy 225#(<= 0 main_~i~0) [2019-10-06 23:16:48,438 INFO L193 IcfgInterpreter]: Reachable states at location L27-3 satisfy 149#(<= 0 main_~i~0) [2019-10-06 23:16:48,439 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 478#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:16:48,439 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 73#true [2019-10-06 23:16:48,444 INFO L193 IcfgInterpreter]: Reachable states at location L3 satisfy 468#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-06 23:16:48,445 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (= ~SIZE~0 0) (<= 0 |#NULL.base|) (<= 0 ~SIZE~0) (= |#NULL.offset| 0) (<= ~SIZE~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:16:48,445 INFO L193 IcfgInterpreter]: Reachable states at location L62-3 satisfy 415#(<= 0 main_~i~0) [2019-10-06 23:16:48,445 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= |old(~SIZE~0)| 0) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0)) (<= 0 |old(~SIZE~0)|) (= |#valid| |old(#valid)|) (<= |old(~SIZE~0)| 0) (<= 0 ~SIZE~0) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (<= ~SIZE~0 0) (= |old(~SIZE~0)| ~SIZE~0)) [2019-10-06 23:16:48,446 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 487#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= ~SIZE~0 0) (<= 0 |#NULL.base|) (<= 0 ~SIZE~0) (= |#NULL.offset| 0) (<= ~SIZE~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:16:48,446 INFO L193 IcfgInterpreter]: Reachable states at location L52-3 satisfy 339#(<= 0 main_~i~0) [2019-10-06 23:16:48,446 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:16:48,446 INFO L193 IcfgInterpreter]: Reachable states at location L42-3 satisfy 263#(<= 0 main_~i~0) [2019-10-06 23:16:48,447 INFO L193 IcfgInterpreter]: Reachable states at location L32-3 satisfy 187#(<= 0 main_~i~0) [2019-10-06 23:16:48,447 INFO L193 IcfgInterpreter]: Reachable states at location L22-3 satisfy 111#(<= 0 main_~i~0) [2019-10-06 23:16:48,447 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 463#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| 0))) [2019-10-06 23:16:48,448 INFO L193 IcfgInterpreter]: Reachable states at location L67-4 satisfy 458#(and (not (< main_~i~0 ~SIZE~0)) (<= 0 main_~i~0)) [2019-10-06 23:16:48,448 INFO L193 IcfgInterpreter]: Reachable states at location L67-3 satisfy 453#(<= 0 main_~i~0) [2019-10-06 23:16:50,101 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:16:50,101 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 37, 40, 11] total 125 [2019-10-06 23:16:50,103 INFO L442 AbstractCegarLoop]: Interpolant automaton has 125 states [2019-10-06 23:16:50,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 125 interpolants. [2019-10-06 23:16:50,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=579, Invalid=14921, Unknown=0, NotChecked=0, Total=15500 [2019-10-06 23:16:50,108 INFO L87 Difference]: Start difference. First operand 55 states and 65 transitions. Second operand 125 states. [2019-10-06 23:16:54,702 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 29 [2019-10-06 23:17:03,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:17:03,205 INFO L93 Difference]: Finished difference Result 150 states and 183 transitions. [2019-10-06 23:17:03,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-10-06 23:17:03,206 INFO L78 Accepts]: Start accepts. Automaton has 125 states. Word has length 54 [2019-10-06 23:17:03,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:17:03,207 INFO L225 Difference]: With dead ends: 150 [2019-10-06 23:17:03,207 INFO L226 Difference]: Without dead ends: 105 [2019-10-06 23:17:03,216 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 81 SyntacticMatches, 6 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8811 ImplicationChecksByTransitivity, 22.8s TimeCoverageRelationStatistics Valid=1357, Invalid=29443, Unknown=0, NotChecked=0, Total=30800 [2019-10-06 23:17:03,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-10-06 23:17:03,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 102. [2019-10-06 23:17:03,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-10-06 23:17:03,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 122 transitions. [2019-10-06 23:17:03,231 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 122 transitions. Word has length 54 [2019-10-06 23:17:03,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:17:03,232 INFO L462 AbstractCegarLoop]: Abstraction has 102 states and 122 transitions. [2019-10-06 23:17:03,232 INFO L463 AbstractCegarLoop]: Interpolant automaton has 125 states. [2019-10-06 23:17:03,232 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 122 transitions. [2019-10-06 23:17:03,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-06 23:17:03,233 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:17:03,233 INFO L385 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:17:03,437 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:17:03,437 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:17:03,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:17:03,438 INFO L82 PathProgramCache]: Analyzing trace with hash -923183133, now seen corresponding path program 7 times [2019-10-06 23:17:03,438 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:17:03,438 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:17:03,439 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:17:03,439 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:17:03,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:17:03,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:17:03,525 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2019-10-06 23:17:03,525 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:17:03,525 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:17:03,525 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:17:03,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:17:03,693 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-06 23:17:03,700 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:17:03,760 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2019-10-06 23:17:03,760 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:17:03,824 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2019-10-06 23:17:03,824 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:17:03,825 INFO L162 IcfgInterpreter]: Started Sifa with 22 locations of interest [2019-10-06 23:17:03,825 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:17:03,826 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:17:03,826 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:17:03,826 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:17:03,848 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 27 for LOIs [2019-10-06 23:17:04,054 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-06 23:17:04,065 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 13 for LOIs [2019-10-06 23:17:04,068 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:17:04,069 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:17:04,069 INFO L193 IcfgInterpreter]: Reachable states at location L11 satisfy 38#(and (= |old(~SIZE~0)| 0) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= 0 |old(~SIZE~0)|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= |#valid| |old(#valid)|) (<= 0 (+ ~SIZE~0 32768)) (<= |old(~SIZE~0)| 0) (<= ~SIZE~0 32767) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|)) [2019-10-06 23:17:04,069 INFO L193 IcfgInterpreter]: Reachable states at location L3-1 satisfy 473#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:17:04,069 INFO L193 IcfgInterpreter]: Reachable states at location L57-3 satisfy 377#(<= 0 main_~i~0) [2019-10-06 23:17:04,069 INFO L193 IcfgInterpreter]: Reachable states at location L47-3 satisfy 301#(<= 0 main_~i~0) [2019-10-06 23:17:04,070 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 482#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~SIZE~0)| ~SIZE~0)) [2019-10-06 23:17:04,070 INFO L193 IcfgInterpreter]: Reachable states at location L37-3 satisfy 225#(<= 0 main_~i~0) [2019-10-06 23:17:04,070 INFO L193 IcfgInterpreter]: Reachable states at location L27-3 satisfy 149#(<= 0 main_~i~0) [2019-10-06 23:17:04,070 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 478#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:17:04,070 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 73#true [2019-10-06 23:17:04,070 INFO L193 IcfgInterpreter]: Reachable states at location L3 satisfy 468#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-06 23:17:04,072 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (= ~SIZE~0 0) (<= 0 |#NULL.base|) (<= 0 ~SIZE~0) (= |#NULL.offset| 0) (<= ~SIZE~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:17:04,072 INFO L193 IcfgInterpreter]: Reachable states at location L62-3 satisfy 415#(<= 0 main_~i~0) [2019-10-06 23:17:04,072 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= |old(~SIZE~0)| 0) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= 0 |old(~SIZE~0)|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= |#valid| |old(#valid)|) (<= |old(~SIZE~0)| 0) (<= 0 ~SIZE~0) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (<= ~SIZE~0 0) (= |old(~SIZE~0)| ~SIZE~0)) [2019-10-06 23:17:04,074 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 487#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= ~SIZE~0 0) (<= 0 |#NULL.base|) (<= 0 ~SIZE~0) (= |#NULL.offset| 0) (<= ~SIZE~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:17:04,075 INFO L193 IcfgInterpreter]: Reachable states at location L52-3 satisfy 339#(<= 0 main_~i~0) [2019-10-06 23:17:04,076 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:17:04,076 INFO L193 IcfgInterpreter]: Reachable states at location L42-3 satisfy 263#(<= 0 main_~i~0) [2019-10-06 23:17:04,076 INFO L193 IcfgInterpreter]: Reachable states at location L32-3 satisfy 187#(<= 0 main_~i~0) [2019-10-06 23:17:04,076 INFO L193 IcfgInterpreter]: Reachable states at location L22-3 satisfy 111#(<= 0 main_~i~0) [2019-10-06 23:17:04,076 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 463#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| 0))) [2019-10-06 23:17:04,077 INFO L193 IcfgInterpreter]: Reachable states at location L67-4 satisfy 458#(and (not (< main_~i~0 ~SIZE~0)) (<= 0 main_~i~0)) [2019-10-06 23:17:04,077 INFO L193 IcfgInterpreter]: Reachable states at location L67-3 satisfy 453#(<= 0 main_~i~0) [2019-10-06 23:17:04,429 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:17:04,429 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11, 11] total 27 [2019-10-06 23:17:04,430 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-10-06 23:17:04,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-10-06 23:17:04,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=591, Unknown=0, NotChecked=0, Total=702 [2019-10-06 23:17:04,432 INFO L87 Difference]: Start difference. First operand 102 states and 122 transitions. Second operand 27 states. [2019-10-06 23:17:05,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:17:05,207 INFO L93 Difference]: Finished difference Result 160 states and 192 transitions. [2019-10-06 23:17:05,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-06 23:17:05,208 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 55 [2019-10-06 23:17:05,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:17:05,210 INFO L225 Difference]: With dead ends: 160 [2019-10-06 23:17:05,210 INFO L226 Difference]: Without dead ends: 90 [2019-10-06 23:17:05,211 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 143 SyntacticMatches, 7 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 387 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=182, Invalid=1008, Unknown=0, NotChecked=0, Total=1190 [2019-10-06 23:17:05,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-10-06 23:17:05,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2019-10-06 23:17:05,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-10-06 23:17:05,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 109 transitions. [2019-10-06 23:17:05,222 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 109 transitions. Word has length 55 [2019-10-06 23:17:05,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:17:05,223 INFO L462 AbstractCegarLoop]: Abstraction has 90 states and 109 transitions. [2019-10-06 23:17:05,223 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-10-06 23:17:05,223 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 109 transitions. [2019-10-06 23:17:05,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-06 23:17:05,224 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:17:05,224 INFO L385 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:17:05,429 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:17:05,430 INFO L410 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:17:05,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:17:05,430 INFO L82 PathProgramCache]: Analyzing trace with hash 1761891923, now seen corresponding path program 8 times [2019-10-06 23:17:05,431 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:17:05,431 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:17:05,431 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:17:05,431 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:17:05,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:17:05,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:17:05,522 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-10-06 23:17:05,523 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:17:05,523 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:17:05,523 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:17:05,719 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-06 23:17:05,719 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:17:05,720 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-06 23:17:05,724 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:17:05,795 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-10-06 23:17:05,796 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:17:05,851 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-10-06 23:17:05,851 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:17:05,852 INFO L162 IcfgInterpreter]: Started Sifa with 22 locations of interest [2019-10-06 23:17:05,852 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:17:05,853 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:17:05,853 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:17:05,853 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:17:05,873 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 27 for LOIs [2019-10-06 23:17:06,122 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-06 23:17:06,131 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 13 for LOIs [2019-10-06 23:17:06,135 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:17:06,135 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:17:06,135 INFO L193 IcfgInterpreter]: Reachable states at location L11 satisfy 38#(and (= |old(~SIZE~0)| 0) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0)) (<= 0 |old(~SIZE~0)|) (= |#valid| |old(#valid)|) (<= 0 (+ ~SIZE~0 32768)) (<= |old(~SIZE~0)| 0) (= |#memory_int| |old(#memory_int)|) (<= ~SIZE~0 32767) (= |#NULL.offset| 0) (= |old(#length)| |#length|)) [2019-10-06 23:17:06,136 INFO L193 IcfgInterpreter]: Reachable states at location L3-1 satisfy 473#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:17:06,136 INFO L193 IcfgInterpreter]: Reachable states at location L57-3 satisfy 377#(<= 0 main_~i~0) [2019-10-06 23:17:06,136 INFO L193 IcfgInterpreter]: Reachable states at location L47-3 satisfy 301#(<= 0 main_~i~0) [2019-10-06 23:17:06,136 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 482#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~SIZE~0)| ~SIZE~0)) [2019-10-06 23:17:06,136 INFO L193 IcfgInterpreter]: Reachable states at location L37-3 satisfy 225#(<= 0 main_~i~0) [2019-10-06 23:17:06,137 INFO L193 IcfgInterpreter]: Reachable states at location L27-3 satisfy 149#(<= 0 main_~i~0) [2019-10-06 23:17:06,137 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 478#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:17:06,137 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 73#true [2019-10-06 23:17:06,137 INFO L193 IcfgInterpreter]: Reachable states at location L3 satisfy 468#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-06 23:17:06,137 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (= ~SIZE~0 0) (<= 0 |#NULL.base|) (<= 0 ~SIZE~0) (= |#NULL.offset| 0) (<= ~SIZE~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:17:06,138 INFO L193 IcfgInterpreter]: Reachable states at location L62-3 satisfy 415#(<= 0 main_~i~0) [2019-10-06 23:17:06,138 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= |old(~SIZE~0)| 0) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0)) (<= 0 |old(~SIZE~0)|) (= |#valid| |old(#valid)|) (<= |old(~SIZE~0)| 0) (<= 0 ~SIZE~0) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (<= ~SIZE~0 0) (= |old(~SIZE~0)| ~SIZE~0)) [2019-10-06 23:17:06,138 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 487#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= ~SIZE~0 0) (<= 0 |#NULL.base|) (<= 0 ~SIZE~0) (= |#NULL.offset| 0) (<= ~SIZE~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:17:06,138 INFO L193 IcfgInterpreter]: Reachable states at location L52-3 satisfy 339#(<= 0 main_~i~0) [2019-10-06 23:17:06,138 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:17:06,139 INFO L193 IcfgInterpreter]: Reachable states at location L42-3 satisfy 263#(<= 0 main_~i~0) [2019-10-06 23:17:06,139 INFO L193 IcfgInterpreter]: Reachable states at location L32-3 satisfy 187#(<= 0 main_~i~0) [2019-10-06 23:17:06,139 INFO L193 IcfgInterpreter]: Reachable states at location L22-3 satisfy 111#(<= 0 main_~i~0) [2019-10-06 23:17:06,139 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 463#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| 0))) [2019-10-06 23:17:06,139 INFO L193 IcfgInterpreter]: Reachable states at location L67-4 satisfy 458#(and (not (< main_~i~0 ~SIZE~0)) (<= 0 main_~i~0)) [2019-10-06 23:17:06,139 INFO L193 IcfgInterpreter]: Reachable states at location L67-3 satisfy 453#(<= 0 main_~i~0) [2019-10-06 23:17:06,499 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:17:06,499 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11, 11] total 27 [2019-10-06 23:17:06,500 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-10-06 23:17:06,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-10-06 23:17:06,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=600, Unknown=0, NotChecked=0, Total=702 [2019-10-06 23:17:06,501 INFO L87 Difference]: Start difference. First operand 90 states and 109 transitions. Second operand 27 states. [2019-10-06 23:17:07,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:17:07,263 INFO L93 Difference]: Finished difference Result 137 states and 173 transitions. [2019-10-06 23:17:07,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-10-06 23:17:07,263 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 56 [2019-10-06 23:17:07,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:17:07,266 INFO L225 Difference]: With dead ends: 137 [2019-10-06 23:17:07,267 INFO L226 Difference]: Without dead ends: 66 [2019-10-06 23:17:07,269 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 145 SyntacticMatches, 8 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 444 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=224, Invalid=1182, Unknown=0, NotChecked=0, Total=1406 [2019-10-06 23:17:07,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-10-06 23:17:07,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-10-06 23:17:07,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-10-06 23:17:07,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 76 transitions. [2019-10-06 23:17:07,283 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 76 transitions. Word has length 56 [2019-10-06 23:17:07,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:17:07,284 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 76 transitions. [2019-10-06 23:17:07,284 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-10-06 23:17:07,284 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 76 transitions. [2019-10-06 23:17:07,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-10-06 23:17:07,286 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:17:07,286 INFO L385 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:17:07,486 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:17:07,487 INFO L410 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:17:07,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:17:07,488 INFO L82 PathProgramCache]: Analyzing trace with hash 1734428395, now seen corresponding path program 9 times [2019-10-06 23:17:07,488 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:17:07,488 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:17:07,488 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:17:07,488 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:17:07,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:17:07,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:17:08,408 WARN L191 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 12 [2019-10-06 23:17:08,592 WARN L191 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 14 [2019-10-06 23:17:08,947 WARN L191 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 34 [2019-10-06 23:17:09,276 WARN L191 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 38 [2019-10-06 23:17:09,586 WARN L191 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 38 [2019-10-06 23:17:09,880 WARN L191 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 34 [2019-10-06 23:17:10,157 WARN L191 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 33 [2019-10-06 23:17:10,496 WARN L191 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 42 [2019-10-06 23:17:10,815 WARN L191 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 42 [2019-10-06 23:17:11,114 WARN L191 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 41 [2019-10-06 23:17:11,398 WARN L191 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 38 [2019-10-06 23:17:11,660 WARN L191 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 35 [2019-10-06 23:17:11,960 WARN L191 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 44 [2019-10-06 23:17:12,282 WARN L191 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 46 [2019-10-06 23:17:12,558 WARN L191 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 42 [2019-10-06 23:17:12,902 WARN L191 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 40 [2019-10-06 23:17:13,155 WARN L191 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 39 [2019-10-06 23:17:13,456 WARN L191 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 47 [2019-10-06 23:17:13,746 WARN L191 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 47 [2019-10-06 23:17:14,037 WARN L191 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 43 [2019-10-06 23:17:14,305 WARN L191 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 40 [2019-10-06 23:17:14,543 WARN L191 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 41 [2019-10-06 23:17:14,830 WARN L191 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 46 [2019-10-06 23:17:15,111 WARN L191 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 47 [2019-10-06 23:17:15,361 WARN L191 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 43 [2019-10-06 23:17:15,596 WARN L191 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 39 [2019-10-06 23:17:15,833 WARN L191 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 41 [2019-10-06 23:17:16,098 WARN L191 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 46 [2019-10-06 23:17:16,369 WARN L191 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 45 [2019-10-06 23:17:16,611 WARN L191 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 41 [2019-10-06 23:17:16,858 WARN L191 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 39 [2019-10-06 23:17:17,136 WARN L191 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 44 [2019-10-06 23:17:17,386 WARN L191 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 46 [2019-10-06 23:17:17,594 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 42 [2019-10-06 23:17:17,862 WARN L191 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 44 [2019-10-06 23:17:18,083 WARN L191 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 44 [2019-10-06 23:17:18,266 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 40 [2019-10-06 23:17:18,505 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 42 [2019-10-06 23:17:18,701 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 41 [2019-10-06 23:17:19,437 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 1 proven. 109 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-06 23:17:19,437 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:17:19,437 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:17:19,437 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:17:19,648 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-06 23:17:19,649 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:17:19,654 WARN L254 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 170 conjunts are in the unsatisfiable core [2019-10-06 23:17:19,657 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:17:23,189 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-06 23:17:23,189 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:17:42,552 WARN L191 SmtUtils]: Spent 7.45 s on a formula simplification. DAG size of input: 3179 DAG size of output: 33 [2019-10-06 23:17:42,741 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-06 23:17:42,741 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:17:42,742 INFO L162 IcfgInterpreter]: Started Sifa with 22 locations of interest [2019-10-06 23:17:42,742 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:17:42,743 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:17:42,743 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:17:42,743 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:17:42,767 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 27 for LOIs [2019-10-06 23:17:42,989 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-06 23:17:43,000 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 13 for LOIs [2019-10-06 23:17:43,004 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:17:43,004 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:17:43,004 INFO L193 IcfgInterpreter]: Reachable states at location L11 satisfy 38#(and (= |old(~SIZE~0)| 0) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0)) (= |#valid| |old(#valid)|) (<= 0 (+ ~SIZE~0 32768)) (<= |old(~SIZE~0)| 0) (<= ~SIZE~0 32767) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|)) [2019-10-06 23:17:43,004 INFO L193 IcfgInterpreter]: Reachable states at location L3-1 satisfy 473#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:17:43,005 INFO L193 IcfgInterpreter]: Reachable states at location L57-3 satisfy 377#(<= 0 main_~i~0) [2019-10-06 23:17:43,005 INFO L193 IcfgInterpreter]: Reachable states at location L47-3 satisfy 301#(<= 0 main_~i~0) [2019-10-06 23:17:43,005 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 482#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~SIZE~0)| ~SIZE~0)) [2019-10-06 23:17:43,005 INFO L193 IcfgInterpreter]: Reachable states at location L37-3 satisfy 225#(<= 0 main_~i~0) [2019-10-06 23:17:43,005 INFO L193 IcfgInterpreter]: Reachable states at location L27-3 satisfy 149#(<= 0 main_~i~0) [2019-10-06 23:17:43,006 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 478#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:17:43,006 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 73#true [2019-10-06 23:17:43,006 INFO L193 IcfgInterpreter]: Reachable states at location L3 satisfy 468#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-06 23:17:43,006 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (= ~SIZE~0 0) (<= 0 |#NULL.base|) (<= 0 ~SIZE~0) (= |#NULL.offset| 0) (<= ~SIZE~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:17:43,006 INFO L193 IcfgInterpreter]: Reachable states at location L62-3 satisfy 415#(<= 0 main_~i~0) [2019-10-06 23:17:43,007 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= |old(~SIZE~0)| 0) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0)) (= |#valid| |old(#valid)|) (<= |old(~SIZE~0)| 0) (<= 0 ~SIZE~0) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (<= ~SIZE~0 0) (= |old(~SIZE~0)| ~SIZE~0)) [2019-10-06 23:17:43,007 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 487#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= ~SIZE~0 0) (<= 0 |#NULL.base|) (<= 0 ~SIZE~0) (= |#NULL.offset| 0) (<= ~SIZE~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:17:43,007 INFO L193 IcfgInterpreter]: Reachable states at location L52-3 satisfy 339#(<= 0 main_~i~0) [2019-10-06 23:17:43,007 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:17:43,007 INFO L193 IcfgInterpreter]: Reachable states at location L42-3 satisfy 263#(<= 0 main_~i~0) [2019-10-06 23:17:43,007 INFO L193 IcfgInterpreter]: Reachable states at location L32-3 satisfy 187#(<= 0 main_~i~0) [2019-10-06 23:17:43,008 INFO L193 IcfgInterpreter]: Reachable states at location L22-3 satisfy 111#(<= 0 main_~i~0) [2019-10-06 23:17:43,008 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 463#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| 0))) [2019-10-06 23:17:43,008 INFO L193 IcfgInterpreter]: Reachable states at location L67-4 satisfy 458#(and (not (< main_~i~0 ~SIZE~0)) (<= 0 main_~i~0)) [2019-10-06 23:17:43,008 INFO L193 IcfgInterpreter]: Reachable states at location L67-3 satisfy 453#(<= 0 main_~i~0) [2019-10-06 23:17:45,002 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:17:45,002 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 47, 50, 11] total 153 [2019-10-06 23:17:45,003 INFO L442 AbstractCegarLoop]: Interpolant automaton has 153 states [2019-10-06 23:17:45,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 153 interpolants. [2019-10-06 23:17:45,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=998, Invalid=22258, Unknown=0, NotChecked=0, Total=23256 [2019-10-06 23:17:45,006 INFO L87 Difference]: Start difference. First operand 66 states and 76 transitions. Second operand 153 states. [2019-10-06 23:18:03,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:18:03,405 INFO L93 Difference]: Finished difference Result 117 states and 136 transitions. [2019-10-06 23:18:03,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-10-06 23:18:03,405 INFO L78 Accepts]: Start accepts. Automaton has 153 states. Word has length 65 [2019-10-06 23:18:03,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:18:03,407 INFO L225 Difference]: With dead ends: 117 [2019-10-06 23:18:03,407 INFO L226 Difference]: Without dead ends: 112 [2019-10-06 23:18:03,411 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 89 SyntacticMatches, 14 SemanticMatches, 203 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13649 ImplicationChecksByTransitivity, 33.6s TimeCoverageRelationStatistics Valid=2095, Invalid=39725, Unknown=0, NotChecked=0, Total=41820 [2019-10-06 23:18:03,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-10-06 23:18:03,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 108. [2019-10-06 23:18:03,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-10-06 23:18:03,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 127 transitions. [2019-10-06 23:18:03,424 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 127 transitions. Word has length 65 [2019-10-06 23:18:03,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:18:03,425 INFO L462 AbstractCegarLoop]: Abstraction has 108 states and 127 transitions. [2019-10-06 23:18:03,425 INFO L463 AbstractCegarLoop]: Interpolant automaton has 153 states. [2019-10-06 23:18:03,425 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 127 transitions. [2019-10-06 23:18:03,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-10-06 23:18:03,426 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:18:03,426 INFO L385 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:18:03,631 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:18:03,632 INFO L410 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:18:03,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:18:03,633 INFO L82 PathProgramCache]: Analyzing trace with hash 1542337655, now seen corresponding path program 10 times [2019-10-06 23:18:03,633 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:18:03,633 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:18:03,633 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:18:03,634 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:18:03,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:18:03,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:18:03,766 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 11 proven. 14 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2019-10-06 23:18:03,767 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:18:03,767 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:18:03,767 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:18:04,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:18:04,086 INFO L256 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-06 23:18:04,089 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:18:04,200 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2019-10-06 23:18:04,200 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:18:04,266 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2019-10-06 23:18:04,267 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:18:04,268 INFO L162 IcfgInterpreter]: Started Sifa with 22 locations of interest [2019-10-06 23:18:04,269 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:18:04,269 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:18:04,269 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:18:04,269 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:18:04,288 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 25 for LOIs [2019-10-06 23:18:04,519 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-06 23:18:04,528 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 13 for LOIs [2019-10-06 23:18:04,531 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:18:04,531 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:18:04,531 INFO L193 IcfgInterpreter]: Reachable states at location L11 satisfy 38#(and (= |old(~SIZE~0)| 0) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0)) (<= 0 |old(~SIZE~0)|) (= |#valid| |old(#valid)|) (<= 0 (+ ~SIZE~0 32768)) (<= |old(~SIZE~0)| 0) (<= ~SIZE~0 32767) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|)) [2019-10-06 23:18:04,531 INFO L193 IcfgInterpreter]: Reachable states at location L3-1 satisfy 473#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:18:04,532 INFO L193 IcfgInterpreter]: Reachable states at location L57-3 satisfy 377#(<= 0 main_~i~0) [2019-10-06 23:18:04,532 INFO L193 IcfgInterpreter]: Reachable states at location L47-3 satisfy 301#(<= 0 main_~i~0) [2019-10-06 23:18:04,532 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 482#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~SIZE~0)| ~SIZE~0)) [2019-10-06 23:18:04,532 INFO L193 IcfgInterpreter]: Reachable states at location L37-3 satisfy 225#(<= 0 main_~i~0) [2019-10-06 23:18:04,532 INFO L193 IcfgInterpreter]: Reachable states at location L27-3 satisfy 149#(<= 0 main_~i~0) [2019-10-06 23:18:04,532 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 478#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:18:04,533 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 73#true [2019-10-06 23:18:04,533 INFO L193 IcfgInterpreter]: Reachable states at location L3 satisfy 468#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-06 23:18:04,533 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (= ~SIZE~0 0) (<= 0 |#NULL.base|) (<= 0 ~SIZE~0) (= |#NULL.offset| 0) (<= ~SIZE~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:18:04,533 INFO L193 IcfgInterpreter]: Reachable states at location L62-3 satisfy 415#(<= 0 main_~i~0) [2019-10-06 23:18:04,533 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= |old(~SIZE~0)| 0) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0)) (<= 0 |old(~SIZE~0)|) (= |#valid| |old(#valid)|) (<= |old(~SIZE~0)| 0) (<= 0 ~SIZE~0) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (<= ~SIZE~0 0) (= |old(~SIZE~0)| ~SIZE~0)) [2019-10-06 23:18:04,533 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 487#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= ~SIZE~0 0) (<= 0 |#NULL.base|) (<= 0 ~SIZE~0) (= |#NULL.offset| 0) (<= ~SIZE~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:18:04,534 INFO L193 IcfgInterpreter]: Reachable states at location L52-3 satisfy 339#(<= 0 main_~i~0) [2019-10-06 23:18:04,534 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:18:04,534 INFO L193 IcfgInterpreter]: Reachable states at location L42-3 satisfy 263#(<= 0 main_~i~0) [2019-10-06 23:18:04,534 INFO L193 IcfgInterpreter]: Reachable states at location L32-3 satisfy 187#(<= 0 main_~i~0) [2019-10-06 23:18:04,534 INFO L193 IcfgInterpreter]: Reachable states at location L22-3 satisfy 111#(<= 0 main_~i~0) [2019-10-06 23:18:04,534 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 463#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| 0))) [2019-10-06 23:18:04,534 INFO L193 IcfgInterpreter]: Reachable states at location L67-4 satisfy 458#(and (not (< main_~i~0 ~SIZE~0)) (<= 0 main_~i~0)) [2019-10-06 23:18:04,535 INFO L193 IcfgInterpreter]: Reachable states at location L67-3 satisfy 453#(<= 0 main_~i~0) [2019-10-06 23:18:04,918 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:18:04,918 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12, 11] total 29 [2019-10-06 23:18:04,919 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-10-06 23:18:04,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-10-06 23:18:04,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=685, Unknown=0, NotChecked=0, Total=812 [2019-10-06 23:18:04,920 INFO L87 Difference]: Start difference. First operand 108 states and 127 transitions. Second operand 29 states. [2019-10-06 23:18:05,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:18:05,832 INFO L93 Difference]: Finished difference Result 210 states and 248 transitions. [2019-10-06 23:18:05,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-06 23:18:05,833 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 66 [2019-10-06 23:18:05,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:18:05,834 INFO L225 Difference]: With dead ends: 210 [2019-10-06 23:18:05,834 INFO L226 Difference]: Without dead ends: 109 [2019-10-06 23:18:05,835 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 174 SyntacticMatches, 8 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 429 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=210, Invalid=1196, Unknown=0, NotChecked=0, Total=1406 [2019-10-06 23:18:05,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-10-06 23:18:05,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2019-10-06 23:18:05,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-10-06 23:18:05,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 128 transitions. [2019-10-06 23:18:05,847 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 128 transitions. Word has length 66 [2019-10-06 23:18:05,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:18:05,847 INFO L462 AbstractCegarLoop]: Abstraction has 109 states and 128 transitions. [2019-10-06 23:18:05,847 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-10-06 23:18:05,847 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 128 transitions. [2019-10-06 23:18:05,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-10-06 23:18:05,848 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:18:05,849 INFO L385 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:18:06,052 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:18:06,053 INFO L410 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:18:06,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:18:06,054 INFO L82 PathProgramCache]: Analyzing trace with hash 1707643070, now seen corresponding path program 11 times [2019-10-06 23:18:06,054 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:18:06,054 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:18:06,054 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:18:06,054 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:18:06,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:18:06,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:18:06,153 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 6 proven. 19 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2019-10-06 23:18:06,153 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:18:06,153 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:18:06,153 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:18:06,426 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-10-06 23:18:06,427 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:18:06,428 INFO L256 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-06 23:18:06,430 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:18:06,520 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2019-10-06 23:18:06,520 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:18:06,638 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2019-10-06 23:18:06,638 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:18:06,640 INFO L162 IcfgInterpreter]: Started Sifa with 22 locations of interest [2019-10-06 23:18:06,640 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:18:06,640 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:18:06,640 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:18:06,641 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:18:06,658 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 25 for LOIs [2019-10-06 23:18:06,917 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-06 23:18:06,929 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 13 for LOIs [2019-10-06 23:18:06,932 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:18:06,932 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:18:06,932 INFO L193 IcfgInterpreter]: Reachable states at location L11 satisfy 38#(and (= |old(~SIZE~0)| 0) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |old(~SIZE~0)|) (= |#valid| |old(#valid)|) (<= 0 (+ ~SIZE~0 32768)) (<= |old(~SIZE~0)| 0) (<= ~SIZE~0 32767) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|)) [2019-10-06 23:18:06,932 INFO L193 IcfgInterpreter]: Reachable states at location L3-1 satisfy 473#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:18:06,933 INFO L193 IcfgInterpreter]: Reachable states at location L57-3 satisfy 377#(<= 0 main_~i~0) [2019-10-06 23:18:06,933 INFO L193 IcfgInterpreter]: Reachable states at location L47-3 satisfy 301#(<= 0 main_~i~0) [2019-10-06 23:18:06,933 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 482#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~SIZE~0)| ~SIZE~0)) [2019-10-06 23:18:06,933 INFO L193 IcfgInterpreter]: Reachable states at location L37-3 satisfy 225#(<= 0 main_~i~0) [2019-10-06 23:18:06,933 INFO L193 IcfgInterpreter]: Reachable states at location L27-3 satisfy 149#(<= 0 main_~i~0) [2019-10-06 23:18:06,933 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 478#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:18:06,934 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 73#true [2019-10-06 23:18:06,934 INFO L193 IcfgInterpreter]: Reachable states at location L3 satisfy 468#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-06 23:18:06,934 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (= ~SIZE~0 0) (<= 0 |#NULL.base|) (<= 0 ~SIZE~0) (= |#NULL.offset| 0) (<= ~SIZE~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:18:06,934 INFO L193 IcfgInterpreter]: Reachable states at location L62-3 satisfy 415#(<= 0 main_~i~0) [2019-10-06 23:18:06,934 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= |old(~SIZE~0)| 0) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |old(~SIZE~0)|) (= |#valid| |old(#valid)|) (<= |old(~SIZE~0)| 0) (<= 0 ~SIZE~0) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (<= ~SIZE~0 0) (= |old(~SIZE~0)| ~SIZE~0)) [2019-10-06 23:18:06,935 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 487#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= ~SIZE~0 0) (<= 0 |#NULL.base|) (<= 0 ~SIZE~0) (= |#NULL.offset| 0) (<= ~SIZE~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:18:06,935 INFO L193 IcfgInterpreter]: Reachable states at location L52-3 satisfy 339#(<= 0 main_~i~0) [2019-10-06 23:18:06,935 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:18:06,935 INFO L193 IcfgInterpreter]: Reachable states at location L42-3 satisfy 263#(<= 0 main_~i~0) [2019-10-06 23:18:06,935 INFO L193 IcfgInterpreter]: Reachable states at location L32-3 satisfy 187#(<= 0 main_~i~0) [2019-10-06 23:18:06,935 INFO L193 IcfgInterpreter]: Reachable states at location L22-3 satisfy 111#(<= 0 main_~i~0) [2019-10-06 23:18:06,935 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 463#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| 0))) [2019-10-06 23:18:06,936 INFO L193 IcfgInterpreter]: Reachable states at location L67-4 satisfy 458#(and (not (< main_~i~0 ~SIZE~0)) (<= 0 main_~i~0)) [2019-10-06 23:18:06,936 INFO L193 IcfgInterpreter]: Reachable states at location L67-3 satisfy 453#(<= 0 main_~i~0) [2019-10-06 23:18:07,434 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:18:07,434 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13, 11] total 30 [2019-10-06 23:18:07,435 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-10-06 23:18:07,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-10-06 23:18:07,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=742, Unknown=0, NotChecked=0, Total=870 [2019-10-06 23:18:07,436 INFO L87 Difference]: Start difference. First operand 109 states and 128 transitions. Second operand 30 states. [2019-10-06 23:18:08,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:18:08,354 INFO L93 Difference]: Finished difference Result 164 states and 200 transitions. [2019-10-06 23:18:08,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-06 23:18:08,354 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 67 [2019-10-06 23:18:08,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:18:08,356 INFO L225 Difference]: With dead ends: 164 [2019-10-06 23:18:08,356 INFO L226 Difference]: Without dead ends: 77 [2019-10-06 23:18:08,358 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 175 SyntacticMatches, 10 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 588 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=282, Invalid=1440, Unknown=0, NotChecked=0, Total=1722 [2019-10-06 23:18:08,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-10-06 23:18:08,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-10-06 23:18:08,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-10-06 23:18:08,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 87 transitions. [2019-10-06 23:18:08,367 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 87 transitions. Word has length 67 [2019-10-06 23:18:08,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:18:08,367 INFO L462 AbstractCegarLoop]: Abstraction has 77 states and 87 transitions. [2019-10-06 23:18:08,367 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-10-06 23:18:08,367 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 87 transitions. [2019-10-06 23:18:08,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-10-06 23:18:08,373 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:18:08,373 INFO L385 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:18:08,586 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:18:08,586 INFO L410 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:18:08,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:18:08,586 INFO L82 PathProgramCache]: Analyzing trace with hash 994799840, now seen corresponding path program 12 times [2019-10-06 23:18:08,586 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:18:08,587 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:18:08,587 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:18:08,587 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:18:08,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:18:08,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:18:10,511 WARN L191 SmtUtils]: Spent 470.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 34 [2019-10-06 23:18:10,883 WARN L191 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 38 [2019-10-06 23:18:11,259 WARN L191 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 39 [2019-10-06 23:18:11,627 WARN L191 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 40 [2019-10-06 23:18:11,973 WARN L191 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 37 [2019-10-06 23:18:12,307 WARN L191 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 35 [2019-10-06 23:18:12,786 WARN L191 SmtUtils]: Spent 445.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 45 [2019-10-06 23:18:13,177 WARN L191 SmtUtils]: Spent 350.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 46 [2019-10-06 23:18:13,560 WARN L191 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 46 [2019-10-06 23:18:13,903 WARN L191 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 45 [2019-10-06 23:18:14,242 WARN L191 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 42 [2019-10-06 23:18:14,568 WARN L191 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 41 [2019-10-06 23:18:14,947 WARN L191 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 50 [2019-10-06 23:18:15,326 WARN L191 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 49 [2019-10-06 23:18:15,699 WARN L191 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 50 [2019-10-06 23:18:16,054 WARN L191 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 47 [2019-10-06 23:18:16,390 WARN L191 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 43 [2019-10-06 23:18:16,687 WARN L191 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 41 [2019-10-06 23:18:17,029 WARN L191 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 52 [2019-10-06 23:18:17,404 WARN L191 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 50 [2019-10-06 23:18:17,738 WARN L191 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 50 [2019-10-06 23:18:18,055 WARN L191 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 47 [2019-10-06 23:18:18,352 WARN L191 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 43 [2019-10-06 23:18:18,615 WARN L191 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 41 [2019-10-06 23:18:18,918 WARN L191 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 50 [2019-10-06 23:18:19,236 WARN L191 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 50 [2019-10-06 23:18:19,544 WARN L191 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 49 [2019-10-06 23:18:19,831 WARN L191 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 45 [2019-10-06 23:18:20,112 WARN L191 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 42 [2019-10-06 23:18:20,359 WARN L191 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 42 [2019-10-06 23:18:20,644 WARN L191 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 47 [2019-10-06 23:18:20,907 WARN L191 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 46 [2019-10-06 23:18:21,202 WARN L191 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 46 [2019-10-06 23:18:21,476 WARN L191 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 46 [2019-10-06 23:18:21,745 WARN L191 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 44 [2019-10-06 23:18:21,999 WARN L191 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 46 [2019-10-06 23:18:22,321 WARN L191 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 51 [2019-10-06 23:18:22,600 WARN L191 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 50 [2019-10-06 23:18:22,859 WARN L191 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 50 [2019-10-06 23:18:23,130 WARN L191 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 46 [2019-10-06 23:18:23,386 WARN L191 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 44 [2019-10-06 23:18:23,594 WARN L191 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 45 [2019-10-06 23:18:23,826 WARN L191 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 49 [2019-10-06 23:18:24,061 WARN L191 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 49 [2019-10-06 23:18:24,314 WARN L191 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 48 [2019-10-06 23:18:24,525 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 44 [2019-10-06 23:18:24,745 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 43 [2019-10-06 23:18:24,938 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 47 [2019-10-06 23:18:25,127 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 45 [2019-10-06 23:18:25,303 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 43 [2019-10-06 23:18:26,460 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 3 proven. 162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-06 23:18:26,460 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:18:26,461 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:18:26,461 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:18:26,777 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-06 23:18:26,777 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:18:26,781 WARN L254 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 210 conjunts are in the unsatisfiable core [2019-10-06 23:18:26,784 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:18:32,205 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 150 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-06 23:18:32,206 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:18:43,488 WARN L191 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 127