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-industry-pattern/nested-3.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-07 13:39:08,264 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-07 13:39:08,267 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-07 13:39:08,285 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-07 13:39:08,286 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-07 13:39:08,288 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-07 13:39:08,290 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-07 13:39:08,301 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-07 13:39:08,303 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-07 13:39:08,304 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-07 13:39:08,305 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-07 13:39:08,307 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-07 13:39:08,307 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-07 13:39:08,310 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-07 13:39:08,313 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-07 13:39:08,315 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-07 13:39:08,316 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-07 13:39:08,320 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-07 13:39:08,321 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-07 13:39:08,326 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-07 13:39:08,327 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-07 13:39:08,329 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-07 13:39:08,330 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-07 13:39:08,331 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-07 13:39:08,335 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-07 13:39:08,336 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-07 13:39:08,336 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-07 13:39:08,338 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-07 13:39:08,339 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-07 13:39:08,341 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-07 13:39:08,341 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-07 13:39:08,342 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-07 13:39:08,342 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-07 13:39:08,343 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-07 13:39:08,345 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-07 13:39:08,345 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-07 13:39:08,345 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-07 13:39:08,346 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-07 13:39:08,346 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-07 13:39:08,347 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-07 13:39:08,349 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-07 13:39:08,350 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:39:08,371 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-07 13:39:08,371 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-07 13:39:08,373 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-07 13:39:08,373 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-07 13:39:08,373 INFO L138 SettingsManager]: * Use SBE=true [2019-10-07 13:39:08,374 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-07 13:39:08,374 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-07 13:39:08,374 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-07 13:39:08,374 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-07 13:39:08,374 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-07 13:39:08,375 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-07 13:39:08,376 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-07 13:39:08,376 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-07 13:39:08,376 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-07 13:39:08,377 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-07 13:39:08,377 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-07 13:39:08,377 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-07 13:39:08,377 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-07 13:39:08,377 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-07 13:39:08,377 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-07 13:39:08,378 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-07 13:39:08,378 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 13:39:08,378 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-07 13:39:08,378 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-07 13:39:08,378 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-07 13:39:08,379 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-07 13:39:08,379 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-07 13:39:08,379 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-07 13:39:08,379 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:39:08,668 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-07 13:39:08,680 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-07 13:39:08,684 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-07 13:39:08,685 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-07 13:39:08,685 INFO L275 PluginConnector]: CDTParser initialized [2019-10-07 13:39:08,686 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-industry-pattern/nested-3.c [2019-10-07 13:39:08,743 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ffc523a84/ef5a02b61990498d9875808805a29144/FLAGb423c8537 [2019-10-07 13:39:09,153 INFO L306 CDTParser]: Found 1 translation units. [2019-10-07 13:39:09,156 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-industry-pattern/nested-3.c [2019-10-07 13:39:09,162 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ffc523a84/ef5a02b61990498d9875808805a29144/FLAGb423c8537 [2019-10-07 13:39:09,553 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ffc523a84/ef5a02b61990498d9875808805a29144 [2019-10-07 13:39:09,562 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-07 13:39:09,564 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-07 13:39:09,565 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-07 13:39:09,565 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-07 13:39:09,568 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-07 13:39:09,569 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 01:39:09" (1/1) ... [2019-10-07 13:39:09,572 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a3d015c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:39:09, skipping insertion in model container [2019-10-07 13:39:09,572 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 01:39:09" (1/1) ... [2019-10-07 13:39:09,579 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-07 13:39:09,598 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-07 13:39:09,833 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 13:39:09,844 INFO L188 MainTranslator]: Completed pre-run [2019-10-07 13:39:09,866 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 13:39:09,882 INFO L192 MainTranslator]: Completed translation [2019-10-07 13:39:09,883 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:39:09 WrapperNode [2019-10-07 13:39:09,884 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-07 13:39:09,885 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-07 13:39:09,885 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-07 13:39:09,885 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-07 13:39:09,988 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:39:09" (1/1) ... [2019-10-07 13:39:09,988 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:39:09" (1/1) ... [2019-10-07 13:39:09,993 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:39:09" (1/1) ... [2019-10-07 13:39:09,994 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:39:09" (1/1) ... [2019-10-07 13:39:09,997 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:39:09" (1/1) ... [2019-10-07 13:39:10,002 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:39:09" (1/1) ... [2019-10-07 13:39:10,003 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:39:09" (1/1) ... [2019-10-07 13:39:10,005 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-07 13:39:10,005 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-07 13:39:10,005 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-07 13:39:10,005 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-07 13:39:10,006 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:39:09" (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:39:10,068 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-07 13:39:10,068 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-07 13:39:10,069 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-07 13:39:10,069 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-07 13:39:10,069 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-07 13:39:10,069 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-07 13:39:10,069 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-07 13:39:10,069 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-07 13:39:10,069 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-07 13:39:10,070 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-07 13:39:10,408 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-07 13:39:10,409 INFO L284 CfgBuilder]: Removed 2 assume(true) statements. [2019-10-07 13:39:10,410 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 01:39:10 BoogieIcfgContainer [2019-10-07 13:39:10,410 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-07 13:39:10,411 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-07 13:39:10,411 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-07 13:39:10,414 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-07 13:39:10,414 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.10 01:39:09" (1/3) ... [2019-10-07 13:39:10,415 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2947f9c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 01:39:10, skipping insertion in model container [2019-10-07 13:39:10,415 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:39:09" (2/3) ... [2019-10-07 13:39:10,416 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2947f9c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 01:39:10, skipping insertion in model container [2019-10-07 13:39:10,416 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 01:39:10" (3/3) ... [2019-10-07 13:39:10,417 INFO L109 eAbstractionObserver]: Analyzing ICFG nested-3.c [2019-10-07 13:39:10,426 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-07 13:39:10,433 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-07 13:39:10,443 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-07 13:39:10,464 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-07 13:39:10,465 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-07 13:39:10,465 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-07 13:39:10,465 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-07 13:39:10,465 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-07 13:39:10,465 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-07 13:39:10,465 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-07 13:39:10,466 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-07 13:39:10,482 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2019-10-07 13:39:10,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-10-07 13:39:10,487 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:39:10,488 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:39:10,490 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:39:10,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:39:10,496 INFO L82 PathProgramCache]: Analyzing trace with hash 254027471, now seen corresponding path program 1 times [2019-10-07 13:39:10,505 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:39:10,505 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:39:10,505 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:39:10,505 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:39:10,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:39:10,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:39:10,663 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:39:10,664 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:39:10,664 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:39:10,665 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 13:39:10,667 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 13:39:10,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 13:39:10,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 13:39:10,680 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 3 states. [2019-10-07 13:39:10,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:39:10,724 INFO L93 Difference]: Finished difference Result 28 states and 36 transitions. [2019-10-07 13:39:10,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 13:39:10,726 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-10-07 13:39:10,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:39:10,734 INFO L225 Difference]: With dead ends: 28 [2019-10-07 13:39:10,735 INFO L226 Difference]: Without dead ends: 16 [2019-10-07 13:39:10,738 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:39:10,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-10-07 13:39:10,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2019-10-07 13:39:10,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-10-07 13:39:10,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2019-10-07 13:39:10,776 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 11 [2019-10-07 13:39:10,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:39:10,776 INFO L462 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2019-10-07 13:39:10,776 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 13:39:10,777 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2019-10-07 13:39:10,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-07 13:39:10,777 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:39:10,778 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:39:10,778 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:39:10,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:39:10,779 INFO L82 PathProgramCache]: Analyzing trace with hash -875331670, now seen corresponding path program 1 times [2019-10-07 13:39:10,779 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:39:10,779 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:39:10,780 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:39:10,780 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:39:10,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:39:10,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:39:10,837 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:39:10,838 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:39:10,838 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 13:39:10,838 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:39:10,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:39:10,886 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-07 13:39:10,892 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 13:39:10,911 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:39:10,912 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 13:39:10,951 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:39:10,952 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 13:39:10,976 INFO L162 IcfgInterpreter]: Started Sifa with 12 locations of interest [2019-10-07 13:39:10,976 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 13:39:10,982 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 13:39:10,990 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 13:39:10,991 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 13:39:11,089 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 6 for LOIs [2019-10-07 13:39:11,448 WARN L222 IntervalDomain]: Interval conversion did not stabilize in 7 iterations. Over-approximation may be very coarse. [2019-10-07 13:39:11,489 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 37 for LOIs [2019-10-07 13:39:11,581 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 3 for LOIs [2019-10-07 13:39:11,587 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 13:39:11,588 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 13:39:11,588 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (<= ~last~0 0) (<= 0 ~last~0) (= ~last~0 0)) [2019-10-07 13:39:11,588 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (<= ~last~0 0) (<= 0 ~last~0) (= ~last~0 |old(~last~0)|) (<= |old(~last~0)| 0) (<= 0 |old(~last~0)|) (= |old(~last~0)| 0)) [2019-10-07 13:39:11,589 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 107#(and (<= ~last~0 0) (<= 0 ~last~0) (= ~last~0 0)) [2019-10-07 13:39:11,589 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 13:39:11,590 INFO L193 IcfgInterpreter]: Reachable states at location L28 satisfy 38#(and (<= 0 main_~b~0) (<= 0 main_~a~0) (<= ~last~0 2147483647) (<= 0 |old(~last~0)|) (<= 0 main_~st~0) (= 0 main_~st~0) (<= main_~st~0 0) (= main_~b~0 0) (<= main_~c~0 0) (= main_~c~0 0) (<= 0 main_~c~0) (= main_~a~0 0) (<= 0 (+ ~last~0 2147483648)) (<= main_~a~0 0) (<= |old(~last~0)| 0) (<= main_~b~0 0) (= |old(~last~0)| 0)) [2019-10-07 13:39:11,590 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 102#(= ~last~0 |old(~last~0)|) [2019-10-07 13:39:11,590 INFO L193 IcfgInterpreter]: Reachable states at location L11 satisfy 93#(and (<= __VERIFIER_assert_~cond 0) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 (+ ~last~0 2147483648)) (<= ~last~0 2147483647) (<= 0 __VERIFIER_assert_~cond)) [2019-10-07 13:39:11,591 INFO L193 IcfgInterpreter]: Reachable states at location L21-3 satisfy 66#(and (<= 0 main_~b~0) (<= 0 main_~a~0) (<= ~last~0 2147483647) (<= 0 |old(~last~0)|) (<= main_~st~0 1) (= main_~b~0 0) (<= 0 main_~c~0) (= main_~a~0 0) (<= 0 (+ ~last~0 2147483648)) (<= main_~a~0 0) (<= |old(~last~0)| 0) (<= main_~b~0 0) (= |old(~last~0)| 0)) [2019-10-07 13:39:11,591 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 83#(and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (+ ~last~0 2147483648)) (<= ~last~0 2147483647)) (and (= |__VERIFIER_assert_#in~cond| 0) (<= 0 (+ ~last~0 2147483648)) (<= ~last~0 2147483647)))) [2019-10-07 13:39:11,591 INFO L193 IcfgInterpreter]: Reachable states at location L10 satisfy 88#(and (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))) (<= 0 |__VERIFIER_assert_#in~cond|) (<= 0 (+ ~last~0 2147483648)) (<= ~last~0 2147483647) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1) (<= 0 __VERIFIER_assert_~cond)) [2019-10-07 13:39:11,592 INFO L193 IcfgInterpreter]: Reachable states at location L26-1 satisfy 78#(and (<= main_~b~0 3) (<= 2 main_~b~0) (<= 200000 main_~c~0) (<= 0 (+ ~last~0 2147483648)) (<= main_~a~0 4) (<= ~last~0 2147483647) (<= |old(~last~0)| 0) (<= 2 main_~a~0) (<= 0 |old(~last~0)|) (= |old(~last~0)| 0) (<= main_~st~0 1)) [2019-10-07 13:39:11,593 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 98#(and (<= __VERIFIER_assert_~cond 0) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 (+ ~last~0 2147483648)) (<= ~last~0 2147483647) (<= 0 __VERIFIER_assert_~cond)) [2019-10-07 13:39:11,963 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 13:39:11,963 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 9] total 15 [2019-10-07 13:39:11,965 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-07 13:39:11,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-07 13:39:11,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2019-10-07 13:39:11,967 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 15 states. [2019-10-07 13:39:12,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:39:12,322 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2019-10-07 13:39:12,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-07 13:39:12,323 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 12 [2019-10-07 13:39:12,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:39:12,324 INFO L225 Difference]: With dead ends: 42 [2019-10-07 13:39:12,325 INFO L226 Difference]: Without dead ends: 32 [2019-10-07 13:39:12,327 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=93, Invalid=369, Unknown=0, NotChecked=0, Total=462 [2019-10-07 13:39:12,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-10-07 13:39:12,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 18. [2019-10-07 13:39:12,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-10-07 13:39:12,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2019-10-07 13:39:12,338 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 12 [2019-10-07 13:39:12,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:39:12,339 INFO L462 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2019-10-07 13:39:12,340 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-07 13:39:12,340 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2019-10-07 13:39:12,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-07 13:39:12,341 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:39:12,341 INFO L385 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:39:12,554 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:39:12,555 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:39:12,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:39:12,555 INFO L82 PathProgramCache]: Analyzing trace with hash 1822492047, now seen corresponding path program 2 times [2019-10-07 13:39:12,555 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:39:12,556 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:39:12,556 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:39:12,556 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:39:12,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:39:12,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:39:12,650 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:39:12,650 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:39:12,651 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 13:39:12,651 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:39:12,694 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-07 13:39:12,694 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-07 13:39:12,696 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-07 13:39:12,697 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 13:39:12,702 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:39:12,702 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 13:39:12,785 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:39:12,785 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 13:39:12,786 INFO L162 IcfgInterpreter]: Started Sifa with 12 locations of interest [2019-10-07 13:39:12,787 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 13:39:12,787 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 13:39:12,787 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 13:39:12,788 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 13:39:12,811 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 6 for LOIs [2019-10-07 13:39:12,943 WARN L222 IntervalDomain]: Interval conversion did not stabilize in 7 iterations. Over-approximation may be very coarse. [2019-10-07 13:39:12,963 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 13 for LOIs [2019-10-07 13:39:12,989 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 3 for LOIs [2019-10-07 13:39:12,992 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 13:39:12,993 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 13:39:12,993 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (<= ~last~0 0) (<= 0 ~last~0) (= ~last~0 0)) [2019-10-07 13:39:12,993 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (<= ~last~0 0) (<= 0 ~last~0) (= ~last~0 |old(~last~0)|) (<= |old(~last~0)| 0) (<= 0 |old(~last~0)|) (= |old(~last~0)| 0)) [2019-10-07 13:39:12,994 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 107#(and (<= ~last~0 0) (<= 0 ~last~0) (= ~last~0 0)) [2019-10-07 13:39:12,995 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 13:39:12,995 INFO L193 IcfgInterpreter]: Reachable states at location L28 satisfy 38#(and (<= 0 main_~b~0) (<= 0 main_~a~0) (<= ~last~0 2147483647) (<= 0 |old(~last~0)|) (<= 0 main_~st~0) (= 0 main_~st~0) (<= main_~st~0 0) (= main_~b~0 0) (<= main_~c~0 0) (= main_~c~0 0) (<= 0 main_~c~0) (= main_~a~0 0) (<= 0 (+ ~last~0 2147483648)) (<= main_~a~0 0) (<= |old(~last~0)| 0) (<= main_~b~0 0) (= |old(~last~0)| 0)) [2019-10-07 13:39:12,996 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 102#(= ~last~0 |old(~last~0)|) [2019-10-07 13:39:12,996 INFO L193 IcfgInterpreter]: Reachable states at location L11 satisfy 93#(and (<= __VERIFIER_assert_~cond 0) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 (+ ~last~0 2147483648)) (<= ~last~0 2147483647) (<= 0 __VERIFIER_assert_~cond)) [2019-10-07 13:39:12,996 INFO L193 IcfgInterpreter]: Reachable states at location L21-3 satisfy 66#(and (<= 0 main_~b~0) (<= 0 main_~a~0) (<= ~last~0 2147483647) (<= 0 |old(~last~0)|) (<= main_~st~0 1) (= main_~b~0 0) (<= 0 main_~c~0) (= main_~a~0 0) (<= 0 (+ ~last~0 2147483648)) (<= main_~a~0 0) (<= |old(~last~0)| 0) (<= main_~b~0 0) (= |old(~last~0)| 0)) [2019-10-07 13:39:12,997 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 83#(and (or (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0)) (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (+ ~last~0 2147483648)) (<= ~last~0 2147483647)) (and (= |__VERIFIER_assert_#in~cond| 0) (<= 0 (+ ~last~0 2147483648)) (<= ~last~0 2147483647)))) [2019-10-07 13:39:12,997 INFO L193 IcfgInterpreter]: Reachable states at location L10 satisfy 88#(and (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))) (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 (+ ~last~0 2147483648)) (<= ~last~0 2147483647) (<= 0 __VERIFIER_assert_~cond)) (and (<= 0 (+ ~last~0 2147483648)) (<= 1 __VERIFIER_assert_~cond) (<= ~last~0 2147483647) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1)))) [2019-10-07 13:39:12,997 INFO L193 IcfgInterpreter]: Reachable states at location L26-1 satisfy 78#(and (<= main_~b~0 3) (<= 2 main_~b~0) (<= 200000 main_~c~0) (<= 0 (+ ~last~0 2147483648)) (<= main_~a~0 4) (<= ~last~0 2147483647) (<= |old(~last~0)| 0) (<= 2 main_~a~0) (<= 0 |old(~last~0)|) (= |old(~last~0)| 0) (<= main_~st~0 1)) [2019-10-07 13:39:12,998 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 98#(and (<= __VERIFIER_assert_~cond 0) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 (+ ~last~0 2147483648)) (<= ~last~0 2147483647) (<= 0 __VERIFIER_assert_~cond)) [2019-10-07 13:39:13,362 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 13:39:13,363 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7, 9] total 21 [2019-10-07 13:39:13,364 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-10-07 13:39:13,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-10-07 13:39:13,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-10-07 13:39:13,365 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 21 states. [2019-10-07 13:39:13,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:39:13,916 INFO L93 Difference]: Finished difference Result 57 states and 72 transitions. [2019-10-07 13:39:13,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-10-07 13:39:13,917 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 15 [2019-10-07 13:39:13,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:39:13,918 INFO L225 Difference]: With dead ends: 57 [2019-10-07 13:39:13,918 INFO L226 Difference]: Without dead ends: 44 [2019-10-07 13:39:13,921 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 262 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=258, Invalid=864, Unknown=0, NotChecked=0, Total=1122 [2019-10-07 13:39:13,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-10-07 13:39:13,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 24. [2019-10-07 13:39:13,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-10-07 13:39:13,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2019-10-07 13:39:13,931 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 15 [2019-10-07 13:39:13,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:39:13,933 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2019-10-07 13:39:13,933 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-10-07 13:39:13,933 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2019-10-07 13:39:13,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-07 13:39:13,934 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:39:13,935 INFO L385 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:39:14,139 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:39:14,139 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:39:14,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:39:14,140 INFO L82 PathProgramCache]: Analyzing trace with hash 995770287, now seen corresponding path program 3 times [2019-10-07 13:39:14,141 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:39:14,141 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:39:14,141 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:39:14,142 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:39:14,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:39:14,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:39:14,280 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:39:14,281 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:39:14,281 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 13:39:14,281 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:39:14,331 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-07 13:39:14,331 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-07 13:39:14,332 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-07 13:39:14,335 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 13:39:14,346 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:39:14,346 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 13:39:14,587 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:39:14,587 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 13:39:14,589 INFO L162 IcfgInterpreter]: Started Sifa with 12 locations of interest [2019-10-07 13:39:14,589 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 13:39:14,590 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 13:39:14,590 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 13:39:14,590 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 13:39:14,612 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 6 for LOIs [2019-10-07 13:39:14,774 WARN L222 IntervalDomain]: Interval conversion did not stabilize in 7 iterations. Over-approximation may be very coarse. [2019-10-07 13:39:14,793 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 13 for LOIs [2019-10-07 13:39:14,827 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 3 for LOIs [2019-10-07 13:39:14,836 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 13:39:14,837 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 13:39:14,837 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (<= ~last~0 0) (<= 0 ~last~0) (= ~last~0 0)) [2019-10-07 13:39:14,837 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (<= ~last~0 0) (<= 0 ~last~0) (= ~last~0 |old(~last~0)|) (<= |old(~last~0)| 0) (<= 0 |old(~last~0)|) (= |old(~last~0)| 0)) [2019-10-07 13:39:14,838 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 122#(and (<= ~last~0 0) (<= 0 ~last~0) (= ~last~0 0)) [2019-10-07 13:39:14,838 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 13:39:14,838 INFO L193 IcfgInterpreter]: Reachable states at location L28 satisfy 38#(and (<= 0 main_~b~0) (<= 0 main_~a~0) (<= ~last~0 2147483647) (<= 0 |old(~last~0)|) (<= 0 main_~st~0) (= 0 main_~st~0) (<= main_~st~0 0) (= main_~b~0 0) (<= main_~c~0 0) (= main_~c~0 0) (<= 0 main_~c~0) (= main_~a~0 0) (<= 0 (+ ~last~0 2147483648)) (<= main_~a~0 0) (<= |old(~last~0)| 0) (<= main_~b~0 0) (= |old(~last~0)| 0)) [2019-10-07 13:39:14,841 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 117#(= ~last~0 |old(~last~0)|) [2019-10-07 13:39:14,842 INFO L193 IcfgInterpreter]: Reachable states at location L11 satisfy 108#(and (<= __VERIFIER_assert_~cond 0) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 (+ ~last~0 2147483648)) (<= ~last~0 2147483647) (<= 0 __VERIFIER_assert_~cond)) [2019-10-07 13:39:14,842 INFO L193 IcfgInterpreter]: Reachable states at location L21-3 satisfy 81#(and (or (and (<= 0 main_~st~0) (= main_~b~0 0) (= main_~a~0 0) (= |old(~last~0)| 0)) (and (= 1 main_~st~0) (= main_~b~0 0) (= main_~c~0 0) (= main_~a~0 0) (= |old(~last~0)| 0))) (or (and (<= 0 main_~b~0) (<= 0 main_~c~0) (<= 0 (+ ~last~0 2147483648)) (<= main_~a~0 0) (<= 0 main_~a~0) (<= ~last~0 2147483647) (<= |old(~last~0)| 0) (<= main_~b~0 0) (<= 0 |old(~last~0)|) (<= 0 main_~st~0) (<= main_~st~0 1)) (and (<= 0 main_~b~0) (<= main_~c~0 0) (<= 0 main_~c~0) (<= 0 (+ ~last~0 2147483648)) (<= main_~a~0 0) (<= 1 main_~st~0) (<= 0 main_~a~0) (<= ~last~0 2147483647) (<= |old(~last~0)| 0) (<= main_~b~0 0) (<= 0 |old(~last~0)|) (<= main_~st~0 1)))) [2019-10-07 13:39:14,842 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 98#(and (or (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0)) (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (+ ~last~0 2147483648)) (<= ~last~0 2147483647)) (and (= |__VERIFIER_assert_#in~cond| 0) (<= 0 (+ ~last~0 2147483648)) (<= ~last~0 2147483647)))) [2019-10-07 13:39:14,843 INFO L193 IcfgInterpreter]: Reachable states at location L10 satisfy 103#(and (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))) (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 (+ ~last~0 2147483648)) (<= ~last~0 2147483647) (<= 0 __VERIFIER_assert_~cond)) (and (<= 0 (+ ~last~0 2147483648)) (<= 1 __VERIFIER_assert_~cond) (<= ~last~0 2147483647) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1)))) [2019-10-07 13:39:14,843 INFO L193 IcfgInterpreter]: Reachable states at location L26-1 satisfy 93#(and (<= main_~b~0 3) (<= 2 main_~b~0) (<= 200000 main_~c~0) (<= 0 (+ ~last~0 2147483648)) (<= main_~a~0 4) (<= ~last~0 2147483647) (<= |old(~last~0)| 0) (<= 2 main_~a~0) (<= 0 |old(~last~0)|) (<= 0 main_~st~0) (= |old(~last~0)| 0) (<= main_~st~0 1)) [2019-10-07 13:39:14,843 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 113#(and (<= __VERIFIER_assert_~cond 0) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 (+ ~last~0 2147483648)) (<= ~last~0 2147483647) (<= 0 __VERIFIER_assert_~cond)) [2019-10-07 13:39:15,218 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 13:39:15,218 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13, 9] total 33 [2019-10-07 13:39:15,219 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-10-07 13:39:15,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-10-07 13:39:15,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=322, Invalid=734, Unknown=0, NotChecked=0, Total=1056 [2019-10-07 13:39:15,222 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 33 states. [2019-10-07 13:39:16,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:39:16,295 INFO L93 Difference]: Finished difference Result 87 states and 114 transitions. [2019-10-07 13:39:16,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-10-07 13:39:16,295 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 21 [2019-10-07 13:39:16,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:39:16,297 INFO L225 Difference]: With dead ends: 87 [2019-10-07 13:39:16,297 INFO L226 Difference]: Without dead ends: 68 [2019-10-07 13:39:16,299 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 745 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=912, Invalid=2394, Unknown=0, NotChecked=0, Total=3306 [2019-10-07 13:39:16,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-10-07 13:39:16,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 36. [2019-10-07 13:39:16,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-10-07 13:39:16,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2019-10-07 13:39:16,309 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 21 [2019-10-07 13:39:16,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:39:16,309 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2019-10-07 13:39:16,310 INFO L463 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-10-07 13:39:16,310 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2019-10-07 13:39:16,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-10-07 13:39:16,311 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:39:16,311 INFO L385 BasicCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:39:16,515 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:39:16,515 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:39:16,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:39:16,516 INFO L82 PathProgramCache]: Analyzing trace with hash 580545519, now seen corresponding path program 4 times [2019-10-07 13:39:16,516 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:39:16,516 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:39:16,516 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:39:16,517 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:39:16,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:39:16,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:39:16,813 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:39:16,814 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:39:16,814 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 13:39:16,814 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:39:16,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:39:16,875 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 24 conjunts are in the unsatisfiable core [2019-10-07 13:39:16,877 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 13:39:16,887 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:39:16,888 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 13:39:17,598 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:39:17,598 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 13:39:17,600 INFO L162 IcfgInterpreter]: Started Sifa with 12 locations of interest [2019-10-07 13:39:17,600 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 13:39:17,600 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 13:39:17,601 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 13:39:17,601 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 13:39:17,629 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 6 for LOIs [2019-10-07 13:39:17,691 WARN L222 IntervalDomain]: Interval conversion did not stabilize in 7 iterations. Over-approximation may be very coarse. [2019-10-07 13:39:17,699 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-07 13:39:17,717 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 3 for LOIs [2019-10-07 13:39:17,719 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 13:39:17,719 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 13:39:17,720 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (<= ~last~0 0) (<= 0 ~last~0) (= ~last~0 0)) [2019-10-07 13:39:17,720 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (<= ~last~0 0) (<= 0 ~last~0) (= ~last~0 |old(~last~0)|) (<= |old(~last~0)| 0) (<= 0 |old(~last~0)|) (= |old(~last~0)| 0)) [2019-10-07 13:39:17,720 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 107#(and (<= ~last~0 0) (<= 0 ~last~0) (= ~last~0 0)) [2019-10-07 13:39:17,720 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 13:39:17,721 INFO L193 IcfgInterpreter]: Reachable states at location L28 satisfy 38#(and (<= 0 main_~b~0) (<= 0 main_~a~0) (<= ~last~0 2147483647) (<= 0 |old(~last~0)|) (<= 0 main_~st~0) (= 0 main_~st~0) (<= main_~st~0 0) (= main_~b~0 0) (<= main_~c~0 0) (= main_~c~0 0) (<= 0 main_~c~0) (<= 0 (+ ~last~0 2147483648)) (= main_~a~0 0) (<= main_~a~0 0) (<= |old(~last~0)| 0) (<= main_~b~0 0) (= |old(~last~0)| 0)) [2019-10-07 13:39:17,721 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 102#(= ~last~0 |old(~last~0)|) [2019-10-07 13:39:17,721 INFO L193 IcfgInterpreter]: Reachable states at location L11 satisfy 93#(and (<= __VERIFIER_assert_~cond 0) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 (+ ~last~0 2147483648)) (<= ~last~0 2147483647) (<= 0 __VERIFIER_assert_~cond)) [2019-10-07 13:39:17,721 INFO L193 IcfgInterpreter]: Reachable states at location L21-3 satisfy 66#(and (<= 0 main_~b~0) (<= 0 main_~a~0) (<= ~last~0 2147483647) (<= 0 |old(~last~0)|) (<= main_~st~0 1) (= main_~b~0 0) (<= 0 main_~c~0) (= main_~a~0 0) (<= 0 (+ ~last~0 2147483648)) (<= main_~a~0 0) (<= |old(~last~0)| 0) (<= main_~b~0 0) (= |old(~last~0)| 0)) [2019-10-07 13:39:17,721 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 83#(and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (+ ~last~0 2147483648)) (<= ~last~0 2147483647)) (and (= |__VERIFIER_assert_#in~cond| 0) (<= 0 (+ ~last~0 2147483648)) (<= ~last~0 2147483647)))) [2019-10-07 13:39:17,722 INFO L193 IcfgInterpreter]: Reachable states at location L10 satisfy 88#(and (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))) (<= 0 |__VERIFIER_assert_#in~cond|) (<= 0 (+ ~last~0 2147483648)) (<= ~last~0 2147483647) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1) (<= 0 __VERIFIER_assert_~cond)) [2019-10-07 13:39:17,722 INFO L193 IcfgInterpreter]: Reachable states at location L26-1 satisfy 78#(and (<= main_~b~0 3) (<= 2 main_~b~0) (<= 200000 main_~c~0) (<= 0 (+ ~last~0 2147483648)) (<= main_~a~0 4) (<= ~last~0 2147483647) (<= |old(~last~0)| 0) (<= 2 main_~a~0) (<= 0 |old(~last~0)|) (= |old(~last~0)| 0) (<= main_~st~0 1)) [2019-10-07 13:39:17,722 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 98#(and (<= __VERIFIER_assert_~cond 0) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 (+ ~last~0 2147483648)) (<= ~last~0 2147483647) (<= 0 __VERIFIER_assert_~cond)) [2019-10-07 13:39:18,095 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 13:39:18,095 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25, 9] total 57 [2019-10-07 13:39:18,097 INFO L442 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-10-07 13:39:18,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-10-07 13:39:18,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1198, Invalid=1994, Unknown=0, NotChecked=0, Total=3192 [2019-10-07 13:39:18,099 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand 57 states. [2019-10-07 13:39:20,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:39:20,890 INFO L93 Difference]: Finished difference Result 147 states and 198 transitions. [2019-10-07 13:39:20,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-10-07 13:39:20,890 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 33 [2019-10-07 13:39:20,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:39:20,892 INFO L225 Difference]: With dead ends: 147 [2019-10-07 13:39:20,892 INFO L226 Difference]: Without dead ends: 116 [2019-10-07 13:39:20,899 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2251 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=3516, Invalid=7614, Unknown=0, NotChecked=0, Total=11130 [2019-10-07 13:39:20,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-10-07 13:39:20,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 60. [2019-10-07 13:39:20,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-10-07 13:39:20,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 61 transitions. [2019-10-07 13:39:20,921 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 61 transitions. Word has length 33 [2019-10-07 13:39:20,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:39:20,922 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 61 transitions. [2019-10-07 13:39:20,922 INFO L463 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-10-07 13:39:20,922 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2019-10-07 13:39:20,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-07 13:39:20,927 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:39:20,927 INFO L385 BasicCegarLoop]: trace histogram [46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:39:21,130 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:39:21,131 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:39:21,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:39:21,132 INFO L82 PathProgramCache]: Analyzing trace with hash -800480145, now seen corresponding path program 5 times [2019-10-07 13:39:21,132 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:39:21,133 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:39:21,133 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:39:21,133 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:39:21,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:39:21,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:39:22,155 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:39:22,155 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:39:22,155 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 13:39:22,155 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:39:22,272 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2019-10-07 13:39:22,272 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-07 13:39:22,274 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 48 conjunts are in the unsatisfiable core [2019-10-07 13:39:22,278 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 13:39:22,313 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:39:22,313 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 13:39:24,696 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:39:24,696 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 13:39:24,697 INFO L162 IcfgInterpreter]: Started Sifa with 12 locations of interest [2019-10-07 13:39:24,697 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 13:39:24,698 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 13:39:24,698 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 13:39:24,698 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 13:39:24,724 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 6 for LOIs [2019-10-07 13:39:24,781 WARN L222 IntervalDomain]: Interval conversion did not stabilize in 7 iterations. Over-approximation may be very coarse. [2019-10-07 13:39:24,798 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 32 for LOIs [2019-10-07 13:39:24,821 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 3 for LOIs [2019-10-07 13:39:24,824 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 13:39:24,824 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 13:39:24,825 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (<= ~last~0 0) (<= 0 ~last~0) (= ~last~0 0)) [2019-10-07 13:39:24,825 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (<= ~last~0 0) (<= 0 ~last~0) (= ~last~0 |old(~last~0)|) (<= |old(~last~0)| 0) (<= 0 |old(~last~0)|) (= |old(~last~0)| 0)) [2019-10-07 13:39:24,826 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 107#(and (<= ~last~0 0) (<= 0 ~last~0) (= ~last~0 0)) [2019-10-07 13:39:24,826 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 13:39:24,826 INFO L193 IcfgInterpreter]: Reachable states at location L28 satisfy 38#(and (<= 0 main_~b~0) (<= 0 main_~a~0) (<= ~last~0 2147483647) (<= 0 |old(~last~0)|) (<= 0 main_~st~0) (= 0 main_~st~0) (<= main_~st~0 0) (= main_~b~0 0) (<= main_~c~0 0) (= main_~c~0 0) (<= 0 main_~c~0) (<= 0 (+ ~last~0 2147483648)) (= main_~a~0 0) (<= main_~a~0 0) (<= |old(~last~0)| 0) (<= main_~b~0 0) (= |old(~last~0)| 0)) [2019-10-07 13:39:24,827 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 102#(= ~last~0 |old(~last~0)|) [2019-10-07 13:39:24,827 INFO L193 IcfgInterpreter]: Reachable states at location L11 satisfy 93#(and (<= __VERIFIER_assert_~cond 0) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 (+ ~last~0 2147483648)) (<= ~last~0 2147483647) (<= 0 __VERIFIER_assert_~cond)) [2019-10-07 13:39:24,827 INFO L193 IcfgInterpreter]: Reachable states at location L21-3 satisfy 66#(and (<= 0 main_~b~0) (<= 0 main_~a~0) (<= ~last~0 2147483647) (<= 0 |old(~last~0)|) (<= main_~st~0 1) (= main_~b~0 0) (<= 0 main_~c~0) (= main_~a~0 0) (<= 0 (+ ~last~0 2147483648)) (<= main_~a~0 0) (<= |old(~last~0)| 0) (<= main_~b~0 0) (= |old(~last~0)| 0)) [2019-10-07 13:39:24,828 INFO L193 IcfgInterpreter]: Reachable states at location L10 satisfy 88#(and (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))) (<= 0 |__VERIFIER_assert_#in~cond|) (<= 0 (+ ~last~0 2147483648)) (<= ~last~0 2147483647) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1) (<= 0 __VERIFIER_assert_~cond)) [2019-10-07 13:39:24,828 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 83#(and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (+ ~last~0 2147483648)) (<= ~last~0 2147483647)) (and (= |__VERIFIER_assert_#in~cond| 0) (<= 0 (+ ~last~0 2147483648)) (<= ~last~0 2147483647)))) [2019-10-07 13:39:24,828 INFO L193 IcfgInterpreter]: Reachable states at location L26-1 satisfy 78#(and (<= main_~b~0 3) (<= 2 main_~b~0) (<= 200000 main_~c~0) (<= 0 (+ ~last~0 2147483648)) (<= main_~a~0 4) (<= ~last~0 2147483647) (<= |old(~last~0)| 0) (<= 2 main_~a~0) (<= 0 |old(~last~0)|) (= |old(~last~0)| 0) (<= main_~st~0 1)) [2019-10-07 13:39:24,831 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 98#(and (<= __VERIFIER_assert_~cond 0) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 (+ ~last~0 2147483648)) (<= ~last~0 2147483647) (<= 0 __VERIFIER_assert_~cond)) [2019-10-07 13:39:25,290 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 13:39:25,290 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49, 9] total 105 [2019-10-07 13:39:25,291 INFO L442 AbstractCegarLoop]: Interpolant automaton has 105 states [2019-10-07 13:39:25,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2019-10-07 13:39:25,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4678, Invalid=6242, Unknown=0, NotChecked=0, Total=10920 [2019-10-07 13:39:25,297 INFO L87 Difference]: Start difference. First operand 60 states and 61 transitions. Second operand 105 states. [2019-10-07 13:39:32,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:39:32,589 INFO L93 Difference]: Finished difference Result 267 states and 366 transitions. [2019-10-07 13:39:32,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 199 states. [2019-10-07 13:39:32,590 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 57 [2019-10-07 13:39:32,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:39:32,592 INFO L225 Difference]: With dead ends: 267 [2019-10-07 13:39:32,592 INFO L226 Difference]: Without dead ends: 212 [2019-10-07 13:39:32,601 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 316 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7423 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=13908, Invalid=26694, Unknown=0, NotChecked=0, Total=40602 [2019-10-07 13:39:32,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2019-10-07 13:39:32,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 108. [2019-10-07 13:39:32,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-10-07 13:39:32,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 109 transitions. [2019-10-07 13:39:32,622 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 109 transitions. Word has length 57 [2019-10-07 13:39:32,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:39:32,623 INFO L462 AbstractCegarLoop]: Abstraction has 108 states and 109 transitions. [2019-10-07 13:39:32,623 INFO L463 AbstractCegarLoop]: Interpolant automaton has 105 states. [2019-10-07 13:39:32,623 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 109 transitions. [2019-10-07 13:39:32,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-07 13:39:32,625 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:39:32,625 INFO L385 BasicCegarLoop]: trace histogram [94, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:39:32,825 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:39:32,826 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:39:32,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:39:32,827 INFO L82 PathProgramCache]: Analyzing trace with hash -1675389585, now seen corresponding path program 6 times [2019-10-07 13:39:32,827 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:39:32,828 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:39:32,828 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:39:32,828 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:39:32,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:39:32,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:39:36,161 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:39:36,162 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:39:36,162 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 13:39:36,162 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:39:36,281 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-07 13:39:36,281 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-07 13:39:36,284 INFO L256 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 96 conjunts are in the unsatisfiable core [2019-10-07 13:39:36,290 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 13:39:36,324 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:39:36,324 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 13:39:45,683 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:39:45,684 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 13:39:45,685 INFO L162 IcfgInterpreter]: Started Sifa with 12 locations of interest [2019-10-07 13:39:45,685 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 13:39:45,686 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 13:39:45,686 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 13:39:45,686 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 13:39:45,697 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 8 for LOIs [2019-10-07 13:39:45,781 WARN L222 IntervalDomain]: Interval conversion did not stabilize in 7 iterations. Over-approximation may be very coarse. [2019-10-07 13:39:45,794 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 13 for LOIs [2019-10-07 13:39:45,806 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 3 for LOIs [2019-10-07 13:39:45,808 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 13:39:45,808 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 13:39:45,808 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (<= ~last~0 0) (<= 0 ~last~0) (= ~last~0 0)) [2019-10-07 13:39:45,808 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (<= ~last~0 0) (<= 0 ~last~0) (= ~last~0 |old(~last~0)|) (<= |old(~last~0)| 0) (<= 0 |old(~last~0)|) (= |old(~last~0)| 0)) [2019-10-07 13:39:45,809 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 107#(and (<= ~last~0 0) (<= 0 ~last~0) (= ~last~0 0)) [2019-10-07 13:39:45,809 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 13:39:45,809 INFO L193 IcfgInterpreter]: Reachable states at location L28 satisfy 38#(and (<= 0 main_~b~0) (<= 0 main_~a~0) (<= ~last~0 2147483647) (<= 0 |old(~last~0)|) (<= 0 main_~st~0) (= 0 main_~st~0) (<= main_~st~0 0) (= main_~b~0 0) (<= main_~c~0 0) (= main_~c~0 0) (<= 0 main_~c~0) (<= 0 (+ ~last~0 2147483648)) (= main_~a~0 0) (<= main_~a~0 0) (<= |old(~last~0)| 0) (<= main_~b~0 0) (= |old(~last~0)| 0)) [2019-10-07 13:39:45,809 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 102#(= ~last~0 |old(~last~0)|) [2019-10-07 13:39:45,809 INFO L193 IcfgInterpreter]: Reachable states at location L21-3 satisfy 66#(and (<= 0 main_~b~0) (<= 0 main_~a~0) (<= ~last~0 2147483647) (<= 0 |old(~last~0)|) (<= main_~st~0 1) (= main_~b~0 0) (<= 0 main_~c~0) (= main_~a~0 0) (<= 0 (+ ~last~0 2147483648)) (<= main_~a~0 0) (<= |old(~last~0)| 0) (<= main_~b~0 0) (= |old(~last~0)| 0)) [2019-10-07 13:39:45,810 INFO L193 IcfgInterpreter]: Reachable states at location L11 satisfy 93#(and (<= __VERIFIER_assert_~cond 0) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 (+ ~last~0 2147483648)) (<= ~last~0 2147483647) (<= 0 __VERIFIER_assert_~cond)) [2019-10-07 13:39:45,810 INFO L193 IcfgInterpreter]: Reachable states at location L10 satisfy 88#(and (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))) (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 (+ ~last~0 2147483648)) (<= ~last~0 2147483647) (<= 0 __VERIFIER_assert_~cond)) (and (<= 0 (+ ~last~0 2147483648)) (<= 1 __VERIFIER_assert_~cond) (<= ~last~0 2147483647) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1)))) [2019-10-07 13:39:45,810 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 83#(and (or (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0)) (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (+ ~last~0 2147483648)) (<= ~last~0 2147483647)) (and (= |__VERIFIER_assert_#in~cond| 0) (<= 0 (+ ~last~0 2147483648)) (<= ~last~0 2147483647)))) [2019-10-07 13:39:45,810 INFO L193 IcfgInterpreter]: Reachable states at location L26-1 satisfy 78#(and (<= main_~b~0 3) (<= 2 main_~b~0) (<= 200000 main_~c~0) (<= 0 (+ ~last~0 2147483648)) (<= main_~a~0 4) (<= ~last~0 2147483647) (<= |old(~last~0)| 0) (<= 2 main_~a~0) (<= 0 |old(~last~0)|) (= |old(~last~0)| 0) (<= main_~st~0 1)) [2019-10-07 13:39:45,811 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 98#(and (<= __VERIFIER_assert_~cond 0) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 (+ ~last~0 2147483648)) (<= ~last~0 2147483647) (<= 0 __VERIFIER_assert_~cond)) [2019-10-07 13:39:46,455 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 13:39:46,455 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97, 97, 9] total 201 [2019-10-07 13:39:46,457 INFO L442 AbstractCegarLoop]: Interpolant automaton has 201 states [2019-10-07 13:39:46,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 201 interpolants. [2019-10-07 13:39:46,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18550, Invalid=21650, Unknown=0, NotChecked=0, Total=40200 [2019-10-07 13:39:46,462 INFO L87 Difference]: Start difference. First operand 108 states and 109 transitions. Second operand 201 states. [2019-10-07 13:40:12,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:40:12,076 INFO L93 Difference]: Finished difference Result 507 states and 702 transitions. [2019-10-07 13:40:12,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 391 states. [2019-10-07 13:40:12,077 INFO L78 Accepts]: Start accepts. Automaton has 201 states. Word has length 105 [2019-10-07 13:40:12,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:40:12,080 INFO L225 Difference]: With dead ends: 507 [2019-10-07 13:40:12,080 INFO L226 Difference]: Without dead ends: 404 [2019-10-07 13:40:12,085 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 604 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 392 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26407 ImplicationChecksByTransitivity, 36.8s TimeCoverageRelationStatistics Valid=55428, Invalid=99414, Unknown=0, NotChecked=0, Total=154842 [2019-10-07 13:40:12,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2019-10-07 13:40:12,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 204. [2019-10-07 13:40:12,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2019-10-07 13:40:12,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 205 transitions. [2019-10-07 13:40:12,114 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 205 transitions. Word has length 105 [2019-10-07 13:40:12,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:40:12,114 INFO L462 AbstractCegarLoop]: Abstraction has 204 states and 205 transitions. [2019-10-07 13:40:12,114 INFO L463 AbstractCegarLoop]: Interpolant automaton has 201 states. [2019-10-07 13:40:12,115 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 205 transitions. [2019-10-07 13:40:12,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-10-07 13:40:12,118 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:40:12,118 INFO L385 BasicCegarLoop]: trace histogram [190, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:40:12,322 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:40:12,322 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:40:12,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:40:12,323 INFO L82 PathProgramCache]: Analyzing trace with hash -742033553, now seen corresponding path program 7 times [2019-10-07 13:40:12,324 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:40:12,324 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:40:12,324 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:40:12,324 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:40:12,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:40:12,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:40:24,896 INFO L134 CoverageAnalysis]: Checked inductivity of 18145 backedges. 0 proven. 18145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:40:24,896 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:40:24,897 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 13:40:24,897 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:40:25,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:40:25,114 INFO L256 TraceCheckSpWp]: Trace formula consists of 803 conjuncts, 192 conjunts are in the unsatisfiable core [2019-10-07 13:40:25,123 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 13:40:25,206 INFO L134 CoverageAnalysis]: Checked inductivity of 18145 backedges. 0 proven. 18145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:40:25,207 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 13:41:02,521 INFO L134 CoverageAnalysis]: Checked inductivity of 18145 backedges. 0 proven. 18145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:41:02,521 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 13:41:02,523 INFO L162 IcfgInterpreter]: Started Sifa with 12 locations of interest [2019-10-07 13:41:02,523 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 13:41:02,523 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 13:41:02,523 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 13:41:02,524 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 13:41:02,539 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 6 for LOIs [2019-10-07 13:41:02,593 WARN L222 IntervalDomain]: Interval conversion did not stabilize in 7 iterations. Over-approximation may be very coarse. [2019-10-07 13:41:02,600 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 32 for LOIs [2019-10-07 13:41:02,614 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 3 for LOIs [2019-10-07 13:41:02,616 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 13:41:02,616 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 13:41:02,616 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (<= ~last~0 0) (<= 0 ~last~0) (= ~last~0 0)) [2019-10-07 13:41:02,616 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (<= ~last~0 0) (<= 0 ~last~0) (= ~last~0 |old(~last~0)|) (<= |old(~last~0)| 0) (<= 0 |old(~last~0)|) (= |old(~last~0)| 0)) [2019-10-07 13:41:02,616 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 107#(and (<= ~last~0 0) (<= 0 ~last~0) (= ~last~0 0)) [2019-10-07 13:41:02,617 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 13:41:02,617 INFO L193 IcfgInterpreter]: Reachable states at location L28 satisfy 38#(and (<= 0 main_~b~0) (<= 0 main_~a~0) (<= ~last~0 2147483647) (<= 0 |old(~last~0)|) (<= 0 main_~st~0) (= 0 main_~st~0) (<= main_~st~0 0) (= main_~b~0 0) (<= main_~c~0 0) (= main_~c~0 0) (<= 0 main_~c~0) (= main_~a~0 0) (<= 0 (+ ~last~0 2147483648)) (<= main_~a~0 0) (<= |old(~last~0)| 0) (<= main_~b~0 0) (= |old(~last~0)| 0)) [2019-10-07 13:41:02,617 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 102#(= ~last~0 |old(~last~0)|) [2019-10-07 13:41:02,617 INFO L193 IcfgInterpreter]: Reachable states at location L11 satisfy 93#(and (<= __VERIFIER_assert_~cond 0) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 (+ ~last~0 2147483648)) (<= ~last~0 2147483647) (<= 0 __VERIFIER_assert_~cond)) [2019-10-07 13:41:02,617 INFO L193 IcfgInterpreter]: Reachable states at location L21-3 satisfy 66#(and (<= 0 main_~b~0) (<= 0 main_~a~0) (<= ~last~0 2147483647) (<= 0 |old(~last~0)|) (<= main_~st~0 1) (= main_~b~0 0) (<= 0 main_~c~0) (= main_~a~0 0) (<= 0 (+ ~last~0 2147483648)) (<= main_~a~0 0) (<= |old(~last~0)| 0) (<= main_~b~0 0) (= |old(~last~0)| 0)) [2019-10-07 13:41:02,618 INFO L193 IcfgInterpreter]: Reachable states at location L10 satisfy 88#(and (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))) (<= 0 |__VERIFIER_assert_#in~cond|) (<= 0 (+ ~last~0 2147483648)) (<= ~last~0 2147483647) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1) (<= 0 __VERIFIER_assert_~cond)) [2019-10-07 13:41:02,618 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 83#(and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (+ ~last~0 2147483648)) (<= ~last~0 2147483647)) (and (= |__VERIFIER_assert_#in~cond| 0) (<= 0 (+ ~last~0 2147483648)) (<= ~last~0 2147483647)))) [2019-10-07 13:41:02,618 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 98#(and (<= __VERIFIER_assert_~cond 0) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 (+ ~last~0 2147483648)) (<= ~last~0 2147483647) (<= 0 __VERIFIER_assert_~cond)) [2019-10-07 13:41:02,618 INFO L193 IcfgInterpreter]: Reachable states at location L26-1 satisfy 78#(and (<= main_~b~0 3) (<= 2 main_~b~0) (<= 200000 main_~c~0) (<= 0 (+ ~last~0 2147483648)) (<= main_~a~0 4) (<= ~last~0 2147483647) (<= |old(~last~0)| 0) (<= 2 main_~a~0) (<= 0 |old(~last~0)|) (= |old(~last~0)| 0) (<= main_~st~0 1)) [2019-10-07 13:41:03,643 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 13:41:03,643 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [193, 193, 193, 9] total 393 [2019-10-07 13:41:03,645 INFO L442 AbstractCegarLoop]: Interpolant automaton has 393 states [2019-10-07 13:41:03,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 393 interpolants. [2019-10-07 13:41:03,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73942, Invalid=80114, Unknown=0, NotChecked=0, Total=154056 [2019-10-07 13:41:03,655 INFO L87 Difference]: Start difference. First operand 204 states and 205 transitions. Second operand 393 states. [2019-10-07 13:42:40,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:42:40,896 INFO L93 Difference]: Finished difference Result 987 states and 1374 transitions. [2019-10-07 13:42:40,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 775 states. [2019-10-07 13:42:40,896 INFO L78 Accepts]: Start accepts. Automaton has 393 states. Word has length 201 [2019-10-07 13:42:40,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:42:40,901 INFO L225 Difference]: With dead ends: 987 [2019-10-07 13:42:40,902 INFO L226 Difference]: Without dead ends: 788 [2019-10-07 13:42:40,914 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 1180 GetRequests, 404 SyntacticMatches, 0 SemanticMatches, 776 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98935 ImplicationChecksByTransitivity, 138.9s TimeCoverageRelationStatistics Valid=221412, Invalid=383094, Unknown=0, NotChecked=0, Total=604506 [2019-10-07 13:42:40,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 788 states. [2019-10-07 13:42:40,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 788 to 396. [2019-10-07 13:42:40,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2019-10-07 13:42:40,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 397 transitions. [2019-10-07 13:42:40,955 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 397 transitions. Word has length 201 [2019-10-07 13:42:40,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:42:40,956 INFO L462 AbstractCegarLoop]: Abstraction has 396 states and 397 transitions. [2019-10-07 13:42:40,956 INFO L463 AbstractCegarLoop]: Interpolant automaton has 393 states. [2019-10-07 13:42:40,956 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 397 transitions. [2019-10-07 13:42:40,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2019-10-07 13:42:40,969 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:42:40,969 INFO L385 BasicCegarLoop]: trace histogram [382, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:42:41,180 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:42:41,180 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:42:41,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:42:41,181 INFO L82 PathProgramCache]: Analyzing trace with hash -1295959185, now seen corresponding path program 8 times [2019-10-07 13:42:41,182 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:42:41,182 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:42:41,183 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:42:41,183 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:42:41,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:42:42,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:43:32,375 INFO L134 CoverageAnalysis]: Checked inductivity of 73153 backedges. 0 proven. 73153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:43:32,375 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:43:32,375 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 13:43:32,376 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:43:34,772 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 192 check-sat command(s) [2019-10-07 13:43:34,772 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-07 13:43:34,787 INFO L256 TraceCheckSpWp]: Trace formula consists of 1571 conjuncts, 384 conjunts are in the unsatisfiable core [2019-10-07 13:43:34,799 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 13:43:34,982 INFO L134 CoverageAnalysis]: Checked inductivity of 73153 backedges. 0 proven. 73153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:43:34,982 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 13:46:08,078 INFO L134 CoverageAnalysis]: Checked inductivity of 73153 backedges. 0 proven. 73153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:46:08,079 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 13:46:08,080 INFO L162 IcfgInterpreter]: Started Sifa with 12 locations of interest [2019-10-07 13:46:08,080 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 13:46:08,081 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 13:46:08,081 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 13:46:08,081 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 13:46:08,090 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 8 for LOIs [2019-10-07 13:46:08,146 WARN L222 IntervalDomain]: Interval conversion did not stabilize in 7 iterations. Over-approximation may be very coarse. [2019-10-07 13:46:08,153 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-07 13:46:08,166 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 3 for LOIs [2019-10-07 13:46:08,168 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 13:46:08,168 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 13:46:08,168 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (<= ~last~0 0) (<= 0 ~last~0) (= ~last~0 0)) [2019-10-07 13:46:08,168 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (<= ~last~0 0) (<= 0 ~last~0) (= ~last~0 |old(~last~0)|) (<= |old(~last~0)| 0) (<= 0 |old(~last~0)|) (= |old(~last~0)| 0)) [2019-10-07 13:46:08,169 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 107#(and (<= ~last~0 0) (<= 0 ~last~0) (= ~last~0 0)) [2019-10-07 13:46:08,169 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 13:46:08,169 INFO L193 IcfgInterpreter]: Reachable states at location L28 satisfy 38#(and (<= 0 main_~b~0) (<= 0 main_~a~0) (<= ~last~0 2147483647) (<= 0 |old(~last~0)|) (<= 0 main_~st~0) (= 0 main_~st~0) (<= main_~st~0 0) (= main_~b~0 0) (<= main_~c~0 0) (= main_~c~0 0) (<= 0 main_~c~0) (<= 0 (+ ~last~0 2147483648)) (= main_~a~0 0) (<= main_~a~0 0) (<= |old(~last~0)| 0) (<= main_~b~0 0) (= |old(~last~0)| 0)) [2019-10-07 13:46:08,169 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 102#(= ~last~0 |old(~last~0)|) [2019-10-07 13:46:08,169 INFO L193 IcfgInterpreter]: Reachable states at location L11 satisfy 93#(and (<= __VERIFIER_assert_~cond 0) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 (+ ~last~0 2147483648)) (<= ~last~0 2147483647) (<= 0 __VERIFIER_assert_~cond)) [2019-10-07 13:46:08,170 INFO L193 IcfgInterpreter]: Reachable states at location L21-3 satisfy 66#(and (<= 0 main_~b~0) (<= 0 main_~a~0) (<= ~last~0 2147483647) (<= 0 |old(~last~0)|) (<= main_~st~0 1) (= main_~b~0 0) (<= 0 main_~c~0) (= main_~a~0 0) (<= 0 (+ ~last~0 2147483648)) (<= main_~a~0 0) (<= |old(~last~0)| 0) (<= main_~b~0 0) (= |old(~last~0)| 0)) [2019-10-07 13:46:08,170 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 83#(and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (+ ~last~0 2147483648)) (<= ~last~0 2147483647)) (and (= |__VERIFIER_assert_#in~cond| 0) (<= 0 (+ ~last~0 2147483648)) (<= ~last~0 2147483647)))) [2019-10-07 13:46:08,170 INFO L193 IcfgInterpreter]: Reachable states at location L10 satisfy 88#(and (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))) (<= 0 |__VERIFIER_assert_#in~cond|) (<= 0 (+ ~last~0 2147483648)) (<= ~last~0 2147483647) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1) (<= 0 __VERIFIER_assert_~cond)) [2019-10-07 13:46:08,170 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 98#(and (<= __VERIFIER_assert_~cond 0) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 (+ ~last~0 2147483648)) (<= ~last~0 2147483647) (<= 0 __VERIFIER_assert_~cond)) [2019-10-07 13:46:08,170 INFO L193 IcfgInterpreter]: Reachable states at location L26-1 satisfy 78#(and (<= main_~b~0 3) (<= 2 main_~b~0) (<= 200000 main_~c~0) (<= 0 (+ ~last~0 2147483648)) (<= main_~a~0 4) (<= ~last~0 2147483647) (<= |old(~last~0)| 0) (<= 2 main_~a~0) (<= 0 |old(~last~0)|) (= |old(~last~0)| 0) (<= main_~st~0 1)) [2019-10-07 13:46:10,033 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 13:46:10,034 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [385, 385, 385, 9] total 777 [2019-10-07 13:46:10,037 INFO L442 AbstractCegarLoop]: Interpolant automaton has 777 states [2019-10-07 13:46:10,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 777 interpolants. [2019-10-07 13:46:10,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=295318, Invalid=307634, Unknown=0, NotChecked=0, Total=602952 [2019-10-07 13:46:10,068 INFO L87 Difference]: Start difference. First operand 396 states and 397 transitions. Second operand 777 states. [2019-10-07 13:46:21,962 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 21