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 -i ../../../trunk/examples/svcomp/loops/linear_search.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c6af20d [2019-09-03 19:19:49,576 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-03 19:19:49,578 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-03 19:19:49,594 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-03 19:19:49,594 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-03 19:19:49,595 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-03 19:19:49,597 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-03 19:19:49,599 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-03 19:19:49,610 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-03 19:19:49,611 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-03 19:19:49,612 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-03 19:19:49,613 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-03 19:19:49,614 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-03 19:19:49,618 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-03 19:19:49,619 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-03 19:19:49,620 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-03 19:19:49,622 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-03 19:19:49,626 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-03 19:19:49,628 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-03 19:19:49,633 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-03 19:19:49,635 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-03 19:19:49,637 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-03 19:19:49,639 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-03 19:19:49,641 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-03 19:19:49,644 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-03 19:19:49,644 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-03 19:19:49,645 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-03 19:19:49,646 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-03 19:19:49,647 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-03 19:19:49,648 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-03 19:19:49,650 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-03 19:19:49,652 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-03 19:19:49,653 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-03 19:19:49,653 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-03 19:19:49,656 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-03 19:19:49,656 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-03 19:19:49,658 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-03 19:19:49,658 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-03 19:19:49,658 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-03 19:19:49,659 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-03 19:19:49,660 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-03 19:19:49,661 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-09-03 19:19:49,675 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-03 19:19:49,675 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-03 19:19:49,676 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-03 19:19:49,677 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-03 19:19:49,677 INFO L138 SettingsManager]: * Use SBE=true [2019-09-03 19:19:49,677 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-03 19:19:49,677 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-03 19:19:49,678 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-03 19:19:49,678 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-03 19:19:49,678 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-03 19:19:49,678 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-03 19:19:49,679 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-03 19:19:49,679 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-03 19:19:49,679 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-03 19:19:49,679 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-03 19:19:49,680 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-03 19:19:49,680 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-03 19:19:49,680 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-03 19:19:49,680 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-03 19:19:49,680 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-03 19:19:49,681 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-03 19:19:49,681 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-03 19:19:49,681 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-03 19:19:49,681 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-03 19:19:49,682 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-03 19:19:49,682 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-03 19:19:49,682 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-03 19:19:49,682 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-03 19:19:49,682 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-03 19:19:49,714 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-03 19:19:49,734 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-03 19:19:49,738 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-03 19:19:49,740 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-03 19:19:49,740 INFO L275 PluginConnector]: CDTParser initialized [2019-09-03 19:19:49,741 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/linear_search.c [2019-09-03 19:19:49,820 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd71383aa/fa9c6a9f71e84a21813a992625d3368f/FLAG256d1554a [2019-09-03 19:19:50,298 INFO L306 CDTParser]: Found 1 translation units. [2019-09-03 19:19:50,299 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/linear_search.c [2019-09-03 19:19:50,305 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd71383aa/fa9c6a9f71e84a21813a992625d3368f/FLAG256d1554a [2019-09-03 19:19:50,675 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd71383aa/fa9c6a9f71e84a21813a992625d3368f [2019-09-03 19:19:50,685 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-03 19:19:50,686 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-03 19:19:50,687 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-03 19:19:50,688 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-03 19:19:50,691 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-03 19:19:50,692 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 07:19:50" (1/1) ... [2019-09-03 19:19:50,695 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b8f617e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:19:50, skipping insertion in model container [2019-09-03 19:19:50,695 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 07:19:50" (1/1) ... [2019-09-03 19:19:50,703 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-03 19:19:50,717 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-03 19:19:50,887 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 19:19:50,898 INFO L188 MainTranslator]: Completed pre-run [2019-09-03 19:19:50,918 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 19:19:50,935 INFO L192 MainTranslator]: Completed translation [2019-09-03 19:19:50,936 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:19:50 WrapperNode [2019-09-03 19:19:50,936 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-03 19:19:50,937 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-03 19:19:50,937 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-03 19:19:50,937 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-03 19:19:51,042 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:19:50" (1/1) ... [2019-09-03 19:19:51,042 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:19:50" (1/1) ... [2019-09-03 19:19:51,048 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:19:50" (1/1) ... [2019-09-03 19:19:51,049 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:19:50" (1/1) ... [2019-09-03 19:19:51,055 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:19:50" (1/1) ... [2019-09-03 19:19:51,060 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:19:50" (1/1) ... [2019-09-03 19:19:51,062 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:19:50" (1/1) ... [2019-09-03 19:19:51,064 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-03 19:19:51,064 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-03 19:19:51,064 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-03 19:19:51,065 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-03 19:19:51,065 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:19:50" (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-09-03 19:19:51,126 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-03 19:19:51,126 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-03 19:19:51,127 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-03 19:19:51,127 INFO L138 BoogieDeclarations]: Found implementation of procedure linear_search [2019-09-03 19:19:51,127 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-03 19:19:51,127 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-03 19:19:51,127 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-03 19:19:51,127 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-03 19:19:51,127 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2019-09-03 19:19:51,127 INFO L130 BoogieDeclarations]: Found specification of procedure linear_search [2019-09-03 19:19:51,128 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-03 19:19:51,128 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-03 19:19:51,129 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-03 19:19:51,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-03 19:19:51,130 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-03 19:19:51,130 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-03 19:19:51,130 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-03 19:19:51,397 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-03 19:19:51,397 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-03 19:19:51,399 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 07:19:51 BoogieIcfgContainer [2019-09-03 19:19:51,399 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-03 19:19:51,406 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-03 19:19:51,406 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-03 19:19:51,415 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-03 19:19:51,416 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.09 07:19:50" (1/3) ... [2019-09-03 19:19:51,417 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30fdb0b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 07:19:51, skipping insertion in model container [2019-09-03 19:19:51,417 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:19:50" (2/3) ... [2019-09-03 19:19:51,420 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30fdb0b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 07:19:51, skipping insertion in model container [2019-09-03 19:19:51,421 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 07:19:51" (3/3) ... [2019-09-03 19:19:51,425 INFO L109 eAbstractionObserver]: Analyzing ICFG linear_search.c [2019-09-03 19:19:51,445 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-03 19:19:51,463 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-03 19:19:51,486 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-03 19:19:51,510 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-03 19:19:51,511 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-03 19:19:51,511 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-03 19:19:51,511 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-03 19:19:51,511 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-03 19:19:51,511 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-03 19:19:51,511 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-03 19:19:51,512 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-03 19:19:51,512 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-03 19:19:51,526 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2019-09-03 19:19:51,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-03 19:19:51,531 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:19:51,532 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:19:51,533 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:19:51,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:19:51,539 INFO L82 PathProgramCache]: Analyzing trace with hash 868129876, now seen corresponding path program 1 times [2019-09-03 19:19:51,541 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:19:51,541 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:19:51,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:19:51,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:19:51,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:19:51,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:19:51,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:19:51,734 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:19:51,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-03 19:19:51,737 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-03 19:19:51,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-03 19:19:51,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-03 19:19:51,753 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 2 states. [2019-09-03 19:19:51,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:19:51,777 INFO L93 Difference]: Finished difference Result 45 states and 53 transitions. [2019-09-03 19:19:51,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-03 19:19:51,778 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2019-09-03 19:19:51,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:19:51,787 INFO L225 Difference]: With dead ends: 45 [2019-09-03 19:19:51,787 INFO L226 Difference]: Without dead ends: 22 [2019-09-03 19:19:51,791 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-03 19:19:51,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-09-03 19:19:51,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-09-03 19:19:51,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-09-03 19:19:51,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2019-09-03 19:19:51,833 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 18 [2019-09-03 19:19:51,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:19:51,834 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2019-09-03 19:19:51,834 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-03 19:19:51,834 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2019-09-03 19:19:51,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-03 19:19:51,835 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:19:51,836 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:19:51,836 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:19:51,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:19:51,838 INFO L82 PathProgramCache]: Analyzing trace with hash -202652409, now seen corresponding path program 1 times [2019-09-03 19:19:51,838 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:19:51,838 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:19:51,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:19:51,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:19:51,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:19:51,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:19:52,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:19:52,037 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:19:52,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-03 19:19:52,039 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-03 19:19:52,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-03 19:19:52,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-03 19:19:52,040 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand 6 states. [2019-09-03 19:19:52,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:19:52,093 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2019-09-03 19:19:52,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-03 19:19:52,094 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2019-09-03 19:19:52,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:19:52,096 INFO L225 Difference]: With dead ends: 30 [2019-09-03 19:19:52,096 INFO L226 Difference]: Without dead ends: 22 [2019-09-03 19:19:52,097 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-03 19:19:52,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-09-03 19:19:52,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-09-03 19:19:52,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-09-03 19:19:52,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2019-09-03 19:19:52,103 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 20 [2019-09-03 19:19:52,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:19:52,103 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2019-09-03 19:19:52,103 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-03 19:19:52,103 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2019-09-03 19:19:52,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-03 19:19:52,104 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:19:52,105 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:19:52,105 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:19:52,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:19:52,106 INFO L82 PathProgramCache]: Analyzing trace with hash 1540157926, now seen corresponding path program 1 times [2019-09-03 19:19:52,106 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:19:52,106 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:19:52,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:19:52,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:19:52,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:19:52,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:19:52,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:19:52,282 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:19:52,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-03 19:19:52,282 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 19:19:52,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 19:19:52,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-03 19:19:52,284 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand 5 states. [2019-09-03 19:19:52,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:19:52,374 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2019-09-03 19:19:52,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-03 19:19:52,375 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-09-03 19:19:52,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:19:52,376 INFO L225 Difference]: With dead ends: 34 [2019-09-03 19:19:52,376 INFO L226 Difference]: Without dead ends: 25 [2019-09-03 19:19:52,377 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-03 19:19:52,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-09-03 19:19:52,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-09-03 19:19:52,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-09-03 19:19:52,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2019-09-03 19:19:52,383 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 20 [2019-09-03 19:19:52,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:19:52,384 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2019-09-03 19:19:52,384 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 19:19:52,384 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2019-09-03 19:19:52,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-03 19:19:52,385 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:19:52,385 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:19:52,385 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:19:52,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:19:52,386 INFO L82 PathProgramCache]: Analyzing trace with hash -1697189824, now seen corresponding path program 1 times [2019-09-03 19:19:52,386 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:19:52,386 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:19:52,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:19:52,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:19:52,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:19:52,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:19:52,530 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:19:52,530 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:19:52,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-03 19:19:52,531 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-03 19:19:52,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-03 19:19:52,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-03 19:19:52,533 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand 4 states. [2019-09-03 19:19:52,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:19:52,582 INFO L93 Difference]: Finished difference Result 45 states and 53 transitions. [2019-09-03 19:19:52,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-03 19:19:52,585 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2019-09-03 19:19:52,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:19:52,588 INFO L225 Difference]: With dead ends: 45 [2019-09-03 19:19:52,589 INFO L226 Difference]: Without dead ends: 32 [2019-09-03 19:19:52,591 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-03 19:19:52,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-09-03 19:19:52,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 26. [2019-09-03 19:19:52,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-09-03 19:19:52,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2019-09-03 19:19:52,603 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 24 [2019-09-03 19:19:52,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:19:52,604 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2019-09-03 19:19:52,604 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-03 19:19:52,604 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2019-09-03 19:19:52,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-03 19:19:52,605 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:19:52,605 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:19:52,606 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:19:52,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:19:52,608 INFO L82 PathProgramCache]: Analyzing trace with hash -1439024386, now seen corresponding path program 1 times [2019-09-03 19:19:52,608 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:19:52,608 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:19:52,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:19:52,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:19:52,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:19:52,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:19:52,910 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-03 19:19:52,911 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:19:52,911 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:19:52,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:19:53,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:19:53,003 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-03 19:19:53,011 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:19:53,219 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-03 19:19:53,224 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:19:53,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2019-09-03 19:19:53,228 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-03 19:19:53,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-03 19:19:53,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2019-09-03 19:19:53,231 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand 13 states. [2019-09-03 19:19:53,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:19:53,638 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2019-09-03 19:19:53,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-03 19:19:53,638 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 24 [2019-09-03 19:19:53,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:19:53,639 INFO L225 Difference]: With dead ends: 37 [2019-09-03 19:19:53,639 INFO L226 Difference]: Without dead ends: 28 [2019-09-03 19:19:53,640 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=85, Invalid=221, Unknown=0, NotChecked=0, Total=306 [2019-09-03 19:19:53,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-09-03 19:19:53,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2019-09-03 19:19:53,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-09-03 19:19:53,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2019-09-03 19:19:53,651 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 24 [2019-09-03 19:19:53,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:19:53,651 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2019-09-03 19:19:53,651 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-03 19:19:53,651 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2019-09-03 19:19:53,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-03 19:19:53,653 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:19:53,653 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:19:53,653 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:19:53,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:19:53,654 INFO L82 PathProgramCache]: Analyzing trace with hash -1832051396, now seen corresponding path program 1 times [2019-09-03 19:19:53,654 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:19:53,655 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:19:53,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:19:53,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:19:53,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:19:53,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:19:53,802 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:19:53,803 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:19:53,803 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:19:53,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:19:53,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:19:53,875 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-03 19:19:53,877 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:19:53,929 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:19:53,934 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:19:53,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 8 [2019-09-03 19:19:53,935 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-03 19:19:53,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-03 19:19:53,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-03 19:19:53,936 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand 8 states. [2019-09-03 19:19:54,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:19:54,032 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2019-09-03 19:19:54,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-03 19:19:54,034 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2019-09-03 19:19:54,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:19:54,037 INFO L225 Difference]: With dead ends: 40 [2019-09-03 19:19:54,037 INFO L226 Difference]: Without dead ends: 31 [2019-09-03 19:19:54,038 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 21 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-03 19:19:54,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-09-03 19:19:54,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2019-09-03 19:19:54,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-09-03 19:19:54,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2019-09-03 19:19:54,049 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 24 [2019-09-03 19:19:54,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:19:54,049 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2019-09-03 19:19:54,049 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-03 19:19:54,050 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2019-09-03 19:19:54,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-03 19:19:54,050 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:19:54,051 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:19:54,051 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:19:54,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:19:54,051 INFO L82 PathProgramCache]: Analyzing trace with hash -648228970, now seen corresponding path program 1 times [2019-09-03 19:19:54,052 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:19:54,052 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:19:54,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:19:54,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:19:54,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:19:54,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:19:54,128 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:19:54,128 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:19:54,129 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:19:54,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:19:54,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:19:54,175 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-03 19:19:54,178 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:19:54,202 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:19:54,206 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:19:54,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-09-03 19:19:54,207 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-03 19:19:54,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-03 19:19:54,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-03 19:19:54,208 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand 6 states. [2019-09-03 19:19:54,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:19:54,290 INFO L93 Difference]: Finished difference Result 52 states and 61 transitions. [2019-09-03 19:19:54,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-03 19:19:54,291 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-09-03 19:19:54,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:19:54,292 INFO L225 Difference]: With dead ends: 52 [2019-09-03 19:19:54,292 INFO L226 Difference]: Without dead ends: 38 [2019-09-03 19:19:54,293 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-03 19:19:54,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-09-03 19:19:54,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 31. [2019-09-03 19:19:54,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-09-03 19:19:54,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2019-09-03 19:19:54,300 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 28 [2019-09-03 19:19:54,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:19:54,300 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2019-09-03 19:19:54,301 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-03 19:19:54,301 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2019-09-03 19:19:54,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-03 19:19:54,302 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:19:54,302 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:19:54,302 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:19:54,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:19:54,303 INFO L82 PathProgramCache]: Analyzing trace with hash -390063532, now seen corresponding path program 2 times [2019-09-03 19:19:54,303 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:19:54,303 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:19:54,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:19:54,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:19:54,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:19:54,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:19:54,779 WARN L188 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 39 [2019-09-03 19:19:55,520 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 44 [2019-09-03 19:19:55,531 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:19:55,532 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:19:55,532 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:19:55,547 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:19:55,621 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:19:55,621 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:19:55,623 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 41 conjunts are in the unsatisfiable core [2019-09-03 19:19:55,627 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:19:55,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:19:59,802 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 49 [2019-09-03 19:19:59,802 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:19:59,812 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50 [2019-09-03 19:19:59,813 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-03 19:19:59,873 INFO L567 ElimStorePlain]: treesize reduction 309, result has 8.8 percent of original size [2019-09-03 19:19:59,873 INFO L464 ElimStorePlain]: Eliminatee |v_#memory_int_6| vanished before elimination [2019-09-03 19:19:59,874 INFO L464 ElimStorePlain]: Eliminatee v_prenex_3 vanished before elimination [2019-09-03 19:19:59,874 INFO L464 ElimStorePlain]: Eliminatee v_prenex_4 vanished before elimination [2019-09-03 19:19:59,875 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-03 19:19:59,875 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:347, output treesize:30 [2019-09-03 19:20:00,372 WARN L188 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 46 [2019-09-03 19:20:02,923 WARN L188 SmtUtils]: Spent 2.21 s on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2019-09-03 19:20:03,181 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:20:03,185 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:20:03,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 21 [2019-09-03 19:20:03,186 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-03 19:20:03,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-03 19:20:03,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=360, Unknown=1, NotChecked=0, Total=420 [2019-09-03 19:20:03,187 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 21 states. [2019-09-03 19:20:03,880 WARN L188 SmtUtils]: Spent 509.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 39 [2019-09-03 19:20:04,455 WARN L188 SmtUtils]: Spent 505.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2019-09-03 19:20:05,270 WARN L188 SmtUtils]: Spent 627.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2019-09-03 19:20:07,272 WARN L188 SmtUtils]: Spent 1.41 s on a formula simplification. DAG size of input: 107 DAG size of output: 74 [2019-09-03 19:20:07,521 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 80 [2019-09-03 19:20:08,736 WARN L188 SmtUtils]: Spent 1.16 s on a formula simplification. DAG size of input: 84 DAG size of output: 78 [2019-09-03 19:20:09,832 WARN L188 SmtUtils]: Spent 1.03 s on a formula simplification. DAG size of input: 75 DAG size of output: 55 [2019-09-03 19:20:10,934 WARN L188 SmtUtils]: Spent 786.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 64 [2019-09-03 19:20:11,605 WARN L188 SmtUtils]: Spent 593.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 61 [2019-09-03 19:20:12,362 WARN L188 SmtUtils]: Spent 706.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 63 [2019-09-03 19:20:13,089 WARN L188 SmtUtils]: Spent 638.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2019-09-03 19:20:13,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:20:13,760 INFO L93 Difference]: Finished difference Result 74 states and 88 transitions. [2019-09-03 19:20:13,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-03 19:20:13,760 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 28 [2019-09-03 19:20:13,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:20:13,761 INFO L225 Difference]: With dead ends: 74 [2019-09-03 19:20:13,762 INFO L226 Difference]: Without dead ends: 44 [2019-09-03 19:20:13,764 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 19 SyntacticMatches, 6 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 303 ImplicationChecksByTransitivity, 18.0s TimeCoverageRelationStatistics Valid=309, Invalid=1496, Unknown=1, NotChecked=0, Total=1806 [2019-09-03 19:20:13,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-09-03 19:20:13,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 33. [2019-09-03 19:20:13,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-09-03 19:20:13,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2019-09-03 19:20:13,775 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 28 [2019-09-03 19:20:13,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:20:13,775 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2019-09-03 19:20:13,777 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-03 19:20:13,777 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2019-09-03 19:20:13,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-03 19:20:13,778 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:20:13,780 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:20:13,780 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:20:13,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:20:13,781 INFO L82 PathProgramCache]: Analyzing trace with hash -723812178, now seen corresponding path program 2 times [2019-09-03 19:20:13,781 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:20:13,781 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:20:13,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:20:13,783 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:20:13,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:20:13,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:20:13,856 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:20:13,857 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:20:13,857 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:20:13,872 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:20:13,902 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:20:13,902 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:20:13,903 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-03 19:20:13,905 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:20:13,927 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:20:13,932 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:20:13,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-09-03 19:20:13,933 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-03 19:20:13,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-03 19:20:13,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-03 19:20:13,934 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 7 states. [2019-09-03 19:20:14,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:20:14,013 INFO L93 Difference]: Finished difference Result 56 states and 65 transitions. [2019-09-03 19:20:14,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-03 19:20:14,015 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 32 [2019-09-03 19:20:14,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:20:14,016 INFO L225 Difference]: With dead ends: 56 [2019-09-03 19:20:14,016 INFO L226 Difference]: Without dead ends: 42 [2019-09-03 19:20:14,017 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-03 19:20:14,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-09-03 19:20:14,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 35. [2019-09-03 19:20:14,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-09-03 19:20:14,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2019-09-03 19:20:14,023 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 32 [2019-09-03 19:20:14,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:20:14,024 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2019-09-03 19:20:14,024 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-03 19:20:14,024 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2019-09-03 19:20:14,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-03 19:20:14,025 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:20:14,025 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:20:14,025 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:20:14,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:20:14,025 INFO L82 PathProgramCache]: Analyzing trace with hash -465646740, now seen corresponding path program 3 times [2019-09-03 19:20:14,026 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:20:14,026 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:20:14,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:20:14,026 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:20:14,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:20:14,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:20:14,498 WARN L188 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 225 DAG size of output: 37 [2019-09-03 19:20:14,906 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 48 [2019-09-03 19:20:15,751 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 40 [2019-09-03 19:20:15,761 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:20:15,761 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:20:15,761 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:20:15,777 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:20:15,841 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-03 19:20:15,841 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:20:15,842 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 33 conjunts are in the unsatisfiable core [2019-09-03 19:20:15,844 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:20:15,866 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-03 19:20:15,867 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:20:17,913 WARN L188 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 52 DAG size of output: 21 [2019-09-03 19:20:17,914 INFO L567 ElimStorePlain]: treesize reduction 195, result has 12.2 percent of original size [2019-09-03 19:20:17,918 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2019-09-03 19:20:17,919 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-03 19:20:17,924 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:20:17,924 INFO L464 ElimStorePlain]: Eliminatee v_prenex_6 vanished before elimination [2019-09-03 19:20:17,925 INFO L464 ElimStorePlain]: Eliminatee v_prenex_7 vanished before elimination [2019-09-03 19:20:17,925 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:20:17,925 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:275, output treesize:23 [2019-09-03 19:20:18,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:20:18,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:20:18,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:20:18,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:20:18,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:20:18,438 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 39 [2019-09-03 19:20:18,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:20:20,387 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:20:20,391 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:20:20,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 24 [2019-09-03 19:20:20,393 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-03 19:20:20,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-03 19:20:20,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=491, Unknown=1, NotChecked=0, Total=552 [2019-09-03 19:20:20,394 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 24 states. [2019-09-03 19:20:22,041 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 50 [2019-09-03 19:20:22,286 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 55 [2019-09-03 19:20:22,692 WARN L188 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 90 [2019-09-03 19:20:22,870 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 68 [2019-09-03 19:20:23,083 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 83 [2019-09-03 19:20:23,326 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 77 [2019-09-03 19:20:23,555 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 89 [2019-09-03 19:20:23,762 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 72 [2019-09-03 19:20:23,991 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 74 [2019-09-03 19:20:26,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:20:26,988 INFO L93 Difference]: Finished difference Result 69 states and 79 transitions. [2019-09-03 19:20:26,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-03 19:20:26,993 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 32 [2019-09-03 19:20:26,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:20:26,994 INFO L225 Difference]: With dead ends: 69 [2019-09-03 19:20:26,994 INFO L226 Difference]: Without dead ends: 39 [2019-09-03 19:20:26,996 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 25 SyntacticMatches, 4 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=215, Invalid=1423, Unknown=2, NotChecked=0, Total=1640 [2019-09-03 19:20:26,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-09-03 19:20:27,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2019-09-03 19:20:27,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-09-03 19:20:27,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2019-09-03 19:20:27,002 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 32 [2019-09-03 19:20:27,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:20:27,002 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2019-09-03 19:20:27,003 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-03 19:20:27,003 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2019-09-03 19:20:27,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-09-03 19:20:27,004 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:20:27,004 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:20:27,004 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:20:27,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:20:27,004 INFO L82 PathProgramCache]: Analyzing trace with hash -1595152954, now seen corresponding path program 3 times [2019-09-03 19:20:27,004 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:20:27,005 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:20:27,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:20:27,006 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:20:27,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:20:27,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:20:27,084 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 12 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:20:27,085 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:20:27,085 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:20:27,102 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:20:27,230 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-09-03 19:20:27,230 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:20:27,232 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-03 19:20:27,234 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:20:27,254 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 12 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:20:27,258 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:20:27,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-09-03 19:20:27,259 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-03 19:20:27,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-03 19:20:27,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-09-03 19:20:27,259 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 8 states. [2019-09-03 19:20:27,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:20:27,357 INFO L93 Difference]: Finished difference Result 60 states and 69 transitions. [2019-09-03 19:20:27,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-03 19:20:27,358 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 36 [2019-09-03 19:20:27,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:20:27,359 INFO L225 Difference]: With dead ends: 60 [2019-09-03 19:20:27,359 INFO L226 Difference]: Without dead ends: 46 [2019-09-03 19:20:27,359 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-09-03 19:20:27,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-09-03 19:20:27,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 39. [2019-09-03 19:20:27,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-09-03 19:20:27,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2019-09-03 19:20:27,366 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 36 [2019-09-03 19:20:27,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:20:27,367 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2019-09-03 19:20:27,367 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-03 19:20:27,367 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2019-09-03 19:20:27,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-09-03 19:20:27,369 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:20:27,369 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:20:27,369 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:20:27,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:20:27,369 INFO L82 PathProgramCache]: Analyzing trace with hash -1336987516, now seen corresponding path program 4 times [2019-09-03 19:20:27,369 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:20:27,370 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:20:27,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:20:27,371 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:20:27,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:20:27,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:20:27,787 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 31 [2019-09-03 19:20:28,145 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 48 [2019-09-03 19:20:28,335 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 51 [2019-09-03 19:20:30,657 WARN L188 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 68 [2019-09-03 19:20:30,858 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2019-09-03 19:20:33,350 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:20:33,350 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:20:33,350 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:20:33,368 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:20:33,454 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:20:33,454 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:20:33,457 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 48 conjunts are in the unsatisfiable core [2019-09-03 19:20:33,460 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:20:33,478 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-03 19:20:33,478 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:20:33,525 INFO L567 ElimStorePlain]: treesize reduction 197, result has 12.1 percent of original size [2019-09-03 19:20:33,528 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2019-09-03 19:20:33,528 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-03 19:20:33,533 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:20:33,533 INFO L464 ElimStorePlain]: Eliminatee v_prenex_11 vanished before elimination [2019-09-03 19:20:33,533 INFO L464 ElimStorePlain]: Eliminatee |v_#memory_int_8| vanished before elimination [2019-09-03 19:20:33,534 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:20:33,534 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:275, output treesize:23 [2019-09-03 19:20:34,106 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2019-09-03 19:20:34,471 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 52 [2019-09-03 19:20:34,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:20:34,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:20:34,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:20:34,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:20:34,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:20:34,734 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 51 [2019-09-03 19:20:35,074 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 54 [2019-09-03 19:20:35,845 WARN L188 SmtUtils]: Spent 383.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 55 [2019-09-03 19:20:38,162 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:20:38,168 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:20:38,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 18] total 31 [2019-09-03 19:20:38,169 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-03 19:20:38,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-03 19:20:38,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=829, Unknown=2, NotChecked=0, Total=930 [2019-09-03 19:20:38,171 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 31 states. [2019-09-03 19:20:44,585 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse4 (= |c_linear_search_#in~a.base| c_linear_search_~a.base)) (.cse8 (= |c_linear_search_#in~a.offset| c_linear_search_~a.offset))) (and (<= c_~MAX~0 100000) (or (not |c_linear_search_#t~short1|) (let ((.cse0 (= c_linear_search_~a.offset 0))) (and (or (not .cse0) (let ((.cse1 (div c_linear_search_~n 4294967296))) (let ((.cse2 (div c_linear_search_~j~0 4294967296)) (.cse3 (* 4294967296 .cse1))) (and (or (<= .cse1 .cse2) (<= (+ .cse3 4) (+ (* 4294967296 .cse2) c_linear_search_~n))) (or (< .cse2 .cse1) (and (<= .cse2 0) (or (<= (+ .cse1 1) .cse2) (let ((.cse7 (* 2 c_linear_search_~j~0))) (let ((.cse5 (div (+ .cse7 (* (- 4294967296) .cse2) .cse3 (* (- 1) c_linear_search_~n) (- 1)) 2))) (let ((.cse6 (+ (* 4 .cse5) 6))) (and (or (and .cse4 (not (= |c_linear_search_#in~q| (select (select |c_#memory_int| c_linear_search_~a.base) (+ (* 4 c_linear_search_~j~0) (* (- 4) .cse5) c_linear_search_~a.offset (- 4)))))) (< .cse6 .cse7)) (<= .cse6 .cse7)))))))))))) (<= 3 c_linear_search_~j~0) (or .cse8 .cse0)))) .cse4 .cse8 (< 0 (+ (div c_~MAX~0 4294967296) 1)) (= |c_linear_search_#in~n| c_linear_search_~n) (exists ((v_main_~a~0.offset_BEFORE_CALL_3 Int) (v_main_~a~0.base_BEFORE_CALL_3 Int)) (= 3 (select (select |c_#memory_int| v_main_~a~0.base_BEFORE_CALL_3) (+ (* 4 (mod (div (mod c_~SIZE~0 4294967296) 2) 4294967296)) v_main_~a~0.offset_BEFORE_CALL_3)))) (= |c_linear_search_#in~q| c_linear_search_~q) (< 1 (mod c_~SIZE~0 4294967296)) (= c_linear_search_~j~0 0))) is different from true [2019-09-03 19:20:45,606 WARN L188 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 74 [2019-09-03 19:20:45,862 WARN L188 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 67 [2019-09-03 19:20:46,048 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 80 [2019-09-03 19:20:46,657 WARN L188 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 88 [2019-09-03 19:20:47,026 WARN L188 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 82 [2019-09-03 19:20:47,236 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 81 [2019-09-03 19:20:47,447 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 75 [2019-09-03 19:20:47,972 WARN L188 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 66 [2019-09-03 19:20:48,158 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 59 [2019-09-03 19:20:50,215 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse15 (mod c_linear_search_~j~0 4294967296)) (.cse17 (mod (+ c_linear_search_~j~0 4294967295) 4294967296)) (.cse16 (mod |c_linear_search_#in~n| 4294967296)) (.cse18 (select |c_#memory_int| |c_linear_search_#in~a.base|))) (let ((.cse0 (not |c_linear_search_#t~short1|)) (.cse8 (not (= (select .cse18 (+ |c_linear_search_#in~a.offset| (* 4 (mod (+ c_linear_search_~j~0 4294967293) 4294967296)))) |c_linear_search_#in~q|))) (.cse9 (< 1 (mod c_~SIZE~0 4294967296))) (.cse10 (not (= (select .cse18 (+ |c_linear_search_#in~a.offset| (* 4 (mod (+ c_linear_search_~j~0 4294967294) 4294967296)))) |c_linear_search_#in~q|))) (.cse11 (= c_linear_search_~j~0 4)) (.cse12 (< .cse17 .cse16)) (.cse13 (<= .cse16 .cse15)) (.cse14 (exists ((v_main_~a~0.offset_BEFORE_CALL_3 Int) (v_main_~a~0.base_BEFORE_CALL_3 Int)) (= 3 (select (select |c_#memory_int| v_main_~a~0.base_BEFORE_CALL_3) (+ (* 4 (mod (div (mod c_~SIZE~0 4294967296) 2) 4294967296)) v_main_~a~0.offset_BEFORE_CALL_3)))))) (and (<= c_~MAX~0 100000) (or .cse0 (let ((.cse1 (= c_linear_search_~a.offset 0))) (and (or (not .cse1) (let ((.cse2 (div c_linear_search_~n 4294967296))) (let ((.cse3 (div c_linear_search_~j~0 4294967296)) (.cse4 (* 4294967296 .cse2))) (and (or (<= .cse2 .cse3) (<= (+ .cse4 4) (+ (* 4294967296 .cse3) c_linear_search_~n))) (or (< .cse3 .cse2) (and (<= .cse3 0) (or (<= (+ .cse2 1) .cse3) (let ((.cse7 (* 2 c_linear_search_~j~0))) (let ((.cse5 (div (+ .cse7 (* (- 4294967296) .cse3) .cse4 (* (- 1) c_linear_search_~n) (- 1)) 2))) (let ((.cse6 (+ (* 4 .cse5) 6))) (and (or (and (= |c_linear_search_#in~a.base| c_linear_search_~a.base) (not (= |c_linear_search_#in~q| (select (select |c_#memory_int| c_linear_search_~a.base) (+ (* 4 c_linear_search_~j~0) (* (- 4) .cse5) c_linear_search_~a.offset (- 4)))))) (< .cse6 .cse7)) (<= .cse6 .cse7)))))))))))) (<= 3 c_linear_search_~j~0) (or (= |c_linear_search_#in~a.offset| c_linear_search_~a.offset) .cse1)))) (= |c_linear_search_#in~n| c_linear_search_~n) .cse8 .cse9 .cse10 .cse11 (or (and .cse12 .cse13 .cse14 .cse8 .cse0 .cse9 .cse10 .cse11) (and .cse14 .cse8 .cse9 .cse10 |c_linear_search_#t~short1| .cse11 (< .cse15 .cse16))) .cse12 (< 0 (+ (div c_~MAX~0 4294967296) 1)) .cse13 .cse14 (< .cse17 (mod c_linear_search_~n 4294967296))))) is different from true [2019-09-03 19:20:52,237 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse18 (select |c_#memory_int| |c_linear_search_#in~a.base|)) (.cse8 (mod c_linear_search_~j~0 4294967296)) (.cse17 (mod (+ c_linear_search_~j~0 4294967295) 4294967296)) (.cse9 (mod |c_linear_search_#in~n| 4294967296))) (let ((.cse4 (not |c_linear_search_#t~short1|)) (.cse0 (< .cse17 .cse9)) (.cse1 (<= .cse9 .cse8)) (.cse2 (exists ((v_main_~a~0.offset_BEFORE_CALL_3 Int) (v_main_~a~0.base_BEFORE_CALL_3 Int)) (= 3 (select (select |c_#memory_int| v_main_~a~0.base_BEFORE_CALL_3) (+ (* 4 (mod (div (mod c_~SIZE~0 4294967296) 2) 4294967296)) v_main_~a~0.offset_BEFORE_CALL_3))))) (.cse3 (not (= (select .cse18 (+ |c_linear_search_#in~a.offset| (* 4 (mod (+ c_linear_search_~j~0 4294967293) 4294967296)))) |c_linear_search_#in~q|))) (.cse5 (< 1 (mod c_~SIZE~0 4294967296))) (.cse6 (not (= (select .cse18 (+ |c_linear_search_#in~a.offset| (* 4 (mod (+ c_linear_search_~j~0 4294967294) 4294967296)))) |c_linear_search_#in~q|))) (.cse7 (= c_linear_search_~j~0 4))) (and (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse2 .cse3 .cse5 .cse6 |c_linear_search_#t~short1| .cse7 (< .cse8 .cse9))) (or .cse4 (let ((.cse10 (= c_linear_search_~a.offset 0))) (and (or (not .cse10) (let ((.cse11 (div c_linear_search_~n 4294967296))) (let ((.cse12 (div c_linear_search_~j~0 4294967296)) (.cse13 (* 4294967296 .cse11))) (and (or (<= .cse11 .cse12) (<= (+ .cse13 4) (+ (* 4294967296 .cse12) c_linear_search_~n))) (or (< .cse12 .cse11) (and (<= .cse12 0) (or (<= (+ .cse11 1) .cse12) (let ((.cse16 (* 2 c_linear_search_~j~0))) (let ((.cse14 (div (+ .cse16 (* (- 4294967296) .cse12) .cse13 (* (- 1) c_linear_search_~n) (- 1)) 2))) (let ((.cse15 (+ (* 4 .cse14) 6))) (and (or (and (= |c_linear_search_#in~a.base| c_linear_search_~a.base) (not (= |c_linear_search_#in~q| (select (select |c_#memory_int| c_linear_search_~a.base) (+ (* 4 c_linear_search_~j~0) (* (- 4) .cse14) c_linear_search_~a.offset (- 4)))))) (< .cse15 .cse16)) (<= .cse15 .cse16)))))))))))) (<= 3 c_linear_search_~j~0) (or (= |c_linear_search_#in~a.offset| c_linear_search_~a.offset) .cse10)))) .cse0 .cse1 (= |c_linear_search_#in~n| c_linear_search_~n) .cse2 (< .cse17 (mod c_linear_search_~n 4294967296)) .cse3 .cse5 .cse6 .cse7))) is different from true [2019-09-03 19:20:52,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:20:52,552 INFO L93 Difference]: Finished difference Result 88 states and 102 transitions. [2019-09-03 19:20:52,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-03 19:20:52,553 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 36 [2019-09-03 19:20:52,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:20:52,554 INFO L225 Difference]: With dead ends: 88 [2019-09-03 19:20:52,555 INFO L226 Difference]: Without dead ends: 79 [2019-09-03 19:20:52,557 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 21 SyntacticMatches, 6 SemanticMatches, 53 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 592 ImplicationChecksByTransitivity, 21.5s TimeCoverageRelationStatistics Valid=277, Invalid=2381, Unknown=6, NotChecked=306, Total=2970 [2019-09-03 19:20:52,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-09-03 19:20:52,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 41. [2019-09-03 19:20:52,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-09-03 19:20:52,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2019-09-03 19:20:52,565 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 36 [2019-09-03 19:20:52,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:20:52,565 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2019-09-03 19:20:52,565 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-03 19:20:52,565 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2019-09-03 19:20:52,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-09-03 19:20:52,566 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:20:52,566 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:20:52,566 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:20:52,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:20:52,567 INFO L82 PathProgramCache]: Analyzing trace with hash 1972633310, now seen corresponding path program 4 times [2019-09-03 19:20:52,567 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:20:52,567 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:20:52,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:20:52,568 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:20:52,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:20:52,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:20:52,649 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 15 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:20:52,650 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:20:52,650 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:20:52,669 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:20:52,696 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:20:52,696 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:20:52,697 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-03 19:20:52,698 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:20:52,730 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 15 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:20:52,734 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:20:52,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-09-03 19:20:52,734 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-03 19:20:52,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-03 19:20:52,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-03 19:20:52,737 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand 9 states. [2019-09-03 19:20:52,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:20:52,860 INFO L93 Difference]: Finished difference Result 64 states and 74 transitions. [2019-09-03 19:20:52,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-03 19:20:52,862 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 40 [2019-09-03 19:20:52,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:20:52,863 INFO L225 Difference]: With dead ends: 64 [2019-09-03 19:20:52,863 INFO L226 Difference]: Without dead ends: 50 [2019-09-03 19:20:52,879 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-03 19:20:52,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-09-03 19:20:52,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 43. [2019-09-03 19:20:52,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-09-03 19:20:52,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2019-09-03 19:20:52,887 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 40 [2019-09-03 19:20:52,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:20:52,888 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2019-09-03 19:20:52,888 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-03 19:20:52,888 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2019-09-03 19:20:52,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-09-03 19:20:52,889 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:20:52,889 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:20:52,889 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:20:52,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:20:52,889 INFO L82 PathProgramCache]: Analyzing trace with hash -2064168548, now seen corresponding path program 5 times [2019-09-03 19:20:52,890 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:20:52,890 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:20:52,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:20:52,890 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:20:52,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:20:52,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:20:53,059 ERROR L253 erpolLogProxyWrapper]: Interpolant 29 not inductive: (Check returned sat) [2019-09-03 19:20:53,088 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: generated interpolants did not pass sanity check at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:969) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.managedscript.ManagedScript.getInterpolants(ManagedScript.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:285) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsTree(InterpolatingTraceCheckCraig.java:271) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:207) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:109) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructCraig(TraceCheckConstructor.java:211) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:183) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:453) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:371) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-09-03 19:20:53,093 INFO L168 Benchmark]: Toolchain (without parser) took 62406.79 ms. Allocated memory was 136.8 MB in the beginning and 451.4 MB in the end (delta: 314.6 MB). Free memory was 84.2 MB in the beginning and 363.4 MB in the end (delta: -279.2 MB). Peak memory consumption was 35.4 MB. Max. memory is 7.1 GB. [2019-09-03 19:20:53,094 INFO L168 Benchmark]: CDTParser took 0.57 ms. Allocated memory is still 136.8 MB. Free memory was 102.9 MB in the beginning and 102.7 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-03 19:20:53,095 INFO L168 Benchmark]: CACSL2BoogieTranslator took 248.92 ms. Allocated memory is still 136.8 MB. Free memory was 84.0 MB in the beginning and 74.0 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. [2019-09-03 19:20:53,095 INFO L168 Benchmark]: Boogie Preprocessor took 127.44 ms. Allocated memory was 136.8 MB in the beginning and 197.1 MB in the end (delta: 60.3 MB). Free memory was 74.0 MB in the beginning and 174.4 MB in the end (delta: -100.4 MB). Peak memory consumption was 11.0 MB. Max. memory is 7.1 GB. [2019-09-03 19:20:53,096 INFO L168 Benchmark]: RCFGBuilder took 340.72 ms. Allocated memory is still 197.1 MB. Free memory was 174.4 MB in the beginning and 158.0 MB in the end (delta: 16.3 MB). Peak memory consumption was 16.3 MB. Max. memory is 7.1 GB. [2019-09-03 19:20:53,097 INFO L168 Benchmark]: TraceAbstraction took 61685.39 ms. Allocated memory was 197.1 MB in the beginning and 451.4 MB in the end (delta: 254.3 MB). Free memory was 158.0 MB in the beginning and 363.4 MB in the end (delta: -205.4 MB). Peak memory consumption was 48.9 MB. Max. memory is 7.1 GB. [2019-09-03 19:20:53,100 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.57 ms. Allocated memory is still 136.8 MB. Free memory was 102.9 MB in the beginning and 102.7 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 248.92 ms. Allocated memory is still 136.8 MB. Free memory was 84.0 MB in the beginning and 74.0 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 127.44 ms. Allocated memory was 136.8 MB in the beginning and 197.1 MB in the end (delta: 60.3 MB). Free memory was 74.0 MB in the beginning and 174.4 MB in the end (delta: -100.4 MB). Peak memory consumption was 11.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 340.72 ms. Allocated memory is still 197.1 MB. Free memory was 174.4 MB in the beginning and 158.0 MB in the end (delta: 16.3 MB). Peak memory consumption was 16.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 61685.39 ms. Allocated memory was 197.1 MB in the beginning and 451.4 MB in the end (delta: 254.3 MB). Free memory was 158.0 MB in the beginning and 363.4 MB in the end (delta: -205.4 MB). Peak memory consumption was 48.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: generated interpolants did not pass sanity check de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: generated interpolants did not pass sanity check: de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:969) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...