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-industry-pattern/array_ptr_single_elem_init-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-07 00:35:32,657 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-07 00:35:32,659 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-07 00:35:32,678 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-07 00:35:32,678 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-07 00:35:32,680 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-07 00:35:32,682 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-07 00:35:32,683 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-07 00:35:32,685 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-07 00:35:32,687 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-07 00:35:32,688 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-07 00:35:32,689 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-07 00:35:32,690 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-07 00:35:32,691 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-07 00:35:32,692 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-07 00:35:32,696 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-07 00:35:32,697 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-07 00:35:32,698 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-07 00:35:32,700 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-07 00:35:32,702 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-07 00:35:32,703 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-07 00:35:32,705 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-07 00:35:32,706 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-07 00:35:32,706 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-07 00:35:32,709 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-07 00:35:32,709 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-07 00:35:32,709 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-07 00:35:32,710 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-07 00:35:32,711 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-07 00:35:32,712 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-07 00:35:32,712 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-07 00:35:32,713 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-07 00:35:32,713 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-07 00:35:32,714 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-07 00:35:32,715 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-07 00:35:32,715 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-07 00:35:32,716 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-07 00:35:32,716 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-07 00:35:32,717 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-07 00:35:32,717 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-07 00:35:32,718 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-07 00:35:32,719 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-07 00:35:32,734 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-07 00:35:32,734 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-07 00:35:32,735 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-07 00:35:32,735 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-07 00:35:32,736 INFO L138 SettingsManager]: * Use SBE=true [2019-10-07 00:35:32,736 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-07 00:35:32,736 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-07 00:35:32,736 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-07 00:35:32,736 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-07 00:35:32,737 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-07 00:35:32,737 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-07 00:35:32,737 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-07 00:35:32,737 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-07 00:35:32,737 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-07 00:35:32,738 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-07 00:35:32,738 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-07 00:35:32,738 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-07 00:35:32,738 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-07 00:35:32,738 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-07 00:35:32,739 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-07 00:35:32,739 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-07 00:35:32,739 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 00:35:32,739 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-07 00:35:32,739 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-07 00:35:32,740 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-07 00:35:32,740 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-07 00:35:32,740 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-07 00:35:32,740 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-07 00:35:32,740 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-07 00:35:33,031 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-07 00:35:33,050 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-07 00:35:33,055 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-07 00:35:33,057 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-07 00:35:33,057 INFO L275 PluginConnector]: CDTParser initialized [2019-10-07 00:35:33,058 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-industry-pattern/array_ptr_single_elem_init-2.i [2019-10-07 00:35:33,140 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/592a5ad12/41b6523842674a2aad2a9276b5c2378d/FLAG80f487fdd [2019-10-07 00:35:33,610 INFO L306 CDTParser]: Found 1 translation units. [2019-10-07 00:35:33,611 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-industry-pattern/array_ptr_single_elem_init-2.i [2019-10-07 00:35:33,617 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/592a5ad12/41b6523842674a2aad2a9276b5c2378d/FLAG80f487fdd [2019-10-07 00:35:33,963 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/592a5ad12/41b6523842674a2aad2a9276b5c2378d [2019-10-07 00:35:33,972 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-07 00:35:33,974 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-07 00:35:33,975 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-07 00:35:33,975 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-07 00:35:33,979 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-07 00:35:33,980 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 12:35:33" (1/1) ... [2019-10-07 00:35:33,983 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f5000c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:35:33, skipping insertion in model container [2019-10-07 00:35:33,984 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 12:35:33" (1/1) ... [2019-10-07 00:35:33,994 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-07 00:35:34,014 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-07 00:35:34,198 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 00:35:34,202 INFO L188 MainTranslator]: Completed pre-run [2019-10-07 00:35:34,225 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 00:35:34,245 INFO L192 MainTranslator]: Completed translation [2019-10-07 00:35:34,245 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:35:34 WrapperNode [2019-10-07 00:35:34,246 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-07 00:35:34,246 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-07 00:35:34,247 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-07 00:35:34,247 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-07 00:35:34,349 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:35:34" (1/1) ... [2019-10-07 00:35:34,349 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:35:34" (1/1) ... [2019-10-07 00:35:34,359 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:35:34" (1/1) ... [2019-10-07 00:35:34,361 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:35:34" (1/1) ... [2019-10-07 00:35:34,381 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:35:34" (1/1) ... [2019-10-07 00:35:34,389 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:35:34" (1/1) ... [2019-10-07 00:35:34,390 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:35:34" (1/1) ... [2019-10-07 00:35:34,393 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-07 00:35:34,393 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-07 00:35:34,393 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-07 00:35:34,394 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-07 00:35:34,395 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:35:34" (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-07 00:35:34,452 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-07 00:35:34,453 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-07 00:35:34,453 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-07 00:35:34,453 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-07 00:35:34,453 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-07 00:35:34,453 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-07 00:35:34,454 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-07 00:35:34,454 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-07 00:35:34,454 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-07 00:35:34,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-07 00:35:34,454 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-07 00:35:34,455 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-07 00:35:34,455 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-07 00:35:34,455 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-07 00:35:34,930 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-07 00:35:34,930 INFO L284 CfgBuilder]: Removed 2 assume(true) statements. [2019-10-07 00:35:34,931 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 12:35:34 BoogieIcfgContainer [2019-10-07 00:35:34,931 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-07 00:35:34,932 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-07 00:35:34,933 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-07 00:35:34,936 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-07 00:35:34,936 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.10 12:35:33" (1/3) ... [2019-10-07 00:35:34,937 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@374c1907 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 12:35:34, skipping insertion in model container [2019-10-07 00:35:34,937 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:35:34" (2/3) ... [2019-10-07 00:35:34,938 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@374c1907 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 12:35:34, skipping insertion in model container [2019-10-07 00:35:34,938 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 12:35:34" (3/3) ... [2019-10-07 00:35:34,940 INFO L109 eAbstractionObserver]: Analyzing ICFG array_ptr_single_elem_init-2.i [2019-10-07 00:35:34,948 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-07 00:35:34,956 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-07 00:35:34,971 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-07 00:35:35,002 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-07 00:35:35,003 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-07 00:35:35,003 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-07 00:35:35,003 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-07 00:35:35,003 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-07 00:35:35,003 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-07 00:35:35,003 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-07 00:35:35,003 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-07 00:35:35,020 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2019-10-07 00:35:35,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-07 00:35:35,026 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:35:35,027 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:35:35,029 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:35:35,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:35:35,035 INFO L82 PathProgramCache]: Analyzing trace with hash -1264123479, now seen corresponding path program 1 times [2019-10-07 00:35:35,041 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:35:35,042 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:35:35,042 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:35:35,042 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:35:35,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:35:35,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:35:35,224 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-07 00:35:35,225 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:35:35,226 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 00:35:35,226 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 00:35:35,230 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 00:35:35,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 00:35:35,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 00:35:35,247 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 3 states. [2019-10-07 00:35:35,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:35:35,305 INFO L93 Difference]: Finished difference Result 38 states and 47 transitions. [2019-10-07 00:35:35,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 00:35:35,308 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-10-07 00:35:35,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:35:35,318 INFO L225 Difference]: With dead ends: 38 [2019-10-07 00:35:35,318 INFO L226 Difference]: Without dead ends: 21 [2019-10-07 00:35:35,322 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 00:35:35,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-10-07 00:35:35,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2019-10-07 00:35:35,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-10-07 00:35:35,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2019-10-07 00:35:35,366 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 12 [2019-10-07 00:35:35,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:35:35,367 INFO L462 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2019-10-07 00:35:35,367 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 00:35:35,368 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2019-10-07 00:35:35,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-07 00:35:35,368 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:35:35,369 INFO L385 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:35:35,369 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:35:35,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:35:35,370 INFO L82 PathProgramCache]: Analyzing trace with hash -392956526, now seen corresponding path program 1 times [2019-10-07 00:35:35,370 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:35:35,370 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:35:35,371 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:35:35,371 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:35:35,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:35:35,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:35:35,490 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-07 00:35:35,491 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:35:35,493 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:35:35,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:35:35,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:35:35,564 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-07 00:35:35,573 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:35:35,608 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-07 00:35:35,611 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:35:35,649 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-07 00:35:35,650 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:35:35,676 INFO L162 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-10-07 00:35:35,677 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:35:35,684 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:35:35,693 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:35:35,693 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:35:35,918 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 00:35:36,031 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:35:36,050 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:35:36,143 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:35:36,305 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:35:36,326 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:35:36,378 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:35:36,399 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:35:36,419 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:35:36,438 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:35:36,454 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:35:36,580 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 144 [2019-10-07 00:35:36,628 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:35:36,647 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:35:36,687 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:35:36,701 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:35:36,718 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:35:36,733 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:35:36,887 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:35:37,033 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:35:37,245 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:35:37,275 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:35:37,329 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:35:37,339 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:35:37,365 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:35:37,420 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:35:37,910 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 28 for LOIs [2019-10-07 00:35:37,938 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 00:35:37,948 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:35:37,949 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:35:37,949 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 187#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_1| Int) (v_prenex_8 Int)) (or (and (= |#NULL.base| 0) (not (= 1 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) 60000))) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= 1 (select (select |#memory_int| v_prenex_8) 60000)) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:35:37,950 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 192#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_main_~#a~0.base_BEFORE_CALL_1| Int) (v_prenex_8 Int)) (or (and (= |#NULL.base| 0) (not (= 1 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) 60000))) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= 1 (select (select |#memory_int| v_prenex_8) 60000)) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:35:37,950 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 201#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 00:35:37,951 INFO L193 IcfgInterpreter]: Reachable states at location L34 satisfy 168#(and (or (and (= |#NULL.base| 0) (<= 0 main_~i~0) (= |main_~#b~0.offset| 0) (= |#NULL.offset| 0) (= |main_~#a~0.offset| 0)) (and (= |#NULL.base| 0) (< main_~i~0 100000) (= |main_~#b~0.offset| 0) (= |#NULL.offset| 0) (= |main_~#a~0.offset| 0))) (or (and (<= 0 main_~i~0) (<= |main_~#b~0.offset| 0) (<= |#NULL.base| 0) (<= 0 |main_~#b~0.offset|) (<= main_~i~0 100000) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (<= 1 main_~i~0) (<= |main_~#b~0.offset| 0) (<= |#NULL.base| 0) (<= 0 |main_~#b~0.offset|) (<= main_~i~0 100000) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) [2019-10-07 00:35:37,952 INFO L193 IcfgInterpreter]: Reachable states at location L36 satisfy 173#(and (= |#NULL.base| 0) (< main_~i~0 100000) (<= |main_~#b~0.offset| 0) (<= |#NULL.base| 0) (= main_~i~0 15000) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (<= 15000 main_~i~0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 1 main_~i~0) (<= 0 |main_~#b~0.offset|) (= |main_~#b~0.offset| 0) (<= main_~i~0 15000) (= |main_#t~mem5| (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset|))) (= |#NULL.offset| 0) (= |main_~#a~0.offset| 0)) [2019-10-07 00:35:37,952 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-07 00:35:37,952 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-07 00:35:37,953 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 206#(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-07 00:35:37,953 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:35:37,953 INFO L193 IcfgInterpreter]: Reachable states at location L10-3 satisfy 86#(and (or (and (= |#NULL.base| 0) (<= 0 main_~i~0) (<= |main_~#b~0.offset| 0) (= |main_~#b~0.offset| 0) (= |#NULL.offset| 0) (= |main_~#a~0.offset| 0)) (and (< |main_~#a~0.base| |#StackHeapBarrier|) (= (store (store |old(#length)| |main_~#a~0.base| 400000) |main_~#b~0.base| 400000) |#length|) (<= 0 main_~i~0) (= 0 |#NULL.base|) (<= |main_~#b~0.offset| 0) (= |#valid| (store (store |old(#valid)| |main_~#a~0.base| 1) |main_~#b~0.base| 1)) (not (= |main_~#b~0.base| 0)) (not (= 0 |main_~#a~0.base|)) (= 0 (select |old(#valid)| |main_~#a~0.base|)) (= |main_~#b~0.offset| 0) (= |main_~#a~0.offset| 0) (< |main_~#b~0.base| |#StackHeapBarrier|) (<= main_~i~0 0) (= 0 (select |old(#valid)| 0)) (= (select (store |old(#valid)| |main_~#a~0.base| 1) |main_~#b~0.base|) 0) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= main_~i~0 0))) (<= |#NULL.base| 0) (<= 0 |main_~#b~0.offset|) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 00:35:37,962 INFO L193 IcfgInterpreter]: Reachable states at location L32-3 satisfy 150#(or (and (= |#NULL.base| 0) (<= 0 main_~i~0) (<= |main_~#b~0.offset| 0) (<= |#NULL.base| 0) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 60000))) (<= main_~i~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |main_~#b~0.offset|) (= |main_~#b~0.offset| 0) (= |#NULL.offset| 0) (= main_~i~0 0) (= |main_~#a~0.offset| 0)) (and (= |#NULL.base| 0) (<= |main_~#b~0.offset| 0) (<= |#NULL.base| 0) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 1 main_~i~0) (<= 0 |main_~#b~0.offset|) (= |main_~#b~0.offset| 0) (= |#NULL.offset| 0) (= |main_~#a~0.offset| 0))) [2019-10-07 00:35:37,962 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 182#(exists ((|v_main_~#a~0.base_BEFORE_CALL_1| Int) (v_prenex_8 Int)) (or (and (= |#NULL.base| 0) (not (= 1 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) 60000))) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= 1 (select (select |#memory_int| v_prenex_8) 60000)) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) [2019-10-07 00:35:37,962 INFO L193 IcfgInterpreter]: Reachable states at location L32-2 satisfy 145#(and (= |#NULL.base| 0) (<= 0 main_~i~0) (<= |main_~#b~0.offset| 0) (<= |#NULL.base| 0) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |main_~#b~0.offset|) (= |main_~#b~0.offset| 0) (= |#NULL.offset| 0) (= |main_~#a~0.offset| 0)) [2019-10-07 00:35:37,963 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 197#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_main_~#a~0.base_BEFORE_CALL_1| Int) (v_prenex_8 Int)) (or (and (= |#NULL.base| 0) (not (= 1 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) 60000))) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= 1 (select (select |#memory_int| v_prenex_8) 60000)) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:35:38,371 WARN L191 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 24 [2019-10-07 00:35:38,600 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 00:35:38,601 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 11] total 17 [2019-10-07 00:35:38,604 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-07 00:35:38,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-07 00:35:38,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2019-10-07 00:35:38,607 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand 17 states. [2019-10-07 00:35:39,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:35:39,634 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2019-10-07 00:35:39,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-07 00:35:39,635 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2019-10-07 00:35:39,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:35:39,636 INFO L225 Difference]: With dead ends: 44 [2019-10-07 00:35:39,636 INFO L226 Difference]: Without dead ends: 31 [2019-10-07 00:35:39,639 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=162, Invalid=594, Unknown=0, NotChecked=0, Total=756 [2019-10-07 00:35:39,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-10-07 00:35:39,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 26. [2019-10-07 00:35:39,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-10-07 00:35:39,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2019-10-07 00:35:39,651 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 16 [2019-10-07 00:35:39,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:35:39,652 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2019-10-07 00:35:39,652 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-07 00:35:39,652 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2019-10-07 00:35:39,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-07 00:35:39,654 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:35:39,654 INFO L385 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:35:39,858 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:35:39,859 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:35:39,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:35:39,860 INFO L82 PathProgramCache]: Analyzing trace with hash -127994615, now seen corresponding path program 2 times [2019-10-07 00:35:39,860 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:35:39,860 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:35:39,861 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:35:39,861 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:35:39,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:35:39,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:35:40,014 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-07 00:35:40,014 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:35:40,015 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:35:40,015 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:35:40,080 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-07 00:35:40,081 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-07 00:35:40,082 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-07 00:35:40,084 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:35:40,112 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-07 00:35:40,112 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:35:40,174 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-07 00:35:40,174 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:35:40,176 INFO L162 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-10-07 00:35:40,176 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:35:40,177 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:35:40,177 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:35:40,177 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:35:40,214 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 00:35:40,291 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:35:40,342 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:35:40,351 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:35:40,440 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:35:40,461 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:35:40,485 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:35:40,503 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:35:40,523 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:35:40,542 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:35:40,579 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:35:40,674 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:35:40,690 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:35:40,725 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:35:40,759 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:35:40,772 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:35:40,782 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:35:40,894 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:35:41,002 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:35:41,157 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:35:41,166 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:35:41,208 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:35:41,216 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:35:41,223 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:35:41,266 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:35:41,615 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 28 for LOIs [2019-10-07 00:35:41,627 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 00:35:41,631 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:35:41,631 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:35:41,631 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 188#(and (exists ((v_prenex_16 Int) (|v_main_~#a~0.base_BEFORE_CALL_2| Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) 60000) 1)) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= (select (select |#memory_int| v_prenex_16) 60000) 1) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:35:41,632 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 193#(and (<= __VERIFIER_assert_~cond 0) (exists ((v_prenex_16 Int) (|v_main_~#a~0.base_BEFORE_CALL_2| Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) 60000) 1)) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= (select (select |#memory_int| v_prenex_16) 60000) 1) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 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-07 00:35:41,632 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 202#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 00:35:41,632 INFO L193 IcfgInterpreter]: Reachable states at location L34 satisfy 169#(and (or (and (= |#NULL.base| 0) (<= 0 main_~i~0) (= |main_~#b~0.offset| 0) (= |#NULL.offset| 0) (= |main_~#a~0.offset| 0)) (and (= |#NULL.base| 0) (< main_~i~0 100000) (= |main_~#b~0.offset| 0) (= |#NULL.offset| 0) (= |main_~#a~0.offset| 0))) (or (and (<= 0 main_~i~0) (<= |main_~#b~0.offset| 0) (<= |#NULL.base| 0) (<= 0 |main_~#b~0.offset|) (<= main_~i~0 100000) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (<= 1 main_~i~0) (<= |main_~#b~0.offset| 0) (<= |#NULL.base| 0) (<= 0 |main_~#b~0.offset|) (<= main_~i~0 100000) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) [2019-10-07 00:35:41,632 INFO L193 IcfgInterpreter]: Reachable states at location L36 satisfy 174#(and (= |#NULL.base| 0) (< main_~i~0 100000) (<= |main_~#b~0.offset| 0) (<= |#NULL.base| 0) (= main_~i~0 15000) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (<= 15000 main_~i~0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 1 main_~i~0) (<= 0 |main_~#b~0.offset|) (= |main_~#b~0.offset| 0) (<= main_~i~0 15000) (= |main_#t~mem5| (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset|))) (= |#NULL.offset| 0) (= |main_~#a~0.offset| 0)) [2019-10-07 00:35:41,632 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-07 00:35:41,633 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-07 00:35:41,633 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 207#(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-07 00:35:41,633 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:35:41,635 INFO L193 IcfgInterpreter]: Reachable states at location L10-3 satisfy 87#(and (or (and (= |#NULL.base| 0) (<= 0 main_~i~0) (<= |main_~#b~0.offset| 0) (= |main_~#b~0.offset| 0) (= |#NULL.offset| 0) (= |main_~#a~0.offset| 0)) (and (< |main_~#a~0.base| |#StackHeapBarrier|) (= (store (store |old(#length)| |main_~#a~0.base| 400000) |main_~#b~0.base| 400000) |#length|) (<= 0 main_~i~0) (= 0 |#NULL.base|) (<= |main_~#b~0.offset| 0) (= |#valid| (store (store |old(#valid)| |main_~#a~0.base| 1) |main_~#b~0.base| 1)) (not (= |main_~#b~0.base| 0)) (not (= 0 |main_~#a~0.base|)) (= 0 (select |old(#valid)| |main_~#a~0.base|)) (= |main_~#b~0.offset| 0) (= |main_~#a~0.offset| 0) (< |main_~#b~0.base| |#StackHeapBarrier|) (<= main_~i~0 0) (= 0 (select |old(#valid)| 0)) (= (select (store |old(#valid)| |main_~#a~0.base| 1) |main_~#b~0.base|) 0) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= main_~i~0 0))) (<= |#NULL.base| 0) (<= 0 |main_~#b~0.offset|) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 00:35:41,635 INFO L193 IcfgInterpreter]: Reachable states at location L32-3 satisfy 151#(or (and (= |#NULL.base| 0) (<= 0 main_~i~0) (<= |main_~#b~0.offset| 0) (<= |#NULL.base| 0) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 60000))) (<= main_~i~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |main_~#b~0.offset|) (= |main_~#b~0.offset| 0) (= |#NULL.offset| 0) (= main_~i~0 0) (= |main_~#a~0.offset| 0)) (and (= |#NULL.base| 0) (<= |main_~#b~0.offset| 0) (<= |#NULL.base| 0) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 1 main_~i~0) (<= 0 |main_~#b~0.offset|) (= |main_~#b~0.offset| 0) (= |#NULL.offset| 0) (= |main_~#a~0.offset| 0))) [2019-10-07 00:35:41,635 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 183#(exists ((v_prenex_16 Int) (|v_main_~#a~0.base_BEFORE_CALL_2| Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) 60000) 1)) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= (select (select |#memory_int| v_prenex_16) 60000) 1) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) [2019-10-07 00:35:41,636 INFO L193 IcfgInterpreter]: Reachable states at location L32-2 satisfy 146#(and (= |#NULL.base| 0) (<= 0 main_~i~0) (<= |main_~#b~0.offset| 0) (<= |#NULL.base| 0) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |main_~#b~0.offset|) (= |main_~#b~0.offset| 0) (= |#NULL.offset| 0) (= |main_~#a~0.offset| 0)) [2019-10-07 00:35:41,636 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 198#(and (<= __VERIFIER_assert_~cond 0) (exists ((v_prenex_16 Int) (|v_main_~#a~0.base_BEFORE_CALL_2| Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) 60000) 1)) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= (select (select |#memory_int| v_prenex_16) 60000) 1) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 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-07 00:35:42,230 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 00:35:42,231 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7, 11] total 24 [2019-10-07 00:35:42,232 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-10-07 00:35:42,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-07 00:35:42,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=436, Unknown=0, NotChecked=0, Total=552 [2019-10-07 00:35:42,232 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 24 states. [2019-10-07 00:35:43,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:35:43,943 INFO L93 Difference]: Finished difference Result 71 states and 87 transitions. [2019-10-07 00:35:43,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-07 00:35:43,944 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 22 [2019-10-07 00:35:43,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:35:43,947 INFO L225 Difference]: With dead ends: 71 [2019-10-07 00:35:43,947 INFO L226 Difference]: Without dead ends: 55 [2019-10-07 00:35:43,948 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 56 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 447 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=364, Invalid=1276, Unknown=0, NotChecked=0, Total=1640 [2019-10-07 00:35:43,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-10-07 00:35:43,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 41. [2019-10-07 00:35:43,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-10-07 00:35:43,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 43 transitions. [2019-10-07 00:35:43,962 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 43 transitions. Word has length 22 [2019-10-07 00:35:43,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:35:43,962 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 43 transitions. [2019-10-07 00:35:43,962 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-10-07 00:35:43,963 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2019-10-07 00:35:43,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-10-07 00:35:43,965 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:35:43,965 INFO L385 BasicCegarLoop]: trace histogram [10, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:35:44,170 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:35:44,171 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:35:44,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:35:44,172 INFO L82 PathProgramCache]: Analyzing trace with hash 701320466, now seen corresponding path program 3 times [2019-10-07 00:35:44,172 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:35:44,172 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:35:44,172 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:35:44,173 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:35:44,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:35:44,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:35:44,373 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-10-07 00:35:44,374 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:35:44,374 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:35:44,374 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:35:44,448 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-07 00:35:44,448 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-07 00:35:44,449 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-07 00:35:44,451 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:35:44,464 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-10-07 00:35:44,464 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:35:44,537 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-10-07 00:35:44,537 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:35:44,540 INFO L162 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-10-07 00:35:44,541 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:35:44,541 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:35:44,541 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:35:44,541 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:35:44,577 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 00:35:44,622 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:35:44,634 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:35:44,643 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:35:44,651 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:35:44,695 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:35:44,703 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:35:44,792 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:35:44,804 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:35:44,819 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:35:44,832 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:35:44,873 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:35:44,911 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:35:44,993 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:35:45,029 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:35:45,041 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:35:45,055 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:35:45,068 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:35:45,084 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:35:45,099 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:35:45,142 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:35:45,262 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:35:45,373 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:35:45,400 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:35:45,409 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:35:45,431 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:35:45,468 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:35:45,624 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:35:45,846 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 28 for LOIs [2019-10-07 00:35:45,857 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 00:35:45,861 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:35:45,862 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:35:45,862 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 192#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_3| Int) (v_prenex_24 Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (not (= 1 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) 60000))) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (= 1 (select (select |#memory_int| v_prenex_24) 60000)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:35:45,862 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 197#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_3| Int) (v_prenex_24 Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (not (= 1 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) 60000))) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (= 1 (select (select |#memory_int| v_prenex_24) 60000)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (<= __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-07 00:35:45,862 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 206#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 00:35:45,863 INFO L193 IcfgInterpreter]: Reachable states at location L34 satisfy 173#(and (or (and (= |#NULL.base| 0) (<= 0 main_~i~0) (= |main_~#b~0.offset| 0) (= |#NULL.offset| 0) (= |main_~#a~0.offset| 0)) (and (= |#NULL.base| 0) (< main_~i~0 100000) (= |main_~#b~0.offset| 0) (= |#NULL.offset| 0) (= |main_~#a~0.offset| 0))) (or (and (<= 0 main_~i~0) (<= |main_~#b~0.offset| 0) (<= |#NULL.base| 0) (<= 0 |main_~#b~0.offset|) (<= main_~i~0 100000) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (<= 1 main_~i~0) (<= |main_~#b~0.offset| 0) (<= |#NULL.base| 0) (<= 0 |main_~#b~0.offset|) (<= main_~i~0 100000) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) [2019-10-07 00:35:45,863 INFO L193 IcfgInterpreter]: Reachable states at location L36 satisfy 178#(and (= |#NULL.base| 0) (< main_~i~0 100000) (<= |main_~#b~0.offset| 0) (<= |#NULL.base| 0) (= main_~i~0 15000) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (<= 15000 main_~i~0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 1 main_~i~0) (<= 0 |main_~#b~0.offset|) (= |main_~#b~0.offset| 0) (<= main_~i~0 15000) (= |main_#t~mem5| (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset|))) (= |#NULL.offset| 0) (= |main_~#a~0.offset| 0)) [2019-10-07 00:35:45,863 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-07 00:35:45,863 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-07 00:35:45,863 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 211#(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-07 00:35:45,864 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:35:45,864 INFO L193 IcfgInterpreter]: Reachable states at location L10-3 satisfy 91#(and (or (and (= |#NULL.base| 0) (<= 0 main_~i~0) (<= |main_~#b~0.offset| 0) (= |main_~#b~0.offset| 0) (= |#NULL.offset| 0) (= |main_~#a~0.offset| 0)) (and (< |main_~#a~0.base| |#StackHeapBarrier|) (= (store (store |old(#length)| |main_~#a~0.base| 400000) |main_~#b~0.base| 400000) |#length|) (<= 0 main_~i~0) (= 0 |#NULL.base|) (<= |main_~#b~0.offset| 0) (= |#valid| (store (store |old(#valid)| |main_~#a~0.base| 1) |main_~#b~0.base| 1)) (not (= |main_~#b~0.base| 0)) (not (= 0 |main_~#a~0.base|)) (= 0 (select |old(#valid)| |main_~#a~0.base|)) (= |main_~#b~0.offset| 0) (= |main_~#a~0.offset| 0) (< |main_~#b~0.base| |#StackHeapBarrier|) (<= main_~i~0 0) (= 0 (select |old(#valid)| 0)) (= (select (store |old(#valid)| |main_~#a~0.base| 1) |main_~#b~0.base|) 0) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= main_~i~0 0))) (<= |#NULL.base| 0) (<= 0 |main_~#b~0.offset|) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 00:35:45,864 INFO L193 IcfgInterpreter]: Reachable states at location L32-3 satisfy 155#(or (and (= |#NULL.base| 0) (<= 0 main_~i~0) (<= |main_~#b~0.offset| 0) (<= |#NULL.base| 0) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 60000))) (<= main_~i~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |main_~#b~0.offset|) (= |main_~#b~0.offset| 0) (= |#NULL.offset| 0) (= main_~i~0 0) (= |main_~#a~0.offset| 0)) (and (= |#NULL.base| 0) (<= |main_~#b~0.offset| 0) (<= |#NULL.base| 0) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 1 main_~i~0) (<= 0 |main_~#b~0.offset|) (= |main_~#b~0.offset| 0) (= |#NULL.offset| 0) (= |main_~#a~0.offset| 0))) [2019-10-07 00:35:45,864 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 187#(exists ((|v_main_~#a~0.base_BEFORE_CALL_3| Int) (v_prenex_24 Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (not (= 1 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) 60000))) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (= 1 (select (select |#memory_int| v_prenex_24) 60000)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) [2019-10-07 00:35:45,866 INFO L193 IcfgInterpreter]: Reachable states at location L32-2 satisfy 150#(and (= |#NULL.base| 0) (<= 0 main_~i~0) (<= |main_~#b~0.offset| 0) (<= |#NULL.base| 0) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |main_~#b~0.offset|) (= |main_~#b~0.offset| 0) (= |#NULL.offset| 0) (= |main_~#a~0.offset| 0)) [2019-10-07 00:35:45,866 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 202#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_3| Int) (v_prenex_24 Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (not (= 1 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) 60000))) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (= 1 (select (select |#memory_int| v_prenex_24) 60000)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (<= __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-07 00:35:46,495 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 00:35:46,496 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 11] total 26 [2019-10-07 00:35:46,497 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-07 00:35:46,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-07 00:35:46,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=512, Unknown=0, NotChecked=0, Total=650 [2019-10-07 00:35:46,498 INFO L87 Difference]: Start difference. First operand 41 states and 43 transitions. Second operand 26 states. [2019-10-07 00:35:48,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:35:48,532 INFO L93 Difference]: Finished difference Result 91 states and 103 transitions. [2019-10-07 00:35:48,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-10-07 00:35:48,533 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 37 [2019-10-07 00:35:48,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:35:48,535 INFO L225 Difference]: With dead ends: 91 [2019-10-07 00:35:48,535 INFO L226 Difference]: Without dead ends: 66 [2019-10-07 00:35:48,537 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 101 SyntacticMatches, 5 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 640 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=455, Invalid=1615, Unknown=0, NotChecked=0, Total=2070 [2019-10-07 00:35:48,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-10-07 00:35:48,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2019-10-07 00:35:48,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-10-07 00:35:48,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 66 transitions. [2019-10-07 00:35:48,550 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 66 transitions. Word has length 37 [2019-10-07 00:35:48,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:35:48,551 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 66 transitions. [2019-10-07 00:35:48,551 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-07 00:35:48,551 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 66 transitions. [2019-10-07 00:35:48,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-07 00:35:48,553 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:35:48,553 INFO L385 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:35:48,759 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:35:48,760 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:35:48,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:35:48,760 INFO L82 PathProgramCache]: Analyzing trace with hash 1575063017, now seen corresponding path program 4 times [2019-10-07 00:35:48,761 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:35:48,761 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:35:48,761 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:35:48,761 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:35:48,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:35:48,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:35:48,975 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-10-07 00:35:48,975 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:35:48,975 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:35:48,976 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:35:49,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:35:49,123 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-07 00:35:49,140 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:35:49,173 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2019-10-07 00:35:49,173 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:35:49,532 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2019-10-07 00:35:49,532 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:35:49,535 INFO L162 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-10-07 00:35:49,536 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:35:49,536 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:35:49,536 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:35:49,536 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:35:49,566 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 00:35:49,603 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:35:49,613 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:35:49,625 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:35:49,634 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:35:49,678 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:35:49,687 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:35:49,791 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:35:49,822 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:35:49,834 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:35:49,843 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:35:49,875 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:35:49,890 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:35:49,949 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:35:49,959 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:35:49,968 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:35:49,981 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:35:50,026 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:35:50,038 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:35:50,051 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:35:50,088 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:35:50,178 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:35:50,289 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:35:50,298 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:35:50,347 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:35:50,356 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:35:50,378 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:35:50,401 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:35:50,718 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 28 for LOIs [2019-10-07 00:35:50,724 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 00:35:50,727 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:35:50,728 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:35:50,728 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 189#(and (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (exists ((|v_main_~#a~0.base_BEFORE_CALL_4| Int) (v_prenex_32 Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (= (select (select |#memory_int| v_prenex_32) 60000) 1) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) 60000) 1)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0))))) [2019-10-07 00:35:50,728 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 194#(and (<= __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) (exists ((|v_main_~#a~0.base_BEFORE_CALL_4| Int) (v_prenex_32 Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (= (select (select |#memory_int| v_prenex_32) 60000) 1) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) 60000) 1)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0))))) [2019-10-07 00:35:50,728 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 203#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 00:35:50,729 INFO L193 IcfgInterpreter]: Reachable states at location L34 satisfy 170#(and (or (and (= |#NULL.base| 0) (<= 0 main_~i~0) (= |main_~#b~0.offset| 0) (= |#NULL.offset| 0) (= |main_~#a~0.offset| 0)) (and (= |#NULL.base| 0) (< main_~i~0 100000) (= |main_~#b~0.offset| 0) (= |#NULL.offset| 0) (= |main_~#a~0.offset| 0))) (or (and (<= 0 main_~i~0) (<= |main_~#b~0.offset| 0) (<= |#NULL.base| 0) (<= 0 |main_~#b~0.offset|) (<= main_~i~0 100000) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (<= 1 main_~i~0) (<= |main_~#b~0.offset| 0) (<= |#NULL.base| 0) (<= 0 |main_~#b~0.offset|) (<= main_~i~0 100000) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) [2019-10-07 00:35:50,729 INFO L193 IcfgInterpreter]: Reachable states at location L36 satisfy 175#(and (= |#NULL.base| 0) (< main_~i~0 100000) (<= |main_~#b~0.offset| 0) (<= |#NULL.base| 0) (= main_~i~0 15000) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (<= 15000 main_~i~0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 1 main_~i~0) (<= 0 |main_~#b~0.offset|) (= |main_~#b~0.offset| 0) (<= main_~i~0 15000) (= |main_#t~mem5| (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset|))) (= |#NULL.offset| 0) (= |main_~#a~0.offset| 0)) [2019-10-07 00:35:50,729 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-07 00:35:50,729 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-07 00:35:50,729 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 208#(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-07 00:35:50,730 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:35:50,730 INFO L193 IcfgInterpreter]: Reachable states at location L10-3 satisfy 88#(and (or (and (= |#NULL.base| 0) (<= 0 main_~i~0) (<= |main_~#b~0.offset| 0) (= |main_~#b~0.offset| 0) (= |#NULL.offset| 0) (= |main_~#a~0.offset| 0)) (and (< |main_~#a~0.base| |#StackHeapBarrier|) (= (store (store |old(#length)| |main_~#a~0.base| 400000) |main_~#b~0.base| 400000) |#length|) (<= 0 main_~i~0) (= 0 |#NULL.base|) (<= |main_~#b~0.offset| 0) (= |#valid| (store (store |old(#valid)| |main_~#a~0.base| 1) |main_~#b~0.base| 1)) (not (= |main_~#b~0.base| 0)) (not (= 0 |main_~#a~0.base|)) (= 0 (select |old(#valid)| |main_~#a~0.base|)) (= |main_~#b~0.offset| 0) (= |main_~#a~0.offset| 0) (< |main_~#b~0.base| |#StackHeapBarrier|) (<= main_~i~0 0) (= 0 (select |old(#valid)| 0)) (= (select (store |old(#valid)| |main_~#a~0.base| 1) |main_~#b~0.base|) 0) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= main_~i~0 0))) (<= |#NULL.base| 0) (<= 0 |main_~#b~0.offset|) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 00:35:50,730 INFO L193 IcfgInterpreter]: Reachable states at location L32-3 satisfy 152#(or (and (= |#NULL.base| 0) (<= 0 main_~i~0) (<= |main_~#b~0.offset| 0) (<= |#NULL.base| 0) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 60000))) (<= main_~i~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |main_~#b~0.offset|) (= |main_~#b~0.offset| 0) (= |#NULL.offset| 0) (= main_~i~0 0) (= |main_~#a~0.offset| 0)) (and (= |#NULL.base| 0) (<= |main_~#b~0.offset| 0) (<= |#NULL.base| 0) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 1 main_~i~0) (<= 0 |main_~#b~0.offset|) (= |main_~#b~0.offset| 0) (= |#NULL.offset| 0) (= |main_~#a~0.offset| 0))) [2019-10-07 00:35:50,730 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 184#(exists ((|v_main_~#a~0.base_BEFORE_CALL_4| Int) (v_prenex_32 Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (= (select (select |#memory_int| v_prenex_32) 60000) 1) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) 60000) 1)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) [2019-10-07 00:35:50,730 INFO L193 IcfgInterpreter]: Reachable states at location L32-2 satisfy 147#(and (= |#NULL.base| 0) (<= 0 main_~i~0) (<= |main_~#b~0.offset| 0) (<= |#NULL.base| 0) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |main_~#b~0.offset|) (= |main_~#b~0.offset| 0) (= |#NULL.offset| 0) (= |main_~#a~0.offset| 0)) [2019-10-07 00:35:50,731 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 199#(and (<= __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) (exists ((|v_main_~#a~0.base_BEFORE_CALL_4| Int) (v_prenex_32 Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (= (select (select |#memory_int| v_prenex_32) 60000) 1) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) 60000) 1)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0))))) [2019-10-07 00:35:51,519 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 00:35:51,519 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15, 11] total 40 [2019-10-07 00:35:51,521 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-10-07 00:35:51,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-10-07 00:35:51,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=452, Invalid=1108, Unknown=0, NotChecked=0, Total=1560 [2019-10-07 00:35:51,523 INFO L87 Difference]: Start difference. First operand 64 states and 66 transitions. Second operand 40 states. [2019-10-07 00:35:55,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:35:55,478 INFO L93 Difference]: Finished difference Result 165 states and 195 transitions. [2019-10-07 00:35:55,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-10-07 00:35:55,479 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 60 [2019-10-07 00:35:55,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:35:55,481 INFO L225 Difference]: With dead ends: 165 [2019-10-07 00:35:55,481 INFO L226 Difference]: Without dead ends: 119 [2019-10-07 00:35:55,484 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 170 SyntacticMatches, 12 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1761 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=1420, Invalid=3836, Unknown=0, NotChecked=0, Total=5256 [2019-10-07 00:35:55,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-10-07 00:35:55,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 81. [2019-10-07 00:35:55,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-10-07 00:35:55,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 83 transitions. [2019-10-07 00:35:55,509 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 83 transitions. Word has length 60 [2019-10-07 00:35:55,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:35:55,509 INFO L462 AbstractCegarLoop]: Abstraction has 81 states and 83 transitions. [2019-10-07 00:35:55,509 INFO L463 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-10-07 00:35:55,509 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 83 transitions. [2019-10-07 00:35:55,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-10-07 00:35:55,512 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:35:55,512 INFO L385 BasicCegarLoop]: trace histogram [26, 14, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:35:55,720 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:35:55,721 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:35:55,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:35:55,721 INFO L82 PathProgramCache]: Analyzing trace with hash 1748959122, now seen corresponding path program 5 times [2019-10-07 00:35:55,721 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:35:55,721 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:35:55,721 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:35:55,721 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:35:55,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:35:55,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:35:55,996 INFO L134 CoverageAnalysis]: Checked inductivity of 611 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2019-10-07 00:35:55,996 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:35:55,996 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:35:55,997 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true