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/loop-crafted/simple_array_index_value_2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-07 13:32:58,235 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-07 13:32:58,238 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-07 13:32:58,257 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-07 13:32:58,257 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-07 13:32:58,259 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-07 13:32:58,261 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-07 13:32:58,275 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-07 13:32:58,277 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-07 13:32:58,279 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-07 13:32:58,281 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-07 13:32:58,282 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-07 13:32:58,282 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-07 13:32:58,285 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-07 13:32:58,288 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-07 13:32:58,290 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-07 13:32:58,291 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-07 13:32:58,294 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-07 13:32:58,296 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-07 13:32:58,301 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-07 13:32:58,305 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-07 13:32:58,306 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-07 13:32:58,308 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-07 13:32:58,309 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-07 13:32:58,312 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-07 13:32:58,312 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-07 13:32:58,312 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-07 13:32:58,314 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-07 13:32:58,315 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-07 13:32:58,317 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-07 13:32:58,317 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-07 13:32:58,318 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-07 13:32:58,319 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-07 13:32:58,319 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-07 13:32:58,321 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-07 13:32:58,321 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-07 13:32:58,322 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-07 13:32:58,322 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-07 13:32:58,322 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-07 13:32:58,323 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-07 13:32:58,327 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-07 13:32:58,328 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 13:32:58,345 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-07 13:32:58,346 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-07 13:32:58,347 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-07 13:32:58,347 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-07 13:32:58,347 INFO L138 SettingsManager]: * Use SBE=true [2019-10-07 13:32:58,347 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-07 13:32:58,348 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-07 13:32:58,348 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-07 13:32:58,348 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-07 13:32:58,348 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-07 13:32:58,349 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-07 13:32:58,350 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-07 13:32:58,350 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-07 13:32:58,350 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-07 13:32:58,350 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-07 13:32:58,351 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-07 13:32:58,351 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-07 13:32:58,351 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-07 13:32:58,351 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-07 13:32:58,351 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-07 13:32:58,352 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-07 13:32:58,352 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 13:32:58,352 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-07 13:32:58,352 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-07 13:32:58,352 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-07 13:32:58,352 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-07 13:32:58,353 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-07 13:32:58,353 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-07 13:32:58,353 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 13:32:58,635 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-07 13:32:58,648 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-07 13:32:58,652 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-07 13:32:58,653 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-07 13:32:58,653 INFO L275 PluginConnector]: CDTParser initialized [2019-10-07 13:32:58,654 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-crafted/simple_array_index_value_2.i [2019-10-07 13:32:58,718 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/187b1581c/4fcb1452530b475cbd1d85c0156d0f93/FLAG8a96495fa [2019-10-07 13:32:59,196 INFO L306 CDTParser]: Found 1 translation units. [2019-10-07 13:32:59,198 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-crafted/simple_array_index_value_2.i [2019-10-07 13:32:59,204 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/187b1581c/4fcb1452530b475cbd1d85c0156d0f93/FLAG8a96495fa [2019-10-07 13:32:59,583 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/187b1581c/4fcb1452530b475cbd1d85c0156d0f93 [2019-10-07 13:32:59,593 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-07 13:32:59,595 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-07 13:32:59,596 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-07 13:32:59,596 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-07 13:32:59,599 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-07 13:32:59,600 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 01:32:59" (1/1) ... [2019-10-07 13:32:59,603 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53ed2c1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:32:59, skipping insertion in model container [2019-10-07 13:32:59,604 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 01:32:59" (1/1) ... [2019-10-07 13:32:59,611 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-07 13:32:59,628 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-07 13:32:59,798 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 13:32:59,802 INFO L188 MainTranslator]: Completed pre-run [2019-10-07 13:32:59,821 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 13:32:59,840 INFO L192 MainTranslator]: Completed translation [2019-10-07 13:32:59,840 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:32:59 WrapperNode [2019-10-07 13:32:59,840 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-07 13:32:59,841 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-07 13:32:59,841 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-07 13:32:59,841 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-07 13:32:59,937 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:32:59" (1/1) ... [2019-10-07 13:32:59,938 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:32:59" (1/1) ... [2019-10-07 13:32:59,946 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:32:59" (1/1) ... [2019-10-07 13:32:59,946 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:32:59" (1/1) ... [2019-10-07 13:32:59,952 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:32:59" (1/1) ... [2019-10-07 13:32:59,957 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:32:59" (1/1) ... [2019-10-07 13:32:59,959 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:32:59" (1/1) ... [2019-10-07 13:32:59,961 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-07 13:32:59,961 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-07 13:32:59,961 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-07 13:32:59,961 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-07 13:32:59,962 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:32:59" (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 13:33:00,016 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-07 13:33:00,017 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-07 13:33:00,017 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-07 13:33:00,017 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-07 13:33:00,017 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-07 13:33:00,017 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-07 13:33:00,018 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-07 13:33:00,018 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2019-10-07 13:33:00,018 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-07 13:33:00,018 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-07 13:33:00,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-07 13:33:00,018 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-07 13:33:00,019 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-07 13:33:00,019 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-07 13:33:00,019 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-07 13:33:00,312 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-07 13:33:00,313 INFO L284 CfgBuilder]: Removed 2 assume(true) statements. [2019-10-07 13:33:00,314 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 01:33:00 BoogieIcfgContainer [2019-10-07 13:33:00,315 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-07 13:33:00,316 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-07 13:33:00,316 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-07 13:33:00,323 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-07 13:33:00,326 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.10 01:32:59" (1/3) ... [2019-10-07 13:33:00,327 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78c02436 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 01:33:00, skipping insertion in model container [2019-10-07 13:33:00,327 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:32:59" (2/3) ... [2019-10-07 13:33:00,328 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78c02436 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 01:33:00, skipping insertion in model container [2019-10-07 13:33:00,330 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 01:33:00" (3/3) ... [2019-10-07 13:33:00,332 INFO L109 eAbstractionObserver]: Analyzing ICFG simple_array_index_value_2.i [2019-10-07 13:33:00,353 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-07 13:33:00,369 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-07 13:33:00,381 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-07 13:33:00,408 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-07 13:33:00,408 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-07 13:33:00,408 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-07 13:33:00,408 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-07 13:33:00,408 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-07 13:33:00,409 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-07 13:33:00,409 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-07 13:33:00,409 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-07 13:33:00,426 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2019-10-07 13:33:00,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-10-07 13:33:00,432 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:33:00,433 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:33:00,435 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:33:00,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:33:00,440 INFO L82 PathProgramCache]: Analyzing trace with hash 2145607436, now seen corresponding path program 1 times [2019-10-07 13:33:00,449 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:33:00,449 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:33:00,449 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:33:00,450 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:33:00,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:33:00,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:33:00,620 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 13:33:00,621 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:33:00,621 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:33:00,622 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 13:33:00,626 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 13:33:00,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 13:33:00,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 13:33:00,644 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 3 states. [2019-10-07 13:33:00,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:33:00,736 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2019-10-07 13:33:00,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 13:33:00,738 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-10-07 13:33:00,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:33:00,750 INFO L225 Difference]: With dead ends: 34 [2019-10-07 13:33:00,751 INFO L226 Difference]: Without dead ends: 19 [2019-10-07 13:33:00,757 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 13:33:00,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-10-07 13:33:00,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 16. [2019-10-07 13:33:00,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-10-07 13:33:00,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2019-10-07 13:33:00,796 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 11 [2019-10-07 13:33:00,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:33:00,797 INFO L462 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2019-10-07 13:33:00,797 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 13:33:00,797 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2019-10-07 13:33:00,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-07 13:33:00,798 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:33:00,798 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:33:00,799 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:33:00,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:33:00,800 INFO L82 PathProgramCache]: Analyzing trace with hash 1122509676, now seen corresponding path program 1 times [2019-10-07 13:33:00,801 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:33:00,801 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:33:00,802 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:33:00,802 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:33:00,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:33:00,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:33:00,949 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:33:00,950 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:33:00,950 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 13:33:00,951 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 13:33:01,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:33:01,003 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-07 13:33:01,010 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 13:33:01,074 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-07 13:33:01,074 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-07 13:33:01,087 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 13:33:01,088 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-07 13:33:01,088 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:9 [2019-10-07 13:33:01,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:33:01,142 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:33:01,143 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-07 13:33:01,159 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 13:33:01,160 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 36 [2019-10-07 13:33:01,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:33:01,164 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-07 13:33:01,182 INFO L567 ElimStorePlain]: treesize reduction 21, result has 30.0 percent of original size [2019-10-07 13:33:01,182 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-07 13:33:01,183 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:75, output treesize:9 [2019-10-07 13:33:01,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:33:01,219 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:33:01,220 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 13:33:01,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:33:01,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:33:01,351 WARN L225 Elim1Store]: Array PQE input equivalent to true [2019-10-07 13:33:01,352 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-07 13:33:01,374 INFO L567 ElimStorePlain]: treesize reduction 6, result has 84.6 percent of original size [2019-10-07 13:33:01,383 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2019-10-07 13:33:01,397 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2019-10-07 13:33:01,400 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2019-10-07 13:33:01,407 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 13:33:01,408 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-10-07 13:33:01,429 INFO L567 ElimStorePlain]: treesize reduction 6, result has 80.0 percent of original size [2019-10-07 13:33:01,431 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-07 13:33:01,431 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 8 variables, input treesize:79, output treesize:24 [2019-10-07 13:33:02,350 WARN L191 SmtUtils]: Spent 889.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-10-07 13:33:02,359 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:33:02,360 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 13:33:02,402 INFO L162 IcfgInterpreter]: Started Sifa with 12 locations of interest [2019-10-07 13:33:02,402 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 13:33:02,408 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 13:33:02,416 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 13:33:02,416 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 13:33:02,551 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 13:33:02,774 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:33:02,808 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 24 for LOIs [2019-10-07 13:33:02,830 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 13:33:02,843 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 13:33:02,843 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 13:33:02,844 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 13:33:02,844 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 13:33:02,845 INFO L193 IcfgInterpreter]: Reachable states at location L30-3 satisfy 73#(and (= 0 main_~index~0) (<= 0 main_~index~0) (<= main_~index~0 0)) [2019-10-07 13:33:02,854 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 107#(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 13:33:02,855 INFO L193 IcfgInterpreter]: Reachable states at location L12 satisfy 93#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_6 Int) (|v_main_~#array~0.base_BEFORE_CALL_1| Int) (v_prenex_7 Int) (|v_main_~#array~0.offset_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (< 0 (mod (select (select |#memory_int| v_prenex_6) v_prenex_7) 4294967296)))) (and (= |__VERIFIER_assert_#in~cond| 1) (< 0 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_1|) |v_main_~#array~0.offset_BEFORE_CALL_1|) 4294967296))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 13:33:02,855 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 13:33:02,855 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 102#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 13:33:02,856 INFO L193 IcfgInterpreter]: Reachable states at location L11 satisfy 88#(and (exists ((v_prenex_6 Int) (|v_main_~#array~0.base_BEFORE_CALL_1| Int) (v_prenex_7 Int) (|v_main_~#array~0.offset_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (< 0 (mod (select (select |#memory_int| v_prenex_6) v_prenex_7) 4294967296)))) (and (= |__VERIFIER_assert_#in~cond| 1) (< 0 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_1|) |v_main_~#array~0.offset_BEFORE_CALL_1|) 4294967296))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 13:33:02,856 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 98#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_6 Int) (|v_main_~#array~0.base_BEFORE_CALL_1| Int) (v_prenex_7 Int) (|v_main_~#array~0.offset_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (< 0 (mod (select (select |#memory_int| v_prenex_6) v_prenex_7) 4294967296)))) (and (= |__VERIFIER_assert_#in~cond| 1) (< 0 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_1|) |v_main_~#array~0.offset_BEFORE_CALL_1|) 4294967296))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 13:33:02,857 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 83#(exists ((v_prenex_6 Int) (|v_main_~#array~0.base_BEFORE_CALL_1| Int) (v_prenex_7 Int) (|v_main_~#array~0.offset_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (< 0 (mod (select (select |#memory_int| v_prenex_6) v_prenex_7) 4294967296)))) (and (= |__VERIFIER_assert_#in~cond| 1) (< 0 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_1|) |v_main_~#array~0.offset_BEFORE_CALL_1|) 4294967296))))) [2019-10-07 13:33:02,857 INFO L193 IcfgInterpreter]: Reachable states at location L31 satisfy 78#(and (< (mod main_~index~0 4294967296) 10000) (= (select (select |#memory_int| |main_~#array~0.base|) (+ (* 4 (ite (<= (mod main_~index~0 4294967296) 2147483647) (mod main_~index~0 4294967296) (+ (mod main_~index~0 4294967296) (- 4294967296)))) |main_~#array~0.offset|)) |main_#t~mem4|) (= 0 main_~index~0) (<= 0 main_~index~0) (<= main_~index~0 0)) [2019-10-07 13:33:02,857 INFO L193 IcfgInterpreter]: Reachable states at location L24-3 satisfy 68#true [2019-10-07 13:33:03,221 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 13:33:03,222 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 8, 8, 10] total 22 [2019-10-07 13:33:03,224 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-10-07 13:33:03,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-10-07 13:33:03,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=399, Unknown=0, NotChecked=0, Total=462 [2019-10-07 13:33:03,226 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand 22 states. [2019-10-07 13:33:03,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:33:03,957 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2019-10-07 13:33:03,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-07 13:33:03,957 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 12 [2019-10-07 13:33:03,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:33:03,958 INFO L225 Difference]: With dead ends: 36 [2019-10-07 13:33:03,958 INFO L226 Difference]: Without dead ends: 27 [2019-10-07 13:33:03,959 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=146, Invalid=784, Unknown=0, NotChecked=0, Total=930 [2019-10-07 13:33:03,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-10-07 13:33:03,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 23. [2019-10-07 13:33:03,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-10-07 13:33:03,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2019-10-07 13:33:03,967 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 12 [2019-10-07 13:33:03,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:33:03,968 INFO L462 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2019-10-07 13:33:03,968 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-10-07 13:33:03,968 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2019-10-07 13:33:03,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-07 13:33:03,969 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:33:03,969 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:33:04,173 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:33:04,174 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:33:04,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:33:04,174 INFO L82 PathProgramCache]: Analyzing trace with hash -2118559936, now seen corresponding path program 1 times [2019-10-07 13:33:04,174 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:33:04,174 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:33:04,175 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:33:04,175 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:33:04,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:33:04,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:33:04,308 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-07 13:33:04,309 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:33:04,309 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 13:33:04,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 13:33:04,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:33:04,367 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 21 conjunts are in the unsatisfiable core [2019-10-07 13:33:04,370 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 13:33:04,402 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:33:04,576 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:33:04,675 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:33:04,675 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 13:33:04,846 WARN L225 Elim1Store]: Array PQE input equivalent to true [2019-10-07 13:33:05,220 WARN L191 SmtUtils]: Spent 293.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-10-07 13:33:05,304 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:33:05,304 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 13:33:05,305 INFO L162 IcfgInterpreter]: Started Sifa with 15 locations of interest [2019-10-07 13:33:05,306 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 13:33:05,306 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 13:33:05,306 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 13:33:05,307 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 13:33:05,340 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 13:33:05,427 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:33:05,433 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:33:05,539 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:33:05,748 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 15 for LOIs [2019-10-07 13:33:05,804 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 13:33:05,810 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 13:33:05,810 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 13:33:05,810 INFO L193 IcfgInterpreter]: Reachable states at location L12 satisfy 176#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (= |#NULL.offset| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (= |#NULL.offset| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 0 |#NULL.base|) (<= 0 __VERIFIER_assert_~cond) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 13:33:05,810 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 185#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 13:33:05,811 INFO L193 IcfgInterpreter]: Reachable states at location L11 satisfy 161#(and (or (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond))) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-07 13:33:05,811 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertEXIT satisfy 171#(and (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 1 __VERIFIER_assert_~cond) (<= 0 |#NULL.base|) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 13:33:05,811 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 181#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (= |#NULL.offset| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (= |#NULL.offset| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 0 |#NULL.base|) (<= 0 __VERIFIER_assert_~cond) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 13:33:05,811 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 13:33:05,812 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 13:33:05,812 INFO L193 IcfgInterpreter]: Reachable states at location L30-3 satisfy 151#(or (exists ((|v_main_#t~mem4_13| Int)) (and (= |#NULL.base| 0) (= |main_~#array~0.offset| 0) (<= |main_~#array~0.offset| 0) (<= 1 main_~index~0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (< (mod (+ main_~index~0 4294967295) 4294967296) (mod |v_main_#t~mem4_13| 4294967296)) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |main_~#array~0.offset|))) (and (= |#NULL.base| 0) (= |main_~#array~0.offset| 0) (<= |main_~#array~0.offset| 0) (<= |#NULL.base| 0) (= 0 main_~index~0) (<= 0 |#NULL.base|) (<= 0 main_~index~0) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |main_~#array~0.offset|) (<= main_~index~0 0))) [2019-10-07 13:33:05,812 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 190#(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 13:33:05,812 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 13:33:05,813 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 156#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (and (= |#NULL.base| 0) (= |__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|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) [2019-10-07 13:33:05,813 INFO L193 IcfgInterpreter]: Reachable states at location L31-1 satisfy 142#(and (= |#NULL.base| 0) (= |main_~#array~0.offset| 0) (<= |main_~#array~0.offset| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= 0 main_~index~0) (= |#NULL.offset| 0) (< (mod main_~index~0 4294967296) (mod |main_#t~mem4| 4294967296)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |main_~#array~0.offset|)) [2019-10-07 13:33:05,813 INFO L193 IcfgInterpreter]: Reachable states at location L11-2 satisfy 166#(and (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 1 __VERIFIER_assert_~cond) (<= 0 |#NULL.base|) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 13:33:05,813 INFO L193 IcfgInterpreter]: Reachable states at location L31 satisfy 130#(and (= |#NULL.base| 0) (= |main_~#array~0.offset| 0) (<= |main_~#array~0.offset| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= 0 main_~index~0) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |main_~#array~0.offset|)) [2019-10-07 13:33:05,813 INFO L193 IcfgInterpreter]: Reachable states at location L24-3 satisfy 74#(and (or (and (= |#NULL.base| 0) (= |main_~#array~0.offset| 0) (<= |main_~#array~0.offset| 0) (= |#NULL.offset| 0)) (and (= 0 |#NULL.base|) (= 0 |main_~#array~0.offset|) (= (select |old(#valid)| |main_~#array~0.base|) 0) (< |main_~#array~0.base| |#StackHeapBarrier|) (= |#valid| (store |old(#valid)| |main_~#array~0.base| 1)) (= 0 (select |old(#valid)| 0)) (not (= |main_~#array~0.base| 0)) (<= |main_~#array~0.offset| 0) (= (store |old(#length)| |main_~#array~0.base| 40000) |#length|) (= 0 main_~index~0) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (<= main_~index~0 0))) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= 0 main_~index~0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |main_~#array~0.offset|)) [2019-10-07 13:33:08,851 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 13:33:08,851 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 11, 10, 11] total 31 [2019-10-07 13:33:08,852 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-10-07 13:33:08,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-10-07 13:33:08,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=827, Unknown=1, NotChecked=0, Total=930 [2019-10-07 13:33:08,854 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 31 states. [2019-10-07 13:33:13,887 WARN L191 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 46 [2019-10-07 13:33:14,079 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 48 [2019-10-07 13:33:15,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:33:15,339 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2019-10-07 13:33:15,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-10-07 13:33:15,339 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 20 [2019-10-07 13:33:15,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:33:15,340 INFO L225 Difference]: With dead ends: 48 [2019-10-07 13:33:15,340 INFO L226 Difference]: Without dead ends: 33 [2019-10-07 13:33:15,342 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 32 SyntacticMatches, 4 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 520 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=305, Invalid=1856, Unknown=1, NotChecked=0, Total=2162 [2019-10-07 13:33:15,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-10-07 13:33:15,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 29. [2019-10-07 13:33:15,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-10-07 13:33:15,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2019-10-07 13:33:15,351 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 20 [2019-10-07 13:33:15,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:33:15,351 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2019-10-07 13:33:15,351 INFO L463 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-10-07 13:33:15,351 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2019-10-07 13:33:15,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-07 13:33:15,353 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:33:15,353 INFO L385 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:33:15,556 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:33:15,557 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:33:15,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:33:15,558 INFO L82 PathProgramCache]: Analyzing trace with hash 322407660, now seen corresponding path program 2 times [2019-10-07 13:33:15,558 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:33:15,558 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:33:15,559 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:33:15,559 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:33:15,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:33:15,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:33:15,661 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-07 13:33:15,662 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:33:15,662 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 13:33:15,662 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 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 13:33:15,870 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-07 13:33:15,871 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-07 13:33:15,872 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 31 conjunts are in the unsatisfiable core [2019-10-07 13:33:15,875 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 13:33:15,963 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-07 13:33:15,963 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 13:33:17,849 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-07 13:33:17,849 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 13:33:17,851 INFO L162 IcfgInterpreter]: Started Sifa with 15 locations of interest [2019-10-07 13:33:17,851 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 13:33:17,851 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 13:33:17,851 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 13:33:17,852 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 13:33:17,873 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 13:33:17,939 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:33:18,065 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 15 for LOIs [2019-10-07 13:33:18,104 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 13:33:18,109 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 13:33:18,109 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 13:33:18,109 INFO L193 IcfgInterpreter]: Reachable states at location L12 satisfy 161#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (= |#NULL.offset| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (= |#NULL.offset| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 0 |#NULL.base|) (<= 0 __VERIFIER_assert_~cond) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 13:33:18,109 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 170#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 13:33:18,110 INFO L193 IcfgInterpreter]: Reachable states at location L11 satisfy 146#(and (or (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond))) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-07 13:33:18,110 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertEXIT satisfy 156#(and (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 1 __VERIFIER_assert_~cond) (<= 0 |#NULL.base|) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 13:33:18,110 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 166#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (= |#NULL.offset| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (= |#NULL.offset| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 0 |#NULL.base|) (<= 0 __VERIFIER_assert_~cond) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 13:33:18,111 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 13:33:18,111 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 13:33:18,111 INFO L193 IcfgInterpreter]: Reachable states at location L30-3 satisfy 136#(or (exists ((|v_main_#t~mem4_21| Int)) (and (= |#NULL.base| 0) (= |main_~#array~0.offset| 0) (<= |main_~#array~0.offset| 0) (<= 1 main_~index~0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (< (mod (+ main_~index~0 4294967295) 4294967296) (mod |v_main_#t~mem4_21| 4294967296)) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |main_~#array~0.offset|))) (and (= |#NULL.base| 0) (= |main_~#array~0.offset| 0) (<= |main_~#array~0.offset| 0) (<= |#NULL.base| 0) (= 0 main_~index~0) (<= 0 |#NULL.base|) (<= 0 main_~index~0) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |main_~#array~0.offset|) (<= main_~index~0 0))) [2019-10-07 13:33:18,111 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 175#(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 13:33:18,112 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 13:33:18,112 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 141#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (and (= |#NULL.base| 0) (= |__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|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) [2019-10-07 13:33:18,112 INFO L193 IcfgInterpreter]: Reachable states at location L31-1 satisfy 127#(and (= |#NULL.base| 0) (= |main_~#array~0.offset| 0) (<= |main_~#array~0.offset| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= 0 main_~index~0) (= |#NULL.offset| 0) (< (mod main_~index~0 4294967296) (mod |main_#t~mem4| 4294967296)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |main_~#array~0.offset|)) [2019-10-07 13:33:18,112 INFO L193 IcfgInterpreter]: Reachable states at location L11-2 satisfy 151#(and (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 1 __VERIFIER_assert_~cond) (<= 0 |#NULL.base|) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 13:33:18,113 INFO L193 IcfgInterpreter]: Reachable states at location L31 satisfy 115#(and (= |#NULL.base| 0) (= |main_~#array~0.offset| 0) (<= |main_~#array~0.offset| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= 0 main_~index~0) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |main_~#array~0.offset|)) [2019-10-07 13:33:18,113 INFO L193 IcfgInterpreter]: Reachable states at location L24-3 satisfy 59#(and (or (and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 |main_~#array~0.offset|) (< |main_~#array~0.base| |#StackHeapBarrier|) (= (select |old(#valid)| |main_~#array~0.base|) 0) (= |#valid| (store |old(#valid)| |main_~#array~0.base| 1)) (= 0 (select |old(#valid)| 0)) (not (= |main_~#array~0.base| 0)) (<= |main_~#array~0.offset| 0) (= (store |old(#length)| |main_~#array~0.base| 40000) |#length|) (= 0 main_~index~0) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (<= main_~index~0 0)) (and (= |#NULL.base| 0) (= |main_~#array~0.offset| 0) (<= |main_~#array~0.offset| 0) (<= |#NULL.base| 0) (= |#NULL.offset| 0))) (<= 0 |#NULL.base|) (<= 0 main_~index~0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |main_~#array~0.offset|)) [2019-10-07 13:33:18,994 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 13:33:18,994 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 13, 11] total 32 [2019-10-07 13:33:18,995 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-10-07 13:33:18,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-10-07 13:33:18,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=875, Unknown=0, NotChecked=0, Total=992 [2019-10-07 13:33:18,997 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand 32 states. [2019-10-07 13:33:20,103 WARN L191 SmtUtils]: Spent 606.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 62 [2019-10-07 13:33:20,376 WARN L191 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 56 [2019-10-07 13:33:21,449 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 51 [2019-10-07 13:33:26,058 WARN L191 SmtUtils]: Spent 2.67 s on a formula simplification. DAG size of input: 65 DAG size of output: 65 [2019-10-07 13:33:26,603 WARN L191 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 59 [2019-10-07 13:33:27,130 WARN L191 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 54 [2019-10-07 13:33:27,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:33:27,493 INFO L93 Difference]: Finished difference Result 85 states and 103 transitions. [2019-10-07 13:33:27,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-10-07 13:33:27,494 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 28 [2019-10-07 13:33:27,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:33:27,496 INFO L225 Difference]: With dead ends: 85 [2019-10-07 13:33:27,496 INFO L226 Difference]: Without dead ends: 65 [2019-10-07 13:33:27,499 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 57 SyntacticMatches, 3 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 918 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=641, Invalid=3265, Unknown=0, NotChecked=0, Total=3906 [2019-10-07 13:33:27,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-10-07 13:33:27,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 39. [2019-10-07 13:33:27,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-10-07 13:33:27,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 47 transitions. [2019-10-07 13:33:27,515 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 47 transitions. Word has length 28 [2019-10-07 13:33:27,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:33:27,515 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 47 transitions. [2019-10-07 13:33:27,516 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-10-07 13:33:27,516 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 47 transitions. [2019-10-07 13:33:27,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-10-07 13:33:27,517 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:33:27,517 INFO L385 BasicCegarLoop]: trace histogram [8, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:33:27,721 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:33:27,721 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:33:27,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:33:27,722 INFO L82 PathProgramCache]: Analyzing trace with hash 57683084, now seen corresponding path program 3 times [2019-10-07 13:33:27,723 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:33:27,723 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:33:27,723 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:33:27,724 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:33:27,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:33:27,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:33:27,915 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 4 proven. 36 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-07 13:33:27,916 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:33:27,916 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 13:33:27,916 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 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 13:33:28,001 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-07 13:33:28,001 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-07 13:33:28,003 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 40 conjunts are in the unsatisfiable core [2019-10-07 13:33:28,006 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 13:33:28,030 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:33:28,099 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:33:28,232 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:33:28,364 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:33:28,508 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:33:28,618 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:33:29,044 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:33:29,152 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-10-07 13:33:29,152 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 13:33:29,732 WARN L225 Elim1Store]: Array PQE input equivalent to true [2019-10-07 13:33:30,758 WARN L191 SmtUtils]: Spent 938.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-10-07 13:33:30,879 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 4 proven. 28 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-10-07 13:33:30,880 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 13:33:30,881 INFO L162 IcfgInterpreter]: Started Sifa with 15 locations of interest [2019-10-07 13:33:30,881 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 13:33:30,882 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 13:33:30,882 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 13:33:30,882 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 13:33:30,904 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 13:33:30,970 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:33:31,027 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-07 13:33:31,046 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 13:33:31,059 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 13:33:31,059 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 13:33:31,060 INFO L193 IcfgInterpreter]: Reachable states at location L12 satisfy 170#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-07 13:33:31,060 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 179#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 13:33:31,060 INFO L193 IcfgInterpreter]: Reachable states at location L11 satisfy 155#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-07 13:33:31,060 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertEXIT satisfy 165#(and (or (and (= |__VERIFIER_assert_#in~cond| 1) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1)) [2019-10-07 13:33:31,060 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 175#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-07 13:33:31,061 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 13:33:31,061 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 13:33:31,061 INFO L193 IcfgInterpreter]: Reachable states at location L30-3 satisfy 145#(or (and (= 0 main_~index~0) (<= 0 main_~index~0) (<= main_~index~0 0)) (exists ((|v_main_#t~mem4_29| Int)) (and (<= 1 main_~index~0) (< (mod (+ main_~index~0 4294967295) 4294967296) (mod |v_main_#t~mem4_29| 4294967296))))) [2019-10-07 13:33:31,061 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 184#(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 13:33:31,061 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 13:33:31,062 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 150#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| 0))) [2019-10-07 13:33:31,062 INFO L193 IcfgInterpreter]: Reachable states at location L31-1 satisfy 136#(and (<= 0 main_~index~0) (< (mod main_~index~0 4294967296) (mod |main_#t~mem4| 4294967296))) [2019-10-07 13:33:31,062 INFO L193 IcfgInterpreter]: Reachable states at location L11-2 satisfy 160#(and (or (and (= |__VERIFIER_assert_#in~cond| 1) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1)) [2019-10-07 13:33:31,064 INFO L193 IcfgInterpreter]: Reachable states at location L31 satisfy 124#(<= 0 main_~index~0) [2019-10-07 13:33:31,064 INFO L193 IcfgInterpreter]: Reachable states at location L24-3 satisfy 68#true [2019-10-07 13:33:31,659 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 13:33:31,660 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 12, 12] total 40 [2019-10-07 13:33:31,661 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-10-07 13:33:31,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-10-07 13:33:31,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=1398, Unknown=0, NotChecked=0, Total=1560 [2019-10-07 13:33:31,662 INFO L87 Difference]: Start difference. First operand 39 states and 47 transitions. Second operand 40 states. [2019-10-07 13:33:53,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:33:53,849 INFO L93 Difference]: Finished difference Result 84 states and 102 transitions. [2019-10-07 13:33:53,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-10-07 13:33:53,850 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 33 [2019-10-07 13:33:53,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:33:53,851 INFO L225 Difference]: With dead ends: 84 [2019-10-07 13:33:53,851 INFO L226 Difference]: Without dead ends: 59 [2019-10-07 13:33:53,853 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 65 SyntacticMatches, 14 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 1011 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=555, Invalid=4137, Unknown=0, NotChecked=0, Total=4692 [2019-10-07 13:33:53,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-10-07 13:33:53,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 38. [2019-10-07 13:33:53,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-10-07 13:33:53,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2019-10-07 13:33:53,866 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 33 [2019-10-07 13:33:53,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:33:53,867 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2019-10-07 13:33:53,867 INFO L463 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-10-07 13:33:53,867 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2019-10-07 13:33:53,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-10-07 13:33:53,868 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:33:53,868 INFO L385 BasicCegarLoop]: trace histogram [9, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:33:54,073 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:33:54,074 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:33:54,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:33:54,074 INFO L82 PathProgramCache]: Analyzing trace with hash 1088585056, now seen corresponding path program 4 times [2019-10-07 13:33:54,074 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:33:54,074 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:33:54,075 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:33:54,075 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:33:54,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:33:54,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:33:54,259 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 6 proven. 45 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-10-07 13:33:54,260 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:33:54,260 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 13:33:54,260 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 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:33:54,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:33:54,344 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 44 conjunts are in the unsatisfiable core [2019-10-07 13:33:54,347 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 13:33:54,362 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:33:54,420 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:33:54,556 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:33:54,677 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:33:54,832 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:33:55,014 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:33:56,038 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:33:56,166 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-10-07 13:33:56,167 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 13:33:56,899 WARN L225 Elim1Store]: Array PQE input equivalent to true [2019-10-07 13:33:57,350 WARN L191 SmtUtils]: Spent 348.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-10-07 13:33:57,708 WARN L191 SmtUtils]: Spent 311.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-10-07 13:33:57,837 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 6 proven. 45 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-10-07 13:33:57,837 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 13:33:57,839 INFO L162 IcfgInterpreter]: Started Sifa with 15 locations of interest [2019-10-07 13:33:57,839 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 13:33:57,839 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 13:33:57,839 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 13:33:57,840 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 13:33:57,858 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 13:33:57,921 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:33:58,034 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 15 for LOIs [2019-10-07 13:33:58,063 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 13:33:58,066 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 13:33:58,067 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 13:33:58,067 INFO L193 IcfgInterpreter]: Reachable states at location L12 satisfy 161#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (= |#NULL.offset| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (= |#NULL.offset| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 0 |#NULL.base|) (<= 0 __VERIFIER_assert_~cond) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 13:33:58,067 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 170#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 13:33:58,067 INFO L193 IcfgInterpreter]: Reachable states at location L11 satisfy 146#(and (or (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond))) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-07 13:33:58,067 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertEXIT satisfy 156#(and (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 1 __VERIFIER_assert_~cond) (<= 0 |#NULL.base|) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 13:33:58,068 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 166#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (= |#NULL.offset| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (= |#NULL.offset| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 0 |#NULL.base|) (<= 0 __VERIFIER_assert_~cond) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 13:33:58,068 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 13:33:58,068 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0))) [2019-10-07 13:33:58,068 INFO L193 IcfgInterpreter]: Reachable states at location L30-3 satisfy 136#(or (exists ((|v_main_#t~mem4_39| Int)) (and (< (mod (+ main_~index~0 4294967295) 4294967296) (mod |v_main_#t~mem4_39| 4294967296)) (= |#NULL.base| 0) (= |main_~#array~0.offset| 0) (<= |main_~#array~0.offset| 0) (<= 1 main_~index~0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |main_~#array~0.offset|))) (and (= |#NULL.base| 0) (= |main_~#array~0.offset| 0) (<= |main_~#array~0.offset| 0) (<= |#NULL.base| 0) (= 0 main_~index~0) (<= 0 |#NULL.base|) (<= 0 main_~index~0) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |main_~#array~0.offset|) (<= main_~index~0 0))) [2019-10-07 13:33:58,068 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 175#(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 13:33:58,069 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 13:33:58,069 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 141#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (and (= |#NULL.base| 0) (= |__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|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) [2019-10-07 13:33:58,069 INFO L193 IcfgInterpreter]: Reachable states at location L31-1 satisfy 127#(and (= |#NULL.base| 0) (= |main_~#array~0.offset| 0) (<= |main_~#array~0.offset| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= 0 main_~index~0) (= |#NULL.offset| 0) (< (mod main_~index~0 4294967296) (mod |main_#t~mem4| 4294967296)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |main_~#array~0.offset|)) [2019-10-07 13:33:58,069 INFO L193 IcfgInterpreter]: Reachable states at location L11-2 satisfy 151#(and (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 1 __VERIFIER_assert_~cond) (<= 0 |#NULL.base|) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 13:33:58,069 INFO L193 IcfgInterpreter]: Reachable states at location L31 satisfy 115#(and (= |#NULL.base| 0) (= |main_~#array~0.offset| 0) (<= |main_~#array~0.offset| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= 0 main_~index~0) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |main_~#array~0.offset|)) [2019-10-07 13:33:58,070 INFO L193 IcfgInterpreter]: Reachable states at location L24-3 satisfy 59#(and (or (and (= |#NULL.base| 0) (= |main_~#array~0.offset| 0) (<= |main_~#array~0.offset| 0) (= |#NULL.offset| 0)) (and (= 0 |#NULL.base|) (= 0 |main_~#array~0.offset|) (< |main_~#array~0.base| |#StackHeapBarrier|) (= (select |old(#valid)| |main_~#array~0.base|) 0) (= |#valid| (store |old(#valid)| |main_~#array~0.base| 1)) (= 0 (select |old(#valid)| 0)) (not (= |main_~#array~0.base| 0)) (<= |main_~#array~0.offset| 0) (= (store |old(#length)| |main_~#array~0.base| 40000) |#length|) (= 0 main_~index~0) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (<= main_~index~0 0))) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= 0 main_~index~0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |main_~#array~0.offset|)) [2019-10-07 13:33:59,117 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 13:33:59,117 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15, 14, 11] total 44 [2019-10-07 13:33:59,119 INFO L442 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-10-07 13:33:59,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-10-07 13:33:59,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=1741, Unknown=0, NotChecked=0, Total=1892 [2019-10-07 13:33:59,121 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand 44 states. [2019-10-07 13:34:17,796 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2019-10-07 13:34:26,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:34:26,521 INFO L93 Difference]: Finished difference Result 92 states and 105 transitions. [2019-10-07 13:34:26,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-10-07 13:34:26,523 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 41 [2019-10-07 13:34:26,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:34:26,524 INFO L225 Difference]: With dead ends: 92 [2019-10-07 13:34:26,524 INFO L226 Difference]: Without dead ends: 69 [2019-10-07 13:34:26,528 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 75 SyntacticMatches, 20 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 1765 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=708, Invalid=6264, Unknown=0, NotChecked=0, Total=6972 [2019-10-07 13:34:26,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-10-07 13:34:26,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 55. [2019-10-07 13:34:26,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-10-07 13:34:26,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 62 transitions. [2019-10-07 13:34:26,562 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 62 transitions. Word has length 41 [2019-10-07 13:34:26,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:34:26,562 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 62 transitions. [2019-10-07 13:34:26,562 INFO L463 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-10-07 13:34:26,563 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 62 transitions. [2019-10-07 13:34:26,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-10-07 13:34:26,567 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:34:26,567 INFO L385 BasicCegarLoop]: trace histogram [10, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:34:26,770 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:34:26,771 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:34:26,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:34:26,771 INFO L82 PathProgramCache]: Analyzing trace with hash -764561908, now seen corresponding path program 5 times [2019-10-07 13:34:26,772 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:34:26,772 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:34:26,772 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:34:26,772 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:34:26,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:34:26,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:34:26,966 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 8 proven. 55 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-10-07 13:34:26,966 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:34:26,966 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 13:34:26,967 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 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:34:38,924 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-10-07 13:34:38,924 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-07 13:34:38,929 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 48 conjunts are in the unsatisfiable core [2019-10-07 13:34:38,932 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 13:34:38,947 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:34:39,042 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:34:39,189 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:34:39,326 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:34:39,450 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:34:39,561 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:34:40,330 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:34:40,425 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 0 proven. 74 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-10-07 13:34:40,426 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 13:34:41,052 WARN L225 Elim1Store]: Array PQE input equivalent to true [2019-10-07 13:34:42,173 WARN L191 SmtUtils]: Spent 1.03 s on a formula simplification that was a NOOP. DAG size: 14 [2019-10-07 13:34:42,411 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 8 proven. 66 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-10-07 13:34:42,411 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 13:34:42,413 INFO L162 IcfgInterpreter]: Started Sifa with 15 locations of interest [2019-10-07 13:34:42,413 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 13:34:42,414 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 13:34:42,414 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 13:34:42,414 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 13:34:42,434 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 13:34:42,468 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:34:42,585 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 15 for LOIs [2019-10-07 13:34:42,615 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 13:34:42,619 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 13:34:42,619 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 13:34:42,619 INFO L193 IcfgInterpreter]: Reachable states at location L12 satisfy 161#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (= |#NULL.offset| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (= |#NULL.offset| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 0 |#NULL.base|) (<= 0 __VERIFIER_assert_~cond) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 13:34:42,620 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 170#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 13:34:42,620 INFO L193 IcfgInterpreter]: Reachable states at location L11 satisfy 146#(and (or (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond))) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-07 13:34:42,620 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertEXIT satisfy 156#(and (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 1 __VERIFIER_assert_~cond) (<= 0 |#NULL.base|) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 13:34:42,620 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 166#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (= |#NULL.offset| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (= |#NULL.offset| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 0 |#NULL.base|) (<= 0 __VERIFIER_assert_~cond) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 13:34:42,620 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 13:34:42,621 INFO L193 IcfgInterpreter]: Reachable states at location L30-3 satisfy 136#(or (and (= |#NULL.base| 0) (= |main_~#array~0.offset| 0) (<= |main_~#array~0.offset| 0) (<= |#NULL.base| 0) (= 0 main_~index~0) (<= 0 |#NULL.base|) (<= 0 main_~index~0) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |main_~#array~0.offset|) (<= main_~index~0 0)) (exists ((|v_main_#t~mem4_51| Int)) (and (= |#NULL.base| 0) (= |main_~#array~0.offset| 0) (<= |main_~#array~0.offset| 0) (<= 1 main_~index~0) (<= |#NULL.base| 0) (< (mod (+ main_~index~0 4294967295) 4294967296) (mod |v_main_#t~mem4_51| 4294967296)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |main_~#array~0.offset|)))) [2019-10-07 13:34:42,621 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 13:34:42,621 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 175#(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 13:34:42,621 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 13:34:42,621 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 141#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (and (= |#NULL.base| 0) (= |__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|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) [2019-10-07 13:34:42,621 INFO L193 IcfgInterpreter]: Reachable states at location L31-1 satisfy 127#(and (= |#NULL.base| 0) (= |main_~#array~0.offset| 0) (<= |main_~#array~0.offset| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= 0 main_~index~0) (= |#NULL.offset| 0) (< (mod main_~index~0 4294967296) (mod |main_#t~mem4| 4294967296)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |main_~#array~0.offset|)) [2019-10-07 13:34:42,622 INFO L193 IcfgInterpreter]: Reachable states at location L11-2 satisfy 151#(and (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 1 __VERIFIER_assert_~cond) (<= 0 |#NULL.base|) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 13:34:42,622 INFO L193 IcfgInterpreter]: Reachable states at location L31 satisfy 115#(and (= |#NULL.base| 0) (= |main_~#array~0.offset| 0) (<= |main_~#array~0.offset| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= 0 main_~index~0) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |main_~#array~0.offset|)) [2019-10-07 13:34:42,622 INFO L193 IcfgInterpreter]: Reachable states at location L24-3 satisfy 59#(and (or (and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 |main_~#array~0.offset|) (< |main_~#array~0.base| |#StackHeapBarrier|) (= (select |old(#valid)| |main_~#array~0.base|) 0) (= |#valid| (store |old(#valid)| |main_~#array~0.base| 1)) (= 0 (select |old(#valid)| 0)) (not (= |main_~#array~0.base| 0)) (<= |main_~#array~0.offset| 0) (= (store |old(#length)| |main_~#array~0.base| 40000) |#length|) (= 0 main_~index~0) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (<= main_~index~0 0)) (and (= |#NULL.base| 0) (= |main_~#array~0.offset| 0) (<= |main_~#array~0.offset| 0) (<= |#NULL.base| 0) (= |#NULL.offset| 0))) (<= 0 |#NULL.base|) (<= 0 main_~index~0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |main_~#array~0.offset|)) [2019-10-07 13:34:43,741 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 13:34:43,741 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 17, 16, 11] total 48 [2019-10-07 13:34:43,742 INFO L442 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-10-07 13:34:43,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-10-07 13:34:43,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=2088, Unknown=0, NotChecked=0, Total=2256 [2019-10-07 13:34:43,743 INFO L87 Difference]: Start difference. First operand 55 states and 62 transitions. Second operand 48 states. [2019-10-07 13:35:10,369 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 48 [2019-10-07 13:35:14,648 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 46 [2019-10-07 13:35:14,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:35:14,657 INFO L93 Difference]: Finished difference Result 110 states and 129 transitions. [2019-10-07 13:35:14,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-10-07 13:35:14,657 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 49 [2019-10-07 13:35:14,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:35:14,658 INFO L225 Difference]: With dead ends: 110 [2019-10-07 13:35:14,659 INFO L226 Difference]: Without dead ends: 71 [2019-10-07 13:35:14,661 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 98 SyntacticMatches, 23 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 1699 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=651, Invalid=6155, Unknown=0, NotChecked=0, Total=6806 [2019-10-07 13:35:14,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-10-07 13:35:14,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 56. [2019-10-07 13:35:14,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-10-07 13:35:14,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 63 transitions. [2019-10-07 13:35:14,689 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 63 transitions. Word has length 49 [2019-10-07 13:35:14,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:35:14,689 INFO L462 AbstractCegarLoop]: Abstraction has 56 states and 63 transitions. [2019-10-07 13:35:14,689 INFO L463 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-10-07 13:35:14,689 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 63 transitions. [2019-10-07 13:35:14,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-07 13:35:14,690 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:35:14,690 INFO L385 BasicCegarLoop]: trace histogram [11, 6, 6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:35:14,892 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:35:14,893 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:35:14,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:35:14,894 INFO L82 PathProgramCache]: Analyzing trace with hash -1510210592, now seen corresponding path program 6 times [2019-10-07 13:35:14,894 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:35:14,894 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:35:14,894 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:35:14,895 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:35:14,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:35:14,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:35:15,131 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 10 proven. 66 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-10-07 13:35:15,131 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:35:15,132 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 13:35:15,132 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 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:35:15,270 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-07 13:35:15,270 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-07 13:35:15,272 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 52 conjunts are in the unsatisfiable core [2019-10-07 13:35:15,275 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 13:35:15,300 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:35:15,380 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:35:15,502 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:35:15,658 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:35:15,762 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:35:15,923 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:35:16,937 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:35:17,049 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 101 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-10-07 13:35:17,049 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 13:35:19,116 WARN L191 SmtUtils]: Spent 1.19 s on a formula simplification that was a NOOP. DAG size: 14 [2019-10-07 13:35:20,344 WARN L191 SmtUtils]: Spent 1.16 s on a formula simplification that was a NOOP. DAG size: 16 [2019-10-07 13:35:20,596 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 10 proven. 91 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-10-07 13:35:20,596 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 13:35:20,598 INFO L162 IcfgInterpreter]: Started Sifa with 15 locations of interest [2019-10-07 13:35:20,598 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 13:35:20,598 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 13:35:20,598 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 13:35:20,599 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 13:35:20,615 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 13:35:20,658 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:35:20,661 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:35:20,716 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:35:20,816 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 15 for LOIs [2019-10-07 13:35:20,855 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 13:35:20,858 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 13:35:20,859 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 13:35:20,859 INFO L193 IcfgInterpreter]: Reachable states at location L12 satisfy 176#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (= |#NULL.offset| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (= |#NULL.offset| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 0 |#NULL.base|) (<= 0 __VERIFIER_assert_~cond) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 13:35:20,859 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 185#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 13:35:20,860 INFO L193 IcfgInterpreter]: Reachable states at location L11 satisfy 161#(and (or (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond))) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-07 13:35:20,860 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertEXIT satisfy 171#(and (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 1 __VERIFIER_assert_~cond) (<= 0 |#NULL.base|) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 13:35:20,860 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 181#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (= |#NULL.offset| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (= |#NULL.offset| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 0 |#NULL.base|) (<= 0 __VERIFIER_assert_~cond) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 13:35:20,861 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 13:35:20,861 INFO L193 IcfgInterpreter]: Reachable states at location L30-3 satisfy 151#(or (exists ((|v_main_#t~mem4_65| Int)) (and (< (mod (+ main_~index~0 4294967295) 4294967296) (mod |v_main_#t~mem4_65| 4294967296)) (= |#NULL.base| 0) (= |main_~#array~0.offset| 0) (<= |main_~#array~0.offset| 0) (<= 1 main_~index~0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |main_~#array~0.offset|))) (and (= |#NULL.base| 0) (= |main_~#array~0.offset| 0) (<= |main_~#array~0.offset| 0) (<= |#NULL.base| 0) (= 0 main_~index~0) (<= 0 |#NULL.base|) (<= 0 main_~index~0) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |main_~#array~0.offset|) (<= main_~index~0 0))) [2019-10-07 13:35:20,861 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 13:35:20,861 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 190#(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 13:35:20,861 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 13:35:20,862 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 156#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (and (= |#NULL.base| 0) (= |__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|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) [2019-10-07 13:35:20,862 INFO L193 IcfgInterpreter]: Reachable states at location L31-1 satisfy 142#(and (= |#NULL.base| 0) (= |main_~#array~0.offset| 0) (<= |main_~#array~0.offset| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= 0 main_~index~0) (= |#NULL.offset| 0) (< (mod main_~index~0 4294967296) (mod |main_#t~mem4| 4294967296)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |main_~#array~0.offset|)) [2019-10-07 13:35:20,862 INFO L193 IcfgInterpreter]: Reachable states at location L11-2 satisfy 166#(and (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 1 __VERIFIER_assert_~cond) (<= 0 |#NULL.base|) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 13:35:20,863 INFO L193 IcfgInterpreter]: Reachable states at location L31 satisfy 130#(and (= |#NULL.base| 0) (= |main_~#array~0.offset| 0) (<= |main_~#array~0.offset| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= 0 main_~index~0) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |main_~#array~0.offset|)) [2019-10-07 13:35:20,863 INFO L193 IcfgInterpreter]: Reachable states at location L24-3 satisfy 74#(and (or (and (= |#NULL.base| 0) (= |main_~#array~0.offset| 0) (<= |main_~#array~0.offset| 0) (= |#NULL.offset| 0)) (and (= 0 |#NULL.base|) (= 0 |main_~#array~0.offset|) (= (select |old(#valid)| |main_~#array~0.base|) 0) (< |main_~#array~0.base| |#StackHeapBarrier|) (= |#valid| (store |old(#valid)| |main_~#array~0.base| 1)) (= 0 (select |old(#valid)| 0)) (not (= |main_~#array~0.base| 0)) (<= |main_~#array~0.offset| 0) (= (store |old(#length)| |main_~#array~0.base| 40000) |#length|) (= 0 main_~index~0) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (<= main_~index~0 0))) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= 0 main_~index~0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |main_~#array~0.offset|)) [2019-10-07 13:35:24,260 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 13:35:24,260 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 19, 18, 11] total 52 [2019-10-07 13:35:24,261 INFO L442 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-10-07 13:35:24,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-10-07 13:35:24,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=2466, Unknown=1, NotChecked=0, Total=2652 [2019-10-07 13:35:24,263 INFO L87 Difference]: Start difference. First operand 56 states and 63 transitions. Second operand 52 states. [2019-10-07 13:35:51,551 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2019-10-07 13:35:56,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:35:56,592 INFO L93 Difference]: Finished difference Result 114 states and 134 transitions. [2019-10-07 13:35:56,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-10-07 13:35:56,593 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 57 [2019-10-07 13:35:56,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:35:56,594 INFO L225 Difference]: With dead ends: 114 [2019-10-07 13:35:56,594 INFO L226 Difference]: Without dead ends: 75 [2019-10-07 13:35:56,597 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 116 SyntacticMatches, 26 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 2053 ImplicationChecksByTransitivity, 12.9s TimeCoverageRelationStatistics Valid=713, Invalid=7296, Unknown=1, NotChecked=0, Total=8010 [2019-10-07 13:35:56,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-10-07 13:35:56,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 57. [2019-10-07 13:35:56,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-10-07 13:35:56,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 64 transitions. [2019-10-07 13:35:56,621 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 64 transitions. Word has length 57 [2019-10-07 13:35:56,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:35:56,622 INFO L462 AbstractCegarLoop]: Abstraction has 57 states and 64 transitions. [2019-10-07 13:35:56,622 INFO L463 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-10-07 13:35:56,622 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 64 transitions. [2019-10-07 13:35:56,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-10-07 13:35:56,623 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:35:56,623 INFO L385 BasicCegarLoop]: trace histogram [12, 7, 7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:35:56,825 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:35:56,826 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:35:56,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:35:56,827 INFO L82 PathProgramCache]: Analyzing trace with hash -1650155636, now seen corresponding path program 7 times [2019-10-07 13:35:56,827 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:35:56,827 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:35:56,827 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:35:56,828 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:35:56,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:35:56,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:35:57,085 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 12 proven. 78 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2019-10-07 13:35:57,085 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:35:57,085 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 13:35:57,085 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 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:35:57,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:35:57,230 INFO L256 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 56 conjunts are in the unsatisfiable core [2019-10-07 13:35:57,234 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 13:35:57,247 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:35:57,335 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:35:57,440 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:35:57,600 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:35:57,702 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:35:57,830 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:35:58,806 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:35:58,927 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-10-07 13:35:58,927 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 13:36:00,217 WARN L191 SmtUtils]: Spent 323.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-10-07 13:36:00,613 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 12 proven. 120 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-10-07 13:36:00,613 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 13:36:00,614 INFO L162 IcfgInterpreter]: Started Sifa with 15 locations of interest [2019-10-07 13:36:00,614 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 13:36:00,615 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 13:36:00,615 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 13:36:00,615 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 13:36:00,634 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 13:36:00,679 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:36:00,692 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:36:00,752 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:36:00,861 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 15 for LOIs [2019-10-07 13:36:00,886 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 13:36:00,888 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 13:36:00,888 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 13:36:00,889 INFO L193 IcfgInterpreter]: Reachable states at location L12 satisfy 176#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (= |#NULL.offset| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (= |#NULL.offset| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 0 |#NULL.base|) (<= 0 __VERIFIER_assert_~cond) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 13:36:00,889 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 185#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 13:36:00,889 INFO L193 IcfgInterpreter]: Reachable states at location L11 satisfy 161#(and (or (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond))) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-07 13:36:00,889 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertEXIT satisfy 171#(and (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 1 __VERIFIER_assert_~cond) (<= 0 |#NULL.base|) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 13:36:00,889 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 181#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (= |#NULL.offset| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (= |#NULL.offset| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 0 |#NULL.base|) (<= 0 __VERIFIER_assert_~cond) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 13:36:00,889 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 13:36:00,889 INFO L193 IcfgInterpreter]: Reachable states at location L30-3 satisfy 151#(or (exists ((|v_main_#t~mem4_81| Int)) (and (= |#NULL.base| 0) (= |main_~#array~0.offset| 0) (<= |main_~#array~0.offset| 0) (<= 1 main_~index~0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (< (mod (+ main_~index~0 4294967295) 4294967296) (mod |v_main_#t~mem4_81| 4294967296)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |main_~#array~0.offset|))) (and (= |#NULL.base| 0) (= |main_~#array~0.offset| 0) (<= |main_~#array~0.offset| 0) (<= |#NULL.base| 0) (= 0 main_~index~0) (<= 0 |#NULL.base|) (<= 0 main_~index~0) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |main_~#array~0.offset|) (<= main_~index~0 0))) [2019-10-07 13:36:00,890 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 13:36:00,890 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 190#(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 13:36:00,890 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 13:36:00,890 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 156#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (and (= |#NULL.base| 0) (= |__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|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) [2019-10-07 13:36:00,890 INFO L193 IcfgInterpreter]: Reachable states at location L31-1 satisfy 142#(and (= |#NULL.base| 0) (= |main_~#array~0.offset| 0) (<= |main_~#array~0.offset| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= 0 main_~index~0) (= |#NULL.offset| 0) (< (mod main_~index~0 4294967296) (mod |main_#t~mem4| 4294967296)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |main_~#array~0.offset|)) [2019-10-07 13:36:00,890 INFO L193 IcfgInterpreter]: Reachable states at location L11-2 satisfy 166#(and (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 1 __VERIFIER_assert_~cond) (<= 0 |#NULL.base|) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 13:36:00,890 INFO L193 IcfgInterpreter]: Reachable states at location L31 satisfy 130#(and (= |#NULL.base| 0) (= |main_~#array~0.offset| 0) (<= |main_~#array~0.offset| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= 0 main_~index~0) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |main_~#array~0.offset|)) [2019-10-07 13:36:00,891 INFO L193 IcfgInterpreter]: Reachable states at location L24-3 satisfy 74#(and (or (and (= |#NULL.base| 0) (= |main_~#array~0.offset| 0) (<= |main_~#array~0.offset| 0) (= |#NULL.offset| 0)) (and (= 0 |#NULL.base|) (= 0 |main_~#array~0.offset|) (= (select |old(#valid)| |main_~#array~0.base|) 0) (< |main_~#array~0.base| |#StackHeapBarrier|) (= |#valid| (store |old(#valid)| |main_~#array~0.base| 1)) (= 0 (select |old(#valid)| 0)) (not (= |main_~#array~0.base| 0)) (<= |main_~#array~0.offset| 0) (= (store |old(#length)| |main_~#array~0.base| 40000) |#length|) (= 0 main_~index~0) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (<= main_~index~0 0))) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= 0 main_~index~0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |main_~#array~0.offset|)) [2019-10-07 13:36:02,238 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 13:36:02,238 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 21, 20, 11] total 56 [2019-10-07 13:36:02,239 INFO L442 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-10-07 13:36:02,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-10-07 13:36:02,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=2878, Unknown=0, NotChecked=0, Total=3080 [2019-10-07 13:36:02,240 INFO L87 Difference]: Start difference. First operand 57 states and 64 transitions. Second operand 56 states. [2019-10-07 13:36:27,518 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 47 [2019-10-07 13:36:27,721 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2019-10-07 13:36:32,902 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 32 [2019-10-07 13:36:33,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:36:33,289 INFO L93 Difference]: Finished difference Result 116 states and 136 transitions. [2019-10-07 13:36:33,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-10-07 13:36:33,290 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 65 [2019-10-07 13:36:33,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:36:33,291 INFO L225 Difference]: With dead ends: 116 [2019-10-07 13:36:33,292 INFO L226 Difference]: Without dead ends: 77 [2019-10-07 13:36:33,295 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 131 SyntacticMatches, 29 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 2440 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=775, Invalid=8537, Unknown=0, NotChecked=0, Total=9312 [2019-10-07 13:36:33,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-10-07 13:36:33,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 56. [2019-10-07 13:36:33,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-10-07 13:36:33,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 62 transitions. [2019-10-07 13:36:33,318 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 62 transitions. Word has length 65 [2019-10-07 13:36:33,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:36:33,319 INFO L462 AbstractCegarLoop]: Abstraction has 56 states and 62 transitions. [2019-10-07 13:36:33,319 INFO L463 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-10-07 13:36:33,319 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 62 transitions. [2019-10-07 13:36:33,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-10-07 13:36:33,320 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:36:33,320 INFO L385 BasicCegarLoop]: trace histogram [13, 8, 8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:36:33,522 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:36:33,523 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:36:33,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:36:33,524 INFO L82 PathProgramCache]: Analyzing trace with hash -1408226720, now seen corresponding path program 8 times [2019-10-07 13:36:33,524 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:36:33,524 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:36:33,525 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:36:33,525 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:36:33,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:36:33,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:36:33,800 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 14 proven. 91 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2019-10-07 13:36:33,800 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:36:33,801 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 13:36:33,801 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 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true