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-examples/standard_two_index_09.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 21:36:37,491 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:36:37,493 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:36:37,510 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:36:37,510 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:36:37,512 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:36:37,514 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:36:37,524 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:36:37,529 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:36:37,531 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:36:37,533 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:36:37,534 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:36:37,534 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:36:37,537 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:36:37,540 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:36:37,541 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:36:37,542 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:36:37,543 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:36:37,546 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:36:37,550 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:36:37,554 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:36:37,556 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:36:37,558 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:36:37,559 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:36:37,561 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:36:37,561 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:36:37,561 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:36:37,563 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:36:37,564 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:36:37,566 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:36:37,566 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:36:37,568 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:36:37,568 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:36:37,569 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:36:37,570 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:36:37,571 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:36:37,571 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:36:37,571 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:36:37,572 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:36:37,572 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:36:37,574 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:36:37,574 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-13 21:36:37,610 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:36:37,610 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:36:37,611 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:36:37,611 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:36:37,612 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:36:37,612 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:36:37,612 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:36:37,612 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:36:37,612 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:36:37,612 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:36:37,613 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:36:37,613 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:36:37,615 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:36:37,615 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:36:37,615 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:36:37,615 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:36:37,616 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:36:37,616 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:36:37,616 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:36:37,616 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:36:37,617 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:36:37,617 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:36:37,617 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:36:37,617 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:36:37,617 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:36:37,618 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:36:37,618 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:36:37,618 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:36:37,619 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-13 21:36:37,924 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:36:37,936 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:36:37,940 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:36:37,941 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:36:37,941 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:36:37,942 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_two_index_09.i [2019-10-13 21:36:38,014 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b14a5a9bf/59817b496a394af0aa84ce5d9c7b03e4/FLAG18c97ed76 [2019-10-13 21:36:38,467 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:36:38,468 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_two_index_09.i [2019-10-13 21:36:38,474 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b14a5a9bf/59817b496a394af0aa84ce5d9c7b03e4/FLAG18c97ed76 [2019-10-13 21:36:38,885 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b14a5a9bf/59817b496a394af0aa84ce5d9c7b03e4 [2019-10-13 21:36:38,895 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:36:38,896 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:36:38,897 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:36:38,897 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:36:38,900 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:36:38,901 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:36:38" (1/1) ... [2019-10-13 21:36:38,904 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76e884bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:36:38, skipping insertion in model container [2019-10-13 21:36:38,904 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:36:38" (1/1) ... [2019-10-13 21:36:38,911 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:36:38,927 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:36:39,106 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:36:39,110 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:36:39,136 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:36:39,156 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:36:39,156 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:36:39 WrapperNode [2019-10-13 21:36:39,157 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:36:39,157 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:36:39,158 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:36:39,158 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:36:39,247 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:36:39" (1/1) ... [2019-10-13 21:36:39,248 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:36:39" (1/1) ... [2019-10-13 21:36:39,257 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:36:39" (1/1) ... [2019-10-13 21:36:39,259 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:36:39" (1/1) ... [2019-10-13 21:36:39,278 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:36:39" (1/1) ... [2019-10-13 21:36:39,284 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:36:39" (1/1) ... [2019-10-13 21:36:39,286 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:36:39" (1/1) ... [2019-10-13 21:36:39,288 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:36:39,288 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:36:39,288 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:36:39,288 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:36:39,289 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:36:39" (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-13 21:36:39,347 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:36:39,348 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:36:39,348 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-13 21:36:39,348 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:36:39,348 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:36:39,348 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-13 21:36:39,349 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 21:36:39,349 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:36:39,349 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-13 21:36:39,349 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-13 21:36:39,349 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-13 21:36:39,349 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-13 21:36:39,349 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:36:39,350 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:36:39,609 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:36:39,609 INFO L284 CfgBuilder]: Removed 3 assume(true) statements. [2019-10-13 21:36:39,611 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:36:39 BoogieIcfgContainer [2019-10-13 21:36:39,611 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:36:39,612 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:36:39,613 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:36:39,616 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:36:39,617 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:36:38" (1/3) ... [2019-10-13 21:36:39,617 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5048dd3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:36:39, skipping insertion in model container [2019-10-13 21:36:39,618 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:36:39" (2/3) ... [2019-10-13 21:36:39,618 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5048dd3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:36:39, skipping insertion in model container [2019-10-13 21:36:39,618 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:36:39" (3/3) ... [2019-10-13 21:36:39,620 INFO L109 eAbstractionObserver]: Analyzing ICFG standard_two_index_09.i [2019-10-13 21:36:39,633 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:36:39,642 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 21:36:39,667 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 21:36:39,697 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:36:39,697 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:36:39,697 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:36:39,698 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:36:39,698 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:36:39,698 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:36:39,698 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:36:39,698 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:36:39,717 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2019-10-13 21:36:39,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-13 21:36:39,722 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:36:39,722 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:36:39,726 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:36:39,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:36:39,730 INFO L82 PathProgramCache]: Analyzing trace with hash 328370140, now seen corresponding path program 1 times [2019-10-13 21:36:39,736 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:36:39,737 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958160974] [2019-10-13 21:36:39,737 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:36:39,737 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:36:39,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:36:39,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:36:39,899 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-13 21:36:39,900 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958160974] [2019-10-13 21:36:39,900 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:36:39,901 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:36:39,901 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234610590] [2019-10-13 21:36:39,907 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:36:39,908 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:36:39,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:36:39,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:36:39,921 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 3 states. [2019-10-13 21:36:39,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:36:39,971 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2019-10-13 21:36:39,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:36:39,973 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-10-13 21:36:39,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:36:39,981 INFO L225 Difference]: With dead ends: 33 [2019-10-13 21:36:39,981 INFO L226 Difference]: Without dead ends: 17 [2019-10-13 21:36:39,984 INFO L600 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-13 21:36:40,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-10-13 21:36:40,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-10-13 21:36:40,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-10-13 21:36:40,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2019-10-13 21:36:40,022 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 12 [2019-10-13 21:36:40,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:36:40,023 INFO L462 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2019-10-13 21:36:40,023 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:36:40,023 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2019-10-13 21:36:40,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-13 21:36:40,024 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:36:40,024 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:36:40,025 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:36:40,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:36:40,026 INFO L82 PathProgramCache]: Analyzing trace with hash 1896737256, now seen corresponding path program 1 times [2019-10-13 21:36:40,026 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:36:40,026 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149434756] [2019-10-13 21:36:40,027 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:36:40,027 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:36:40,027 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:36:40,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:36:40,072 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-13 21:36:40,073 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149434756] [2019-10-13 21:36:40,073 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:36:40,074 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:36:40,074 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298264801] [2019-10-13 21:36:40,076 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:36:40,076 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:36:40,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:36:40,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:36:40,077 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand 3 states. [2019-10-13 21:36:40,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:36:40,116 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2019-10-13 21:36:40,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:36:40,118 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-10-13 21:36:40,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:36:40,120 INFO L225 Difference]: With dead ends: 30 [2019-10-13 21:36:40,121 INFO L226 Difference]: Without dead ends: 21 [2019-10-13 21:36:40,122 INFO L600 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-13 21:36:40,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-10-13 21:36:40,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 18. [2019-10-13 21:36:40,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-10-13 21:36:40,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2019-10-13 21:36:40,138 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 13 [2019-10-13 21:36:40,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:36:40,138 INFO L462 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2019-10-13 21:36:40,139 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:36:40,139 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2019-10-13 21:36:40,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-13 21:36:40,139 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:36:40,140 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:36:40,140 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:36:40,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:36:40,140 INFO L82 PathProgramCache]: Analyzing trace with hash -1718311367, now seen corresponding path program 1 times [2019-10-13 21:36:40,141 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:36:40,141 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644138962] [2019-10-13 21:36:40,141 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:36:40,142 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:36:40,142 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:36:40,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:36:40,227 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-13 21:36:40,227 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644138962] [2019-10-13 21:36:40,227 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1370140721] [2019-10-13 21:36:40,228 INFO L94 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-13 21:36:40,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:36:40,298 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 21:36:40,305 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:36:40,360 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-13 21:36:40,360 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:36:40,392 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-13 21:36:40,392 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1915388049] [2019-10-13 21:36:40,417 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-13 21:36:40,417 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:36:40,424 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:36:40,431 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:36:40,432 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:36:40,617 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:36:41,041 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 44 [2019-10-13 21:36:41,169 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 32 for LOIs [2019-10-13 21:36:41,194 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:36:41,207 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:36:41,207 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:36:41,208 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 131#(and (exists ((|v_main_~#b~0.base_BEFORE_CALL_1| Int) (v_prenex_4 Int) (v_prenex_2 Int) (v_prenex_3 Int) (|v_main_~#b~0.offset_BEFORE_CALL_1| Int) (|v_main_~#a~0.offset_BEFORE_CALL_1| Int) (v_prenex_1 Int) (|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_1|) (+ |v_main_~#b~0.offset_BEFORE_CALL_1| 4)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) |v_main_~#a~0.offset_BEFORE_CALL_1|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_1) (+ v_prenex_2 4)) (select (select |#memory_int| v_prenex_4) v_prenex_3)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:36:41,209 INFO L193 IcfgInterpreter]: Reachable states at location L24-2 satisfy 116#(and (<= 0 main_~j~0) (<= 1 main_~i~0) (= main_~i~0 1) (<= main_~i~0 1) (= main_~j~0 0) (<= main_~j~0 0)) [2019-10-13 21:36:41,209 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 136#(and (exists ((|v_main_~#b~0.base_BEFORE_CALL_1| Int) (v_prenex_4 Int) (v_prenex_2 Int) (v_prenex_3 Int) (|v_main_~#b~0.offset_BEFORE_CALL_1| Int) (|v_main_~#a~0.offset_BEFORE_CALL_1| Int) (v_prenex_1 Int) (|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_1|) (+ |v_main_~#b~0.offset_BEFORE_CALL_1| 4)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) |v_main_~#a~0.offset_BEFORE_CALL_1|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_1) (+ v_prenex_2 4)) (select (select |#memory_int| v_prenex_4) v_prenex_3)))))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:36:41,210 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 145#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:36:41,210 INFO L193 IcfgInterpreter]: Reachable states at location L16-2 satisfy 111#(<= 1 main_~i~0) [2019-10-13 21:36:41,211 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 141#(and (exists ((|v_main_~#b~0.base_BEFORE_CALL_1| Int) (v_prenex_4 Int) (v_prenex_2 Int) (v_prenex_3 Int) (|v_main_~#b~0.offset_BEFORE_CALL_1| Int) (|v_main_~#a~0.offset_BEFORE_CALL_1| Int) (v_prenex_1 Int) (|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_1|) (+ |v_main_~#b~0.offset_BEFORE_CALL_1| 4)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) |v_main_~#a~0.offset_BEFORE_CALL_1|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_1) (+ v_prenex_2 4)) (select (select |#memory_int| v_prenex_4) v_prenex_3)))))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:36:41,211 INFO L193 IcfgInterpreter]: Reachable states at location L26 satisfy 121#(and (<= 0 main_~j~0) (< main_~i~0 100000) (<= 1 main_~i~0) (= |main_#t~mem2| (select (select |#memory_int| |main_~#a~0.base|) (+ (* main_~j~0 4) |main_~#a~0.offset|))) (= (select (select |#memory_int| |main_~#b~0.base|) (+ (* main_~j~0 36) |main_~#b~0.offset| 4)) |main_#t~mem3|) (= main_~i~0 1) (<= main_~i~0 1) (= main_~j~0 0) (<= main_~j~0 0)) [2019-10-13 21:36:41,212 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:36:41,212 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:36:41,213 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 150#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:36:41,213 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:36:41,213 INFO L193 IcfgInterpreter]: Reachable states at location L10-2 satisfy 68#true [2019-10-13 21:36:41,214 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 126#(exists ((|v_main_~#b~0.base_BEFORE_CALL_1| Int) (v_prenex_4 Int) (v_prenex_2 Int) (v_prenex_3 Int) (|v_main_~#b~0.offset_BEFORE_CALL_1| Int) (|v_main_~#a~0.offset_BEFORE_CALL_1| Int) (v_prenex_1 Int) (|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_1|) (+ |v_main_~#b~0.offset_BEFORE_CALL_1| 4)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) |v_main_~#a~0.offset_BEFORE_CALL_1|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_1) (+ v_prenex_2 4)) (select (select |#memory_int| v_prenex_4) v_prenex_3)))))) [2019-10-13 21:36:41,516 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:36:41,516 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 11] total 18 [2019-10-13 21:36:41,516 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856663614] [2019-10-13 21:36:41,517 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-13 21:36:41,518 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:36:41,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-13 21:36:41,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2019-10-13 21:36:41,519 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand 18 states. [2019-10-13 21:36:42,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:36:42,237 INFO L93 Difference]: Finished difference Result 50 states and 61 transitions. [2019-10-13 21:36:42,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-10-13 21:36:42,237 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 14 [2019-10-13 21:36:42,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:36:42,239 INFO L225 Difference]: With dead ends: 50 [2019-10-13 21:36:42,239 INFO L226 Difference]: Without dead ends: 39 [2019-10-13 21:36:42,240 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=234, Invalid=888, Unknown=0, NotChecked=0, Total=1122 [2019-10-13 21:36:42,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-10-13 21:36:42,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 24. [2019-10-13 21:36:42,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-10-13 21:36:42,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2019-10-13 21:36:42,248 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 14 [2019-10-13 21:36:42,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:36:42,248 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2019-10-13 21:36:42,248 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-13 21:36:42,249 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2019-10-13 21:36:42,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-13 21:36:42,249 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:36:42,250 INFO L380 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:36:42,458 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:36:42,459 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:36:42,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:36:42,459 INFO L82 PathProgramCache]: Analyzing trace with hash -1363999975, now seen corresponding path program 2 times [2019-10-13 21:36:42,459 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:36:42,460 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775995134] [2019-10-13 21:36:42,460 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:36:42,460 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:36:42,460 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:36:42,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:36:42,559 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-13 21:36:42,560 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775995134] [2019-10-13 21:36:42,560 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1572790329] [2019-10-13 21:36:42,560 INFO L92 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-13 21:36:42,608 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-13 21:36:42,609 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:36:42,610 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-13 21:36:42,612 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:36:42,624 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-13 21:36:42,625 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:36:42,671 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-13 21:36:42,671 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [969886597] [2019-10-13 21:36:42,673 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-13 21:36:42,673 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:36:42,673 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:36:42,674 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:36:42,674 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:36:42,717 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:36:43,074 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 32 for LOIs [2019-10-13 21:36:43,092 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:36:43,098 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:36:43,098 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:36:43,098 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 131#(and (exists ((v_prenex_6 Int) (v_prenex_7 Int) (|v_main_~#a~0.base_BEFORE_CALL_2| Int) (|v_main_~#b~0.base_BEFORE_CALL_2| Int) (v_prenex_5 Int) (|v_main_~#a~0.offset_BEFORE_CALL_2| Int) (|v_main_~#b~0.offset_BEFORE_CALL_2| Int) (v_prenex_8 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) |v_main_~#a~0.offset_BEFORE_CALL_2|) (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_2|) (+ |v_main_~#b~0.offset_BEFORE_CALL_2| 4))))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_5) v_prenex_7) (select (select |#memory_int| v_prenex_6) (+ v_prenex_8 4)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:36:43,099 INFO L193 IcfgInterpreter]: Reachable states at location L24-2 satisfy 116#(and (<= 0 main_~j~0) (<= 1 main_~i~0) (= main_~i~0 1) (<= main_~i~0 1) (= main_~j~0 0) (<= main_~j~0 0)) [2019-10-13 21:36:43,099 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 136#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (exists ((v_prenex_6 Int) (v_prenex_7 Int) (|v_main_~#a~0.base_BEFORE_CALL_2| Int) (|v_main_~#b~0.base_BEFORE_CALL_2| Int) (v_prenex_5 Int) (|v_main_~#a~0.offset_BEFORE_CALL_2| Int) (|v_main_~#b~0.offset_BEFORE_CALL_2| Int) (v_prenex_8 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) |v_main_~#a~0.offset_BEFORE_CALL_2|) (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_2|) (+ |v_main_~#b~0.offset_BEFORE_CALL_2| 4))))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_5) v_prenex_7) (select (select |#memory_int| v_prenex_6) (+ v_prenex_8 4)))))) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:36:43,099 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 145#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:36:43,099 INFO L193 IcfgInterpreter]: Reachable states at location L16-2 satisfy 111#(<= 1 main_~i~0) [2019-10-13 21:36:43,100 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 141#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (exists ((v_prenex_6 Int) (v_prenex_7 Int) (|v_main_~#a~0.base_BEFORE_CALL_2| Int) (|v_main_~#b~0.base_BEFORE_CALL_2| Int) (v_prenex_5 Int) (|v_main_~#a~0.offset_BEFORE_CALL_2| Int) (|v_main_~#b~0.offset_BEFORE_CALL_2| Int) (v_prenex_8 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) |v_main_~#a~0.offset_BEFORE_CALL_2|) (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_2|) (+ |v_main_~#b~0.offset_BEFORE_CALL_2| 4))))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_5) v_prenex_7) (select (select |#memory_int| v_prenex_6) (+ v_prenex_8 4)))))) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:36:43,100 INFO L193 IcfgInterpreter]: Reachable states at location L26 satisfy 121#(and (<= 0 main_~j~0) (< main_~i~0 100000) (<= 1 main_~i~0) (= |main_#t~mem2| (select (select |#memory_int| |main_~#a~0.base|) (+ (* main_~j~0 4) |main_~#a~0.offset|))) (= (select (select |#memory_int| |main_~#b~0.base|) (+ (* main_~j~0 36) |main_~#b~0.offset| 4)) |main_#t~mem3|) (= main_~i~0 1) (<= main_~i~0 1) (= main_~j~0 0) (<= main_~j~0 0)) [2019-10-13 21:36:43,100 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:36:43,100 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:36:43,101 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 150#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:36:43,101 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:36:43,101 INFO L193 IcfgInterpreter]: Reachable states at location L10-2 satisfy 68#true [2019-10-13 21:36:43,101 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 126#(exists ((v_prenex_6 Int) (v_prenex_7 Int) (|v_main_~#a~0.base_BEFORE_CALL_2| Int) (|v_main_~#b~0.base_BEFORE_CALL_2| Int) (v_prenex_5 Int) (|v_main_~#a~0.offset_BEFORE_CALL_2| Int) (|v_main_~#b~0.offset_BEFORE_CALL_2| Int) (v_prenex_8 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) |v_main_~#a~0.offset_BEFORE_CALL_2|) (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_2|) (+ |v_main_~#b~0.offset_BEFORE_CALL_2| 4))))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_5) v_prenex_7) (select (select |#memory_int| v_prenex_6) (+ v_prenex_8 4)))))) [2019-10-13 21:36:43,408 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:36:43,408 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 11] total 21 [2019-10-13 21:36:43,409 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571175039] [2019-10-13 21:36:43,411 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-10-13 21:36:43,412 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:36:43,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-10-13 21:36:43,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=317, Unknown=0, NotChecked=0, Total=420 [2019-10-13 21:36:43,414 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 21 states. [2019-10-13 21:36:44,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:36:44,391 INFO L93 Difference]: Finished difference Result 73 states and 90 transitions. [2019-10-13 21:36:44,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-10-13 21:36:44,392 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 20 [2019-10-13 21:36:44,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:36:44,395 INFO L225 Difference]: With dead ends: 73 [2019-10-13 21:36:44,395 INFO L226 Difference]: Without dead ends: 60 [2019-10-13 21:36:44,396 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 512 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=436, Invalid=1456, Unknown=0, NotChecked=0, Total=1892 [2019-10-13 21:36:44,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-10-13 21:36:44,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 32. [2019-10-13 21:36:44,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-10-13 21:36:44,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2019-10-13 21:36:44,414 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 20 [2019-10-13 21:36:44,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:36:44,415 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2019-10-13 21:36:44,415 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-10-13 21:36:44,416 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2019-10-13 21:36:44,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-13 21:36:44,417 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:36:44,418 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:36:44,621 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:36:44,622 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:36:44,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:36:44,622 INFO L82 PathProgramCache]: Analyzing trace with hash 311824988, now seen corresponding path program 3 times [2019-10-13 21:36:44,623 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:36:44,623 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464626628] [2019-10-13 21:36:44,624 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:36:44,624 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:36:44,624 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:36:44,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:36:44,794 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-13 21:36:44,794 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464626628] [2019-10-13 21:36:44,795 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2117857950] [2019-10-13 21:36:44,795 INFO L92 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-13 21:36:44,878 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-13 21:36:44,879 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:36:44,879 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-13 21:36:44,884 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:36:44,964 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-13 21:36:44,965 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:36:45,120 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-13 21:36:45,120 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [657141163] [2019-10-13 21:36:45,122 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-13 21:36:45,122 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:36:45,122 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:36:45,122 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:36:45,123 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:36:45,149 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:36:45,429 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 32 for LOIs [2019-10-13 21:36:45,443 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:36:45,448 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:36:45,448 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:36:45,448 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 131#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_3| Int) (v_prenex_12 Int) (v_prenex_11 Int) (|v_main_~#b~0.offset_BEFORE_CALL_3| Int) (|v_main_~#a~0.offset_BEFORE_CALL_3| Int) (v_prenex_10 Int) (|v_main_~#b~0.base_BEFORE_CALL_3| Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_12) (+ v_prenex_10 4)) (select (select |#memory_int| v_prenex_9) v_prenex_11))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_3|) (+ |v_main_~#b~0.offset_BEFORE_CALL_3| 4)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) |v_main_~#a~0.offset_BEFORE_CALL_3|)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:36:45,449 INFO L193 IcfgInterpreter]: Reachable states at location L24-2 satisfy 116#(and (<= 0 main_~j~0) (<= 1 main_~i~0) (= main_~i~0 1) (<= main_~i~0 1) (= main_~j~0 0) (<= main_~j~0 0)) [2019-10-13 21:36:45,449 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 136#(and (<= __VERIFIER_assert_~cond 0) (exists ((|v_main_~#a~0.base_BEFORE_CALL_3| Int) (v_prenex_12 Int) (v_prenex_11 Int) (|v_main_~#b~0.offset_BEFORE_CALL_3| Int) (|v_main_~#a~0.offset_BEFORE_CALL_3| Int) (v_prenex_10 Int) (|v_main_~#b~0.base_BEFORE_CALL_3| Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_12) (+ v_prenex_10 4)) (select (select |#memory_int| v_prenex_9) v_prenex_11))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_3|) (+ |v_main_~#b~0.offset_BEFORE_CALL_3| 4)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) |v_main_~#a~0.offset_BEFORE_CALL_3|)))))) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:36:45,450 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 145#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:36:45,450 INFO L193 IcfgInterpreter]: Reachable states at location L16-2 satisfy 111#(<= 1 main_~i~0) [2019-10-13 21:36:45,450 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 141#(and (<= __VERIFIER_assert_~cond 0) (exists ((|v_main_~#a~0.base_BEFORE_CALL_3| Int) (v_prenex_12 Int) (v_prenex_11 Int) (|v_main_~#b~0.offset_BEFORE_CALL_3| Int) (|v_main_~#a~0.offset_BEFORE_CALL_3| Int) (v_prenex_10 Int) (|v_main_~#b~0.base_BEFORE_CALL_3| Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_12) (+ v_prenex_10 4)) (select (select |#memory_int| v_prenex_9) v_prenex_11))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_3|) (+ |v_main_~#b~0.offset_BEFORE_CALL_3| 4)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) |v_main_~#a~0.offset_BEFORE_CALL_3|)))))) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:36:45,450 INFO L193 IcfgInterpreter]: Reachable states at location L26 satisfy 121#(and (<= 0 main_~j~0) (< main_~i~0 100000) (<= 1 main_~i~0) (= |main_#t~mem2| (select (select |#memory_int| |main_~#a~0.base|) (+ (* main_~j~0 4) |main_~#a~0.offset|))) (= (select (select |#memory_int| |main_~#b~0.base|) (+ (* main_~j~0 36) |main_~#b~0.offset| 4)) |main_#t~mem3|) (= main_~i~0 1) (<= main_~i~0 1) (= main_~j~0 0) (<= main_~j~0 0)) [2019-10-13 21:36:45,451 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:36:45,451 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:36:45,451 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 150#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:36:45,451 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:36:45,452 INFO L193 IcfgInterpreter]: Reachable states at location L10-2 satisfy 68#true [2019-10-13 21:36:45,456 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 126#(exists ((|v_main_~#a~0.base_BEFORE_CALL_3| Int) (v_prenex_12 Int) (v_prenex_11 Int) (|v_main_~#b~0.offset_BEFORE_CALL_3| Int) (|v_main_~#a~0.offset_BEFORE_CALL_3| Int) (v_prenex_10 Int) (|v_main_~#b~0.base_BEFORE_CALL_3| Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_12) (+ v_prenex_10 4)) (select (select |#memory_int| v_prenex_9) v_prenex_11))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_3|) (+ |v_main_~#b~0.offset_BEFORE_CALL_3| 4)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) |v_main_~#a~0.offset_BEFORE_CALL_3|)))))) [2019-10-13 21:36:45,796 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:36:45,796 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11, 11] total 39 [2019-10-13 21:36:45,797 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124900840] [2019-10-13 21:36:45,797 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-10-13 21:36:45,798 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:36:45,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-10-13 21:36:45,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=487, Invalid=995, Unknown=0, NotChecked=0, Total=1482 [2019-10-13 21:36:45,801 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand 39 states. [2019-10-13 21:36:47,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:36:47,649 INFO L93 Difference]: Finished difference Result 106 states and 138 transitions. [2019-10-13 21:36:47,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-10-13 21:36:47,650 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 28 [2019-10-13 21:36:47,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:36:47,651 INFO L225 Difference]: With dead ends: 106 [2019-10-13 21:36:47,651 INFO L226 Difference]: Without dead ends: 88 [2019-10-13 21:36:47,654 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2180 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1816, Invalid=4990, Unknown=0, NotChecked=0, Total=6806 [2019-10-13 21:36:47,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-10-13 21:36:47,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 52. [2019-10-13 21:36:47,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-10-13 21:36:47,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions. [2019-10-13 21:36:47,668 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 28 [2019-10-13 21:36:47,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:36:47,670 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 54 transitions. [2019-10-13 21:36:47,670 INFO L463 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-10-13 21:36:47,671 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2019-10-13 21:36:47,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-10-13 21:36:47,672 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:36:47,672 INFO L380 BasicCegarLoop]: trace histogram [26, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:36:47,872 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:36:47,873 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:36:47,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:36:47,874 INFO L82 PathProgramCache]: Analyzing trace with hash -1833583364, now seen corresponding path program 4 times [2019-10-13 21:36:47,874 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:36:47,875 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910825394] [2019-10-13 21:36:47,875 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:36:47,875 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:36:47,875 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:36:47,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:36:48,079 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2019-10-13 21:36:48,080 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910825394] [2019-10-13 21:36:48,080 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1926165106] [2019-10-13 21:36:48,084 INFO L92 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-13 21:36:48,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:36:48,174 INFO L256 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 28 conjunts are in the unsatisfiable core [2019-10-13 21:36:48,181 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:36:48,383 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-10-13 21:36:48,383 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:36:49,031 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-10-13 21:36:49,032 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [967157010] [2019-10-13 21:36:49,033 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-13 21:36:49,033 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:36:49,034 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:36:49,034 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:36:49,034 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:36:49,055 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:36:49,319 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 32 for LOIs [2019-10-13 21:36:49,330 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:36:49,334 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:36:49,334 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:36:49,335 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 131#(and (exists ((v_prenex_16 Int) (|v_main_~#a~0.base_BEFORE_CALL_4| Int) (v_prenex_15 Int) (|v_main_~#a~0.offset_BEFORE_CALL_4| Int) (|v_main_~#b~0.offset_BEFORE_CALL_4| Int) (v_prenex_14 Int) (v_prenex_13 Int) (|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_16) (+ v_prenex_15 4)) (select (select |#memory_int| v_prenex_13) v_prenex_14))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_4|) (+ |v_main_~#b~0.offset_BEFORE_CALL_4| 4)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) |v_main_~#a~0.offset_BEFORE_CALL_4|)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:36:49,335 INFO L193 IcfgInterpreter]: Reachable states at location L24-2 satisfy 116#(and (<= 0 main_~j~0) (<= 1 main_~i~0) (= main_~i~0 1) (<= main_~i~0 1) (= main_~j~0 0) (<= main_~j~0 0)) [2019-10-13 21:36:49,335 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 136#(and (exists ((v_prenex_16 Int) (|v_main_~#a~0.base_BEFORE_CALL_4| Int) (v_prenex_15 Int) (|v_main_~#a~0.offset_BEFORE_CALL_4| Int) (|v_main_~#b~0.offset_BEFORE_CALL_4| Int) (v_prenex_14 Int) (v_prenex_13 Int) (|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_16) (+ v_prenex_15 4)) (select (select |#memory_int| v_prenex_13) v_prenex_14))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_4|) (+ |v_main_~#b~0.offset_BEFORE_CALL_4| 4)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) |v_main_~#a~0.offset_BEFORE_CALL_4|)))))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:36:49,335 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 145#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:36:49,336 INFO L193 IcfgInterpreter]: Reachable states at location L16-2 satisfy 111#(<= 1 main_~i~0) [2019-10-13 21:36:49,336 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 141#(and (exists ((v_prenex_16 Int) (|v_main_~#a~0.base_BEFORE_CALL_4| Int) (v_prenex_15 Int) (|v_main_~#a~0.offset_BEFORE_CALL_4| Int) (|v_main_~#b~0.offset_BEFORE_CALL_4| Int) (v_prenex_14 Int) (v_prenex_13 Int) (|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_16) (+ v_prenex_15 4)) (select (select |#memory_int| v_prenex_13) v_prenex_14))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_4|) (+ |v_main_~#b~0.offset_BEFORE_CALL_4| 4)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) |v_main_~#a~0.offset_BEFORE_CALL_4|)))))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:36:49,336 INFO L193 IcfgInterpreter]: Reachable states at location L26 satisfy 121#(and (<= 0 main_~j~0) (< main_~i~0 100000) (<= 1 main_~i~0) (= |main_#t~mem2| (select (select |#memory_int| |main_~#a~0.base|) (+ (* main_~j~0 4) |main_~#a~0.offset|))) (= (select (select |#memory_int| |main_~#b~0.base|) (+ (* main_~j~0 36) |main_~#b~0.offset| 4)) |main_#t~mem3|) (= main_~i~0 1) (<= main_~i~0 1) (= main_~j~0 0) (<= main_~j~0 0)) [2019-10-13 21:36:49,337 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:36:49,339 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:36:49,340 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 150#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:36:49,340 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:36:49,340 INFO L193 IcfgInterpreter]: Reachable states at location L10-2 satisfy 68#true [2019-10-13 21:36:49,340 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 126#(exists ((v_prenex_16 Int) (|v_main_~#a~0.base_BEFORE_CALL_4| Int) (v_prenex_15 Int) (|v_main_~#a~0.offset_BEFORE_CALL_4| Int) (|v_main_~#b~0.offset_BEFORE_CALL_4| Int) (v_prenex_14 Int) (v_prenex_13 Int) (|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_16) (+ v_prenex_15 4)) (select (select |#memory_int| v_prenex_13) v_prenex_14))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_4|) (+ |v_main_~#b~0.offset_BEFORE_CALL_4| 4)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) |v_main_~#a~0.offset_BEFORE_CALL_4|)))))) [2019-10-13 21:36:49,607 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:36:49,607 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 29, 29, 11] total 75 [2019-10-13 21:36:49,607 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570987851] [2019-10-13 21:36:49,609 INFO L442 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-10-13 21:36:49,609 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:36:49,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-10-13 21:36:49,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2233, Invalid=3317, Unknown=0, NotChecked=0, Total=5550 [2019-10-13 21:36:49,613 INFO L87 Difference]: Start difference. First operand 52 states and 54 transitions. Second operand 75 states. [2019-10-13 21:36:53,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:36:53,944 INFO L93 Difference]: Finished difference Result 160 states and 216 transitions. [2019-10-13 21:36:53,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-10-13 21:36:53,944 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 48 [2019-10-13 21:36:53,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:36:53,947 INFO L225 Difference]: With dead ends: 160 [2019-10-13 21:36:53,947 INFO L226 Difference]: Without dead ends: 140 [2019-10-13 21:36:53,954 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9132 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=7700, Invalid=17422, Unknown=0, NotChecked=0, Total=25122 [2019-10-13 21:36:53,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-10-13 21:36:53,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 92. [2019-10-13 21:36:53,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-10-13 21:36:53,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 94 transitions. [2019-10-13 21:36:53,970 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 94 transitions. Word has length 48 [2019-10-13 21:36:53,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:36:53,971 INFO L462 AbstractCegarLoop]: Abstraction has 92 states and 94 transitions. [2019-10-13 21:36:53,971 INFO L463 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-10-13 21:36:53,971 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 94 transitions. [2019-10-13 21:36:53,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-10-13 21:36:53,973 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:36:53,974 INFO L380 BasicCegarLoop]: trace histogram [62, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:36:54,176 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:36:54,177 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:36:54,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:36:54,178 INFO L82 PathProgramCache]: Analyzing trace with hash 1450531388, now seen corresponding path program 5 times [2019-10-13 21:36:54,178 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:36:54,179 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034667275] [2019-10-13 21:36:54,179 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:36:54,179 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:36:54,179 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:36:54,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:36:54,483 INFO L134 CoverageAnalysis]: Checked inductivity of 2058 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 1953 trivial. 0 not checked. [2019-10-13 21:36:54,484 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034667275] [2019-10-13 21:36:54,484 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [103091575] [2019-10-13 21:36:54,484 INFO L92 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-13 21:36:59,062 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-10-13 21:36:59,062 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:36:59,067 INFO L256 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-13 21:36:59,071 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:36:59,088 INFO L134 CoverageAnalysis]: Checked inductivity of 2058 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 1953 trivial. 0 not checked. [2019-10-13 21:36:59,089 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:36:59,370 INFO L134 CoverageAnalysis]: Checked inductivity of 2058 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 1953 trivial. 0 not checked. [2019-10-13 21:36:59,370 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [82212500] [2019-10-13 21:36:59,371 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-13 21:36:59,371 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:36:59,372 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:36:59,372 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:36:59,372 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:36:59,388 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:36:59,657 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 32 for LOIs [2019-10-13 21:36:59,665 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:36:59,668 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:36:59,668 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:36:59,669 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 131#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_5| Int) (v_prenex_18 Int) (|v_main_~#a~0.offset_BEFORE_CALL_5| Int) (|v_main_~#b~0.offset_BEFORE_CALL_5| Int) (v_prenex_17 Int) (v_prenex_20 Int) (v_prenex_19 Int) (|v_main_~#b~0.base_BEFORE_CALL_5| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) |v_main_~#a~0.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_5|) (+ |v_main_~#b~0.offset_BEFORE_CALL_5| 4)))) (and (not (= (select (select |#memory_int| v_prenex_17) v_prenex_18) (select (select |#memory_int| v_prenex_20) (+ v_prenex_19 4)))) (= |__VERIFIER_assert_#in~cond| 0)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:36:59,669 INFO L193 IcfgInterpreter]: Reachable states at location L24-2 satisfy 116#(and (<= 0 main_~j~0) (<= 1 main_~i~0) (= main_~i~0 1) (<= main_~i~0 1) (= main_~j~0 0) (<= main_~j~0 0)) [2019-10-13 21:36:59,669 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 136#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_main_~#a~0.base_BEFORE_CALL_5| Int) (v_prenex_18 Int) (|v_main_~#a~0.offset_BEFORE_CALL_5| Int) (|v_main_~#b~0.offset_BEFORE_CALL_5| Int) (v_prenex_17 Int) (v_prenex_20 Int) (v_prenex_19 Int) (|v_main_~#b~0.base_BEFORE_CALL_5| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) |v_main_~#a~0.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_5|) (+ |v_main_~#b~0.offset_BEFORE_CALL_5| 4)))) (and (not (= (select (select |#memory_int| v_prenex_17) v_prenex_18) (select (select |#memory_int| v_prenex_20) (+ v_prenex_19 4)))) (= |__VERIFIER_assert_#in~cond| 0)))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:36:59,669 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 145#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:36:59,669 INFO L193 IcfgInterpreter]: Reachable states at location L16-2 satisfy 111#(<= 1 main_~i~0) [2019-10-13 21:36:59,670 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 141#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_main_~#a~0.base_BEFORE_CALL_5| Int) (v_prenex_18 Int) (|v_main_~#a~0.offset_BEFORE_CALL_5| Int) (|v_main_~#b~0.offset_BEFORE_CALL_5| Int) (v_prenex_17 Int) (v_prenex_20 Int) (v_prenex_19 Int) (|v_main_~#b~0.base_BEFORE_CALL_5| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) |v_main_~#a~0.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_5|) (+ |v_main_~#b~0.offset_BEFORE_CALL_5| 4)))) (and (not (= (select (select |#memory_int| v_prenex_17) v_prenex_18) (select (select |#memory_int| v_prenex_20) (+ v_prenex_19 4)))) (= |__VERIFIER_assert_#in~cond| 0)))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:36:59,670 INFO L193 IcfgInterpreter]: Reachable states at location L26 satisfy 121#(and (<= 0 main_~j~0) (< main_~i~0 100000) (<= 1 main_~i~0) (= |main_#t~mem2| (select (select |#memory_int| |main_~#a~0.base|) (+ (* main_~j~0 4) |main_~#a~0.offset|))) (= (select (select |#memory_int| |main_~#b~0.base|) (+ (* main_~j~0 36) |main_~#b~0.offset| 4)) |main_#t~mem3|) (= main_~i~0 1) (<= main_~i~0 1) (= main_~j~0 0) (<= main_~j~0 0)) [2019-10-13 21:36:59,670 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:36:59,670 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0))) [2019-10-13 21:36:59,670 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 150#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:36:59,671 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:36:59,671 INFO L193 IcfgInterpreter]: Reachable states at location L10-2 satisfy 68#true [2019-10-13 21:36:59,671 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 126#(exists ((|v_main_~#a~0.base_BEFORE_CALL_5| Int) (v_prenex_18 Int) (|v_main_~#a~0.offset_BEFORE_CALL_5| Int) (|v_main_~#b~0.offset_BEFORE_CALL_5| Int) (v_prenex_17 Int) (v_prenex_20 Int) (v_prenex_19 Int) (|v_main_~#b~0.base_BEFORE_CALL_5| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) |v_main_~#a~0.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_5|) (+ |v_main_~#b~0.offset_BEFORE_CALL_5| 4)))) (and (not (= (select (select |#memory_int| v_prenex_17) v_prenex_18) (select (select |#memory_int| v_prenex_20) (+ v_prenex_19 4)))) (= |__VERIFIER_assert_#in~cond| 0)))) [2019-10-13 21:37:00,003 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:37:00,004 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17, 11] total 43 [2019-10-13 21:37:00,004 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820645183] [2019-10-13 21:37:00,005 INFO L442 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-10-13 21:37:00,005 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:37:00,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-10-13 21:37:00,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=620, Invalid=1186, Unknown=0, NotChecked=0, Total=1806 [2019-10-13 21:37:00,007 INFO L87 Difference]: Start difference. First operand 92 states and 94 transitions. Second operand 43 states. [2019-10-13 21:37:03,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:37:03,133 INFO L93 Difference]: Finished difference Result 211 states and 257 transitions. [2019-10-13 21:37:03,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-10-13 21:37:03,134 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 88 [2019-10-13 21:37:03,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:37:03,138 INFO L225 Difference]: With dead ends: 211 [2019-10-13 21:37:03,140 INFO L226 Difference]: Without dead ends: 202 [2019-10-13 21:37:03,144 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3295 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3362, Invalid=8628, Unknown=0, NotChecked=0, Total=11990 [2019-10-13 21:37:03,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2019-10-13 21:37:03,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 108. [2019-10-13 21:37:03,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-10-13 21:37:03,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 110 transitions. [2019-10-13 21:37:03,192 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 110 transitions. Word has length 88 [2019-10-13 21:37:03,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:37:03,194 INFO L462 AbstractCegarLoop]: Abstraction has 108 states and 110 transitions. [2019-10-13 21:37:03,194 INFO L463 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-10-13 21:37:03,194 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 110 transitions. [2019-10-13 21:37:03,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-10-13 21:37:03,199 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:37:03,200 INFO L380 BasicCegarLoop]: trace histogram [62, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:37:03,400 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:37:03,401 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:37:03,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:37:03,402 INFO L82 PathProgramCache]: Analyzing trace with hash 1109762876, now seen corresponding path program 6 times [2019-10-13 21:37:03,402 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:37:03,402 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273067736] [2019-10-13 21:37:03,402 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:37:03,403 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:37:03,403 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:37:03,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:37:03,986 INFO L134 CoverageAnalysis]: Checked inductivity of 2418 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 1953 trivial. 0 not checked. [2019-10-13 21:37:03,986 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273067736] [2019-10-13 21:37:03,986 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [812772447] [2019-10-13 21:37:03,986 INFO L92 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-13 21:37:04,141 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-13 21:37:04,142 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:37:04,144 INFO L256 TraceCheckSpWp]: Trace formula consists of 618 conjuncts, 64 conjunts are in the unsatisfiable core [2019-10-13 21:37:04,149 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:37:04,659 INFO L134 CoverageAnalysis]: Checked inductivity of 2418 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-10-13 21:37:04,659 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:37:07,572 INFO L134 CoverageAnalysis]: Checked inductivity of 2418 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-10-13 21:37:07,573 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1455651669] [2019-10-13 21:37:07,574 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-13 21:37:07,574 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:37:07,574 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:37:07,575 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:37:07,575 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:37:07,604 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:37:07,858 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 32 for LOIs [2019-10-13 21:37:07,863 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:37:07,866 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:37:07,866 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:37:07,867 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 131#(and (exists ((|v_main_~#a~0.offset_BEFORE_CALL_6| Int) (|v_main_~#b~0.offset_BEFORE_CALL_6| Int) (v_prenex_23 Int) (v_prenex_22 Int) (|v_main_~#a~0.base_BEFORE_CALL_6| Int) (v_prenex_24 Int) (v_prenex_21 Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (or (and (= (select (select |#memory_int| v_prenex_24) (+ v_prenex_22 4)) (select (select |#memory_int| v_prenex_23) v_prenex_21)) (= |__VERIFIER_assert_#in~cond| 1)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_6|) (+ |v_main_~#b~0.offset_BEFORE_CALL_6| 4)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_6|) |v_main_~#a~0.offset_BEFORE_CALL_6|)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:37:07,867 INFO L193 IcfgInterpreter]: Reachable states at location L24-2 satisfy 116#(and (<= 0 main_~j~0) (<= 1 main_~i~0) (= main_~i~0 1) (<= main_~i~0 1) (= main_~j~0 0) (<= main_~j~0 0)) [2019-10-13 21:37:07,867 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 136#(and (exists ((|v_main_~#a~0.offset_BEFORE_CALL_6| Int) (|v_main_~#b~0.offset_BEFORE_CALL_6| Int) (v_prenex_23 Int) (v_prenex_22 Int) (|v_main_~#a~0.base_BEFORE_CALL_6| Int) (v_prenex_24 Int) (v_prenex_21 Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (or (and (= (select (select |#memory_int| v_prenex_24) (+ v_prenex_22 4)) (select (select |#memory_int| v_prenex_23) v_prenex_21)) (= |__VERIFIER_assert_#in~cond| 1)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_6|) (+ |v_main_~#b~0.offset_BEFORE_CALL_6| 4)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_6|) |v_main_~#a~0.offset_BEFORE_CALL_6|)))))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:37:07,867 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 145#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:37:07,867 INFO L193 IcfgInterpreter]: Reachable states at location L16-2 satisfy 111#(<= 1 main_~i~0) [2019-10-13 21:37:07,868 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 141#(and (exists ((|v_main_~#a~0.offset_BEFORE_CALL_6| Int) (|v_main_~#b~0.offset_BEFORE_CALL_6| Int) (v_prenex_23 Int) (v_prenex_22 Int) (|v_main_~#a~0.base_BEFORE_CALL_6| Int) (v_prenex_24 Int) (v_prenex_21 Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (or (and (= (select (select |#memory_int| v_prenex_24) (+ v_prenex_22 4)) (select (select |#memory_int| v_prenex_23) v_prenex_21)) (= |__VERIFIER_assert_#in~cond| 1)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_6|) (+ |v_main_~#b~0.offset_BEFORE_CALL_6| 4)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_6|) |v_main_~#a~0.offset_BEFORE_CALL_6|)))))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:37:07,868 INFO L193 IcfgInterpreter]: Reachable states at location L26 satisfy 121#(and (<= 0 main_~j~0) (< main_~i~0 100000) (<= 1 main_~i~0) (= |main_#t~mem2| (select (select |#memory_int| |main_~#a~0.base|) (+ (* main_~j~0 4) |main_~#a~0.offset|))) (= (select (select |#memory_int| |main_~#b~0.base|) (+ (* main_~j~0 36) |main_~#b~0.offset| 4)) |main_#t~mem3|) (= main_~i~0 1) (<= main_~i~0 1) (= main_~j~0 0) (<= main_~j~0 0)) [2019-10-13 21:37:07,868 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:37:07,868 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:37:07,868 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 150#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:37:07,869 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:37:07,869 INFO L193 IcfgInterpreter]: Reachable states at location L10-2 satisfy 68#true [2019-10-13 21:37:07,869 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 126#(exists ((|v_main_~#a~0.offset_BEFORE_CALL_6| Int) (|v_main_~#b~0.offset_BEFORE_CALL_6| Int) (v_prenex_23 Int) (v_prenex_22 Int) (|v_main_~#a~0.base_BEFORE_CALL_6| Int) (v_prenex_24 Int) (v_prenex_21 Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (or (and (= (select (select |#memory_int| v_prenex_24) (+ v_prenex_22 4)) (select (select |#memory_int| v_prenex_23) v_prenex_21)) (= |__VERIFIER_assert_#in~cond| 1)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_6|) (+ |v_main_~#b~0.offset_BEFORE_CALL_6| 4)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_6|) |v_main_~#a~0.offset_BEFORE_CALL_6|)))))) [2019-10-13 21:37:08,238 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:37:08,239 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 65, 65, 11] total 163 [2019-10-13 21:37:08,239 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857193029] [2019-10-13 21:37:08,240 INFO L442 AbstractCegarLoop]: Interpolant automaton has 163 states [2019-10-13 21:37:08,241 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:37:08,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 163 interpolants. [2019-10-13 21:37:08,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11957, Invalid=14449, Unknown=0, NotChecked=0, Total=26406 [2019-10-13 21:37:08,246 INFO L87 Difference]: Start difference. First operand 108 states and 110 transitions. Second operand 163 states.