java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/mempurity-32bit-Automizer_Camel+AI_EQ.epf -i ../../../trunk/examples/svcomp/array-examples/data_structures_set_multi_proc_false-unreach-call_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d63d1fb [2018-01-27 22:47:13,422 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-27 22:47:13,424 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-27 22:47:13,446 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-27 22:47:13,446 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-27 22:47:13,447 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-27 22:47:13,448 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-27 22:47:13,452 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-27 22:47:13,454 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-27 22:47:13,454 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-27 22:47:13,456 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-27 22:47:13,457 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-27 22:47:13,458 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-27 22:47:13,459 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-27 22:47:13,460 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-27 22:47:13,470 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-27 22:47:13,472 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-27 22:47:13,474 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-27 22:47:13,475 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-27 22:47:13,479 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-27 22:47:13,482 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-27 22:47:13,482 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-27 22:47:13,482 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-27 22:47:13,486 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-27 22:47:13,487 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-27 22:47:13,488 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-27 22:47:13,489 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-27 22:47:13,489 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-27 22:47:13,489 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-27 22:47:13,492 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-27 22:47:13,493 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-27 22:47:13,493 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/mempurity-32bit-Automizer_Camel+AI_EQ.epf [2018-01-27 22:47:13,506 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-27 22:47:13,507 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-27 22:47:13,508 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-27 22:47:13,508 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-27 22:47:13,508 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-27 22:47:13,509 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-27 22:47:13,509 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-27 22:47:13,509 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-27 22:47:13,510 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-27 22:47:13,510 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-27 22:47:13,510 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-27 22:47:13,510 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-27 22:47:13,510 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-27 22:47:13,510 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-27 22:47:13,511 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-27 22:47:13,511 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-27 22:47:13,511 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-27 22:47:13,511 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-27 22:47:13,512 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-27 22:47:13,512 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-27 22:47:13,512 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-27 22:47:13,512 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-27 22:47:13,512 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-27 22:47:13,512 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-27 22:47:13,513 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-27 22:47:13,513 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-27 22:47:13,513 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-27 22:47:13,513 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-27 22:47:13,513 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-27 22:47:13,513 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-27 22:47:13,514 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-27 22:47:13,514 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-27 22:47:13,514 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-27 22:47:13,514 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-27 22:47:13,514 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-27 22:47:13,517 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-27 22:47:13,517 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-27 22:47:13,550 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-27 22:47:13,562 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-27 22:47:13,566 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-27 22:47:13,568 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-27 22:47:13,568 INFO L276 PluginConnector]: CDTParser initialized [2018-01-27 22:47:13,569 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/data_structures_set_multi_proc_false-unreach-call_ground.i [2018-01-27 22:47:13,678 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-27 22:47:13,686 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-27 22:47:13,687 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-27 22:47:13,687 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-27 22:47:13,694 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-27 22:47:13,696 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 10:47:13" (1/1) ... [2018-01-27 22:47:13,700 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68efc30f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 10:47:13, skipping insertion in model container [2018-01-27 22:47:13,700 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 10:47:13" (1/1) ... [2018-01-27 22:47:13,718 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-27 22:47:13,740 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-27 22:47:13,916 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-27 22:47:13,945 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-27 22:47:13,955 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 10:47:13 WrapperNode [2018-01-27 22:47:13,956 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-27 22:47:13,962 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-27 22:47:13,963 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-27 22:47:13,963 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-27 22:47:13,979 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 10:47:13" (1/1) ... [2018-01-27 22:47:13,979 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 10:47:13" (1/1) ... [2018-01-27 22:47:13,991 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 10:47:13" (1/1) ... [2018-01-27 22:47:13,991 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 10:47:13" (1/1) ... [2018-01-27 22:47:13,996 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 10:47:13" (1/1) ... [2018-01-27 22:47:14,008 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 10:47:13" (1/1) ... [2018-01-27 22:47:14,011 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 10:47:13" (1/1) ... [2018-01-27 22:47:14,013 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-27 22:47:14,014 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-27 22:47:14,014 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-27 22:47:14,014 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-27 22:47:14,015 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 10:47:13" (1/1) ... No working directory specified, using /storage/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 [2018-01-27 22:47:14,092 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-27 22:47:14,092 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-27 22:47:14,093 INFO L136 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-01-27 22:47:14,093 INFO L136 BoogieDeclarations]: Found implementation of procedure insert [2018-01-27 22:47:14,093 INFO L136 BoogieDeclarations]: Found implementation of procedure elem_exists [2018-01-27 22:47:14,093 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-27 22:47:14,093 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-27 22:47:14,093 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-27 22:47:14,093 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-27 22:47:14,094 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-27 22:47:14,094 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-27 22:47:14,094 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-27 22:47:14,094 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-01-27 22:47:14,094 INFO L128 BoogieDeclarations]: Found specification of procedure insert [2018-01-27 22:47:14,094 INFO L128 BoogieDeclarations]: Found specification of procedure elem_exists [2018-01-27 22:47:14,094 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-27 22:47:14,095 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-27 22:47:14,095 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-27 22:47:14,616 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-27 22:47:14,617 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 10:47:14 BoogieIcfgContainer [2018-01-27 22:47:14,617 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-27 22:47:14,618 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-27 22:47:14,618 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-27 22:47:14,621 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-27 22:47:14,621 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.01 10:47:13" (1/3) ... [2018-01-27 22:47:14,622 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70346012 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 10:47:14, skipping insertion in model container [2018-01-27 22:47:14,622 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 10:47:13" (2/3) ... [2018-01-27 22:47:14,622 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70346012 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 10:47:14, skipping insertion in model container [2018-01-27 22:47:14,622 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 10:47:14" (3/3) ... [2018-01-27 22:47:14,624 INFO L105 eAbstractionObserver]: Analyzing ICFG data_structures_set_multi_proc_false-unreach-call_ground.i [2018-01-27 22:47:14,633 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-27 22:47:14,640 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2018-01-27 22:47:14,690 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-27 22:47:14,690 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-27 22:47:14,690 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-27 22:47:14,690 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-27 22:47:14,691 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-27 22:47:14,691 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-27 22:47:14,691 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-27 22:47:14,691 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == elem_existsErr0EnsuresViolation======== [2018-01-27 22:47:14,692 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-27 22:47:14,711 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states. [2018-01-27 22:47:14,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-27 22:47:14,720 INFO L322 BasicCegarLoop]: Found error trace [2018-01-27 22:47:14,721 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-27 22:47:14,722 INFO L371 AbstractCegarLoop]: === Iteration 1 === [elem_existsErr0EnsuresViolation]=== [2018-01-27 22:47:14,731 INFO L82 PathProgramCache]: Analyzing trace with hash 596078378, now seen corresponding path program 1 times [2018-01-27 22:47:14,733 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-27 22:47:14,733 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-27 22:47:14,791 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 22:47:14,791 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-27 22:47:14,792 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 22:47:14,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 22:47:14,851 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-27 22:47:14,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-27 22:47:14,902 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-27 22:47:14,902 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-27 22:47:14,904 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-27 22:47:14,918 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-27 22:47:14,919 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-27 22:47:14,922 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 2 states. [2018-01-27 22:47:14,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-27 22:47:14,961 INFO L93 Difference]: Finished difference Result 128 states and 164 transitions. [2018-01-27 22:47:14,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-27 22:47:14,964 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2018-01-27 22:47:14,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-27 22:47:14,974 INFO L225 Difference]: With dead ends: 128 [2018-01-27 22:47:14,974 INFO L226 Difference]: Without dead ends: 0 [2018-01-27 22:47:14,985 INFO L533 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 [2018-01-27 22:47:15,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-27 22:47:15,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-27 22:47:15,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-27 22:47:15,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-27 22:47:15,144 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 17 [2018-01-27 22:47:15,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-27 22:47:15,145 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-27 22:47:15,145 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-27 22:47:15,145 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-27 22:47:15,145 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-27 22:47:15,150 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-27 22:47:15,245 INFO L399 ceAbstractionStarter]: For program point L9''''(lines 9 11) no Hoare annotation was computed. [2018-01-27 22:47:15,245 INFO L399 ceAbstractionStarter]: For program point L10(line 10) no Hoare annotation was computed. [2018-01-27 22:47:15,246 INFO L399 ceAbstractionStarter]: For program point elem_existsFINAL(lines 7 13) no Hoare annotation was computed. [2018-01-27 22:47:15,246 INFO L399 ceAbstractionStarter]: For program point L9(lines 9 11) no Hoare annotation was computed. [2018-01-27 22:47:15,246 INFO L399 ceAbstractionStarter]: For program point L9''(lines 9 11) no Hoare annotation was computed. [2018-01-27 22:47:15,246 INFO L399 ceAbstractionStarter]: For program point elem_existsErr0EnsuresViolation(lines 7 13) no Hoare annotation was computed. [2018-01-27 22:47:15,246 INFO L402 ceAbstractionStarter]: At program point elem_existsENTRY(lines 7 13) the Hoare annotation is: true [2018-01-27 22:47:15,247 INFO L402 ceAbstractionStarter]: At program point L9'''(lines 9 11) the Hoare annotation is: true [2018-01-27 22:47:15,247 INFO L399 ceAbstractionStarter]: For program point elem_existsEXIT(lines 7 13) no Hoare annotation was computed. [2018-01-27 22:47:15,247 INFO L399 ceAbstractionStarter]: For program point L10'(line 10) no Hoare annotation was computed. [2018-01-27 22:47:15,247 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.initErr0EnsuresViolation(lines 1 37) no Hoare annotation was computed. [2018-01-27 22:47:15,247 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 37) no Hoare annotation was computed. [2018-01-27 22:47:15,247 INFO L402 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 37) the Hoare annotation is: true [2018-01-27 22:47:15,247 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 37) no Hoare annotation was computed. [2018-01-27 22:47:15,248 INFO L402 ceAbstractionStarter]: At program point insertENTRY(lines 3 6) the Hoare annotation is: true [2018-01-27 22:47:15,248 INFO L399 ceAbstractionStarter]: For program point L4(line 4) no Hoare annotation was computed. [2018-01-27 22:47:15,248 INFO L399 ceAbstractionStarter]: For program point insertFINAL(lines 3 6) no Hoare annotation was computed. [2018-01-27 22:47:15,248 INFO L399 ceAbstractionStarter]: For program point insertEXIT(lines 3 6) no Hoare annotation was computed. [2018-01-27 22:47:15,248 INFO L399 ceAbstractionStarter]: For program point insertErr0EnsuresViolation(lines 3 6) no Hoare annotation was computed. [2018-01-27 22:47:15,248 INFO L399 ceAbstractionStarter]: For program point L4'(line 4) no Hoare annotation was computed. [2018-01-27 22:47:15,248 INFO L402 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 37) the Hoare annotation is: true [2018-01-27 22:47:15,249 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 37) no Hoare annotation was computed. [2018-01-27 22:47:15,249 INFO L402 ceAbstractionStarter]: At program point L1(lines 1 37) the Hoare annotation is: true [2018-01-27 22:47:15,249 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.startErr0EnsuresViolation(lines 1 37) no Hoare annotation was computed. [2018-01-27 22:47:15,249 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 37) no Hoare annotation was computed. [2018-01-27 22:47:15,249 INFO L399 ceAbstractionStarter]: For program point L21(line 21) no Hoare annotation was computed. [2018-01-27 22:47:15,249 INFO L399 ceAbstractionStarter]: For program point L20(lines 20 22) no Hoare annotation was computed. [2018-01-27 22:47:15,249 INFO L399 ceAbstractionStarter]: For program point L33'''(line 33) no Hoare annotation was computed. [2018-01-27 22:47:15,250 INFO L399 ceAbstractionStarter]: For program point L32''(lines 32 34) no Hoare annotation was computed. [2018-01-27 22:47:15,250 INFO L402 ceAbstractionStarter]: At program point L27(line 27) the Hoare annotation is: true [2018-01-27 22:47:15,250 INFO L399 ceAbstractionStarter]: For program point L26(lines 26 30) no Hoare annotation was computed. [2018-01-27 22:47:15,250 INFO L399 ceAbstractionStarter]: For program point L19''(lines 19 23) no Hoare annotation was computed. [2018-01-27 22:47:15,250 INFO L402 ceAbstractionStarter]: At program point L28(line 28) the Hoare annotation is: true [2018-01-27 22:47:15,250 INFO L399 ceAbstractionStarter]: For program point L27'(line 27) no Hoare annotation was computed. [2018-01-27 22:47:15,250 INFO L399 ceAbstractionStarter]: For program point L19''''(lines 19 23) no Hoare annotation was computed. [2018-01-27 22:47:15,251 INFO L399 ceAbstractionStarter]: For program point mainFINAL(lines 14 37) no Hoare annotation was computed. [2018-01-27 22:47:15,251 INFO L399 ceAbstractionStarter]: For program point L32(lines 32 34) no Hoare annotation was computed. [2018-01-27 22:47:15,251 INFO L402 ceAbstractionStarter]: At program point L32'''(lines 32 34) the Hoare annotation is: true [2018-01-27 22:47:15,251 INFO L399 ceAbstractionStarter]: For program point L31(lines 31 35) no Hoare annotation was computed. [2018-01-27 22:47:15,251 INFO L399 ceAbstractionStarter]: For program point L20''(lines 20 22) no Hoare annotation was computed. [2018-01-27 22:47:15,251 INFO L399 ceAbstractionStarter]: For program point L33(line 33) no Hoare annotation was computed. [2018-01-27 22:47:15,251 INFO L402 ceAbstractionStarter]: At program point L19'''(lines 19 23) the Hoare annotation is: true [2018-01-27 22:47:15,252 INFO L399 ceAbstractionStarter]: For program point mainEXIT(lines 14 37) no Hoare annotation was computed. [2018-01-27 22:47:15,252 INFO L402 ceAbstractionStarter]: At program point mainENTRY(lines 14 37) the Hoare annotation is: true [2018-01-27 22:47:15,253 INFO L399 ceAbstractionStarter]: For program point L26''(lines 26 30) no Hoare annotation was computed. [2018-01-27 22:47:15,253 INFO L402 ceAbstractionStarter]: At program point L26'''(lines 26 30) the Hoare annotation is: true [2018-01-27 22:47:15,253 INFO L402 ceAbstractionStarter]: At program point L31'''(lines 31 35) the Hoare annotation is: true [2018-01-27 22:47:15,253 INFO L402 ceAbstractionStarter]: At program point L33''(line 33) the Hoare annotation is: true [2018-01-27 22:47:15,253 INFO L399 ceAbstractionStarter]: For program point L31''(lines 31 35) no Hoare annotation was computed. [2018-01-27 22:47:15,253 INFO L399 ceAbstractionStarter]: For program point L16'''(line 16) no Hoare annotation was computed. [2018-01-27 22:47:15,254 INFO L399 ceAbstractionStarter]: For program point L31''''(lines 31 35) no Hoare annotation was computed. [2018-01-27 22:47:15,254 INFO L399 ceAbstractionStarter]: For program point L16''(line 16) no Hoare annotation was computed. [2018-01-27 22:47:15,254 INFO L399 ceAbstractionStarter]: For program point L33'(line 33) no Hoare annotation was computed. [2018-01-27 22:47:15,254 INFO L399 ceAbstractionStarter]: For program point L21'''(line 21) no Hoare annotation was computed. [2018-01-27 22:47:15,254 INFO L399 ceAbstractionStarter]: For program point L21'(line 21) no Hoare annotation was computed. [2018-01-27 22:47:15,254 INFO L399 ceAbstractionStarter]: For program point mainErr0EnsuresViolation(lines 14 37) no Hoare annotation was computed. [2018-01-27 22:47:15,254 INFO L399 ceAbstractionStarter]: For program point L26''''(lines 26 30) no Hoare annotation was computed. [2018-01-27 22:47:15,255 INFO L402 ceAbstractionStarter]: At program point L21''(line 21) the Hoare annotation is: true [2018-01-27 22:47:15,255 INFO L399 ceAbstractionStarter]: For program point L16(line 16) no Hoare annotation was computed. [2018-01-27 22:47:15,255 INFO L399 ceAbstractionStarter]: For program point L16'(line 16) no Hoare annotation was computed. [2018-01-27 22:47:15,255 INFO L399 ceAbstractionStarter]: For program point L19(lines 19 23) no Hoare annotation was computed. [2018-01-27 22:47:15,255 INFO L399 ceAbstractionStarter]: For program point L28'(line 28) no Hoare annotation was computed. [2018-01-27 22:47:15,255 INFO L399 ceAbstractionStarter]: For program point L27''(lines 27 29) no Hoare annotation was computed. [2018-01-27 22:47:15,255 INFO L402 ceAbstractionStarter]: At program point L20'''(lines 20 22) the Hoare annotation is: true [2018-01-27 22:47:15,256 INFO L399 ceAbstractionStarter]: For program point L2'(line 2) no Hoare annotation was computed. [2018-01-27 22:47:15,256 INFO L399 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(line 2) no Hoare annotation was computed. [2018-01-27 22:47:15,256 INFO L399 ceAbstractionStarter]: For program point __VERIFIER_assertErr0EnsuresViolation(line 2) no Hoare annotation was computed. [2018-01-27 22:47:15,256 INFO L399 ceAbstractionStarter]: For program point L2(line 2) no Hoare annotation was computed. [2018-01-27 22:47:15,256 INFO L399 ceAbstractionStarter]: For program point L2'''(line 2) no Hoare annotation was computed. [2018-01-27 22:47:15,256 INFO L402 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(line 2) the Hoare annotation is: true [2018-01-27 22:47:15,260 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-27 22:47:15,260 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-27 22:47:15,260 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-27 22:47:15,261 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-27 22:47:15,261 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-27 22:47:15,261 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-27 22:47:15,261 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-27 22:47:15,261 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-27 22:47:15,261 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-27 22:47:15,264 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states. [2018-01-27 22:47:15,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-27 22:47:15,264 INFO L322 BasicCegarLoop]: Found error trace [2018-01-27 22:47:15,265 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-27 22:47:15,265 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-27 22:47:15,265 INFO L82 PathProgramCache]: Analyzing trace with hash 166030, now seen corresponding path program 1 times [2018-01-27 22:47:15,265 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-27 22:47:15,265 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-27 22:47:15,266 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 22:47:15,266 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-27 22:47:15,267 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 22:47:15,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-27 22:47:15,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-27 22:47:15,294 INFO L389 BasicCegarLoop]: Counterexample might be feasible [2018-01-27 22:47:15,297 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-27 22:47:15,301 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-27 22:47:15,302 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-27 22:47:15,302 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-27 22:47:15,302 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-27 22:47:15,302 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-27 22:47:15,302 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-27 22:47:15,302 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-27 22:47:15,302 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == insertErr0EnsuresViolation======== [2018-01-27 22:47:15,303 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-27 22:47:15,305 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states. [2018-01-27 22:47:15,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-27 22:47:15,307 INFO L322 BasicCegarLoop]: Found error trace [2018-01-27 22:47:15,307 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-27 22:47:15,307 INFO L371 AbstractCegarLoop]: === Iteration 1 === [insertErr0EnsuresViolation]=== [2018-01-27 22:47:15,308 INFO L82 PathProgramCache]: Analyzing trace with hash 1134612362, now seen corresponding path program 1 times [2018-01-27 22:47:15,308 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-27 22:47:15,310 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-27 22:47:15,311 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 22:47:15,311 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-27 22:47:15,311 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 22:47:15,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 22:47:15,330 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-27 22:47:15,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-27 22:47:15,373 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-27 22:47:15,491 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-27 22:47:15,491 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-27 22:47:15,491 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-27 22:47:15,492 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-27 22:47:15,492 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 2 states. [2018-01-27 22:47:15,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-27 22:47:15,502 INFO L93 Difference]: Finished difference Result 128 states and 164 transitions. [2018-01-27 22:47:15,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-27 22:47:15,502 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 25 [2018-01-27 22:47:15,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-27 22:47:15,503 INFO L225 Difference]: With dead ends: 128 [2018-01-27 22:47:15,503 INFO L226 Difference]: Without dead ends: 0 [2018-01-27 22:47:15,504 INFO L533 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 [2018-01-27 22:47:15,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-27 22:47:15,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-27 22:47:15,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-27 22:47:15,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-27 22:47:15,505 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2018-01-27 22:47:15,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-27 22:47:15,506 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-27 22:47:15,507 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-27 22:47:15,507 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-27 22:47:15,507 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-27 22:47:15,509 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-27 22:47:15,509 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-27 22:47:15,509 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-27 22:47:15,509 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-27 22:47:15,510 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-27 22:47:15,510 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-27 22:47:15,510 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-27 22:47:15,510 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-27 22:47:15,510 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-27 22:47:15,512 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states. [2018-01-27 22:47:15,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-27 22:47:15,514 INFO L322 BasicCegarLoop]: Found error trace [2018-01-27 22:47:15,514 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-27 22:47:15,515 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-27 22:47:15,515 INFO L82 PathProgramCache]: Analyzing trace with hash -934928139, now seen corresponding path program 1 times [2018-01-27 22:47:15,515 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-27 22:47:15,515 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-27 22:47:15,517 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 22:47:15,517 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-27 22:47:15,517 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 22:47:15,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 22:47:15,527 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-27 22:47:15,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-27 22:47:15,545 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-27 22:47:15,546 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-27 22:47:15,546 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-27 22:47:15,546 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-27 22:47:15,546 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-27 22:47:15,547 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 2 states. [2018-01-27 22:47:15,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-27 22:47:15,556 INFO L93 Difference]: Finished difference Result 128 states and 164 transitions. [2018-01-27 22:47:15,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-27 22:47:15,557 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 19 [2018-01-27 22:47:15,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-27 22:47:15,562 INFO L225 Difference]: With dead ends: 128 [2018-01-27 22:47:15,562 INFO L226 Difference]: Without dead ends: 63 [2018-01-27 22:47:15,563 INFO L533 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 [2018-01-27 22:47:15,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-01-27 22:47:15,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-01-27 22:47:15,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-01-27 22:47:15,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 71 transitions. [2018-01-27 22:47:15,587 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 71 transitions. Word has length 19 [2018-01-27 22:47:15,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-27 22:47:15,587 INFO L432 AbstractCegarLoop]: Abstraction has 63 states and 71 transitions. [2018-01-27 22:47:15,587 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-27 22:47:15,588 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 71 transitions. [2018-01-27 22:47:15,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-27 22:47:15,595 INFO L322 BasicCegarLoop]: Found error trace [2018-01-27 22:47:15,595 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-27 22:47:15,595 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-27 22:47:15,595 INFO L82 PathProgramCache]: Analyzing trace with hash -776142171, now seen corresponding path program 1 times [2018-01-27 22:47:15,595 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-27 22:47:15,596 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-27 22:47:15,597 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 22:47:15,597 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-27 22:47:15,597 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 22:47:15,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 22:47:15,629 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-27 22:47:15,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-27 22:47:15,694 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-27 22:47:15,694 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-27 22:47:15,696 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-27 22:47:15,696 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-27 22:47:15,696 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-27 22:47:15,696 INFO L87 Difference]: Start difference. First operand 63 states and 71 transitions. Second operand 3 states. [2018-01-27 22:47:15,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-27 22:47:15,763 INFO L93 Difference]: Finished difference Result 93 states and 106 transitions. [2018-01-27 22:47:15,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-27 22:47:15,771 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-01-27 22:47:15,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-27 22:47:15,773 INFO L225 Difference]: With dead ends: 93 [2018-01-27 22:47:15,774 INFO L226 Difference]: Without dead ends: 71 [2018-01-27 22:47:15,775 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-27 22:47:15,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-01-27 22:47:15,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 65. [2018-01-27 22:47:15,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-01-27 22:47:15,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 73 transitions. [2018-01-27 22:47:15,792 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 73 transitions. Word has length 22 [2018-01-27 22:47:15,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-27 22:47:15,792 INFO L432 AbstractCegarLoop]: Abstraction has 65 states and 73 transitions. [2018-01-27 22:47:15,792 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-27 22:47:15,792 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 73 transitions. [2018-01-27 22:47:15,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-27 22:47:15,794 INFO L322 BasicCegarLoop]: Found error trace [2018-01-27 22:47:15,794 INFO L330 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-27 22:47:15,798 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-27 22:47:15,798 INFO L82 PathProgramCache]: Analyzing trace with hash -1643425263, now seen corresponding path program 1 times [2018-01-27 22:47:15,798 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-27 22:47:15,798 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-27 22:47:15,799 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 22:47:15,800 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-27 22:47:15,800 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 22:47:15,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 22:47:15,829 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-27 22:47:15,925 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-27 22:47:15,926 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-27 22:47:15,926 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-27 22:47:15,926 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-27 22:47:15,926 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-27 22:47:15,927 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-27 22:47:15,927 INFO L87 Difference]: Start difference. First operand 65 states and 73 transitions. Second operand 4 states. [2018-01-27 22:47:16,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-27 22:47:16,016 INFO L93 Difference]: Finished difference Result 109 states and 122 transitions. [2018-01-27 22:47:16,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-27 22:47:16,016 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-01-27 22:47:16,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-27 22:47:16,018 INFO L225 Difference]: With dead ends: 109 [2018-01-27 22:47:16,018 INFO L226 Difference]: Without dead ends: 65 [2018-01-27 22:47:16,019 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-27 22:47:16,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-01-27 22:47:16,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-01-27 22:47:16,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-01-27 22:47:16,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 72 transitions. [2018-01-27 22:47:16,027 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 72 transitions. Word has length 34 [2018-01-27 22:47:16,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-27 22:47:16,027 INFO L432 AbstractCegarLoop]: Abstraction has 65 states and 72 transitions. [2018-01-27 22:47:16,027 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-27 22:47:16,028 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 72 transitions. [2018-01-27 22:47:16,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-01-27 22:47:16,029 INFO L322 BasicCegarLoop]: Found error trace [2018-01-27 22:47:16,029 INFO L330 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-27 22:47:16,030 INFO L371 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-27 22:47:16,030 INFO L82 PathProgramCache]: Analyzing trace with hash -1041938855, now seen corresponding path program 1 times [2018-01-27 22:47:16,030 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-27 22:47:16,030 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-27 22:47:16,031 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 22:47:16,031 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-27 22:47:16,032 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 22:47:16,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 22:47:16,052 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-27 22:47:16,141 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-27 22:47:16,141 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-27 22:47:16,141 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-27 22:47:16,155 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-27 22:47:16,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 22:47:16,216 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-27 22:47:16,335 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-27 22:47:16,366 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-27 22:47:16,367 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-01-27 22:47:16,367 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-27 22:47:16,367 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-27 22:47:16,367 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-01-27 22:47:16,368 INFO L87 Difference]: Start difference. First operand 65 states and 72 transitions. Second operand 5 states. [2018-01-27 22:47:16,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-27 22:47:16,438 INFO L93 Difference]: Finished difference Result 101 states and 114 transitions. [2018-01-27 22:47:16,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-27 22:47:16,439 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2018-01-27 22:47:16,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-27 22:47:16,442 INFO L225 Difference]: With dead ends: 101 [2018-01-27 22:47:16,442 INFO L226 Difference]: Without dead ends: 79 [2018-01-27 22:47:16,443 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-01-27 22:47:16,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-01-27 22:47:16,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 73. [2018-01-27 22:47:16,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-01-27 22:47:16,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 82 transitions. [2018-01-27 22:47:16,453 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 82 transitions. Word has length 41 [2018-01-27 22:47:16,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-27 22:47:16,453 INFO L432 AbstractCegarLoop]: Abstraction has 73 states and 82 transitions. [2018-01-27 22:47:16,453 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-27 22:47:16,453 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 82 transitions. [2018-01-27 22:47:16,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-01-27 22:47:16,455 INFO L322 BasicCegarLoop]: Found error trace [2018-01-27 22:47:16,456 INFO L330 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-27 22:47:16,456 INFO L371 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-27 22:47:16,456 INFO L82 PathProgramCache]: Analyzing trace with hash -1985815003, now seen corresponding path program 2 times [2018-01-27 22:47:16,456 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-27 22:47:16,456 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-27 22:47:16,457 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 22:47:16,457 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-27 22:47:16,457 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 22:47:16,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 22:47:16,485 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-27 22:47:16,578 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-01-27 22:47:16,579 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-27 22:47:16,579 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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) [2018-01-27 22:47:16,594 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-27 22:47:16,621 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-27 22:47:16,640 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-27 22:47:16,648 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-27 22:47:16,653 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-27 22:47:16,931 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-01-27 22:47:16,965 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-27 22:47:16,965 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [5] total 12 [2018-01-27 22:47:16,966 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-27 22:47:16,966 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-27 22:47:16,966 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-01-27 22:47:16,966 INFO L87 Difference]: Start difference. First operand 73 states and 82 transitions. Second operand 12 states. [2018-01-27 22:47:17,263 WARN L143 SmtUtils]: Spent 100ms on a formula simplification that was a NOOP. DAG size: 8 [2018-01-27 22:47:17,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-27 22:47:17,852 INFO L93 Difference]: Finished difference Result 141 states and 167 transitions. [2018-01-27 22:47:17,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-27 22:47:17,852 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 60 [2018-01-27 22:47:17,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-27 22:47:17,856 INFO L225 Difference]: With dead ends: 141 [2018-01-27 22:47:17,856 INFO L226 Difference]: Without dead ends: 97 [2018-01-27 22:47:17,857 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=93, Invalid=369, Unknown=0, NotChecked=0, Total=462 [2018-01-27 22:47:17,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-01-27 22:47:17,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 86. [2018-01-27 22:47:17,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-01-27 22:47:17,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 98 transitions. [2018-01-27 22:47:17,872 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 98 transitions. Word has length 60 [2018-01-27 22:47:17,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-27 22:47:17,872 INFO L432 AbstractCegarLoop]: Abstraction has 86 states and 98 transitions. [2018-01-27 22:47:17,872 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-27 22:47:17,872 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 98 transitions. [2018-01-27 22:47:17,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-01-27 22:47:17,875 INFO L322 BasicCegarLoop]: Found error trace [2018-01-27 22:47:17,875 INFO L330 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-27 22:47:17,876 INFO L371 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-27 22:47:17,876 INFO L82 PathProgramCache]: Analyzing trace with hash -1818809765, now seen corresponding path program 1 times [2018-01-27 22:47:17,876 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-27 22:47:17,876 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-27 22:47:17,877 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 22:47:17,877 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-27 22:47:17,877 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 22:47:17,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 22:47:17,911 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-27 22:47:18,039 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-01-27 22:47:18,040 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-27 22:47:18,040 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-27 22:47:18,050 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-27 22:47:18,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 22:47:18,104 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-27 22:47:18,232 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-01-27 22:47:18,265 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-27 22:47:18,265 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-01-27 22:47:18,266 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-27 22:47:18,266 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-27 22:47:18,266 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-01-27 22:47:18,266 INFO L87 Difference]: Start difference. First operand 86 states and 98 transitions. Second operand 7 states. [2018-01-27 22:47:18,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-27 22:47:18,584 INFO L93 Difference]: Finished difference Result 122 states and 140 transitions. [2018-01-27 22:47:18,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-27 22:47:18,585 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 81 [2018-01-27 22:47:18,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-27 22:47:18,587 INFO L225 Difference]: With dead ends: 122 [2018-01-27 22:47:18,587 INFO L226 Difference]: Without dead ends: 100 [2018-01-27 22:47:18,588 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-01-27 22:47:18,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-01-27 22:47:18,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 94. [2018-01-27 22:47:18,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-01-27 22:47:18,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 108 transitions. [2018-01-27 22:47:18,613 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 108 transitions. Word has length 81 [2018-01-27 22:47:18,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-27 22:47:18,614 INFO L432 AbstractCegarLoop]: Abstraction has 94 states and 108 transitions. [2018-01-27 22:47:18,614 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-27 22:47:18,614 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 108 transitions. [2018-01-27 22:47:18,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-01-27 22:47:18,616 INFO L322 BasicCegarLoop]: Found error trace [2018-01-27 22:47:18,621 INFO L330 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-27 22:47:18,621 INFO L371 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-27 22:47:18,622 INFO L82 PathProgramCache]: Analyzing trace with hash -434004836, now seen corresponding path program 2 times [2018-01-27 22:47:18,622 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-27 22:47:18,622 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-27 22:47:18,623 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 22:47:18,623 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-27 22:47:18,623 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 22:47:18,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 22:47:18,692 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-27 22:47:18,893 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-01-27 22:47:18,893 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-27 22:47:18,893 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-27 22:47:18,898 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-27 22:47:18,915 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-27 22:47:18,944 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-27 22:47:18,960 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-27 22:47:18,967 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-27 22:47:19,401 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-01-27 22:47:19,423 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-27 22:47:19,423 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [7] total 19 [2018-01-27 22:47:19,424 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-01-27 22:47:19,424 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-01-27 22:47:19,424 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2018-01-27 22:47:19,424 INFO L87 Difference]: Start difference. First operand 94 states and 108 transitions. Second operand 19 states. [2018-01-27 22:47:19,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-27 22:47:19,852 INFO L93 Difference]: Finished difference Result 140 states and 163 transitions. [2018-01-27 22:47:19,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-01-27 22:47:19,853 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 101 [2018-01-27 22:47:19,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-27 22:47:19,854 INFO L225 Difference]: With dead ends: 140 [2018-01-27 22:47:19,854 INFO L226 Difference]: Without dead ends: 118 [2018-01-27 22:47:19,855 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=225, Invalid=965, Unknown=0, NotChecked=0, Total=1190 [2018-01-27 22:47:19,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-01-27 22:47:19,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 104. [2018-01-27 22:47:19,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-01-27 22:47:19,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 120 transitions. [2018-01-27 22:47:19,869 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 120 transitions. Word has length 101 [2018-01-27 22:47:19,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-27 22:47:19,870 INFO L432 AbstractCegarLoop]: Abstraction has 104 states and 120 transitions. [2018-01-27 22:47:19,870 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-01-27 22:47:19,870 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 120 transitions. [2018-01-27 22:47:19,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-01-27 22:47:19,872 INFO L322 BasicCegarLoop]: Found error trace [2018-01-27 22:47:19,872 INFO L330 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-27 22:47:19,872 INFO L371 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-27 22:47:19,872 INFO L82 PathProgramCache]: Analyzing trace with hash 1193826338, now seen corresponding path program 1 times [2018-01-27 22:47:19,872 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-27 22:47:19,872 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-27 22:47:19,873 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 22:47:19,873 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-27 22:47:19,873 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 22:47:19,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 22:47:19,919 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-27 22:47:20,483 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2018-01-27 22:47:20,502 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-27 22:47:20,503 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-27 22:47:20,508 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-27 22:47:20,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 22:47:20,570 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-27 22:47:20,623 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2018-01-27 22:47:20,643 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-27 22:47:20,643 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-01-27 22:47:20,644 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-27 22:47:20,644 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-27 22:47:20,644 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-01-27 22:47:20,644 INFO L87 Difference]: Start difference. First operand 104 states and 120 transitions. Second operand 9 states. [2018-01-27 22:47:20,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-27 22:47:20,727 INFO L93 Difference]: Finished difference Result 142 states and 164 transitions. [2018-01-27 22:47:20,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-27 22:47:20,732 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 126 [2018-01-27 22:47:20,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-27 22:47:20,734 INFO L225 Difference]: With dead ends: 142 [2018-01-27 22:47:20,734 INFO L226 Difference]: Without dead ends: 118 [2018-01-27 22:47:20,735 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-01-27 22:47:20,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-01-27 22:47:20,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 112. [2018-01-27 22:47:20,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-01-27 22:47:20,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 130 transitions. [2018-01-27 22:47:20,747 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 130 transitions. Word has length 126 [2018-01-27 22:47:20,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-27 22:47:20,748 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 130 transitions. [2018-01-27 22:47:20,748 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-27 22:47:20,748 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 130 transitions. [2018-01-27 22:47:20,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-01-27 22:47:20,750 INFO L322 BasicCegarLoop]: Found error trace [2018-01-27 22:47:20,750 INFO L330 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-27 22:47:20,750 INFO L371 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-27 22:47:20,750 INFO L82 PathProgramCache]: Analyzing trace with hash -515236991, now seen corresponding path program 2 times [2018-01-27 22:47:20,751 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-27 22:47:20,751 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-27 22:47:20,751 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 22:47:20,752 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-27 22:47:20,752 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 22:47:20,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 22:47:20,785 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-27 22:47:20,943 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2018-01-27 22:47:20,943 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-27 22:47:20,943 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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 [2018-01-27 22:47:20,953 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-27 22:47:20,971 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-27 22:47:21,007 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-27 22:47:21,020 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-27 22:47:21,027 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-27 22:47:21,081 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2018-01-27 22:47:21,115 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-27 22:47:21,115 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-01-27 22:47:21,115 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-27 22:47:21,116 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-27 22:47:21,116 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-01-27 22:47:21,116 INFO L87 Difference]: Start difference. First operand 112 states and 130 transitions. Second operand 10 states. [2018-01-27 22:47:21,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-27 22:47:21,190 INFO L93 Difference]: Finished difference Result 150 states and 174 transitions. [2018-01-27 22:47:21,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-27 22:47:21,190 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 146 [2018-01-27 22:47:21,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-27 22:47:21,191 INFO L225 Difference]: With dead ends: 150 [2018-01-27 22:47:21,192 INFO L226 Difference]: Without dead ends: 126 [2018-01-27 22:47:21,192 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-01-27 22:47:21,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-01-27 22:47:21,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 120. [2018-01-27 22:47:21,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-01-27 22:47:21,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 140 transitions. [2018-01-27 22:47:21,203 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 140 transitions. Word has length 146 [2018-01-27 22:47:21,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-27 22:47:21,204 INFO L432 AbstractCegarLoop]: Abstraction has 120 states and 140 transitions. [2018-01-27 22:47:21,204 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-27 22:47:21,204 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 140 transitions. [2018-01-27 22:47:21,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-01-27 22:47:21,205 INFO L322 BasicCegarLoop]: Found error trace [2018-01-27 22:47:21,206 INFO L330 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-27 22:47:21,206 INFO L371 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-27 22:47:21,206 INFO L82 PathProgramCache]: Analyzing trace with hash 1353677152, now seen corresponding path program 3 times [2018-01-27 22:47:21,206 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-27 22:47:21,206 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-27 22:47:21,207 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 22:47:21,207 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-27 22:47:21,207 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 22:47:21,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 22:47:21,240 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-27 22:47:21,477 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2018-01-27 22:47:21,477 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-27 22:47:21,477 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-27 22:47:21,482 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-27 22:47:21,500 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-27 22:47:21,508 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-27 22:47:21,521 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-27 22:47:21,527 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-27 22:47:21,665 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 320 trivial. 0 not checked. [2018-01-27 22:47:21,685 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-27 22:47:21,685 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [10] total 19 [2018-01-27 22:47:21,685 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-01-27 22:47:21,686 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-01-27 22:47:21,686 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2018-01-27 22:47:21,686 INFO L87 Difference]: Start difference. First operand 120 states and 140 transitions. Second operand 19 states. [2018-01-27 22:47:22,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-27 22:47:22,554 INFO L93 Difference]: Finished difference Result 191 states and 224 transitions. [2018-01-27 22:47:22,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-01-27 22:47:22,555 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 166 [2018-01-27 22:47:22,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-27 22:47:22,557 INFO L225 Difference]: With dead ends: 191 [2018-01-27 22:47:22,557 INFO L226 Difference]: Without dead ends: 164 [2018-01-27 22:47:22,558 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=356, Invalid=1366, Unknown=0, NotChecked=0, Total=1722 [2018-01-27 22:47:22,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-01-27 22:47:22,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 141. [2018-01-27 22:47:22,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-01-27 22:47:22,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 165 transitions. [2018-01-27 22:47:22,573 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 165 transitions. Word has length 166 [2018-01-27 22:47:22,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-27 22:47:22,574 INFO L432 AbstractCegarLoop]: Abstraction has 141 states and 165 transitions. [2018-01-27 22:47:22,574 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-01-27 22:47:22,574 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 165 transitions. [2018-01-27 22:47:22,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-01-27 22:47:22,577 INFO L322 BasicCegarLoop]: Found error trace [2018-01-27 22:47:22,577 INFO L330 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-27 22:47:22,578 INFO L371 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-27 22:47:22,578 INFO L82 PathProgramCache]: Analyzing trace with hash 1570475092, now seen corresponding path program 1 times [2018-01-27 22:47:22,578 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-27 22:47:22,578 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-27 22:47:22,579 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 22:47:22,579 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-27 22:47:22,579 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 22:47:22,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 22:47:22,616 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-27 22:47:22,804 INFO L134 CoverageAnalysis]: Checked inductivity of 566 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 562 trivial. 0 not checked. [2018-01-27 22:47:22,805 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-27 22:47:22,805 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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 [2018-01-27 22:47:22,811 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-27 22:47:22,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 22:47:22,894 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-27 22:47:23,137 INFO L134 CoverageAnalysis]: Checked inductivity of 566 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 326 trivial. 0 not checked. [2018-01-27 22:47:23,157 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-27 22:47:23,157 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 11] total 14 [2018-01-27 22:47:23,158 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-01-27 22:47:23,158 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-01-27 22:47:23,158 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2018-01-27 22:47:23,158 INFO L87 Difference]: Start difference. First operand 141 states and 165 transitions. Second operand 14 states. [2018-01-27 22:47:23,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-27 22:47:23,429 INFO L93 Difference]: Finished difference Result 288 states and 342 transitions. [2018-01-27 22:47:23,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-27 22:47:23,429 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 197 [2018-01-27 22:47:23,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-27 22:47:23,431 INFO L225 Difference]: With dead ends: 288 [2018-01-27 22:47:23,431 INFO L226 Difference]: Without dead ends: 165 [2018-01-27 22:47:23,432 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2018-01-27 22:47:23,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-01-27 22:47:23,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 159. [2018-01-27 22:47:23,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-01-27 22:47:23,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 187 transitions. [2018-01-27 22:47:23,449 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 187 transitions. Word has length 197 [2018-01-27 22:47:23,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-27 22:47:23,450 INFO L432 AbstractCegarLoop]: Abstraction has 159 states and 187 transitions. [2018-01-27 22:47:23,450 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-01-27 22:47:23,450 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 187 transitions. [2018-01-27 22:47:23,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2018-01-27 22:47:23,453 INFO L322 BasicCegarLoop]: Found error trace [2018-01-27 22:47:23,453 INFO L330 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-27 22:47:23,453 INFO L371 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-27 22:47:23,454 INFO L82 PathProgramCache]: Analyzing trace with hash 658360170, now seen corresponding path program 2 times [2018-01-27 22:47:23,454 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-27 22:47:23,454 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-27 22:47:23,455 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 22:47:23,455 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-27 22:47:23,455 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 22:47:23,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 22:47:23,494 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-27 22:47:24,279 INFO L134 CoverageAnalysis]: Checked inductivity of 735 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 429 trivial. 0 not checked. [2018-01-27 22:47:24,279 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-27 22:47:24,279 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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 [2018-01-27 22:47:24,285 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-27 22:47:24,305 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-27 22:47:24,345 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-27 22:47:24,352 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-27 22:47:24,356 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-27 22:47:24,445 INFO L134 CoverageAnalysis]: Checked inductivity of 735 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 429 trivial. 0 not checked. [2018-01-27 22:47:24,465 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-27 22:47:24,465 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-01-27 22:47:24,465 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-27 22:47:24,466 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-27 22:47:24,466 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-01-27 22:47:24,466 INFO L87 Difference]: Start difference. First operand 159 states and 187 transitions. Second operand 13 states. [2018-01-27 22:47:24,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-27 22:47:24,666 INFO L93 Difference]: Finished difference Result 204 states and 239 transitions. [2018-01-27 22:47:24,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-27 22:47:24,667 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 222 [2018-01-27 22:47:24,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-27 22:47:24,669 INFO L225 Difference]: With dead ends: 204 [2018-01-27 22:47:24,669 INFO L226 Difference]: Without dead ends: 173 [2018-01-27 22:47:24,670 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-01-27 22:47:24,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-01-27 22:47:24,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 167. [2018-01-27 22:47:24,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-01-27 22:47:24,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 197 transitions. [2018-01-27 22:47:24,689 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 197 transitions. Word has length 222 [2018-01-27 22:47:24,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-27 22:47:24,690 INFO L432 AbstractCegarLoop]: Abstraction has 167 states and 197 transitions. [2018-01-27 22:47:24,690 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-27 22:47:24,690 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 197 transitions. [2018-01-27 22:47:24,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2018-01-27 22:47:24,694 INFO L322 BasicCegarLoop]: Found error trace [2018-01-27 22:47:24,695 INFO L330 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-27 22:47:24,695 INFO L371 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-27 22:47:24,695 INFO L82 PathProgramCache]: Analyzing trace with hash -1225271607, now seen corresponding path program 3 times [2018-01-27 22:47:24,695 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-27 22:47:24,695 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-27 22:47:24,696 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 22:47:24,701 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-27 22:47:24,701 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 22:47:24,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 22:47:24,757 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-27 22:47:25,735 INFO L134 CoverageAnalysis]: Checked inductivity of 915 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 535 trivial. 0 not checked. [2018-01-27 22:47:25,735 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-27 22:47:25,735 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-27 22:47:25,740 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-27 22:47:25,764 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-27 22:47:25,774 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-27 22:47:25,792 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-27 22:47:25,793 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-27 22:47:25,799 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-27 22:47:26,132 INFO L134 CoverageAnalysis]: Checked inductivity of 915 backedges. 247 proven. 12 refuted. 0 times theorem prover too weak. 656 trivial. 0 not checked. [2018-01-27 22:47:26,156 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-27 22:47:26,156 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 25 [2018-01-27 22:47:26,157 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-01-27 22:47:26,157 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-01-27 22:47:26,157 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=484, Unknown=0, NotChecked=0, Total=600 [2018-01-27 22:47:26,157 INFO L87 Difference]: Start difference. First operand 167 states and 197 transitions. Second operand 25 states. [2018-01-27 22:47:27,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-27 22:47:27,586 INFO L93 Difference]: Finished difference Result 254 states and 301 transitions. [2018-01-27 22:47:27,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-01-27 22:47:27,587 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 242 [2018-01-27 22:47:27,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-27 22:47:27,590 INFO L225 Difference]: With dead ends: 254 [2018-01-27 22:47:27,590 INFO L226 Difference]: Without dead ends: 223 [2018-01-27 22:47:27,591 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 732 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=647, Invalid=2659, Unknown=0, NotChecked=0, Total=3306 [2018-01-27 22:47:27,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-01-27 22:47:27,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 187. [2018-01-27 22:47:27,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-01-27 22:47:27,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 221 transitions. [2018-01-27 22:47:27,610 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 221 transitions. Word has length 242 [2018-01-27 22:47:27,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-27 22:47:27,611 INFO L432 AbstractCegarLoop]: Abstraction has 187 states and 221 transitions. [2018-01-27 22:47:27,611 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-01-27 22:47:27,611 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 221 transitions. [2018-01-27 22:47:27,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2018-01-27 22:47:27,613 INFO L322 BasicCegarLoop]: Found error trace [2018-01-27 22:47:27,614 INFO L330 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 5, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-27 22:47:27,614 INFO L371 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-27 22:47:27,614 INFO L82 PathProgramCache]: Analyzing trace with hash -1397493900, now seen corresponding path program 4 times [2018-01-27 22:47:27,614 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-27 22:47:27,614 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-27 22:47:27,615 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 22:47:27,615 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-27 22:47:27,615 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 22:47:27,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 22:47:27,663 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-27 22:47:28,074 INFO L134 CoverageAnalysis]: Checked inductivity of 1146 backedges. 29 proven. 6 refuted. 0 times theorem prover too weak. 1111 trivial. 0 not checked. [2018-01-27 22:47:28,075 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-27 22:47:28,075 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-27 22:47:28,081 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-27 22:47:28,155 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-27 22:47:28,161 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-27 22:47:28,211 INFO L134 CoverageAnalysis]: Checked inductivity of 1146 backedges. 33 proven. 6 refuted. 0 times theorem prover too weak. 1107 trivial. 0 not checked. [2018-01-27 22:47:28,233 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-27 22:47:28,233 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-01-27 22:47:28,234 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-27 22:47:28,234 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-27 22:47:28,234 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-27 22:47:28,234 INFO L87 Difference]: Start difference. First operand 187 states and 221 transitions. Second operand 7 states. [2018-01-27 22:47:28,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-27 22:47:28,429 INFO L93 Difference]: Finished difference Result 519 states and 625 transitions. [2018-01-27 22:47:28,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-27 22:47:28,430 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 278 [2018-01-27 22:47:28,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-27 22:47:28,432 INFO L225 Difference]: With dead ends: 519 [2018-01-27 22:47:28,433 INFO L226 Difference]: Without dead ends: 335 [2018-01-27 22:47:28,434 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 280 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-01-27 22:47:28,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2018-01-27 22:47:28,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 220. [2018-01-27 22:47:28,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-01-27 22:47:28,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 260 transitions. [2018-01-27 22:47:28,461 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 260 transitions. Word has length 278 [2018-01-27 22:47:28,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-27 22:47:28,462 INFO L432 AbstractCegarLoop]: Abstraction has 220 states and 260 transitions. [2018-01-27 22:47:28,462 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-27 22:47:28,462 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 260 transitions. [2018-01-27 22:47:28,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2018-01-27 22:47:28,465 INFO L322 BasicCegarLoop]: Found error trace [2018-01-27 22:47:28,465 INFO L330 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 6, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-27 22:47:28,465 INFO L371 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-27 22:47:28,465 INFO L82 PathProgramCache]: Analyzing trace with hash 1695336879, now seen corresponding path program 5 times [2018-01-27 22:47:28,466 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-27 22:47:28,466 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-27 22:47:28,466 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 22:47:28,466 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-27 22:47:28,467 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 22:47:28,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 22:47:28,507 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-27 22:47:29,352 INFO L134 CoverageAnalysis]: Checked inductivity of 1174 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 712 trivial. 0 not checked. [2018-01-27 22:47:29,353 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-27 22:47:29,353 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-27 22:47:29,358 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-27 22:47:29,385 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-27 22:47:29,391 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-27 22:47:29,397 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-27 22:47:29,404 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-27 22:47:29,413 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-27 22:47:29,425 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-27 22:47:29,439 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-27 22:47:29,454 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-27 22:47:29,479 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-27 22:47:29,499 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-27 22:47:29,522 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-27 22:47:29,529 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-27 22:47:29,543 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-27 22:47:30,074 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-01-27 22:47:30,076 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 11 [2018-01-27 22:47:30,076 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-27 22:47:30,081 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-27 22:47:30,088 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-27 22:47:30,088 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:3 [2018-01-27 22:47:30,737 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2018-01-27 22:47:30,741 INFO L700 Elim1Store]: detected not equals via solver [2018-01-27 22:47:30,755 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2018-01-27 22:47:30,756 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-27 22:47:30,765 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-27 22:47:30,771 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-27 22:47:30,771 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:30 [2018-01-27 22:47:31,006 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2018-01-27 22:47:31,006 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-27 22:47:31,011 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-01-27 22:47:31,011 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:30, output treesize:23 [2018-01-27 22:47:33,019 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|v_main_~#set~7.base_BEFORE_CALL_2| Int) (v_main_~n~7_BEFORE_CALL_36 Int) (|v_main_~#set~7.offset_BEFORE_CALL_2| Int)) (and (<= 10 v_main_~n~7_BEFORE_CALL_36) (<= v_main_~n~7_BEFORE_CALL_36 10) (let ((.cse0 (select |c_#memory_int| |v_main_~#set~7.base_BEFORE_CALL_2|))) (= (select .cse0 |v_main_~#set~7.offset_BEFORE_CALL_2|) (select .cse0 (+ (* 4 v_main_~n~7_BEFORE_CALL_36) |v_main_~#set~7.offset_BEFORE_CALL_2| (- 4))))))) is different from true [2018-01-27 22:47:37,134 WARN L143 SmtUtils]: Spent 2013ms on a formula simplification that was a NOOP. DAG size: 30 [2018-01-27 22:47:41,223 WARN L143 SmtUtils]: Spent 2006ms on a formula simplification that was a NOOP. DAG size: 27 [2018-01-27 22:47:45,298 WARN L143 SmtUtils]: Spent 2005ms on a formula simplification that was a NOOP. DAG size: 24 [2018-01-27 22:47:47,395 WARN L143 SmtUtils]: Spent 2009ms on a formula simplification that was a NOOP. DAG size: 38 [2018-01-27 22:47:47,465 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 42 [2018-01-27 22:47:47,466 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-27 22:47:47,491 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 62 [2018-01-27 22:47:47,500 INFO L700 Elim1Store]: detected not equals via solver [2018-01-27 22:47:47,500 INFO L700 Elim1Store]: detected not equals via solver [2018-01-27 22:47:47,501 INFO L700 Elim1Store]: detected not equals via solver [2018-01-27 22:47:47,502 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 90 [2018-01-27 22:47:47,502 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-27 22:47:47,541 INFO L700 Elim1Store]: detected not equals via solver [2018-01-27 22:47:47,543 INFO L700 Elim1Store]: detected not equals via solver [2018-01-27 22:47:47,545 INFO L700 Elim1Store]: detected not equals via solver [2018-01-27 22:47:47,547 INFO L700 Elim1Store]: detected not equals via solver [2018-01-27 22:47:47,651 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 8 case distinctions, treesize of input 48 treesize of output 127 [2018-01-27 22:47:47,652 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 4 xjuncts. [2018-01-27 22:47:47,713 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-27 22:47:47,745 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-01-27 22:47:47,745 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:79, output treesize:111 [2018-01-27 22:47:49,967 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|v_main_~#set~7.base_BEFORE_CALL_4| Int) (v_main_~n~7_BEFORE_CALL_38 Int) (|v_main_~#set~7.offset_BEFORE_CALL_4| Int)) (let ((.cse1 (select |c_#memory_int| |v_main_~#set~7.base_BEFORE_CALL_4|)) (.cse2 (* 4 v_main_~n~7_BEFORE_CALL_38))) (let ((.cse0 (select .cse1 (+ .cse2 |v_main_~#set~7.offset_BEFORE_CALL_4| (- 8))))) (and (<= 11 v_main_~n~7_BEFORE_CALL_38) (= .cse0 (select .cse1 (+ .cse2 |v_main_~#set~7.offset_BEFORE_CALL_4| (- 4)))) (<= v_main_~n~7_BEFORE_CALL_38 11) (= .cse0 (select .cse1 |v_main_~#set~7.offset_BEFORE_CALL_4|)))))) is different from true [2018-01-27 22:47:54,338 WARN L143 SmtUtils]: Spent 2011ms on a formula simplification that was a NOOP. DAG size: 41 [2018-01-27 22:47:56,469 WARN L143 SmtUtils]: Spent 2013ms on a formula simplification that was a NOOP. DAG size: 41 [2018-01-27 22:47:58,591 WARN L143 SmtUtils]: Spent 2013ms on a formula simplification that was a NOOP. DAG size: 42 [2018-01-27 22:48:00,616 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v_main_~#set~7.base_BEFORE_CALL_4| Int) (v_main_~n~7_BEFORE_CALL_38 Int) (|v_main_~#set~7.offset_BEFORE_CALL_4| Int)) (let ((.cse1 (select |c_#memory_int| |v_main_~#set~7.base_BEFORE_CALL_4|)) (.cse2 (* 4 v_main_~n~7_BEFORE_CALL_38))) (let ((.cse0 (select .cse1 (+ .cse2 |v_main_~#set~7.offset_BEFORE_CALL_4| (- 8))))) (and (<= 11 v_main_~n~7_BEFORE_CALL_38) (= .cse0 (select .cse1 (+ .cse2 |v_main_~#set~7.offset_BEFORE_CALL_4| (- 4)))) (<= v_main_~n~7_BEFORE_CALL_38 11) (= .cse0 (select .cse1 |v_main_~#set~7.offset_BEFORE_CALL_4|)))))) (exists ((|v_main_~#set~7.base_BEFORE_CALL_5| Int) (|v_main_~#set~7.offset_BEFORE_CALL_5| Int) (v_main_~n~7_BEFORE_CALL_39 Int)) (let ((.cse3 (select |c_#memory_int| |v_main_~#set~7.base_BEFORE_CALL_5|)) (.cse4 (* 4 v_main_~n~7_BEFORE_CALL_39))) (let ((.cse5 (select .cse3 (+ |v_main_~#set~7.offset_BEFORE_CALL_5| .cse4 (- 8))))) (and (<= 11 v_main_~n~7_BEFORE_CALL_39) (= (select .cse3 (+ |v_main_~#set~7.offset_BEFORE_CALL_5| .cse4 (- 4))) .cse5) (<= v_main_~n~7_BEFORE_CALL_39 11) (= (select .cse3 |v_main_~#set~7.offset_BEFORE_CALL_5|) .cse5)))))) is different from true [2018-01-27 22:48:02,968 WARN L143 SmtUtils]: Spent 2090ms on a formula simplification that was a NOOP. DAG size: 44 [2018-01-27 22:48:04,568 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 49 [2018-01-27 22:48:04,615 INFO L700 Elim1Store]: detected not equals via solver [2018-01-27 22:48:04,641 INFO L700 Elim1Store]: detected not equals via solver [2018-01-27 22:48:04,661 INFO L700 Elim1Store]: detected not equals via solver [2018-01-27 22:48:04,662 INFO L682 Elim1Store]: detected equality via solver [2018-01-27 22:48:04,663 INFO L700 Elim1Store]: detected not equals via solver [2018-01-27 22:48:04,663 INFO L700 Elim1Store]: detected not equals via solver [2018-01-27 22:48:04,664 INFO L682 Elim1Store]: detected equality via solver [2018-01-27 22:48:04,665 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 84 [2018-01-27 22:48:04,665 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-27 22:48:04,676 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-27 22:48:04,682 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-27 22:48:04,682 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:75, output treesize:3 [2018-01-27 22:48:04,986 INFO L134 CoverageAnalysis]: Checked inductivity of 1174 backedges. 291 proven. 549 refuted. 2 times theorem prover too weak. 322 trivial. 10 not checked. [2018-01-27 22:48:05,006 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-27 22:48:05,006 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 62] total 74 [2018-01-27 22:48:05,007 INFO L409 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-01-27 22:48:05,007 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-01-27 22:48:05,008 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=239, Invalid=4736, Unknown=7, NotChecked=420, Total=5402 [2018-01-27 22:48:05,009 INFO L87 Difference]: Start difference. First operand 220 states and 260 transitions. Second operand 74 states. Received shutdown request... [2018-01-27 22:48:26,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-01-27 22:48:26,389 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-27 22:48:26,391 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-27 22:48:26,391 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-27 22:48:26,391 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-27 22:48:26,391 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-27 22:48:26,391 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-27 22:48:26,391 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-27 22:48:26,391 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-27 22:48:26,391 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-27 22:48:26,391 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-27 22:48:26,397 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states. [2018-01-27 22:48:26,398 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-27 22:48:26,400 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-27 22:48:26,400 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-27 22:48:26,400 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-27 22:48:26,400 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-27 22:48:26,400 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-27 22:48:26,401 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-27 22:48:26,401 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-27 22:48:26,401 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == __VERIFIER_assertErr0EnsuresViolation======== [2018-01-27 22:48:26,401 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-27 22:48:26,402 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states. [2018-01-27 22:48:26,402 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-27 22:48:26,403 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.01 10:48:26 BoogieIcfgContainer [2018-01-27 22:48:26,403 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-27 22:48:26,404 INFO L168 Benchmark]: Toolchain (without parser) took 72724.81 ms. Allocated memory was 302.0 MB in the beginning and 706.7 MB in the end (delta: 404.8 MB). Free memory was 262.7 MB in the beginning and 618.0 MB in the end (delta: -355.3 MB). Peak memory consumption was 49.5 MB. Max. memory is 5.3 GB. [2018-01-27 22:48:26,409 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 302.0 MB. Free memory is still 266.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-27 22:48:26,409 INFO L168 Benchmark]: CACSL2BoogieTranslator took 274.88 ms. Allocated memory is still 302.0 MB. Free memory was 260.7 MB in the beginning and 252.7 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 5.3 GB. [2018-01-27 22:48:26,409 INFO L168 Benchmark]: Boogie Preprocessor took 50.79 ms. Allocated memory is still 302.0 MB. Free memory was 252.7 MB in the beginning and 250.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-27 22:48:26,410 INFO L168 Benchmark]: RCFGBuilder took 603.23 ms. Allocated memory is still 302.0 MB. Free memory was 250.7 MB in the beginning and 229.7 MB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 5.3 GB. [2018-01-27 22:48:26,410 INFO L168 Benchmark]: TraceAbstraction took 71785.31 ms. Allocated memory was 302.0 MB in the beginning and 706.7 MB in the end (delta: 404.8 MB). Free memory was 229.7 MB in the beginning and 618.0 MB in the end (delta: -388.3 MB). Peak memory consumption was 16.4 MB. Max. memory is 5.3 GB. [2018-01-27 22:48:26,412 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 302.0 MB. Free memory is still 266.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 274.88 ms. Allocated memory is still 302.0 MB. Free memory was 260.7 MB in the beginning and 252.7 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 50.79 ms. Allocated memory is still 302.0 MB. Free memory was 252.7 MB in the beginning and 250.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 603.23 ms. Allocated memory is still 302.0 MB. Free memory was 250.7 MB in the beginning and 229.7 MB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 5.3 GB. * TraceAbstraction took 71785.31 ms. Allocated memory was 302.0 MB in the beginning and 706.7 MB in the end (delta: 404.8 MB). Free memory was 229.7 MB in the beginning and 618.0 MB in the end (delta: -388.3 MB). Peak memory consumption was 16.4 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 7]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data for error location: elem_existsErr0EnsuresViolation CFG has 6 procedures, 70 locations, 6 error locations. SAFE Result, 0.5s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 75 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=70occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 17 LocationsWithAnnotation, 23 PreInvPairs, 32 NumberOfFragments, 17 HoareAnnotationTreeSize, 23 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 17 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 17 NumberOfCodeBlocks, 17 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 16 ConstructedInterpolants, 0 QuantifiedInterpolants, 256 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - CounterExampleResult [Line: 1]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.initErr0EnsuresViolation CFG has 6 procedures, 70 locations, 6 error locations. UNSAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=70occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 3 NumberOfCodeBlocks, 3 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - PositiveResult [Line: 3]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data for error location: insertErr0EnsuresViolation CFG has 6 procedures, 70 locations, 6 error locations. SAFE Result, 0.2s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 75 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=70occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 25 NumberOfCodeBlocks, 25 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 24 ConstructedInterpolants, 0 QuantifiedInterpolants, 576 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 1). Cancelled while BasicCegarLoop was constructing difference of abstraction (220states) and interpolant automaton (currently 17 states, 74 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 87 known predicates. - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0EnsuresViolation CFG has 6 procedures, 70 locations, 6 error locations. TIMEOUT Result, 70.8s OverallTime, 15 OverallIterations, 12 TraceHistogramMax, 26.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1072 SDtfs, 752 SDslu, 6596 SDs, 0 SdLazy, 4125 SolverSat, 406 SolverUnsat, 7 SolverUnknown, 0 SolverNotchecked, 17.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2152 GetRequests, 1858 SyntacticMatches, 1 SemanticMatches, 292 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 2799 ImplicationChecksByTransitivity, 45.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=220occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 14 MinimizatonAttempts, 241 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 42.1s InterpolantComputationTime, 3973 NumberOfCodeBlocks, 3627 NumberOfCodeBlocksAsserted, 44 NumberOfCheckSat, 3946 ConstructedInterpolants, 41 QuantifiedInterpolants, 2292314 SizeOfPredicates, 108 NumberOfNonLiveVariables, 4948 ConjunctsInSsa, 369 ConjunctsInUnsatCore, 27 InterpolantComputations, 6 PerfectInterpolantSequences, 8317/11356 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - TimeoutResultAtElement [Line: 14]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 14). Cancelled while IsEmpty was searching accepting run (input had 70 states). - StatisticsResult: Ultimate Automizer benchmark data for error location: mainErr0EnsuresViolation CFG has 6 procedures, 70 locations, 6 error locations. TIMEOUT Result, 0.0s OverallTime, 0 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=70occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - TimeoutResultAtElement [Line: 2]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 2). Cancelled while IsEmpty was searching accepting run (input had 70 states). - StatisticsResult: Ultimate Automizer benchmark data for error location: __VERIFIER_assertErr0EnsuresViolation CFG has 6 procedures, 70 locations, 6 error locations. TIMEOUT Result, 0.0s OverallTime, 0 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=70occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/data_structures_set_multi_proc_false-unreach-call_ground.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-27_22-48-26-427.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/data_structures_set_multi_proc_false-unreach-call_ground.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-27_22-48-26-427.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/data_structures_set_multi_proc_false-unreach-call_ground.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-1-2018-01-27_22-48-26-427.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/data_structures_set_multi_proc_false-unreach-call_ground.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-2-2018-01-27_22-48-26-427.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/data_structures_set_multi_proc_false-unreach-call_ground.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-3-2018-01-27_22-48-26-427.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/data_structures_set_multi_proc_false-unreach-call_ground.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-4-2018-01-27_22-48-26-427.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/data_structures_set_multi_proc_false-unreach-call_ground.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-5-2018-01-27_22-48-26-427.csv Completed graceful shutdown