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_find_ground-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 21:34:14,042 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:34:14,045 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:34:14,065 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:34:14,065 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:34:14,067 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:34:14,069 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:34:14,071 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:34:14,073 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:34:14,074 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:34:14,075 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:34:14,076 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:34:14,076 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:34:14,077 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:34:14,078 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:34:14,080 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:34:14,081 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:34:14,082 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:34:14,083 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:34:14,086 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:34:14,090 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:34:14,094 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:34:14,096 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:34:14,096 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:34:14,101 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:34:14,101 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:34:14,101 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:34:14,103 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:34:14,104 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:34:14,105 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:34:14,107 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:34:14,108 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:34:14,109 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:34:14,109 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:34:14,110 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:34:14,110 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:34:14,111 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:34:14,111 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:34:14,111 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:34:14,115 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:34:14,118 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:34:14,119 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:34:14,141 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:34:14,142 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:34:14,144 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:34:14,144 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:34:14,144 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:34:14,144 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:34:14,145 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:34:14,145 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:34:14,145 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:34:14,145 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:34:14,146 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:34:14,147 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:34:14,147 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:34:14,147 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:34:14,147 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:34:14,148 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:34:14,148 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:34:14,148 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:34:14,148 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:34:14,149 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:34:14,149 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:34:14,149 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:34:14,150 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:34:14,150 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:34:14,150 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:34:14,150 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:34:14,150 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:34:14,151 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:34:14,151 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:34:14,465 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:34:14,478 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:34:14,481 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:34:14,483 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:34:14,483 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:34:14,484 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_find_ground-1.i [2019-10-13 21:34:14,561 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15317051a/87cfd18ea923449abf1fe627d1eeea90/FLAG8760b866b [2019-10-13 21:34:15,035 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:34:15,037 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_find_ground-1.i [2019-10-13 21:34:15,044 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15317051a/87cfd18ea923449abf1fe627d1eeea90/FLAG8760b866b [2019-10-13 21:34:15,422 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15317051a/87cfd18ea923449abf1fe627d1eeea90 [2019-10-13 21:34:15,432 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:34:15,434 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:34:15,435 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:34:15,435 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:34:15,438 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:34:15,439 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:34:15" (1/1) ... [2019-10-13 21:34:15,442 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9ea241b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:34:15, skipping insertion in model container [2019-10-13 21:34:15,443 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:34:15" (1/1) ... [2019-10-13 21:34:15,450 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:34:15,468 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:34:15,671 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:34:15,675 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:34:15,693 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:34:15,807 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:34:15,808 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:34:15 WrapperNode [2019-10-13 21:34:15,808 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:34:15,809 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:34:15,809 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:34:15,809 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:34:15,821 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:34:15" (1/1) ... [2019-10-13 21:34:15,821 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:34:15" (1/1) ... [2019-10-13 21:34:15,829 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:34:15" (1/1) ... [2019-10-13 21:34:15,830 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:34:15" (1/1) ... [2019-10-13 21:34:15,841 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:34:15" (1/1) ... [2019-10-13 21:34:15,848 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:34:15" (1/1) ... [2019-10-13 21:34:15,849 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:34:15" (1/1) ... [2019-10-13 21:34:15,852 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:34:15,852 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:34:15,852 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:34:15,853 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:34:15,854 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:34:15" (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:34:15,925 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:34:15,925 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:34:15,925 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-13 21:34:15,925 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:34:15,926 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:34:15,926 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 21:34:15,927 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-13 21:34:15,927 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:34:15,927 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-13 21:34:15,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-13 21:34:15,927 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-13 21:34:15,928 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-13 21:34:15,928 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:34:15,928 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:34:16,294 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:34:16,294 INFO L284 CfgBuilder]: Removed 3 assume(true) statements. [2019-10-13 21:34:16,296 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:34:16 BoogieIcfgContainer [2019-10-13 21:34:16,296 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:34:16,297 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:34:16,297 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:34:16,304 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:34:16,305 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:34:15" (1/3) ... [2019-10-13 21:34:16,306 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1864da05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:34:16, skipping insertion in model container [2019-10-13 21:34:16,306 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:34:15" (2/3) ... [2019-10-13 21:34:16,306 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1864da05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:34:16, skipping insertion in model container [2019-10-13 21:34:16,306 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:34:16" (3/3) ... [2019-10-13 21:34:16,309 INFO L109 eAbstractionObserver]: Analyzing ICFG standard_find_ground-1.i [2019-10-13 21:34:16,320 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:34:16,327 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 21:34:16,337 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 21:34:16,358 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:34:16,358 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:34:16,358 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:34:16,358 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:34:16,359 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:34:16,359 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:34:16,359 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:34:16,359 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:34:16,375 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2019-10-13 21:34:16,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-13 21:34:16,382 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:34:16,383 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:34:16,385 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:34:16,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:34:16,391 INFO L82 PathProgramCache]: Analyzing trace with hash -1508760786, now seen corresponding path program 1 times [2019-10-13 21:34:16,398 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:34:16,398 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576880874] [2019-10-13 21:34:16,399 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:34:16,399 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:34:16,399 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:34:16,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:34:16,523 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:34:16,523 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576880874] [2019-10-13 21:34:16,524 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:34:16,525 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-13 21:34:16,525 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932590584] [2019-10-13 21:34:16,530 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-13 21:34:16,530 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:34:16,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-13 21:34:16,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-13 21:34:16,549 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 2 states. [2019-10-13 21:34:16,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:34:16,573 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2019-10-13 21:34:16,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-13 21:34:16,575 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2019-10-13 21:34:16,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:34:16,586 INFO L225 Difference]: With dead ends: 34 [2019-10-13 21:34:16,587 INFO L226 Difference]: Without dead ends: 18 [2019-10-13 21:34:16,591 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-13 21:34:16,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-10-13 21:34:16,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-10-13 21:34:16,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-10-13 21:34:16,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2019-10-13 21:34:16,638 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 13 [2019-10-13 21:34:16,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:34:16,638 INFO L462 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2019-10-13 21:34:16,639 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-13 21:34:16,639 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2019-10-13 21:34:16,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-13 21:34:16,640 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:34:16,640 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:34:16,640 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:34:16,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:34:16,641 INFO L82 PathProgramCache]: Analyzing trace with hash 1117724220, now seen corresponding path program 1 times [2019-10-13 21:34:16,641 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:34:16,642 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730621132] [2019-10-13 21:34:16,642 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:34:16,642 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:34:16,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:34:16,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:34:16,734 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:34:16,734 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730621132] [2019-10-13 21:34:16,735 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:34:16,735 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:34:16,736 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186356049] [2019-10-13 21:34:16,739 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:34:16,739 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:34:16,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:34:16,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:34:16,740 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand 3 states. [2019-10-13 21:34:16,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:34:16,761 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2019-10-13 21:34:16,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:34:16,763 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-10-13 21:34:16,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:34:16,765 INFO L225 Difference]: With dead ends: 31 [2019-10-13 21:34:16,765 INFO L226 Difference]: Without dead ends: 19 [2019-10-13 21:34:16,767 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:34:16,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-10-13 21:34:16,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-10-13 21:34:16,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-10-13 21:34:16,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2019-10-13 21:34:16,780 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 14 [2019-10-13 21:34:16,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:34:16,781 INFO L462 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2019-10-13 21:34:16,781 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:34:16,781 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2019-10-13 21:34:16,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-13 21:34:16,783 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:34:16,784 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:34:16,785 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:34:16,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:34:16,786 INFO L82 PathProgramCache]: Analyzing trace with hash -578316820, now seen corresponding path program 1 times [2019-10-13 21:34:16,787 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:34:16,788 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039521262] [2019-10-13 21:34:16,789 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:34:16,789 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:34:16,789 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:34:16,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:34:16,933 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:34:16,933 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039521262] [2019-10-13 21:34:16,933 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:34:16,934 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:34:16,934 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373312823] [2019-10-13 21:34:16,935 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:34:16,935 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:34:16,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:34:16,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:34:16,938 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand 4 states. [2019-10-13 21:34:16,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:34:16,971 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2019-10-13 21:34:16,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:34:16,972 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-10-13 21:34:16,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:34:16,973 INFO L225 Difference]: With dead ends: 32 [2019-10-13 21:34:16,973 INFO L226 Difference]: Without dead ends: 21 [2019-10-13 21:34:16,974 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:34:16,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-10-13 21:34:16,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-10-13 21:34:16,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-10-13 21:34:16,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2019-10-13 21:34:16,979 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 15 [2019-10-13 21:34:16,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:34:16,979 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2019-10-13 21:34:16,979 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:34:16,979 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2019-10-13 21:34:16,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-13 21:34:16,980 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:34:16,980 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:34:16,981 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:34:16,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:34:16,981 INFO L82 PathProgramCache]: Analyzing trace with hash 1210330239, now seen corresponding path program 1 times [2019-10-13 21:34:16,981 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:34:16,982 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331072067] [2019-10-13 21:34:16,982 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:34:16,982 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:34:16,982 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:34:17,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:34:17,034 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-13 21:34:17,035 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331072067] [2019-10-13 21:34:17,038 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1124084868] [2019-10-13 21:34:17,039 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:34:17,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:34:17,095 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 21:34:17,101 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:34:17,129 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-13 21:34:17,130 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:34:17,174 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-13 21:34:17,175 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1653740419] [2019-10-13 21:34:17,210 INFO L162 IcfgInterpreter]: Started Sifa with 15 locations of interest [2019-10-13 21:34:17,210 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:34:17,216 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:34:17,224 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:34:17,225 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:34:17,395 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:34:17,677 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 24 for LOIs [2019-10-13 21:34:17,703 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:34:17,721 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:34:17,721 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:34:17,721 INFO L193 IcfgInterpreter]: Reachable states at location L13-2 satisfy 91#(<= 100000 main_~j~0) [2019-10-13 21:34:17,722 INFO L193 IcfgInterpreter]: Reachable states at location L3-1 satisfy 121#(and (exists ((|v_main_~#a~0.offset_BEFORE_CALL_1| Int) (v_main_~i~0_BEFORE_CALL_1 Int) (|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (or (and (< v_main_~i~0_BEFORE_CALL_1 100000) (= |__VERIFIER_assert_#in~cond| 0) (< 0 v_main_~i~0_BEFORE_CALL_1) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (+ |v_main_~#a~0.offset_BEFORE_CALL_1| (* v_main_~i~0_BEFORE_CALL_1 4))) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) |v_main_~#a~0.offset_BEFORE_CALL_1|))) (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| 0) (and (< v_main_~i~0_BEFORE_CALL_1 100000) (= |__VERIFIER_assert_#in~cond| 1) (< 0 v_main_~i~0_BEFORE_CALL_1) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (+ |v_main_~#a~0.offset_BEFORE_CALL_1| (* v_main_~i~0_BEFORE_CALL_1 4))) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) |v_main_~#a~0.offset_BEFORE_CALL_1|)))))) (<= __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:34:17,723 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 126#(and (exists ((|v_main_~#a~0.offset_BEFORE_CALL_1| Int) (v_main_~i~0_BEFORE_CALL_1 Int) (|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (or (and (< v_main_~i~0_BEFORE_CALL_1 100000) (= |__VERIFIER_assert_#in~cond| 0) (< 0 v_main_~i~0_BEFORE_CALL_1) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (+ |v_main_~#a~0.offset_BEFORE_CALL_1| (* v_main_~i~0_BEFORE_CALL_1 4))) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) |v_main_~#a~0.offset_BEFORE_CALL_1|))) (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| 0) (and (< v_main_~i~0_BEFORE_CALL_1 100000) (= |__VERIFIER_assert_#in~cond| 1) (< 0 v_main_~i~0_BEFORE_CALL_1) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (+ |v_main_~#a~0.offset_BEFORE_CALL_1| (* v_main_~i~0_BEFORE_CALL_1 4))) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) |v_main_~#a~0.offset_BEFORE_CALL_1|)))))) (<= __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:34:17,723 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 130#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:34:17,724 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 101#(and (or (and (<= 100000 main_~i~0) (<= 100000 main_~j~0) (<= main_~x~0 0) (<= 0 main_~x~0)) (and (<= main_~i~0 100000) (<= 100000 main_~j~0) (<= main_~x~0 0) (<= 0 main_~x~0))) (or (and (= main_~x~0 0) (not (< main_~j~0 100000)) (not (< main_~i~0 100000))) (and (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* main_~i~0 4) |main_~#a~0.offset|)) main_~e~0) (= main_~x~0 0) (not (< main_~j~0 100000))))) [2019-10-13 21:34:17,725 INFO L193 IcfgInterpreter]: Reachable states at location L3 satisfy 116#(and (exists ((|v_main_~#a~0.offset_BEFORE_CALL_1| Int) (v_main_~i~0_BEFORE_CALL_1 Int) (|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (or (and (< v_main_~i~0_BEFORE_CALL_1 100000) (= |__VERIFIER_assert_#in~cond| 0) (< 0 v_main_~i~0_BEFORE_CALL_1) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (+ |v_main_~#a~0.offset_BEFORE_CALL_1| (* v_main_~i~0_BEFORE_CALL_1 4))) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) |v_main_~#a~0.offset_BEFORE_CALL_1|))) (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| 0) (and (< v_main_~i~0_BEFORE_CALL_1 100000) (= |__VERIFIER_assert_#in~cond| 1) (< 0 v_main_~i~0_BEFORE_CALL_1) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (+ |v_main_~#a~0.offset_BEFORE_CALL_1| (* v_main_~i~0_BEFORE_CALL_1 4))) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) |v_main_~#a~0.offset_BEFORE_CALL_1|)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:34:17,725 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:34:17,725 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:34:17,725 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 135#(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:34:17,726 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 68#true [2019-10-13 21:34:17,726 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:34:17,727 INFO L193 IcfgInterpreter]: Reachable states at location L18 satisfy 106#(and (or (and (= |main_#t~mem6| (select (select |#memory_int| |main_~#a~0.base|) (+ (* main_~x~0 4) |main_~#a~0.offset|))) (not (< main_~j~0 100000)) (= main_~x~0 0) (not (< main_~i~0 100000)) (< main_~x~0 main_~i~0)) (and (= |main_#t~mem6| (select (select |#memory_int| |main_~#a~0.base|) (+ (* main_~x~0 4) |main_~#a~0.offset|))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* main_~i~0 4) |main_~#a~0.offset|)) main_~e~0) (not (< main_~j~0 100000)) (= main_~x~0 0) (< main_~x~0 main_~i~0))) (or (and (<= 0 main_~i~0) (<= main_~i~0 100000) (<= 100000 main_~j~0) (<= main_~x~0 0) (<= 0 main_~x~0)) (and (<= 100000 main_~i~0) (<= 100000 main_~j~0) (<= main_~x~0 0) (<= 0 main_~x~0)))) [2019-10-13 21:34:17,727 INFO L193 IcfgInterpreter]: Reachable states at location L13-5 satisfy 96#(and (or (and (<= main_~i~0 100000) (<= 100000 main_~j~0)) (and (<= 100000 main_~i~0) (<= 100000 main_~j~0))) (or (and (not (< main_~j~0 100000)) (not (< main_~i~0 100000))) (and (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* main_~i~0 4) |main_~#a~0.offset|)) main_~e~0) (not (< main_~j~0 100000))))) [2019-10-13 21:34:17,731 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 111#(exists ((|v_main_~#a~0.offset_BEFORE_CALL_1| Int) (v_main_~i~0_BEFORE_CALL_1 Int) (|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (or (and (< v_main_~i~0_BEFORE_CALL_1 100000) (= |__VERIFIER_assert_#in~cond| 0) (< 0 v_main_~i~0_BEFORE_CALL_1) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (+ |v_main_~#a~0.offset_BEFORE_CALL_1| (* v_main_~i~0_BEFORE_CALL_1 4))) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) |v_main_~#a~0.offset_BEFORE_CALL_1|))) (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| 0) (and (< v_main_~i~0_BEFORE_CALL_1 100000) (= |__VERIFIER_assert_#in~cond| 1) (< 0 v_main_~i~0_BEFORE_CALL_1) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (+ |v_main_~#a~0.offset_BEFORE_CALL_1| (* v_main_~i~0_BEFORE_CALL_1 4))) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) |v_main_~#a~0.offset_BEFORE_CALL_1|)))))) [2019-10-13 21:34:17,734 INFO L193 IcfgInterpreter]: Reachable states at location L13-4 satisfy 83#(and (not (< main_~j~0 100000)) (<= 100000 main_~j~0)) [2019-10-13 21:34:18,201 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:34:18,202 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 12] total 18 [2019-10-13 21:34:18,202 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906728450] [2019-10-13 21:34:18,204 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-13 21:34:18,204 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:34:18,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-13 21:34:18,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2019-10-13 21:34:18,208 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand 18 states. [2019-10-13 21:34:18,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:34:18,787 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2019-10-13 21:34:18,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-13 21:34:18,788 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 17 [2019-10-13 21:34:18,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:34:18,790 INFO L225 Difference]: With dead ends: 41 [2019-10-13 21:34:18,791 INFO L226 Difference]: Without dead ends: 27 [2019-10-13 21:34:18,798 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=148, Invalid=722, Unknown=0, NotChecked=0, Total=870 [2019-10-13 21:34:18,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-10-13 21:34:18,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 24. [2019-10-13 21:34:18,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-10-13 21:34:18,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2019-10-13 21:34:18,817 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 17 [2019-10-13 21:34:18,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:34:18,821 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2019-10-13 21:34:18,821 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-13 21:34:18,821 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2019-10-13 21:34:18,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-13 21:34:18,822 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:34:18,822 INFO L380 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:34:19,033 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:34:19,034 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:34:19,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:34:19,036 INFO L82 PathProgramCache]: Analyzing trace with hash -884454193, now seen corresponding path program 2 times [2019-10-13 21:34:19,036 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:34:19,036 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311221511] [2019-10-13 21:34:19,037 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:34:19,037 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:34:19,037 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:34:19,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:34:19,119 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-13 21:34:19,120 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311221511] [2019-10-13 21:34:19,120 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1813446267] [2019-10-13 21:34:19,120 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:34:19,171 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-10-13 21:34:19,171 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:34:19,172 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 17 conjunts are in the unsatisfiable core [2019-10-13 21:34:19,177 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:34:19,304 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-13 21:34:19,304 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:34:19,426 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-13 21:34:19,427 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [993073892] [2019-10-13 21:34:19,428 INFO L162 IcfgInterpreter]: Started Sifa with 15 locations of interest [2019-10-13 21:34:19,428 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:34:19,429 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:34:19,429 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:34:19,429 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:34:19,491 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:34:19,641 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 24 for LOIs [2019-10-13 21:34:19,676 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:34:19,683 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:34:19,684 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:34:19,684 INFO L193 IcfgInterpreter]: Reachable states at location L13-2 satisfy 91#(<= 100000 main_~j~0) [2019-10-13 21:34:19,684 INFO L193 IcfgInterpreter]: Reachable states at location L3-1 satisfy 121#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_main_~#a~0.base_BEFORE_CALL_2| Int) (|v_main_~#a~0.offset_BEFORE_CALL_2| Int) (v_main_~i~0_BEFORE_CALL_2 Int)) (or (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| 0) (and (= |__VERIFIER_assert_#in~cond| 0) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) (+ |v_main_~#a~0.offset_BEFORE_CALL_2| (* v_main_~i~0_BEFORE_CALL_2 4))) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) |v_main_~#a~0.offset_BEFORE_CALL_2|)) (< 0 v_main_~i~0_BEFORE_CALL_2) (< v_main_~i~0_BEFORE_CALL_2 100000)) (and (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) (+ |v_main_~#a~0.offset_BEFORE_CALL_2| (* v_main_~i~0_BEFORE_CALL_2 4))) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) |v_main_~#a~0.offset_BEFORE_CALL_2|))) (= |__VERIFIER_assert_#in~cond| 1) (< 0 v_main_~i~0_BEFORE_CALL_2) (< v_main_~i~0_BEFORE_CALL_2 100000)))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:34:19,685 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 126#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_main_~#a~0.base_BEFORE_CALL_2| Int) (|v_main_~#a~0.offset_BEFORE_CALL_2| Int) (v_main_~i~0_BEFORE_CALL_2 Int)) (or (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| 0) (and (= |__VERIFIER_assert_#in~cond| 0) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) (+ |v_main_~#a~0.offset_BEFORE_CALL_2| (* v_main_~i~0_BEFORE_CALL_2 4))) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) |v_main_~#a~0.offset_BEFORE_CALL_2|)) (< 0 v_main_~i~0_BEFORE_CALL_2) (< v_main_~i~0_BEFORE_CALL_2 100000)) (and (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) (+ |v_main_~#a~0.offset_BEFORE_CALL_2| (* v_main_~i~0_BEFORE_CALL_2 4))) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) |v_main_~#a~0.offset_BEFORE_CALL_2|))) (= |__VERIFIER_assert_#in~cond| 1) (< 0 v_main_~i~0_BEFORE_CALL_2) (< v_main_~i~0_BEFORE_CALL_2 100000)))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:34:19,685 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 130#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:34:19,685 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 101#(and (or (and (<= 100000 main_~i~0) (<= 100000 main_~j~0) (<= main_~x~0 0) (<= 0 main_~x~0)) (and (<= main_~i~0 100000) (<= 100000 main_~j~0) (<= main_~x~0 0) (<= 0 main_~x~0))) (or (and (= main_~x~0 0) (not (< main_~j~0 100000)) (not (< main_~i~0 100000))) (and (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* main_~i~0 4) |main_~#a~0.offset|)) main_~e~0) (= main_~x~0 0) (not (< main_~j~0 100000))))) [2019-10-13 21:34:19,686 INFO L193 IcfgInterpreter]: Reachable states at location L3 satisfy 116#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_2| Int) (|v_main_~#a~0.offset_BEFORE_CALL_2| Int) (v_main_~i~0_BEFORE_CALL_2 Int)) (or (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| 0) (and (= |__VERIFIER_assert_#in~cond| 0) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) (+ |v_main_~#a~0.offset_BEFORE_CALL_2| (* v_main_~i~0_BEFORE_CALL_2 4))) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) |v_main_~#a~0.offset_BEFORE_CALL_2|)) (< 0 v_main_~i~0_BEFORE_CALL_2) (< v_main_~i~0_BEFORE_CALL_2 100000)) (and (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) (+ |v_main_~#a~0.offset_BEFORE_CALL_2| (* v_main_~i~0_BEFORE_CALL_2 4))) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) |v_main_~#a~0.offset_BEFORE_CALL_2|))) (= |__VERIFIER_assert_#in~cond| 1) (< 0 v_main_~i~0_BEFORE_CALL_2) (< v_main_~i~0_BEFORE_CALL_2 100000)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:34:19,686 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:34:19,686 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:34:19,693 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 135#(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:34:19,693 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 68#true [2019-10-13 21:34:19,694 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:34:19,694 INFO L193 IcfgInterpreter]: Reachable states at location L18 satisfy 106#(and (or (and (= |main_#t~mem6| (select (select |#memory_int| |main_~#a~0.base|) (+ (* main_~x~0 4) |main_~#a~0.offset|))) (not (< main_~j~0 100000)) (= main_~x~0 0) (not (< main_~i~0 100000)) (< main_~x~0 main_~i~0)) (and (= |main_#t~mem6| (select (select |#memory_int| |main_~#a~0.base|) (+ (* main_~x~0 4) |main_~#a~0.offset|))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* main_~i~0 4) |main_~#a~0.offset|)) main_~e~0) (not (< main_~j~0 100000)) (= main_~x~0 0) (< main_~x~0 main_~i~0))) (or (and (<= 0 main_~i~0) (<= main_~i~0 100000) (<= 100000 main_~j~0) (<= main_~x~0 0) (<= 0 main_~x~0)) (and (<= 100000 main_~i~0) (<= 100000 main_~j~0) (<= main_~x~0 0) (<= 0 main_~x~0)))) [2019-10-13 21:34:19,694 INFO L193 IcfgInterpreter]: Reachable states at location L13-5 satisfy 96#(and (or (and (<= main_~i~0 100000) (<= 100000 main_~j~0)) (and (<= 100000 main_~i~0) (<= 100000 main_~j~0))) (or (and (not (< main_~j~0 100000)) (not (< main_~i~0 100000))) (and (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* main_~i~0 4) |main_~#a~0.offset|)) main_~e~0) (not (< main_~j~0 100000))))) [2019-10-13 21:34:19,694 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 111#(exists ((|v_main_~#a~0.base_BEFORE_CALL_2| Int) (|v_main_~#a~0.offset_BEFORE_CALL_2| Int) (v_main_~i~0_BEFORE_CALL_2 Int)) (or (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| 0) (and (= |__VERIFIER_assert_#in~cond| 0) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) (+ |v_main_~#a~0.offset_BEFORE_CALL_2| (* v_main_~i~0_BEFORE_CALL_2 4))) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) |v_main_~#a~0.offset_BEFORE_CALL_2|)) (< 0 v_main_~i~0_BEFORE_CALL_2) (< v_main_~i~0_BEFORE_CALL_2 100000)) (and (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) (+ |v_main_~#a~0.offset_BEFORE_CALL_2| (* v_main_~i~0_BEFORE_CALL_2 4))) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) |v_main_~#a~0.offset_BEFORE_CALL_2|))) (= |__VERIFIER_assert_#in~cond| 1) (< 0 v_main_~i~0_BEFORE_CALL_2) (< v_main_~i~0_BEFORE_CALL_2 100000)))) [2019-10-13 21:34:19,694 INFO L193 IcfgInterpreter]: Reachable states at location L13-4 satisfy 83#(and (not (< main_~j~0 100000)) (<= 100000 main_~j~0)) [2019-10-13 21:34:20,250 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:34:20,251 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9, 12] total 31 [2019-10-13 21:34:20,251 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625328605] [2019-10-13 21:34:20,252 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-10-13 21:34:20,252 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:34:20,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-10-13 21:34:20,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=837, Unknown=0, NotChecked=0, Total=930 [2019-10-13 21:34:20,253 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 31 states. [2019-10-13 21:34:21,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:34:21,435 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2019-10-13 21:34:21,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-13 21:34:21,435 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 20 [2019-10-13 21:34:21,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:34:21,437 INFO L225 Difference]: With dead ends: 44 [2019-10-13 21:34:21,437 INFO L226 Difference]: Without dead ends: 30 [2019-10-13 21:34:21,438 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 453 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=290, Invalid=2160, Unknown=0, NotChecked=0, Total=2450 [2019-10-13 21:34:21,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-10-13 21:34:21,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2019-10-13 21:34:21,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-10-13 21:34:21,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2019-10-13 21:34:21,446 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 20 [2019-10-13 21:34:21,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:34:21,446 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2019-10-13 21:34:21,446 INFO L463 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-10-13 21:34:21,447 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2019-10-13 21:34:21,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-13 21:34:21,448 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:34:21,448 INFO L380 BasicCegarLoop]: trace histogram [5, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:34:21,654 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:34:21,655 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:34:21,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:34:21,656 INFO L82 PathProgramCache]: Analyzing trace with hash 647347453, now seen corresponding path program 1 times [2019-10-13 21:34:21,656 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:34:21,656 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101075590] [2019-10-13 21:34:21,657 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:34:21,657 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:34:21,657 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:34:21,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:34:21,746 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-13 21:34:21,746 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101075590] [2019-10-13 21:34:21,746 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1562480766] [2019-10-13 21:34:21,747 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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:34:21,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:34:21,800 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-13 21:34:21,802 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:34:21,817 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-13 21:34:21,817 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:34:21,887 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-13 21:34:21,888 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1970779373] [2019-10-13 21:34:21,890 INFO L162 IcfgInterpreter]: Started Sifa with 18 locations of interest [2019-10-13 21:34:21,891 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:34:21,892 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:34:21,892 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:34:21,892 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:34:21,923 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:34:22,147 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-13 21:34:22,171 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:34:22,178 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:34:22,179 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:34:22,179 INFO L193 IcfgInterpreter]: Reachable states at location L13-2 satisfy 91#(<= 100000 main_~j~0) [2019-10-13 21:34:22,179 INFO L193 IcfgInterpreter]: Reachable states at location L3-1 satisfy 190#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-13 21:34:22,180 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 195#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-13 21:34:22,180 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 199#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:34:22,180 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertEXIT satisfy 185#(and (or (and (= |__VERIFIER_assert_#in~cond| 1) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1)) [2019-10-13 21:34:22,181 INFO L193 IcfgInterpreter]: Reachable states at location L3-3 satisfy 180#(and (or (and (= |__VERIFIER_assert_#in~cond| 1) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1)) [2019-10-13 21:34:22,181 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 148#(and (<= 100000 main_~j~0) (<= 0 main_~x~0)) [2019-10-13 21:34:22,186 INFO L193 IcfgInterpreter]: Reachable states at location L3 satisfy 175#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-13 21:34:22,186 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:34:22,187 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:34:22,187 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 68#true [2019-10-13 21:34:22,187 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 204#(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:34:22,187 INFO L193 IcfgInterpreter]: Reachable states at location L18-1 satisfy 166#(and (= |main_#t~mem6| (select (select |#memory_int| |main_~#a~0.base|) (+ (* main_~x~0 4) |main_~#a~0.offset|))) (<= 0 main_~i~0) (<= 100000 main_~j~0) (not (= main_~e~0 |main_#t~mem6|)) (< main_~x~0 main_~i~0) (<= 0 main_~x~0)) [2019-10-13 21:34:22,187 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:34:22,188 INFO L193 IcfgInterpreter]: Reachable states at location L18 satisfy 153#(and (= |main_#t~mem6| (select (select |#memory_int| |main_~#a~0.base|) (+ (* main_~x~0 4) |main_~#a~0.offset|))) (<= 0 main_~i~0) (<= 100000 main_~j~0) (< main_~x~0 main_~i~0) (<= 0 main_~x~0)) [2019-10-13 21:34:22,188 INFO L193 IcfgInterpreter]: Reachable states at location L13-5 satisfy 96#(and (or (and (<= main_~i~0 100000) (<= 100000 main_~j~0)) (and (<= 100000 main_~i~0) (<= 100000 main_~j~0))) (or (and (not (< main_~j~0 100000)) (not (< main_~i~0 100000))) (and (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* main_~i~0 4) |main_~#a~0.offset|)) main_~e~0) (not (< main_~j~0 100000))))) [2019-10-13 21:34:22,188 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 170#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| 0))) [2019-10-13 21:34:22,188 INFO L193 IcfgInterpreter]: Reachable states at location L13-4 satisfy 83#(and (not (< main_~j~0 100000)) (<= 100000 main_~j~0)) [2019-10-13 21:34:22,660 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:34:22,661 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 14] total 28 [2019-10-13 21:34:22,661 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191422083] [2019-10-13 21:34:22,662 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-10-13 21:34:22,664 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:34:22,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-10-13 21:34:22,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=610, Unknown=0, NotChecked=0, Total=756 [2019-10-13 21:34:22,665 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand 28 states. [2019-10-13 21:34:23,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:34:23,556 INFO L93 Difference]: Finished difference Result 54 states and 66 transitions. [2019-10-13 21:34:23,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-10-13 21:34:23,556 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 28 [2019-10-13 21:34:23,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:34:23,559 INFO L225 Difference]: With dead ends: 54 [2019-10-13 21:34:23,559 INFO L226 Difference]: Without dead ends: 36 [2019-10-13 21:34:23,561 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 706 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=415, Invalid=2035, Unknown=0, NotChecked=0, Total=2450 [2019-10-13 21:34:23,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-10-13 21:34:23,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-10-13 21:34:23,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-10-13 21:34:23,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2019-10-13 21:34:23,570 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 28 [2019-10-13 21:34:23,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:34:23,570 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2019-10-13 21:34:23,570 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-10-13 21:34:23,571 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2019-10-13 21:34:23,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-10-13 21:34:23,572 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:34:23,572 INFO L380 BasicCegarLoop]: trace histogram [12, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:34:23,776 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:34:23,776 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:34:23,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:34:23,776 INFO L82 PathProgramCache]: Analyzing trace with hash 827219629, now seen corresponding path program 2 times [2019-10-13 21:34:23,777 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:34:23,777 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203058309] [2019-10-13 21:34:23,777 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:34:23,778 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:34:23,778 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:34:23,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:34:23,999 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 2 proven. 78 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-13 21:34:24,000 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203058309] [2019-10-13 21:34:24,001 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1347899619] [2019-10-13 21:34:24,001 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 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:34:24,068 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-10-13 21:34:24,071 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:34:24,072 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-13 21:34:24,077 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:34:24,139 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-10-13 21:34:24,139 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:34:24,194 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-10-13 21:34:24,195 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [257333301] [2019-10-13 21:34:24,196 INFO L162 IcfgInterpreter]: Started Sifa with 18 locations of interest [2019-10-13 21:34:24,196 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:34:24,197 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:34:24,197 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:34:24,198 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:34:24,233 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:34:24,384 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-13 21:34:24,404 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:34:24,408 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:34:24,409 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:34:24,409 INFO L193 IcfgInterpreter]: Reachable states at location L13-2 satisfy 91#(<= 100000 main_~j~0) [2019-10-13 21:34:24,409 INFO L193 IcfgInterpreter]: Reachable states at location L3-1 satisfy 190#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-13 21:34:24,409 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 195#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-13 21:34:24,410 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 199#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:34:24,410 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertEXIT satisfy 185#(and (or (and (= |__VERIFIER_assert_#in~cond| 1) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1)) [2019-10-13 21:34:24,410 INFO L193 IcfgInterpreter]: Reachable states at location L3-3 satisfy 180#(and (or (and (= |__VERIFIER_assert_#in~cond| 1) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1)) [2019-10-13 21:34:24,410 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 148#(and (<= 100000 main_~j~0) (<= 0 main_~x~0)) [2019-10-13 21:34:24,410 INFO L193 IcfgInterpreter]: Reachable states at location L3 satisfy 175#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-13 21:34:24,411 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:34:24,411 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:34:24,411 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 68#true [2019-10-13 21:34:24,411 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 204#(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:34:24,411 INFO L193 IcfgInterpreter]: Reachable states at location L18-1 satisfy 166#(and (= |main_#t~mem6| (select (select |#memory_int| |main_~#a~0.base|) (+ (* main_~x~0 4) |main_~#a~0.offset|))) (<= 0 main_~i~0) (<= 100000 main_~j~0) (not (= main_~e~0 |main_#t~mem6|)) (< main_~x~0 main_~i~0) (<= 0 main_~x~0)) [2019-10-13 21:34:24,412 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:34:24,412 INFO L193 IcfgInterpreter]: Reachable states at location L18 satisfy 153#(and (= |main_#t~mem6| (select (select |#memory_int| |main_~#a~0.base|) (+ (* main_~x~0 4) |main_~#a~0.offset|))) (<= 0 main_~i~0) (<= 100000 main_~j~0) (< main_~x~0 main_~i~0) (<= 0 main_~x~0)) [2019-10-13 21:34:24,412 INFO L193 IcfgInterpreter]: Reachable states at location L13-5 satisfy 96#(and (or (and (<= main_~i~0 100000) (<= 100000 main_~j~0)) (and (<= 100000 main_~i~0) (<= 100000 main_~j~0))) (or (and (not (< main_~j~0 100000)) (not (< main_~i~0 100000))) (and (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* main_~i~0 4) |main_~#a~0.offset|)) main_~e~0) (not (< main_~j~0 100000))))) [2019-10-13 21:34:24,412 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 170#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| 1))) [2019-10-13 21:34:24,412 INFO L193 IcfgInterpreter]: Reachable states at location L13-4 satisfy 83#(and (not (< main_~j~0 100000)) (<= 100000 main_~j~0)) [2019-10-13 21:34:24,945 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:34:24,945 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 6, 6, 14] total 34 [2019-10-13 21:34:24,946 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129776514] [2019-10-13 21:34:24,947 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-10-13 21:34:24,947 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:34:24,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-10-13 21:34:24,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=956, Unknown=0, NotChecked=0, Total=1122 [2019-10-13 21:34:24,949 INFO L87 Difference]: Start difference. First operand 36 states and 39 transitions. Second operand 34 states. [2019-10-13 21:34:26,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:34:26,607 INFO L93 Difference]: Finished difference Result 62 states and 70 transitions. [2019-10-13 21:34:26,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-10-13 21:34:26,607 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 35 [2019-10-13 21:34:26,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:34:26,608 INFO L225 Difference]: With dead ends: 62 [2019-10-13 21:34:26,608 INFO L226 Difference]: Without dead ends: 39 [2019-10-13 21:34:26,610 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 86 SyntacticMatches, 2 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1003 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=598, Invalid=3562, Unknown=0, NotChecked=0, Total=4160 [2019-10-13 21:34:26,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-10-13 21:34:26,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-10-13 21:34:26,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-10-13 21:34:26,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2019-10-13 21:34:26,618 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 35 [2019-10-13 21:34:26,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:34:26,619 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2019-10-13 21:34:26,619 INFO L463 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-10-13 21:34:26,619 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2019-10-13 21:34:26,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-10-13 21:34:26,620 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:34:26,620 INFO L380 BasicCegarLoop]: trace histogram [13, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:34:26,824 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:34:26,824 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:34:26,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:34:26,825 INFO L82 PathProgramCache]: Analyzing trace with hash -1326599222, now seen corresponding path program 3 times [2019-10-13 21:34:26,825 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:34:26,826 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765984539] [2019-10-13 21:34:26,826 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:34:26,826 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:34:26,827 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:34:26,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:34:26,986 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 2 proven. 91 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-13 21:34:26,987 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765984539] [2019-10-13 21:34:26,987 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1073305567] [2019-10-13 21:34:26,987 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 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:34:27,070 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-13 21:34:27,070 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:34:27,071 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-13 21:34:27,073 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:34:27,085 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-13 21:34:27,086 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:34:27,394 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 2 proven. 91 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-13 21:34:27,394 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [323953815] [2019-10-13 21:34:27,396 INFO L162 IcfgInterpreter]: Started Sifa with 18 locations of interest [2019-10-13 21:34:27,396 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:34:27,396 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:34:27,397 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:34:27,397 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:34:27,419 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:34:27,558 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-13 21:34:27,578 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:34:27,582 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:34:27,582 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:34:27,582 INFO L193 IcfgInterpreter]: Reachable states at location L13-2 satisfy 91#(<= 100000 main_~j~0) [2019-10-13 21:34:27,584 INFO L193 IcfgInterpreter]: Reachable states at location L3-1 satisfy 190#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-13 21:34:27,586 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 195#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-13 21:34:27,586 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 199#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:34:27,586 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertEXIT satisfy 185#(and (or (and (= |__VERIFIER_assert_#in~cond| 1) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1)) [2019-10-13 21:34:27,587 INFO L193 IcfgInterpreter]: Reachable states at location L3-3 satisfy 180#(and (or (and (= |__VERIFIER_assert_#in~cond| 1) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1)) [2019-10-13 21:34:27,587 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 148#(and (<= 100000 main_~j~0) (<= 0 main_~x~0)) [2019-10-13 21:34:27,587 INFO L193 IcfgInterpreter]: Reachable states at location L3 satisfy 175#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-13 21:34:27,587 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:34:27,587 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:34:27,587 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 68#true [2019-10-13 21:34:27,588 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 204#(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:34:27,588 INFO L193 IcfgInterpreter]: Reachable states at location L18-1 satisfy 166#(and (= |main_#t~mem6| (select (select |#memory_int| |main_~#a~0.base|) (+ (* main_~x~0 4) |main_~#a~0.offset|))) (<= 0 main_~i~0) (<= 100000 main_~j~0) (not (= main_~e~0 |main_#t~mem6|)) (< main_~x~0 main_~i~0) (<= 0 main_~x~0)) [2019-10-13 21:34:27,588 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:34:27,588 INFO L193 IcfgInterpreter]: Reachable states at location L18 satisfy 153#(and (= |main_#t~mem6| (select (select |#memory_int| |main_~#a~0.base|) (+ (* main_~x~0 4) |main_~#a~0.offset|))) (<= 0 main_~i~0) (<= 100000 main_~j~0) (< main_~x~0 main_~i~0) (<= 0 main_~x~0)) [2019-10-13 21:34:27,588 INFO L193 IcfgInterpreter]: Reachable states at location L13-5 satisfy 96#(and (or (and (<= main_~i~0 100000) (<= 100000 main_~j~0)) (and (<= 100000 main_~i~0) (<= 100000 main_~j~0))) (or (and (not (< main_~j~0 100000)) (not (< main_~i~0 100000))) (and (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* main_~i~0 4) |main_~#a~0.offset|)) main_~e~0) (not (< main_~j~0 100000))))) [2019-10-13 21:34:27,589 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 170#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| 0))) [2019-10-13 21:34:27,589 INFO L193 IcfgInterpreter]: Reachable states at location L13-4 satisfy 83#(and (not (< main_~j~0 100000)) (<= 100000 main_~j~0)) [2019-10-13 21:34:28,001 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:34:28,001 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16, 14] total 44 [2019-10-13 21:34:28,002 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358965181] [2019-10-13 21:34:28,003 INFO L442 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-10-13 21:34:28,003 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:34:28,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-10-13 21:34:28,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=506, Invalid=1386, Unknown=0, NotChecked=0, Total=1892 [2019-10-13 21:34:28,005 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 44 states. [2019-10-13 21:34:29,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:34:29,591 INFO L93 Difference]: Finished difference Result 74 states and 94 transitions. [2019-10-13 21:34:29,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-10-13 21:34:29,591 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 38 [2019-10-13 21:34:29,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:34:29,592 INFO L225 Difference]: With dead ends: 74 [2019-10-13 21:34:29,592 INFO L226 Difference]: Without dead ends: 54 [2019-10-13 21:34:29,595 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1798 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1463, Invalid=5179, Unknown=0, NotChecked=0, Total=6642 [2019-10-13 21:34:29,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-10-13 21:34:29,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-10-13 21:34:29,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-10-13 21:34:29,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2019-10-13 21:34:29,604 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 38 [2019-10-13 21:34:29,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:34:29,604 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions. [2019-10-13 21:34:29,604 INFO L463 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-10-13 21:34:29,604 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2019-10-13 21:34:29,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-10-13 21:34:29,606 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:34:29,606 INFO L380 BasicCegarLoop]: trace histogram [28, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:34:29,810 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:34:29,810 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:34:29,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:34:29,811 INFO L82 PathProgramCache]: Analyzing trace with hash 1469456762, now seen corresponding path program 4 times [2019-10-13 21:34:29,811 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:34:29,811 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779126238] [2019-10-13 21:34:29,811 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:34:29,811 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:34:29,811 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:34:29,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:34:30,258 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 2 proven. 406 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-13 21:34:30,259 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779126238] [2019-10-13 21:34:30,259 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [806148456] [2019-10-13 21:34:30,259 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 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:34:30,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:34:30,355 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 30 conjunts are in the unsatisfiable core [2019-10-13 21:34:30,358 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:34:30,389 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-13 21:34:30,390 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:34:31,481 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 2 proven. 406 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-13 21:34:31,481 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [227088804] [2019-10-13 21:34:31,483 INFO L162 IcfgInterpreter]: Started Sifa with 18 locations of interest [2019-10-13 21:34:31,483 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:34:31,483 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:34:31,483 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:34:31,483 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:34:31,505 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:34:31,622 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-13 21:34:31,637 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:34:31,641 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:34:31,641 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:34:31,641 INFO L193 IcfgInterpreter]: Reachable states at location L3-1 satisfy 190#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-13 21:34:31,642 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 195#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-13 21:34:31,642 INFO L193 IcfgInterpreter]: Reachable states at location L13-2 satisfy 91#(<= 100000 main_~j~0) [2019-10-13 21:34:31,642 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 199#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:34:31,642 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertEXIT satisfy 185#(and (or (and (= |__VERIFIER_assert_#in~cond| 1) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1)) [2019-10-13 21:34:31,642 INFO L193 IcfgInterpreter]: Reachable states at location L3-3 satisfy 180#(and (or (and (= |__VERIFIER_assert_#in~cond| 1) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1)) [2019-10-13 21:34:31,643 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 148#(and (<= 100000 main_~j~0) (<= 0 main_~x~0)) [2019-10-13 21:34:31,643 INFO L193 IcfgInterpreter]: Reachable states at location L3 satisfy 175#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-13 21:34:31,643 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:34:31,643 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:34:31,643 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 204#(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:34:31,644 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 68#true [2019-10-13 21:34:31,644 INFO L193 IcfgInterpreter]: Reachable states at location L18-1 satisfy 166#(and (= |main_#t~mem6| (select (select |#memory_int| |main_~#a~0.base|) (+ (* main_~x~0 4) |main_~#a~0.offset|))) (<= 0 main_~i~0) (<= 100000 main_~j~0) (not (= main_~e~0 |main_#t~mem6|)) (< main_~x~0 main_~i~0) (<= 0 main_~x~0)) [2019-10-13 21:34:31,644 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:34:31,644 INFO L193 IcfgInterpreter]: Reachable states at location L18 satisfy 153#(and (= |main_#t~mem6| (select (select |#memory_int| |main_~#a~0.base|) (+ (* main_~x~0 4) |main_~#a~0.offset|))) (<= 0 main_~i~0) (<= 100000 main_~j~0) (< main_~x~0 main_~i~0) (<= 0 main_~x~0)) [2019-10-13 21:34:31,644 INFO L193 IcfgInterpreter]: Reachable states at location L13-5 satisfy 96#(and (or (and (<= main_~i~0 100000) (<= 100000 main_~j~0)) (and (<= 100000 main_~i~0) (<= 100000 main_~j~0))) (or (and (not (< main_~j~0 100000)) (not (< main_~i~0 100000))) (and (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* main_~i~0 4) |main_~#a~0.offset|)) main_~e~0) (not (< main_~j~0 100000))))) [2019-10-13 21:34:31,645 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 170#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| 1))) [2019-10-13 21:34:31,645 INFO L193 IcfgInterpreter]: Reachable states at location L13-4 satisfy 83#(and (not (< main_~j~0 100000)) (<= 100000 main_~j~0)) [2019-10-13 21:34:32,201 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:34:32,201 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31, 14] total 74 [2019-10-13 21:34:32,201 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039723048] [2019-10-13 21:34:32,203 INFO L442 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-10-13 21:34:32,203 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:34:32,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-10-13 21:34:32,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1871, Invalid=3531, Unknown=0, NotChecked=0, Total=5402 [2019-10-13 21:34:32,206 INFO L87 Difference]: Start difference. First operand 54 states and 57 transitions. Second operand 74 states. [2019-10-13 21:34:35,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:34:35,750 INFO L93 Difference]: Finished difference Result 104 states and 139 transitions. [2019-10-13 21:34:35,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-10-13 21:34:35,750 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 53 [2019-10-13 21:34:35,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:34:35,751 INFO L225 Difference]: With dead ends: 104 [2019-10-13 21:34:35,752 INFO L226 Difference]: Without dead ends: 84 [2019-10-13 21:34:35,758 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4708 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=5498, Invalid=14524, Unknown=0, NotChecked=0, Total=20022 [2019-10-13 21:34:35,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-10-13 21:34:35,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2019-10-13 21:34:35,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-10-13 21:34:35,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 87 transitions. [2019-10-13 21:34:35,770 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 87 transitions. Word has length 53 [2019-10-13 21:34:35,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:34:35,770 INFO L462 AbstractCegarLoop]: Abstraction has 84 states and 87 transitions. [2019-10-13 21:34:35,770 INFO L463 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-10-13 21:34:35,770 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 87 transitions. [2019-10-13 21:34:35,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-10-13 21:34:35,772 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:34:35,772 INFO L380 BasicCegarLoop]: trace histogram [58, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:34:35,977 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:34:35,977 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:34:35,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:34:35,978 INFO L82 PathProgramCache]: Analyzing trace with hash -912001158, now seen corresponding path program 5 times [2019-10-13 21:34:35,978 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:34:35,979 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316119851] [2019-10-13 21:34:35,979 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:34:35,979 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:34:35,979 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:34:36,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:34:37,466 INFO L134 CoverageAnalysis]: Checked inductivity of 1721 backedges. 2 proven. 1711 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-13 21:34:37,467 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316119851] [2019-10-13 21:34:37,467 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1024906095] [2019-10-13 21:34:37,467 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 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:34:37,582 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-13 21:34:37,583 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:34:37,583 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 21 conjunts are in the unsatisfiable core [2019-10-13 21:34:37,590 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:34:37,953 INFO L134 CoverageAnalysis]: Checked inductivity of 1721 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 1711 trivial. 0 not checked. [2019-10-13 21:34:37,954 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:34:38,307 INFO L134 CoverageAnalysis]: Checked inductivity of 1721 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 1711 trivial. 0 not checked. [2019-10-13 21:34:38,308 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [457916533] [2019-10-13 21:34:38,309 INFO L162 IcfgInterpreter]: Started Sifa with 18 locations of interest [2019-10-13 21:34:38,310 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:34:38,310 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:34:38,310 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:34:38,311 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:34:38,338 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:34:38,459 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-13 21:34:38,473 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:34:38,476 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:34:38,477 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:34:38,477 INFO L193 IcfgInterpreter]: Reachable states at location L3-1 satisfy 190#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-13 21:34:38,477 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 195#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-13 21:34:38,477 INFO L193 IcfgInterpreter]: Reachable states at location L13-2 satisfy 91#(<= 100000 main_~j~0) [2019-10-13 21:34:38,477 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 199#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:34:38,478 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertEXIT satisfy 185#(and (or (and (= |__VERIFIER_assert_#in~cond| 1) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1)) [2019-10-13 21:34:38,478 INFO L193 IcfgInterpreter]: Reachable states at location L3-3 satisfy 180#(and (or (and (= |__VERIFIER_assert_#in~cond| 1) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1)) [2019-10-13 21:34:38,478 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 148#(and (<= 100000 main_~j~0) (<= 0 main_~x~0)) [2019-10-13 21:34:38,478 INFO L193 IcfgInterpreter]: Reachable states at location L3 satisfy 175#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-13 21:34:38,478 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:34:38,479 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:34:38,479 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 204#(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:34:38,479 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 68#true [2019-10-13 21:34:38,479 INFO L193 IcfgInterpreter]: Reachable states at location L18-1 satisfy 166#(and (= |main_#t~mem6| (select (select |#memory_int| |main_~#a~0.base|) (+ (* main_~x~0 4) |main_~#a~0.offset|))) (<= 0 main_~i~0) (<= 100000 main_~j~0) (not (= main_~e~0 |main_#t~mem6|)) (< main_~x~0 main_~i~0) (<= 0 main_~x~0)) [2019-10-13 21:34:38,479 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:34:38,480 INFO L193 IcfgInterpreter]: Reachable states at location L18 satisfy 153#(and (= |main_#t~mem6| (select (select |#memory_int| |main_~#a~0.base|) (+ (* main_~x~0 4) |main_~#a~0.offset|))) (<= 0 main_~i~0) (<= 100000 main_~j~0) (< main_~x~0 main_~i~0) (<= 0 main_~x~0)) [2019-10-13 21:34:38,480 INFO L193 IcfgInterpreter]: Reachable states at location L13-5 satisfy 96#(and (or (and (<= main_~i~0 100000) (<= 100000 main_~j~0)) (and (<= 100000 main_~i~0) (<= 100000 main_~j~0))) (or (and (not (< main_~j~0 100000)) (not (< main_~i~0 100000))) (and (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* main_~i~0 4) |main_~#a~0.offset|)) main_~e~0) (not (< main_~j~0 100000))))) [2019-10-13 21:34:38,480 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 170#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| 0))) [2019-10-13 21:34:38,480 INFO L193 IcfgInterpreter]: Reachable states at location L13-4 satisfy 83#(and (not (< main_~j~0 100000)) (<= 100000 main_~j~0)) [2019-10-13 21:34:39,347 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:34:39,348 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 11, 11, 14] total 91 [2019-10-13 21:34:39,348 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193621211] [2019-10-13 21:34:39,349 INFO L442 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-10-13 21:34:39,350 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:34:39,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-10-13 21:34:39,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1928, Invalid=6262, Unknown=0, NotChecked=0, Total=8190 [2019-10-13 21:34:39,352 INFO L87 Difference]: Start difference. First operand 84 states and 87 transitions. Second operand 91 states. [2019-10-13 21:34:45,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:34:45,746 INFO L93 Difference]: Finished difference Result 111 states and 119 transitions. [2019-10-13 21:34:45,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-10-13 21:34:45,747 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 83 [2019-10-13 21:34:45,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:34:45,749 INFO L225 Difference]: With dead ends: 111 [2019-10-13 21:34:45,749 INFO L226 Difference]: Without dead ends: 91 [2019-10-13 21:34:45,754 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 389 GetRequests, 221 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5645 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=5998, Invalid=22732, Unknown=0, NotChecked=0, Total=28730 [2019-10-13 21:34:45,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-10-13 21:34:45,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 88. [2019-10-13 21:34:45,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-10-13 21:34:45,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 92 transitions. [2019-10-13 21:34:45,765 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 92 transitions. Word has length 83 [2019-10-13 21:34:45,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:34:45,765 INFO L462 AbstractCegarLoop]: Abstraction has 88 states and 92 transitions. [2019-10-13 21:34:45,765 INFO L463 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-10-13 21:34:45,766 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 92 transitions. [2019-10-13 21:34:45,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-10-13 21:34:45,767 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:34:45,767 INFO L380 BasicCegarLoop]: trace histogram [59, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:34:45,970 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:34:45,971 INFO L410 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:34:45,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:34:45,972 INFO L82 PathProgramCache]: Analyzing trace with hash 1366373714, now seen corresponding path program 6 times [2019-10-13 21:34:45,972 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:34:45,972 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387136219] [2019-10-13 21:34:45,973 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:34:45,973 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:34:45,973 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:34:46,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:34:47,754 INFO L134 CoverageAnalysis]: Checked inductivity of 1791 backedges. 4 proven. 1770 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-10-13 21:34:47,755 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387136219] [2019-10-13 21:34:47,755 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [177352739] [2019-10-13 21:34:47,755 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 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:34:47,915 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-13 21:34:47,915 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:34:47,917 INFO L256 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-13 21:34:47,920 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:34:48,151 INFO L134 CoverageAnalysis]: Checked inductivity of 1791 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 1774 trivial. 0 not checked. [2019-10-13 21:34:48,151 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:34:48,478 INFO L134 CoverageAnalysis]: Checked inductivity of 1791 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 1774 trivial. 0 not checked. [2019-10-13 21:34:48,478 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1815244999] [2019-10-13 21:34:48,480 INFO L162 IcfgInterpreter]: Started Sifa with 18 locations of interest [2019-10-13 21:34:48,480 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:34:48,481 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:34:48,481 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:34:48,482 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:34:48,512 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:34:48,673 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-13 21:34:48,697 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:34:48,701 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:34:48,702 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:34:48,702 INFO L193 IcfgInterpreter]: Reachable states at location L3-1 satisfy 190#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-13 21:34:48,702 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 195#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-13 21:34:48,703 INFO L193 IcfgInterpreter]: Reachable states at location L13-2 satisfy 91#(<= 100000 main_~j~0) [2019-10-13 21:34:48,703 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 199#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:34:48,704 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertEXIT satisfy 185#(and (or (and (= |__VERIFIER_assert_#in~cond| 1) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1)) [2019-10-13 21:34:48,704 INFO L193 IcfgInterpreter]: Reachable states at location L3-3 satisfy 180#(and (or (and (= |__VERIFIER_assert_#in~cond| 1) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1)) [2019-10-13 21:34:48,704 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 148#(and (<= 100000 main_~j~0) (<= 0 main_~x~0)) [2019-10-13 21:34:48,704 INFO L193 IcfgInterpreter]: Reachable states at location L3 satisfy 175#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-13 21:34:48,705 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:34:48,705 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:34:48,706 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 204#(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:34:48,706 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 68#true [2019-10-13 21:34:48,706 INFO L193 IcfgInterpreter]: Reachable states at location L18-1 satisfy 166#(and (= |main_#t~mem6| (select (select |#memory_int| |main_~#a~0.base|) (+ (* main_~x~0 4) |main_~#a~0.offset|))) (<= 0 main_~i~0) (<= 100000 main_~j~0) (not (= main_~e~0 |main_#t~mem6|)) (< main_~x~0 main_~i~0) (<= 0 main_~x~0)) [2019-10-13 21:34:48,706 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:34:48,707 INFO L193 IcfgInterpreter]: Reachable states at location L18 satisfy 153#(and (= |main_#t~mem6| (select (select |#memory_int| |main_~#a~0.base|) (+ (* main_~x~0 4) |main_~#a~0.offset|))) (<= 0 main_~i~0) (<= 100000 main_~j~0) (< main_~x~0 main_~i~0) (<= 0 main_~x~0)) [2019-10-13 21:34:48,707 INFO L193 IcfgInterpreter]: Reachable states at location L13-5 satisfy 96#(and (or (and (<= main_~i~0 100000) (<= 100000 main_~j~0)) (and (<= 100000 main_~i~0) (<= 100000 main_~j~0))) (or (and (not (< main_~j~0 100000)) (not (< main_~i~0 100000))) (and (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* main_~i~0 4) |main_~#a~0.offset|)) main_~e~0) (not (< main_~j~0 100000))))) [2019-10-13 21:34:48,707 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 170#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| 1))) [2019-10-13 21:34:48,708 INFO L193 IcfgInterpreter]: Reachable states at location L13-4 satisfy 83#(and (not (< main_~j~0 100000)) (<= 100000 main_~j~0)) [2019-10-13 21:34:50,003 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:34:50,004 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 8, 8, 14] total 84 [2019-10-13 21:34:50,004 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528876313] [2019-10-13 21:34:50,007 INFO L442 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-10-13 21:34:50,008 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:34:50,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-10-13 21:34:50,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1968, Invalid=5004, Unknown=0, NotChecked=0, Total=6972 [2019-10-13 21:34:50,010 INFO L87 Difference]: Start difference. First operand 88 states and 92 transitions. Second operand 84 states.