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/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test18_3_false-valid-memtrack_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cceb4a [2018-01-30 00:05:59,524 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-30 00:05:59,526 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-30 00:05:59,539 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-30 00:05:59,539 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-30 00:05:59,540 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-30 00:05:59,541 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-30 00:05:59,543 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-30 00:05:59,545 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-30 00:05:59,546 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-30 00:05:59,546 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-30 00:05:59,546 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-30 00:05:59,547 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-30 00:05:59,548 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-30 00:05:59,549 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-30 00:05:59,551 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-30 00:05:59,553 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-30 00:05:59,555 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-30 00:05:59,556 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-30 00:05:59,557 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-30 00:05:59,560 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-30 00:05:59,560 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-30 00:05:59,560 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-30 00:05:59,561 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-30 00:05:59,562 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-30 00:05:59,563 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-30 00:05:59,564 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-30 00:05:59,564 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-30 00:05:59,564 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-30 00:05:59,565 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-30 00:05:59,565 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-30 00:05:59,566 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf [2018-01-30 00:05:59,575 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-30 00:05:59,576 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-30 00:05:59,576 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-30 00:05:59,577 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-30 00:05:59,577 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-30 00:05:59,577 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-30 00:05:59,577 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-30 00:05:59,578 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-30 00:05:59,578 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-30 00:05:59,578 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-30 00:05:59,578 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-30 00:05:59,578 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-30 00:05:59,579 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-30 00:05:59,579 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-30 00:05:59,579 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-30 00:05:59,579 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-30 00:05:59,579 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-30 00:05:59,580 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-30 00:05:59,580 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-30 00:05:59,580 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-30 00:05:59,580 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-30 00:05:59,580 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-30 00:05:59,581 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-30 00:05:59,581 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-30 00:05:59,581 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-30 00:05:59,581 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-30 00:05:59,581 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-30 00:05:59,582 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-30 00:05:59,582 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-30 00:05:59,582 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-30 00:05:59,582 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-30 00:05:59,582 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-30 00:05:59,583 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-30 00:05:59,583 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-30 00:05:59,617 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-30 00:05:59,629 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-30 00:05:59,633 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-30 00:05:59,635 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-30 00:05:59,635 INFO L276 PluginConnector]: CDTParser initialized [2018-01-30 00:05:59,636 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test18_3_false-valid-memtrack_true-termination.i [2018-01-30 00:05:59,823 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-30 00:05:59,827 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-30 00:05:59,827 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-30 00:05:59,828 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-30 00:05:59,832 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-30 00:05:59,833 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 12:05:59" (1/1) ... [2018-01-30 00:05:59,836 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46819eb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:05:59, skipping insertion in model container [2018-01-30 00:05:59,837 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 12:05:59" (1/1) ... [2018-01-30 00:05:59,855 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-30 00:05:59,906 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-30 00:06:00,009 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-30 00:06:00,023 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-30 00:06:00,028 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:06:00 WrapperNode [2018-01-30 00:06:00,028 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-30 00:06:00,029 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-30 00:06:00,029 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-30 00:06:00,029 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-30 00:06:00,041 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:06:00" (1/1) ... [2018-01-30 00:06:00,041 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:06:00" (1/1) ... [2018-01-30 00:06:00,052 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:06:00" (1/1) ... [2018-01-30 00:06:00,074 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:06:00" (1/1) ... [2018-01-30 00:06:00,077 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:06:00" (1/1) ... [2018-01-30 00:06:00,079 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:06:00" (1/1) ... [2018-01-30 00:06:00,080 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:06:00" (1/1) ... [2018-01-30 00:06:00,081 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-30 00:06:00,082 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-30 00:06:00,082 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-30 00:06:00,082 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-30 00:06:00,083 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:06:00" (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-30 00:06:00,129 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-30 00:06:00,129 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-30 00:06:00,130 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-30 00:06:00,130 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-30 00:06:00,130 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-30 00:06:00,130 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-30 00:06:00,130 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-30 00:06:00,130 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-30 00:06:00,130 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-30 00:06:00,131 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-30 00:06:00,131 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-30 00:06:00,131 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-30 00:06:00,131 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-30 00:06:00,131 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-30 00:06:00,131 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-30 00:06:00,132 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-30 00:06:00,132 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-30 00:06:00,304 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-30 00:06:00,304 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 12:06:00 BoogieIcfgContainer [2018-01-30 00:06:00,304 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-30 00:06:00,305 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-30 00:06:00,305 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-30 00:06:00,308 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-30 00:06:00,308 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.01 12:05:59" (1/3) ... [2018-01-30 00:06:00,309 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44f3fa4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 12:06:00, skipping insertion in model container [2018-01-30 00:06:00,309 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:06:00" (2/3) ... [2018-01-30 00:06:00,309 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44f3fa4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 12:06:00, skipping insertion in model container [2018-01-30 00:06:00,309 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 12:06:00" (3/3) ... [2018-01-30 00:06:00,311 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test18_3_false-valid-memtrack_true-termination.i [2018-01-30 00:06:00,317 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-30 00:06:00,323 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-01-30 00:06:00,371 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-30 00:06:00,371 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-30 00:06:00,371 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-30 00:06:00,372 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-30 00:06:00,372 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-30 00:06:00,372 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-30 00:06:00,372 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-30 00:06:00,372 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-30 00:06:00,373 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-30 00:06:00,388 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states. [2018-01-30 00:06:00,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-30 00:06:00,393 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:06:00,394 INFO L350 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] [2018-01-30 00:06:00,394 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-30 00:06:00,400 INFO L82 PathProgramCache]: Analyzing trace with hash 684105477, now seen corresponding path program 1 times [2018-01-30 00:06:00,402 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:06:00,403 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:06:00,454 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:06:00,454 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:06:00,454 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:06:00,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:06:00,505 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:06:00,595 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-30 00:06:00,598 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:06:00,599 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-30 00:06:00,601 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 00:06:00,616 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 00:06:00,617 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 00:06:00,619 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 3 states. [2018-01-30 00:06:00,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:06:00,811 INFO L93 Difference]: Finished difference Result 70 states and 80 transitions. [2018-01-30 00:06:00,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 00:06:00,813 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-01-30 00:06:00,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:06:00,822 INFO L225 Difference]: With dead ends: 70 [2018-01-30 00:06:00,822 INFO L226 Difference]: Without dead ends: 57 [2018-01-30 00:06:00,825 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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-30 00:06:00,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-01-30 00:06:00,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2018-01-30 00:06:00,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-01-30 00:06:00,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 63 transitions. [2018-01-30 00:06:00,862 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 63 transitions. Word has length 24 [2018-01-30 00:06:00,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:06:00,863 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 63 transitions. [2018-01-30 00:06:00,863 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 00:06:00,863 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2018-01-30 00:06:00,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-30 00:06:00,865 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:06:00,865 INFO L350 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-30 00:06:00,865 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-30 00:06:00,865 INFO L82 PathProgramCache]: Analyzing trace with hash -380665648, now seen corresponding path program 1 times [2018-01-30 00:06:00,865 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:06:00,865 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:06:00,867 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:06:00,867 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:06:00,867 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:06:00,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:06:00,892 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:06:00,986 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-30 00:06:00,986 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:06:00,986 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 00:06:00,988 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 00:06:00,988 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 00:06:00,989 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-30 00:06:00,989 INFO L87 Difference]: Start difference. First operand 55 states and 63 transitions. Second operand 6 states. [2018-01-30 00:06:01,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:06:01,084 INFO L93 Difference]: Finished difference Result 72 states and 82 transitions. [2018-01-30 00:06:01,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-30 00:06:01,085 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-01-30 00:06:01,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:06:01,086 INFO L225 Difference]: With dead ends: 72 [2018-01-30 00:06:01,086 INFO L226 Difference]: Without dead ends: 68 [2018-01-30 00:06:01,087 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-30 00:06:01,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-01-30 00:06:01,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 55. [2018-01-30 00:06:01,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-01-30 00:06:01,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 62 transitions. [2018-01-30 00:06:01,096 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 62 transitions. Word has length 25 [2018-01-30 00:06:01,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:06:01,097 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 62 transitions. [2018-01-30 00:06:01,097 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 00:06:01,097 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 62 transitions. [2018-01-30 00:06:01,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-30 00:06:01,098 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:06:01,098 INFO L350 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, 1, 1] [2018-01-30 00:06:01,099 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-30 00:06:01,099 INFO L82 PathProgramCache]: Analyzing trace with hash -737007156, now seen corresponding path program 1 times [2018-01-30 00:06:01,099 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:06:01,099 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:06:01,101 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:06:01,101 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:06:01,101 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:06:01,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:06:01,120 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:06:01,171 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-30 00:06:01,171 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:06:01,171 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 00:06:01,171 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 00:06:01,171 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 00:06:01,172 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-30 00:06:01,172 INFO L87 Difference]: Start difference. First operand 55 states and 62 transitions. Second operand 4 states. [2018-01-30 00:06:01,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:06:01,228 INFO L93 Difference]: Finished difference Result 77 states and 90 transitions. [2018-01-30 00:06:01,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 00:06:01,229 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2018-01-30 00:06:01,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:06:01,230 INFO L225 Difference]: With dead ends: 77 [2018-01-30 00:06:01,231 INFO L226 Difference]: Without dead ends: 73 [2018-01-30 00:06:01,231 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-30 00:06:01,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-01-30 00:06:01,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 57. [2018-01-30 00:06:01,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-01-30 00:06:01,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 64 transitions. [2018-01-30 00:06:01,243 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 64 transitions. Word has length 27 [2018-01-30 00:06:01,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:06:01,243 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 64 transitions. [2018-01-30 00:06:01,243 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 00:06:01,244 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 64 transitions. [2018-01-30 00:06:01,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-30 00:06:01,245 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:06:01,245 INFO L350 BasicCegarLoop]: trace histogram [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-30 00:06:01,245 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-30 00:06:01,246 INFO L82 PathProgramCache]: Analyzing trace with hash 532330910, now seen corresponding path program 1 times [2018-01-30 00:06:01,246 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:06:01,246 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:06:01,247 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:06:01,248 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:06:01,248 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:06:01,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:06:01,261 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:06:01,323 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-30 00:06:01,323 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:06:01,323 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-30 00:06:01,335 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:06:01,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:06:01,378 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:06:01,430 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:06:01,464 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-30 00:06:01,464 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 5 [2018-01-30 00:06:01,464 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-30 00:06:01,465 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-30 00:06:01,465 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-30 00:06:01,465 INFO L87 Difference]: Start difference. First operand 57 states and 64 transitions. Second operand 5 states. [2018-01-30 00:06:01,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:06:01,519 INFO L93 Difference]: Finished difference Result 84 states and 92 transitions. [2018-01-30 00:06:01,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-30 00:06:01,520 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2018-01-30 00:06:01,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:06:01,521 INFO L225 Difference]: With dead ends: 84 [2018-01-30 00:06:01,521 INFO L226 Difference]: Without dead ends: 43 [2018-01-30 00:06:01,522 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 32 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-30 00:06:01,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-01-30 00:06:01,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-01-30 00:06:01,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-01-30 00:06:01,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 45 transitions. [2018-01-30 00:06:01,529 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 45 transitions. Word has length 34 [2018-01-30 00:06:01,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:06:01,529 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 45 transitions. [2018-01-30 00:06:01,529 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-30 00:06:01,529 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2018-01-30 00:06:01,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-30 00:06:01,531 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:06:01,531 INFO L350 BasicCegarLoop]: trace histogram [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] [2018-01-30 00:06:01,531 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-30 00:06:01,531 INFO L82 PathProgramCache]: Analyzing trace with hash -390587991, now seen corresponding path program 1 times [2018-01-30 00:06:01,532 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:06:01,532 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:06:01,533 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:06:01,534 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:06:01,534 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:06:01,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:06:01,551 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:06:01,637 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:06:01,637 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:06:01,637 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) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 00:06:01,643 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:06:01,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:06:01,681 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:06:01,705 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 6 treesize of output 5 [2018-01-30 00:06:01,707 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:06:01,709 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:06:01,710 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-30 00:06:01,735 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:06:01,756 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:06:01,757 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-01-30 00:06:01,757 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-30 00:06:01,757 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-30 00:06:01,757 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-30 00:06:01,758 INFO L87 Difference]: Start difference. First operand 43 states and 45 transitions. Second operand 7 states. [2018-01-30 00:06:01,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:06:01,920 INFO L93 Difference]: Finished difference Result 48 states and 50 transitions. [2018-01-30 00:06:01,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-30 00:06:01,920 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 35 [2018-01-30 00:06:01,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:06:01,922 INFO L225 Difference]: With dead ends: 48 [2018-01-30 00:06:01,922 INFO L226 Difference]: Without dead ends: 47 [2018-01-30 00:06:01,923 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-01-30 00:06:01,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-01-30 00:06:01,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2018-01-30 00:06:01,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-01-30 00:06:01,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2018-01-30 00:06:01,930 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 35 [2018-01-30 00:06:01,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:06:01,930 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 49 transitions. [2018-01-30 00:06:01,930 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-30 00:06:01,931 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2018-01-30 00:06:01,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-30 00:06:01,932 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:06:01,932 INFO L350 BasicCegarLoop]: trace histogram [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] [2018-01-30 00:06:01,932 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-30 00:06:01,933 INFO L82 PathProgramCache]: Analyzing trace with hash -390587990, now seen corresponding path program 1 times [2018-01-30 00:06:01,933 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:06:01,933 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:06:01,934 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:06:01,935 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:06:01,935 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:06:01,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:06:01,956 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:06:02,375 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:06:02,376 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:06:02,376 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-30 00:06:02,389 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:06:02,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:06:02,416 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:06:02,456 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 20 treesize of output 19 [2018-01-30 00:06:02,457 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:06:02,481 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 17 treesize of output 16 [2018-01-30 00:06:02,481 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:06:02,511 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-30 00:06:02,511 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-01-30 00:06:02,873 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:06:02,904 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:06:02,904 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2018-01-30 00:06:02,904 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-01-30 00:06:02,905 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-01-30 00:06:02,905 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2018-01-30 00:06:02,905 INFO L87 Difference]: Start difference. First operand 46 states and 49 transitions. Second operand 16 states. [2018-01-30 00:06:03,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:06:03,353 INFO L93 Difference]: Finished difference Result 65 states and 73 transitions. [2018-01-30 00:06:03,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-30 00:06:03,353 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 35 [2018-01-30 00:06:03,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:06:03,355 INFO L225 Difference]: With dead ends: 65 [2018-01-30 00:06:03,355 INFO L226 Difference]: Without dead ends: 64 [2018-01-30 00:06:03,355 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=89, Invalid=463, Unknown=0, NotChecked=0, Total=552 [2018-01-30 00:06:03,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-01-30 00:06:03,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 50. [2018-01-30 00:06:03,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-01-30 00:06:03,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2018-01-30 00:06:03,363 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 35 [2018-01-30 00:06:03,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:06:03,364 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2018-01-30 00:06:03,364 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-01-30 00:06:03,364 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2018-01-30 00:06:03,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-30 00:06:03,365 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:06:03,365 INFO L350 BasicCegarLoop]: trace histogram [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-30 00:06:03,365 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-30 00:06:03,367 INFO L82 PathProgramCache]: Analyzing trace with hash 1618317978, now seen corresponding path program 1 times [2018-01-30 00:06:03,367 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:06:03,368 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:06:03,369 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:06:03,369 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:06:03,369 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:06:03,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:06:03,391 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:06:03,555 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:06:03,556 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:06:03,556 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-30 00:06:03,568 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:06:03,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:06:03,588 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:06:03,597 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 6 treesize of output 5 [2018-01-30 00:06:03,598 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:06:03,599 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:06:03,599 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-30 00:06:03,623 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:06:03,624 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:06:03,627 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-01-30 00:06:03,628 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:06:03,636 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-30 00:06:03,636 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-01-30 00:06:03,661 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:06:03,683 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:06:03,683 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2018-01-30 00:06:03,684 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-30 00:06:03,684 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-30 00:06:03,684 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-01-30 00:06:03,684 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand 11 states. [2018-01-30 00:06:03,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:06:03,925 INFO L93 Difference]: Finished difference Result 64 states and 71 transitions. [2018-01-30 00:06:03,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-30 00:06:03,925 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 36 [2018-01-30 00:06:03,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:06:03,926 INFO L225 Difference]: With dead ends: 64 [2018-01-30 00:06:03,926 INFO L226 Difference]: Without dead ends: 63 [2018-01-30 00:06:03,927 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2018-01-30 00:06:03,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-01-30 00:06:03,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 46. [2018-01-30 00:06:03,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-01-30 00:06:03,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2018-01-30 00:06:03,933 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 36 [2018-01-30 00:06:03,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:06:03,933 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2018-01-30 00:06:03,933 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-30 00:06:03,934 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2018-01-30 00:06:03,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-30 00:06:03,934 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:06:03,934 INFO L350 BasicCegarLoop]: trace histogram [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-30 00:06:03,935 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-30 00:06:03,935 INFO L82 PathProgramCache]: Analyzing trace with hash 1618317979, now seen corresponding path program 1 times [2018-01-30 00:06:03,935 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:06:03,935 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:06:03,936 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:06:03,936 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:06:03,936 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:06:03,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:06:03,952 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:06:04,270 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:06:04,270 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:06:04,270 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-30 00:06:04,278 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:06:04,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:06:04,298 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:06:04,337 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 23 treesize of output 22 [2018-01-30 00:06:04,337 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:06:04,370 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 22 treesize of output 21 [2018-01-30 00:06:04,370 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:06:04,372 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 26 treesize of output 25 [2018-01-30 00:06:04,372 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-30 00:06:04,390 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 25 treesize of output 24 [2018-01-30 00:06:04,390 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-30 00:06:04,405 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-30 00:06:04,405 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46 [2018-01-30 00:06:04,750 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:06:04,752 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:06:04,753 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 67 [2018-01-30 00:06:04,753 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:06:04,833 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:06:04,834 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:06:04,835 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 40 [2018-01-30 00:06:04,835 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:06:04,915 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:06:04,916 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:06:04,917 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 39 [2018-01-30 00:06:04,917 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-30 00:06:04,990 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 39 treesize of output 38 [2018-01-30 00:06:04,990 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-30 00:06:05,028 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 4 dim-1 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-01-30 00:06:05,028 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:107, output treesize:75 [2018-01-30 00:06:05,130 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:06:05,151 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:06:05,151 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 20 [2018-01-30 00:06:05,151 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-30 00:06:05,152 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-30 00:06:05,152 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=365, Unknown=1, NotChecked=0, Total=420 [2018-01-30 00:06:05,152 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand 21 states. [2018-01-30 00:06:05,466 WARN L146 SmtUtils]: Spent 121ms on a formula simplification. DAG size of input: 67 DAG size of output 64 [2018-01-30 00:06:30,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:06:30,329 INFO L93 Difference]: Finished difference Result 80 states and 89 transitions. [2018-01-30 00:06:30,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-01-30 00:06:30,330 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 36 [2018-01-30 00:06:30,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:06:30,331 INFO L225 Difference]: With dead ends: 80 [2018-01-30 00:06:30,331 INFO L226 Difference]: Without dead ends: 79 [2018-01-30 00:06:30,332 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=146, Invalid=842, Unknown=4, NotChecked=0, Total=992 [2018-01-30 00:06:30,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-01-30 00:06:30,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 46. [2018-01-30 00:06:30,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-01-30 00:06:30,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2018-01-30 00:06:30,340 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 36 [2018-01-30 00:06:30,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:06:30,340 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2018-01-30 00:06:30,340 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-30 00:06:30,340 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2018-01-30 00:06:30,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-01-30 00:06:30,341 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:06:30,341 INFO L350 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:06:30,342 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-30 00:06:30,342 INFO L82 PathProgramCache]: Analyzing trace with hash -7831485, now seen corresponding path program 1 times [2018-01-30 00:06:30,342 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:06:30,342 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:06:30,343 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:06:30,343 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:06:30,343 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:06:30,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:06:30,353 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:06:30,419 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-30 00:06:30,419 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:06:30,419 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-30 00:06:30,428 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:06:30,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:06:30,452 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:06:30,495 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-30 00:06:30,527 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:06:30,527 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-01-30 00:06:30,527 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-30 00:06:30,527 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-30 00:06:30,528 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-01-30 00:06:30,528 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand 9 states. [2018-01-30 00:06:30,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:06:30,608 INFO L93 Difference]: Finished difference Result 62 states and 68 transitions. [2018-01-30 00:06:30,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-30 00:06:30,609 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 43 [2018-01-30 00:06:30,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:06:30,610 INFO L225 Difference]: With dead ends: 62 [2018-01-30 00:06:30,610 INFO L226 Difference]: Without dead ends: 58 [2018-01-30 00:06:30,610 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2018-01-30 00:06:30,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-01-30 00:06:30,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 51. [2018-01-30 00:06:30,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-01-30 00:06:30,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2018-01-30 00:06:30,621 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 43 [2018-01-30 00:06:30,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:06:30,622 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2018-01-30 00:06:30,622 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-30 00:06:30,622 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2018-01-30 00:06:30,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-01-30 00:06:30,623 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:06:30,623 INFO L350 BasicCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1] [2018-01-30 00:06:30,624 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-30 00:06:30,624 INFO L82 PathProgramCache]: Analyzing trace with hash 659032353, now seen corresponding path program 1 times [2018-01-30 00:06:30,624 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:06:30,624 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:06:30,625 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:06:30,625 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:06:30,626 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:06:30,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:06:30,639 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:06:30,998 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-01-30 00:06:30,999 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:06:31,029 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-30 00:06:31,036 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:06:31,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:06:31,058 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:06:31,080 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 17 treesize of output 16 [2018-01-30 00:06:31,080 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:06:31,097 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 20 treesize of output 19 [2018-01-30 00:06:31,098 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:06:31,111 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-30 00:06:31,112 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-01-30 00:06:31,569 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-01-30 00:06:31,589 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:06:31,589 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 21 [2018-01-30 00:06:31,590 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-01-30 00:06:31,590 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-01-30 00:06:31,590 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=398, Unknown=0, NotChecked=0, Total=462 [2018-01-30 00:06:31,590 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand 22 states. [2018-01-30 00:06:32,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:06:32,123 INFO L93 Difference]: Finished difference Result 78 states and 87 transitions. [2018-01-30 00:06:32,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-30 00:06:32,124 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 51 [2018-01-30 00:06:32,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:06:32,125 INFO L225 Difference]: With dead ends: 78 [2018-01-30 00:06:32,125 INFO L226 Difference]: Without dead ends: 77 [2018-01-30 00:06:32,125 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=149, Invalid=907, Unknown=0, NotChecked=0, Total=1056 [2018-01-30 00:06:32,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-01-30 00:06:32,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 63. [2018-01-30 00:06:32,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-01-30 00:06:32,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 69 transitions. [2018-01-30 00:06:32,139 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 69 transitions. Word has length 51 [2018-01-30 00:06:32,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:06:32,139 INFO L432 AbstractCegarLoop]: Abstraction has 63 states and 69 transitions. [2018-01-30 00:06:32,140 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-01-30 00:06:32,140 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 69 transitions. [2018-01-30 00:06:32,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-01-30 00:06:32,141 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:06:32,141 INFO L350 BasicCegarLoop]: trace histogram [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, 1] [2018-01-30 00:06:32,141 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-30 00:06:32,141 INFO L82 PathProgramCache]: Analyzing trace with hash 352288786, now seen corresponding path program 2 times [2018-01-30 00:06:32,141 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:06:32,141 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:06:32,142 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:06:32,143 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:06:32,143 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:06:32,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:06:32,156 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:06:32,500 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:06:32,500 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:06:32,500 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-30 00:06:32,505 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-30 00:06:32,515 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:06:32,521 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:06:32,525 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 00:06:32,528 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:06:32,544 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 26 treesize of output 25 [2018-01-30 00:06:32,545 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:06:32,558 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 23 treesize of output 22 [2018-01-30 00:06:32,559 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:06:32,572 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 25 treesize of output 24 [2018-01-30 00:06:32,572 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-30 00:06:32,574 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 22 treesize of output 21 [2018-01-30 00:06:32,574 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-30 00:06:32,586 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-30 00:06:32,587 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46 [2018-01-30 00:06:32,839 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:06:32,840 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:06:32,841 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 67 [2018-01-30 00:06:32,842 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:06:32,896 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:06:32,896 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:06:32,897 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 39 [2018-01-30 00:06:32,897 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:06:32,939 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 39 treesize of output 38 [2018-01-30 00:06:32,939 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-30 00:06:32,982 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:06:32,983 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:06:32,984 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 40 [2018-01-30 00:06:32,984 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-30 00:06:33,016 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 4 dim-1 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-01-30 00:06:33,016 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:107, output treesize:75 [2018-01-30 00:06:33,396 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:06:33,416 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:06:33,416 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 25 [2018-01-30 00:06:33,416 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-01-30 00:06:33,417 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-01-30 00:06:33,417 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=581, Unknown=1, NotChecked=0, Total=650 [2018-01-30 00:06:33,417 INFO L87 Difference]: Start difference. First operand 63 states and 69 transitions. Second operand 26 states. [2018-01-30 00:06:33,739 WARN L146 SmtUtils]: Spent 113ms on a formula simplification. DAG size of input: 67 DAG size of output 64 [2018-01-30 00:07:23,130 WARN L146 SmtUtils]: Spent 111ms on a formula simplification. DAG size of input: 63 DAG size of output 57 [2018-01-30 00:07:23,301 WARN L146 SmtUtils]: Spent 123ms on a formula simplification. DAG size of input: 63 DAG size of output 57 [2018-01-30 00:07:36,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:07:36,278 INFO L93 Difference]: Finished difference Result 99 states and 113 transitions. [2018-01-30 00:07:36,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-01-30 00:07:36,279 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 52 [2018-01-30 00:07:36,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:07:36,280 INFO L225 Difference]: With dead ends: 99 [2018-01-30 00:07:36,280 INFO L226 Difference]: Without dead ends: 98 [2018-01-30 00:07:36,280 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 389 ImplicationChecksByTransitivity, 24.4s TimeCoverageRelationStatistics Valid=226, Invalid=1568, Unknown=12, NotChecked=0, Total=1806 [2018-01-30 00:07:36,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-01-30 00:07:36,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 55. [2018-01-30 00:07:36,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-01-30 00:07:36,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 61 transitions. [2018-01-30 00:07:36,291 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 61 transitions. Word has length 52 [2018-01-30 00:07:36,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:07:36,291 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 61 transitions. [2018-01-30 00:07:36,291 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-01-30 00:07:36,291 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions. [2018-01-30 00:07:36,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-01-30 00:07:36,292 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:07:36,292 INFO L350 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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, 1, 1] [2018-01-30 00:07:36,292 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-30 00:07:36,292 INFO L82 PathProgramCache]: Analyzing trace with hash 243861690, now seen corresponding path program 2 times [2018-01-30 00:07:36,292 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:07:36,292 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:07:36,293 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:07:36,293 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 00:07:36,293 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:07:36,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:07:36,302 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:07:36,384 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-01-30 00:07:36,385 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:07:36,415 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-30 00:07:36,422 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-30 00:07:36,433 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:07:36,441 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:07:36,442 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 00:07:36,445 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:07:36,507 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-01-30 00:07:36,528 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:07:36,528 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2018-01-30 00:07:36,528 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-30 00:07:36,528 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-30 00:07:36,529 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2018-01-30 00:07:36,529 INFO L87 Difference]: Start difference. First operand 55 states and 61 transitions. Second operand 13 states. [2018-01-30 00:07:36,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:07:36,653 INFO L93 Difference]: Finished difference Result 71 states and 79 transitions. [2018-01-30 00:07:36,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-30 00:07:36,653 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 59 [2018-01-30 00:07:36,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:07:36,654 INFO L225 Difference]: With dead ends: 71 [2018-01-30 00:07:36,654 INFO L226 Difference]: Without dead ends: 67 [2018-01-30 00:07:36,654 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2018-01-30 00:07:36,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-01-30 00:07:36,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 60. [2018-01-30 00:07:36,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-01-30 00:07:36,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 66 transitions. [2018-01-30 00:07:36,665 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 66 transitions. Word has length 59 [2018-01-30 00:07:36,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:07:36,665 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 66 transitions. [2018-01-30 00:07:36,665 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-30 00:07:36,665 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 66 transitions. [2018-01-30 00:07:36,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-01-30 00:07:36,666 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:07:36,667 INFO L350 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:07:36,667 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-30 00:07:36,667 INFO L82 PathProgramCache]: Analyzing trace with hash 2098211480, now seen corresponding path program 3 times [2018-01-30 00:07:36,667 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:07:36,667 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:07:36,668 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:07:36,669 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 00:07:36,669 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:07:36,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:07:36,683 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:07:36,984 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 3 proven. 33 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-01-30 00:07:36,984 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:07:36,984 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-30 00:07:36,989 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-30 00:07:37,001 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:07:37,005 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:07:37,008 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:07:37,013 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:07:37,015 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 00:07:37,018 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:07:37,041 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 17 treesize of output 16 [2018-01-30 00:07:37,042 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:07:37,053 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 20 treesize of output 19 [2018-01-30 00:07:37,053 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:07:37,062 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-30 00:07:37,063 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-01-30 00:07:37,477 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 3 proven. 33 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-01-30 00:07:37,511 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:07:37,512 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13] total 26 [2018-01-30 00:07:37,512 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-01-30 00:07:37,512 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-01-30 00:07:37,513 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=614, Unknown=0, NotChecked=0, Total=702 [2018-01-30 00:07:37,513 INFO L87 Difference]: Start difference. First operand 60 states and 66 transitions. Second operand 27 states. [2018-01-30 00:07:38,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:07:38,562 INFO L93 Difference]: Finished difference Result 96 states and 109 transitions. [2018-01-30 00:07:38,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-30 00:07:38,562 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 67 [2018-01-30 00:07:38,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:07:38,563 INFO L225 Difference]: With dead ends: 96 [2018-01-30 00:07:38,563 INFO L226 Difference]: Without dead ends: 95 [2018-01-30 00:07:38,564 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 60 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 367 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=215, Invalid=1425, Unknown=0, NotChecked=0, Total=1640 [2018-01-30 00:07:38,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-01-30 00:07:38,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 81. [2018-01-30 00:07:38,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-01-30 00:07:38,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 91 transitions. [2018-01-30 00:07:38,582 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 91 transitions. Word has length 67 [2018-01-30 00:07:38,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:07:38,583 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 91 transitions. [2018-01-30 00:07:38,583 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-01-30 00:07:38,583 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 91 transitions. [2018-01-30 00:07:38,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-01-30 00:07:38,583 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:07:38,584 INFO L350 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 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] [2018-01-30 00:07:38,584 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-30 00:07:38,584 INFO L82 PathProgramCache]: Analyzing trace with hash 1493540745, now seen corresponding path program 4 times [2018-01-30 00:07:38,584 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:07:38,584 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:07:38,585 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:07:38,585 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 00:07:38,585 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:07:38,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:07:38,596 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:07:38,970 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 7 proven. 42 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-01-30 00:07:38,970 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:07:38,970 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-30 00:07:38,975 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-30 00:07:38,997 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 00:07:39,000 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:07:39,017 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 26 treesize of output 25 [2018-01-30 00:07:39,017 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:07:39,032 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 25 treesize of output 24 [2018-01-30 00:07:39,032 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:07:39,033 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 23 treesize of output 22 [2018-01-30 00:07:39,034 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-30 00:07:39,047 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 22 treesize of output 21 [2018-01-30 00:07:39,048 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-30 00:07:39,060 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-30 00:07:39,060 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46 [2018-01-30 00:07:39,309 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:07:39,310 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:07:39,311 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 67 [2018-01-30 00:07:39,311 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:07:39,361 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:07:39,362 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 45 treesize of output 48 [2018-01-30 00:07:39,363 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:07:39,414 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:07:39,414 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:07:39,415 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 40 [2018-01-30 00:07:39,415 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-30 00:07:39,459 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:07:39,459 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:07:39,460 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 38 [2018-01-30 00:07:39,460 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-30 00:07:39,491 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 4 dim-1 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-01-30 00:07:39,491 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:107, output treesize:75 [2018-01-30 00:07:41,623 WARN L143 SmtUtils]: Spent 1578ms on a formula simplification that was a NOOP. DAG size: 51 [2018-01-30 00:07:41,760 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 3 proven. 46 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-01-30 00:07:41,780 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:07:41,780 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 30 [2018-01-30 00:07:41,781 INFO L409 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-01-30 00:07:41,781 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-01-30 00:07:41,781 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=836, Unknown=1, NotChecked=0, Total=930 [2018-01-30 00:07:41,781 INFO L87 Difference]: Start difference. First operand 81 states and 91 transitions. Second operand 31 states. [2018-01-30 00:07:42,049 WARN L146 SmtUtils]: Spent 129ms on a formula simplification. DAG size of input: 55 DAG size of output 52 [2018-01-30 00:07:42,292 WARN L146 SmtUtils]: Spent 185ms on a formula simplification. DAG size of input: 67 DAG size of output 64 [2018-01-30 00:07:42,610 WARN L143 SmtUtils]: Spent 119ms on a formula simplification that was a NOOP. DAG size: 58 [2018-01-30 00:08:34,202 WARN L146 SmtUtils]: Spent 104ms on a formula simplification. DAG size of input: 58 DAG size of output 55 Received shutdown request... [2018-01-30 00:08:36,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-01-30 00:08:36,397 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-30 00:08:36,401 WARN L185 ceAbstractionStarter]: Timeout [2018-01-30 00:08:36,401 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.01 12:08:36 BoogieIcfgContainer [2018-01-30 00:08:36,401 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-30 00:08:36,402 INFO L168 Benchmark]: Toolchain (without parser) took 156579.24 ms. Allocated memory was 305.7 MB in the beginning and 547.4 MB in the end (delta: 241.7 MB). Free memory was 264.5 MB in the beginning and 309.1 MB in the end (delta: -44.6 MB). Peak memory consumption was 197.1 MB. Max. memory is 5.3 GB. [2018-01-30 00:08:36,403 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 305.7 MB. Free memory is still 270.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-30 00:08:36,403 INFO L168 Benchmark]: CACSL2BoogieTranslator took 201.08 ms. Allocated memory is still 305.7 MB. Free memory was 264.5 MB in the beginning and 250.5 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 5.3 GB. [2018-01-30 00:08:36,404 INFO L168 Benchmark]: Boogie Preprocessor took 52.48 ms. Allocated memory is still 305.7 MB. Free memory was 250.5 MB in the beginning and 248.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-30 00:08:36,404 INFO L168 Benchmark]: RCFGBuilder took 222.98 ms. Allocated memory is still 305.7 MB. Free memory was 248.5 MB in the beginning and 233.5 MB in the end (delta: 15.0 MB). Peak memory consumption was 15.0 MB. Max. memory is 5.3 GB. [2018-01-30 00:08:36,404 INFO L168 Benchmark]: TraceAbstraction took 156096.46 ms. Allocated memory was 305.7 MB in the beginning and 547.4 MB in the end (delta: 241.7 MB). Free memory was 233.5 MB in the beginning and 309.1 MB in the end (delta: -75.6 MB). Peak memory consumption was 166.1 MB. Max. memory is 5.3 GB. [2018-01-30 00:08:36,406 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.23 ms. Allocated memory is still 305.7 MB. Free memory is still 270.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 201.08 ms. Allocated memory is still 305.7 MB. Free memory was 264.5 MB in the beginning and 250.5 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 52.48 ms. Allocated memory is still 305.7 MB. Free memory was 250.5 MB in the beginning and 248.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 222.98 ms. Allocated memory is still 305.7 MB. Free memory was 248.5 MB in the beginning and 233.5 MB in the end (delta: 15.0 MB). Peak memory consumption was 15.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 156096.46 ms. Allocated memory was 305.7 MB in the beginning and 547.4 MB in the end (delta: 241.7 MB). Free memory was 233.5 MB in the beginning and 309.1 MB in the end (delta: -75.6 MB). Peak memory consumption was 166.1 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1452]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 1452). Cancelled while BasicCegarLoop was constructing difference of abstraction (81states) and interpolant automaton (currently 17 states, 31 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 44 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1446). Cancelled while BasicCegarLoop was constructing difference of abstraction (81states) and interpolant automaton (currently 17 states, 31 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 44 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1446). Cancelled while BasicCegarLoop was constructing difference of abstraction (81states) and interpolant automaton (currently 17 states, 31 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 44 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 42 locations, 3 error locations. TIMEOUT Result, 156.0s OverallTime, 14 OverallIterations, 4 TraceHistogramMax, 145.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 520 SDtfs, 1093 SDslu, 2886 SDs, 0 SdLazy, 3162 SolverSat, 251 SolverUnsat, 48 SolverUnknown, 0 SolverNotchecked, 89.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 748 GetRequests, 466 SyntacticMatches, 18 SemanticMatches, 263 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1740 ImplicationChecksByTransitivity, 59.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=81occurred in iteration=13, 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, 13 MinimizatonAttempts, 181 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 8.9s InterpolantComputationTime, 1108 NumberOfCodeBlocks, 1108 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 1083 ConstructedInterpolants, 135 QuantifiedInterpolants, 646264 SizeOfPredicates, 73 NumberOfNonLiveVariables, 1505 ConjunctsInSsa, 266 ConjunctsInUnsatCore, 25 InterpolantComputations, 4 PerfectInterpolantSequences, 173/460 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test18_3_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-30_00-08-36-412.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test18_3_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-30_00-08-36-412.csv Completed graceful shutdown