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-acfac67 [2018-01-28 22:29:24,266 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-28 22:29:24,267 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-28 22:29:24,282 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-28 22:29:24,282 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-28 22:29:24,283 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-28 22:29:24,284 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-28 22:29:24,286 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-28 22:29:24,288 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-28 22:29:24,288 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-28 22:29:24,289 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-28 22:29:24,290 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-28 22:29:24,290 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-28 22:29:24,292 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-28 22:29:24,292 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-28 22:29:24,295 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-28 22:29:24,297 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-28 22:29:24,299 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-28 22:29:24,300 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-28 22:29:24,301 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-28 22:29:24,303 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-28 22:29:24,304 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-28 22:29:24,304 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-28 22:29:24,305 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-28 22:29:24,306 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-28 22:29:24,307 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-28 22:29:24,307 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-28 22:29:24,308 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-28 22:29:24,308 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-28 22:29:24,308 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-28 22:29:24,309 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-28 22:29:24,309 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-28 22:29:24,318 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-28 22:29:24,318 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-28 22:29:24,319 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-28 22:29:24,319 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-28 22:29:24,319 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-28 22:29:24,320 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-28 22:29:24,320 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-28 22:29:24,320 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-28 22:29:24,320 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-28 22:29:24,320 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-28 22:29:24,320 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-28 22:29:24,320 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-28 22:29:24,321 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-28 22:29:24,321 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-28 22:29:24,321 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-28 22:29:24,321 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-28 22:29:24,321 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-28 22:29:24,321 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-28 22:29:24,321 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-28 22:29:24,321 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-28 22:29:24,322 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-28 22:29:24,322 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-28 22:29:24,322 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-28 22:29:24,322 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-28 22:29:24,322 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-28 22:29:24,322 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-28 22:29:24,323 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-28 22:29:24,323 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-28 22:29:24,323 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-28 22:29:24,323 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-28 22:29:24,323 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-28 22:29:24,323 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-28 22:29:24,324 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-28 22:29:24,324 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-28 22:29:24,356 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-28 22:29:24,366 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-28 22:29:24,369 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-28 22:29:24,370 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-28 22:29:24,371 INFO L276 PluginConnector]: CDTParser initialized [2018-01-28 22:29:24,371 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-28 22:29:24,561 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-28 22:29:24,566 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-28 22:29:24,589 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-28 22:29:24,589 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-28 22:29:24,594 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-28 22:29:24,595 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 10:29:24" (1/1) ... [2018-01-28 22:29:24,597 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74274b85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:29:24, skipping insertion in model container [2018-01-28 22:29:24,598 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 10:29:24" (1/1) ... [2018-01-28 22:29:24,610 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-28 22:29:24,656 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-28 22:29:24,769 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-28 22:29:24,788 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-28 22:29:24,796 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:29:24 WrapperNode [2018-01-28 22:29:24,796 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-28 22:29:24,797 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-28 22:29:24,797 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-28 22:29:24,797 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-28 22:29:24,812 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:29:24" (1/1) ... [2018-01-28 22:29:24,812 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:29:24" (1/1) ... [2018-01-28 22:29:24,820 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:29:24" (1/1) ... [2018-01-28 22:29:24,820 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:29:24" (1/1) ... [2018-01-28 22:29:24,824 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:29:24" (1/1) ... [2018-01-28 22:29:24,827 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:29:24" (1/1) ... [2018-01-28 22:29:24,828 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:29:24" (1/1) ... [2018-01-28 22:29:24,830 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-28 22:29:24,831 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-28 22:29:24,831 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-28 22:29:24,831 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-28 22:29:24,832 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:29:24" (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-28 22:29:24,891 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-28 22:29:24,891 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-28 22:29:24,891 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-28 22:29:24,891 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-28 22:29:24,892 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-28 22:29:24,892 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-28 22:29:24,892 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-28 22:29:24,892 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-28 22:29:24,892 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-28 22:29:24,892 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-28 22:29:24,892 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-28 22:29:24,893 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-28 22:29:24,893 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-28 22:29:24,893 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-28 22:29:24,893 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-28 22:29:24,893 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-28 22:29:24,893 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-28 22:29:25,071 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-28 22:29:25,071 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 10:29:25 BoogieIcfgContainer [2018-01-28 22:29:25,072 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-28 22:29:25,072 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-28 22:29:25,072 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-28 22:29:25,075 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-28 22:29:25,075 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.01 10:29:24" (1/3) ... [2018-01-28 22:29:25,075 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e377eb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 10:29:25, skipping insertion in model container [2018-01-28 22:29:25,076 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:29:24" (2/3) ... [2018-01-28 22:29:25,076 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e377eb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 10:29:25, skipping insertion in model container [2018-01-28 22:29:25,076 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 10:29:25" (3/3) ... [2018-01-28 22:29:25,077 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test18_3_false-valid-memtrack_true-termination.i [2018-01-28 22:29:25,083 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-28 22:29:25,088 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-01-28 22:29:25,129 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-28 22:29:25,129 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-28 22:29:25,129 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-28 22:29:25,129 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-28 22:29:25,130 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-28 22:29:25,130 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-28 22:29:25,130 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-28 22:29:25,130 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-28 22:29:25,131 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-28 22:29:25,146 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states. [2018-01-28 22:29:25,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-28 22:29:25,151 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:29:25,151 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:29:25,152 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-28 22:29:25,157 INFO L82 PathProgramCache]: Analyzing trace with hash 684105477, now seen corresponding path program 1 times [2018-01-28 22:29:25,159 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:29:25,160 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:29:25,207 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:29:25,208 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:29:25,208 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:29:25,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:29:25,261 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:29:25,352 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-28 22:29:25,355 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:29:25,356 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-28 22:29:25,358 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-28 22:29:25,368 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-28 22:29:25,368 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-28 22:29:25,370 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 3 states. [2018-01-28 22:29:25,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:29:25,527 INFO L93 Difference]: Finished difference Result 70 states and 80 transitions. [2018-01-28 22:29:25,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-28 22:29:25,529 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-01-28 22:29:25,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:29:25,539 INFO L225 Difference]: With dead ends: 70 [2018-01-28 22:29:25,539 INFO L226 Difference]: Without dead ends: 57 [2018-01-28 22:29:25,542 INFO L533 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-28 22:29:25,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-01-28 22:29:25,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2018-01-28 22:29:25,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-01-28 22:29:25,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 63 transitions. [2018-01-28 22:29:25,580 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 63 transitions. Word has length 24 [2018-01-28 22:29:25,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:29:25,580 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 63 transitions. [2018-01-28 22:29:25,580 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-28 22:29:25,580 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2018-01-28 22:29:25,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-28 22:29:25,582 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:29:25,582 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:29:25,582 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-28 22:29:25,583 INFO L82 PathProgramCache]: Analyzing trace with hash -380665648, now seen corresponding path program 1 times [2018-01-28 22:29:25,583 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:29:25,583 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:29:25,584 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:29:25,585 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:29:25,585 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:29:25,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:29:25,608 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:29:25,681 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-28 22:29:25,682 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:29:25,682 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-28 22:29:25,684 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-28 22:29:25,684 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-28 22:29:25,684 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-28 22:29:25,684 INFO L87 Difference]: Start difference. First operand 55 states and 63 transitions. Second operand 6 states. [2018-01-28 22:29:25,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:29:25,764 INFO L93 Difference]: Finished difference Result 72 states and 82 transitions. [2018-01-28 22:29:25,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-28 22:29:25,765 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-01-28 22:29:25,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:29:25,767 INFO L225 Difference]: With dead ends: 72 [2018-01-28 22:29:25,767 INFO L226 Difference]: Without dead ends: 68 [2018-01-28 22:29:25,768 INFO L533 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-28 22:29:25,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-01-28 22:29:25,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 55. [2018-01-28 22:29:25,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-01-28 22:29:25,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 62 transitions. [2018-01-28 22:29:25,775 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 62 transitions. Word has length 25 [2018-01-28 22:29:25,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:29:25,776 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 62 transitions. [2018-01-28 22:29:25,776 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-28 22:29:25,776 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 62 transitions. [2018-01-28 22:29:25,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-28 22:29:25,777 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:29:25,777 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:29:25,777 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-28 22:29:25,777 INFO L82 PathProgramCache]: Analyzing trace with hash -737007156, now seen corresponding path program 1 times [2018-01-28 22:29:25,777 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:29:25,778 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:29:25,779 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:29:25,779 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:29:25,779 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:29:25,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:29:25,797 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:29:25,843 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-28 22:29:25,844 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:29:25,844 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-28 22:29:25,844 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-28 22:29:25,844 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-28 22:29:25,844 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-28 22:29:25,845 INFO L87 Difference]: Start difference. First operand 55 states and 62 transitions. Second operand 4 states. [2018-01-28 22:29:25,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:29:25,873 INFO L93 Difference]: Finished difference Result 77 states and 90 transitions. [2018-01-28 22:29:25,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-28 22:29:25,873 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2018-01-28 22:29:25,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:29:25,875 INFO L225 Difference]: With dead ends: 77 [2018-01-28 22:29:25,875 INFO L226 Difference]: Without dead ends: 73 [2018-01-28 22:29:25,875 INFO L533 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-28 22:29:25,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-01-28 22:29:25,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 57. [2018-01-28 22:29:25,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-01-28 22:29:25,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 64 transitions. [2018-01-28 22:29:25,886 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 64 transitions. Word has length 27 [2018-01-28 22:29:25,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:29:25,887 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 64 transitions. [2018-01-28 22:29:25,887 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-28 22:29:25,887 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 64 transitions. [2018-01-28 22:29:25,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-28 22:29:25,889 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:29:25,889 INFO L330 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-28 22:29:25,889 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-28 22:29:25,889 INFO L82 PathProgramCache]: Analyzing trace with hash 532330910, now seen corresponding path program 1 times [2018-01-28 22:29:25,889 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:29:25,890 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:29:25,891 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:29:25,891 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:29:25,891 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:29:25,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:29:25,904 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:29:25,968 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-28 22:29:25,968 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:29:25,968 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-28 22:29:25,978 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:29:26,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:29:26,022 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:29:26,068 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-28 22:29:26,088 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-28 22:29:26,089 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 5 [2018-01-28 22:29:26,089 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-28 22:29:26,089 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-28 22:29:26,089 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-28 22:29:26,090 INFO L87 Difference]: Start difference. First operand 57 states and 64 transitions. Second operand 5 states. [2018-01-28 22:29:26,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:29:26,165 INFO L93 Difference]: Finished difference Result 84 states and 92 transitions. [2018-01-28 22:29:26,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-28 22:29:26,166 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2018-01-28 22:29:26,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:29:26,167 INFO L225 Difference]: With dead ends: 84 [2018-01-28 22:29:26,167 INFO L226 Difference]: Without dead ends: 43 [2018-01-28 22:29:26,168 INFO L533 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-28 22:29:26,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-01-28 22:29:26,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-01-28 22:29:26,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-01-28 22:29:26,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 45 transitions. [2018-01-28 22:29:26,175 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 45 transitions. Word has length 34 [2018-01-28 22:29:26,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:29:26,176 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 45 transitions. [2018-01-28 22:29:26,176 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-28 22:29:26,176 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2018-01-28 22:29:26,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-28 22:29:26,177 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:29:26,177 INFO L330 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-28 22:29:26,178 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-28 22:29:26,178 INFO L82 PathProgramCache]: Analyzing trace with hash -390587991, now seen corresponding path program 1 times [2018-01-28 22:29:26,178 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:29:26,178 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:29:26,180 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:29:26,180 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:29:26,180 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:29:26,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:29:26,196 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:29:26,278 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-28 22:29:26,278 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:29:26,278 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-28 22:29:26,285 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:29:26,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:29:26,318 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:29:26,340 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-28 22:29:26,342 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:29:26,344 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:29:26,344 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-28 22:29:26,359 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-28 22:29:26,389 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:29:26,389 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-01-28 22:29:26,390 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-28 22:29:26,390 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-28 22:29:26,390 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-28 22:29:26,390 INFO L87 Difference]: Start difference. First operand 43 states and 45 transitions. Second operand 7 states. [2018-01-28 22:29:26,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:29:26,569 INFO L93 Difference]: Finished difference Result 48 states and 50 transitions. [2018-01-28 22:29:26,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-28 22:29:26,569 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 35 [2018-01-28 22:29:26,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:29:26,571 INFO L225 Difference]: With dead ends: 48 [2018-01-28 22:29:26,571 INFO L226 Difference]: Without dead ends: 47 [2018-01-28 22:29:26,571 INFO L533 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-28 22:29:26,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-01-28 22:29:26,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2018-01-28 22:29:26,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-01-28 22:29:26,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2018-01-28 22:29:26,577 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 35 [2018-01-28 22:29:26,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:29:26,578 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 49 transitions. [2018-01-28 22:29:26,578 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-28 22:29:26,578 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2018-01-28 22:29:26,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-28 22:29:26,579 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:29:26,579 INFO L330 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-28 22:29:26,579 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-28 22:29:26,580 INFO L82 PathProgramCache]: Analyzing trace with hash -390587990, now seen corresponding path program 1 times [2018-01-28 22:29:26,580 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:29:26,580 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:29:26,581 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:29:26,582 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:29:26,582 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:29:26,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:29:26,598 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:29:26,960 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-28 22:29:26,960 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:29:26,960 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-28 22:29:26,965 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:29:26,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:29:26,986 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:29:27,012 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-28 22:29:27,013 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:29:27,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 17 treesize of output 16 [2018-01-28 22:29:27,034 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:29:27,045 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-28 22:29:27,045 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-01-28 22:29:27,374 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-28 22:29:27,399 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:29:27,399 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2018-01-28 22:29:27,399 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-01-28 22:29:27,399 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-01-28 22:29:27,400 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2018-01-28 22:29:27,400 INFO L87 Difference]: Start difference. First operand 46 states and 49 transitions. Second operand 16 states. [2018-01-28 22:29:27,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:29:27,827 INFO L93 Difference]: Finished difference Result 65 states and 73 transitions. [2018-01-28 22:29:27,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-28 22:29:27,828 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 35 [2018-01-28 22:29:27,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:29:27,829 INFO L225 Difference]: With dead ends: 65 [2018-01-28 22:29:27,829 INFO L226 Difference]: Without dead ends: 64 [2018-01-28 22:29:27,829 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=89, Invalid=463, Unknown=0, NotChecked=0, Total=552 [2018-01-28 22:29:27,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-01-28 22:29:27,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 50. [2018-01-28 22:29:27,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-01-28 22:29:27,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2018-01-28 22:29:27,836 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 35 [2018-01-28 22:29:27,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:29:27,837 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2018-01-28 22:29:27,837 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-01-28 22:29:27,837 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2018-01-28 22:29:27,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-28 22:29:27,838 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:29:27,838 INFO L330 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-28 22:29:27,839 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-28 22:29:27,839 INFO L82 PathProgramCache]: Analyzing trace with hash 1618317978, now seen corresponding path program 1 times [2018-01-28 22:29:27,839 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:29:27,839 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:29:27,840 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:29:27,840 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:29:27,840 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:29:27,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:29:27,855 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:29:28,007 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-28 22:29:28,007 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:29:28,007 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-28 22:29:28,014 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:29:28,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:29:28,031 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:29:28,034 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-28 22:29:28,034 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:29:28,036 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:29:28,040 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-28 22:29:28,069 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:29:28,069 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:29:28,072 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-28 22:29:28,073 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:29:28,079 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-28 22:29:28,079 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-01-28 22:29:28,097 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-28 22:29:28,118 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:29:28,118 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2018-01-28 22:29:28,118 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-28 22:29:28,119 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-28 22:29:28,119 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-01-28 22:29:28,119 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand 11 states. [2018-01-28 22:29:28,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:29:28,317 INFO L93 Difference]: Finished difference Result 64 states and 71 transitions. [2018-01-28 22:29:28,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-28 22:29:28,318 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 36 [2018-01-28 22:29:28,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:29:28,319 INFO L225 Difference]: With dead ends: 64 [2018-01-28 22:29:28,319 INFO L226 Difference]: Without dead ends: 63 [2018-01-28 22:29:28,319 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2018-01-28 22:29:28,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-01-28 22:29:28,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 46. [2018-01-28 22:29:28,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-01-28 22:29:28,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2018-01-28 22:29:28,327 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 36 [2018-01-28 22:29:28,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:29:28,328 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2018-01-28 22:29:28,328 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-28 22:29:28,328 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2018-01-28 22:29:28,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-28 22:29:28,329 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:29:28,329 INFO L330 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-28 22:29:28,329 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-28 22:29:28,330 INFO L82 PathProgramCache]: Analyzing trace with hash 1618317979, now seen corresponding path program 1 times [2018-01-28 22:29:28,330 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:29:28,330 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:29:28,331 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:29:28,331 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:29:28,331 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:29:28,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:29:28,347 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:29:28,560 WARN L146 SmtUtils]: Spent 105ms on a formula simplification. DAG size of input: 18 DAG size of output 14 [2018-01-28 22:29:28,711 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-28 22:29:28,711 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:29:28,711 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-28 22:29:28,722 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:29:28,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:29:28,752 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:29:28,785 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-28 22:29:28,786 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:29:28,817 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-28 22:29:28,818 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:29:28,820 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-28 22:29:28,820 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-28 22:29:28,835 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-28 22:29:28,836 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 22:29:28,851 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-28 22:29:28,851 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46 [2018-01-28 22:29:29,146 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:29:29,147 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:29:29,148 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-28 22:29:29,149 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:29:29,217 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:29:29,217 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:29:29,218 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-28 22:29:29,219 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:29:29,272 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:29:29,273 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:29:29,273 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-28 22:29:29,274 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-28 22:29:29,324 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-28 22:29:29,324 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 22:29:29,362 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-28 22:29:29,362 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:107, output treesize:75 [2018-01-28 22:29:29,462 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-28 22:29:29,483 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:29:29,483 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 20 [2018-01-28 22:29:29,484 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-28 22:29:29,484 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-28 22:29:29,484 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=365, Unknown=1, NotChecked=0, Total=420 [2018-01-28 22:29:29,484 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand 21 states. [2018-01-28 22:29:29,771 WARN L146 SmtUtils]: Spent 106ms on a formula simplification. DAG size of input: 67 DAG size of output 64 [2018-01-28 22:29:54,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:29:54,848 INFO L93 Difference]: Finished difference Result 80 states and 89 transitions. [2018-01-28 22:29:54,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-01-28 22:29:54,848 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 36 [2018-01-28 22:29:54,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:29:54,849 INFO L225 Difference]: With dead ends: 80 [2018-01-28 22:29:54,850 INFO L226 Difference]: Without dead ends: 79 [2018-01-28 22:29:54,850 INFO L533 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-28 22:29:54,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-01-28 22:29:54,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 46. [2018-01-28 22:29:54,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-01-28 22:29:54,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2018-01-28 22:29:54,861 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 36 [2018-01-28 22:29:54,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:29:54,862 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2018-01-28 22:29:54,862 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-28 22:29:54,862 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2018-01-28 22:29:54,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-01-28 22:29:54,863 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:29:54,864 INFO L330 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-28 22:29:54,864 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-28 22:29:54,864 INFO L82 PathProgramCache]: Analyzing trace with hash -7831485, now seen corresponding path program 1 times [2018-01-28 22:29:54,864 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:29:54,865 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:29:54,866 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:29:54,866 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:29:54,866 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:29:54,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:29:54,877 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:29:54,944 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-28 22:29:54,944 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:29:54,944 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-28 22:29:54,960 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:29:54,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:29:54,985 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:29:55,025 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-28 22:29:55,048 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:29:55,049 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-01-28 22:29:55,049 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-28 22:29:55,049 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-28 22:29:55,049 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-01-28 22:29:55,049 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand 9 states. [2018-01-28 22:29:55,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:29:55,122 INFO L93 Difference]: Finished difference Result 62 states and 68 transitions. [2018-01-28 22:29:55,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-28 22:29:55,123 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 43 [2018-01-28 22:29:55,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:29:55,124 INFO L225 Difference]: With dead ends: 62 [2018-01-28 22:29:55,124 INFO L226 Difference]: Without dead ends: 58 [2018-01-28 22:29:55,124 INFO L533 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-28 22:29:55,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-01-28 22:29:55,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 51. [2018-01-28 22:29:55,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-01-28 22:29:55,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2018-01-28 22:29:55,136 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 43 [2018-01-28 22:29:55,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:29:55,136 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2018-01-28 22:29:55,136 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-28 22:29:55,137 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2018-01-28 22:29:55,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-01-28 22:29:55,138 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:29:55,139 INFO L330 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-28 22:29:55,139 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-28 22:29:55,139 INFO L82 PathProgramCache]: Analyzing trace with hash 659032353, now seen corresponding path program 1 times [2018-01-28 22:29:55,139 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:29:55,139 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:29:55,140 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:29:55,141 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:29:55,141 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:29:55,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:29:55,156 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:29:55,408 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-28 22:29:55,408 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:29:55,408 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-28 22:29:55,413 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:29:55,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:29:55,431 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:29:55,452 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-28 22:29:55,452 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:29:55,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 20 treesize of output 19 [2018-01-28 22:29:55,482 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:29:55,495 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-28 22:29:55,495 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-01-28 22:29:55,959 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-28 22:29:55,993 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:29:55,993 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 21 [2018-01-28 22:29:55,994 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-01-28 22:29:55,994 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-01-28 22:29:55,995 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=398, Unknown=0, NotChecked=0, Total=462 [2018-01-28 22:29:55,995 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand 22 states. [2018-01-28 22:29:56,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:29:56,792 INFO L93 Difference]: Finished difference Result 78 states and 87 transitions. [2018-01-28 22:29:56,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-28 22:29:56,792 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 51 [2018-01-28 22:29:56,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:29:56,793 INFO L225 Difference]: With dead ends: 78 [2018-01-28 22:29:56,793 INFO L226 Difference]: Without dead ends: 77 [2018-01-28 22:29:56,794 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=149, Invalid=907, Unknown=0, NotChecked=0, Total=1056 [2018-01-28 22:29:56,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-01-28 22:29:56,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 63. [2018-01-28 22:29:56,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-01-28 22:29:56,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 69 transitions. [2018-01-28 22:29:56,808 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 69 transitions. Word has length 51 [2018-01-28 22:29:56,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:29:56,809 INFO L432 AbstractCegarLoop]: Abstraction has 63 states and 69 transitions. [2018-01-28 22:29:56,809 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-01-28 22:29:56,809 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 69 transitions. [2018-01-28 22:29:56,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-01-28 22:29:56,810 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:29:56,811 INFO L330 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-28 22:29:56,811 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-28 22:29:56,811 INFO L82 PathProgramCache]: Analyzing trace with hash 352288786, now seen corresponding path program 2 times [2018-01-28 22:29:56,811 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:29:56,811 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:29:56,812 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:29:56,813 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:29:56,813 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:29:56,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:29:56,827 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:29:57,344 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-28 22:29:57,345 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:29:57,345 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-28 22:29:57,352 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-28 22:29:57,363 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-28 22:29:57,370 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-28 22:29:57,375 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-28 22:29:57,380 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:29:57,414 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-28 22:29:57,414 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:29:57,429 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-28 22:29:57,430 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:29:57,446 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-28 22:29:57,446 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-28 22:29:57,448 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-28 22:29:57,448 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 22:29:57,461 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-28 22:29:57,461 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46 [2018-01-28 22:29:57,748 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:29:57,749 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:29:57,750 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-28 22:29:57,751 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:29:57,795 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:29:57,796 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:29:57,797 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-28 22:29:57,797 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:29:57,838 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-28 22:29:57,838 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-28 22:29:57,886 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:29:57,887 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:29:57,888 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-28 22:29:57,888 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 22:29:57,928 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-28 22:29:57,929 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:107, output treesize:75 [2018-01-28 22:29:58,367 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-28 22:29:58,387 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:29:58,387 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 25 [2018-01-28 22:29:58,387 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-01-28 22:29:58,387 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-01-28 22:29:58,388 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=581, Unknown=1, NotChecked=0, Total=650 [2018-01-28 22:29:58,388 INFO L87 Difference]: Start difference. First operand 63 states and 69 transitions. Second operand 26 states. [2018-01-28 22:29:58,719 WARN L146 SmtUtils]: Spent 114ms on a formula simplification. DAG size of input: 67 DAG size of output 64 [2018-01-28 22:29:59,019 WARN L143 SmtUtils]: Spent 174ms on a formula simplification that was a NOOP. DAG size: 58 [2018-01-28 22:30:48,370 WARN L146 SmtUtils]: Spent 113ms on a formula simplification. DAG size of input: 63 DAG size of output 57 [2018-01-28 22:30:48,576 WARN L146 SmtUtils]: Spent 152ms on a formula simplification. DAG size of input: 63 DAG size of output 57 [2018-01-28 22:31:01,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:31:01,410 INFO L93 Difference]: Finished difference Result 99 states and 113 transitions. [2018-01-28 22:31:01,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-01-28 22:31:01,410 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 52 [2018-01-28 22:31:01,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:31:01,411 INFO L225 Difference]: With dead ends: 99 [2018-01-28 22:31:01,411 INFO L226 Difference]: Without dead ends: 98 [2018-01-28 22:31:01,412 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 389 ImplicationChecksByTransitivity, 25.0s TimeCoverageRelationStatistics Valid=226, Invalid=1568, Unknown=12, NotChecked=0, Total=1806 [2018-01-28 22:31:01,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-01-28 22:31:01,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 55. [2018-01-28 22:31:01,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-01-28 22:31:01,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 61 transitions. [2018-01-28 22:31:01,422 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 61 transitions. Word has length 52 [2018-01-28 22:31:01,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:31:01,422 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 61 transitions. [2018-01-28 22:31:01,422 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-01-28 22:31:01,422 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions. [2018-01-28 22:31:01,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-01-28 22:31:01,423 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:31:01,423 INFO L330 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-28 22:31:01,423 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-28 22:31:01,423 INFO L82 PathProgramCache]: Analyzing trace with hash 243861690, now seen corresponding path program 2 times [2018-01-28 22:31:01,423 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:31:01,423 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:31:01,424 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:31:01,424 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-28 22:31:01,424 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:31:01,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:31:01,433 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:31:01,523 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-28 22:31:01,523 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:31:01,524 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-28 22:31:01,530 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-28 22:31:01,542 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-28 22:31:01,560 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-28 22:31:01,573 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-28 22:31:01,576 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:31:01,902 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-28 22:31:01,923 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:31:01,923 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2018-01-28 22:31:01,923 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-28 22:31:01,923 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-28 22:31:01,923 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2018-01-28 22:31:01,923 INFO L87 Difference]: Start difference. First operand 55 states and 61 transitions. Second operand 13 states. [2018-01-28 22:31:02,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:31:02,054 INFO L93 Difference]: Finished difference Result 71 states and 79 transitions. [2018-01-28 22:31:02,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-28 22:31:02,055 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 59 [2018-01-28 22:31:02,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:31:02,055 INFO L225 Difference]: With dead ends: 71 [2018-01-28 22:31:02,056 INFO L226 Difference]: Without dead ends: 67 [2018-01-28 22:31:02,056 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2018-01-28 22:31:02,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-01-28 22:31:02,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 60. [2018-01-28 22:31:02,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-01-28 22:31:02,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 66 transitions. [2018-01-28 22:31:02,066 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 66 transitions. Word has length 59 [2018-01-28 22:31:02,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:31:02,067 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 66 transitions. [2018-01-28 22:31:02,067 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-28 22:31:02,067 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 66 transitions. [2018-01-28 22:31:02,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-01-28 22:31:02,068 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:31:02,068 INFO L330 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-28 22:31:02,068 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-28 22:31:02,068 INFO L82 PathProgramCache]: Analyzing trace with hash 2098211480, now seen corresponding path program 3 times [2018-01-28 22:31:02,068 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:31:02,068 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:31:02,069 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:31:02,070 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-28 22:31:02,070 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:31:02,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:31:02,084 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:31:02,440 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-28 22:31:02,440 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:31:02,440 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-28 22:31:02,446 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-28 22:31:02,459 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-28 22:31:02,463 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-28 22:31:02,467 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-28 22:31:02,471 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-28 22:31:02,473 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-28 22:31:02,477 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:31:02,502 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-28 22:31:02,502 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:31:02,516 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-28 22:31:02,516 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:31:02,529 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-28 22:31:02,529 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-01-28 22:31:03,054 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-28 22:31:03,074 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:31:03,075 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13] total 26 [2018-01-28 22:31:03,075 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-01-28 22:31:03,075 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-01-28 22:31:03,076 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=614, Unknown=0, NotChecked=0, Total=702 [2018-01-28 22:31:03,076 INFO L87 Difference]: Start difference. First operand 60 states and 66 transitions. Second operand 27 states. [2018-01-28 22:31:04,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:31:04,125 INFO L93 Difference]: Finished difference Result 96 states and 109 transitions. [2018-01-28 22:31:04,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-28 22:31:04,126 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 67 [2018-01-28 22:31:04,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:31:04,127 INFO L225 Difference]: With dead ends: 96 [2018-01-28 22:31:04,127 INFO L226 Difference]: Without dead ends: 95 [2018-01-28 22:31:04,128 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 60 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 367 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=215, Invalid=1425, Unknown=0, NotChecked=0, Total=1640 [2018-01-28 22:31:04,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-01-28 22:31:04,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 81. [2018-01-28 22:31:04,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-01-28 22:31:04,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 91 transitions. [2018-01-28 22:31:04,151 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 91 transitions. Word has length 67 [2018-01-28 22:31:04,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:31:04,151 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 91 transitions. [2018-01-28 22:31:04,151 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-01-28 22:31:04,152 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 91 transitions. [2018-01-28 22:31:04,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-01-28 22:31:04,153 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:31:04,153 INFO L330 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-28 22:31:04,153 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-28 22:31:04,153 INFO L82 PathProgramCache]: Analyzing trace with hash 1493540745, now seen corresponding path program 4 times [2018-01-28 22:31:04,153 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:31:04,153 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:31:04,154 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:31:04,154 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-28 22:31:04,154 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:31:04,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:31:04,168 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:31:04,542 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-28 22:31:04,542 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:31:04,542 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-28 22:31:04,547 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-28 22:31:04,570 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-28 22:31:04,574 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:31:04,591 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-28 22:31:04,592 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:31:04,606 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-28 22:31:04,606 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:31:04,607 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-28 22:31:04,608 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-28 22:31:04,621 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-28 22:31:04,621 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 22:31:04,633 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-28 22:31:04,633 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46 [2018-01-28 22:31:04,924 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:31:04,925 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:31:04,926 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-28 22:31:04,926 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:31:04,973 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:31:04,975 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-28 22:31:04,975 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:31:05,035 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:31:05,036 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:31:05,036 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-28 22:31:05,037 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-28 22:31:05,085 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:31:05,085 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:31:05,086 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-28 22:31:05,086 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 22:31:05,117 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-28 22:31:05,118 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:107, output treesize:75 [2018-01-28 22:31:05,794 WARN L143 SmtUtils]: Spent 424ms on a formula simplification that was a NOOP. DAG size: 50 [2018-01-28 22:31:06,212 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-28 22:31:06,233 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:31:06,233 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 30 [2018-01-28 22:31:06,233 INFO L409 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-01-28 22:31:06,234 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-01-28 22:31:06,234 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=836, Unknown=1, NotChecked=0, Total=930 [2018-01-28 22:31:06,234 INFO L87 Difference]: Start difference. First operand 81 states and 91 transitions. Second operand 31 states. [2018-01-28 22:31:06,588 WARN L146 SmtUtils]: Spent 112ms on a formula simplification. DAG size of input: 67 DAG size of output 64 [2018-01-28 22:31:55,292 WARN L143 SmtUtils]: Spent 2050ms on a formula simplification that was a NOOP. DAG size: 51 Received shutdown request... [2018-01-28 22:32:01,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-01-28 22:32:01,577 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-28 22:32:01,581 WARN L185 ceAbstractionStarter]: Timeout [2018-01-28 22:32:01,581 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.01 10:32:01 BoogieIcfgContainer [2018-01-28 22:32:01,581 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-28 22:32:01,582 INFO L168 Benchmark]: Toolchain (without parser) took 157021.20 ms. Allocated memory was 296.7 MB in the beginning and 522.7 MB in the end (delta: 226.0 MB). Free memory was 255.8 MB in the beginning and 298.2 MB in the end (delta: -42.4 MB). Peak memory consumption was 183.6 MB. Max. memory is 5.3 GB. [2018-01-28 22:32:01,584 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 296.7 MB. Free memory is still 262.8 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-28 22:32:01,584 INFO L168 Benchmark]: CACSL2BoogieTranslator took 207.53 ms. Allocated memory is still 296.7 MB. Free memory was 255.8 MB in the beginning and 242.7 MB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 5.3 GB. [2018-01-28 22:32:01,584 INFO L168 Benchmark]: Boogie Preprocessor took 33.83 ms. Allocated memory is still 296.7 MB. Free memory was 242.7 MB in the beginning and 240.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-28 22:32:01,585 INFO L168 Benchmark]: RCFGBuilder took 240.68 ms. Allocated memory is still 296.7 MB. Free memory was 240.8 MB in the beginning and 225.1 MB in the end (delta: 15.6 MB). Peak memory consumption was 15.6 MB. Max. memory is 5.3 GB. [2018-01-28 22:32:01,585 INFO L168 Benchmark]: TraceAbstraction took 156509.25 ms. Allocated memory was 296.7 MB in the beginning and 522.7 MB in the end (delta: 226.0 MB). Free memory was 225.1 MB in the beginning and 298.2 MB in the end (delta: -73.1 MB). Peak memory consumption was 152.9 MB. Max. memory is 5.3 GB. [2018-01-28 22:32:01,587 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.12 ms. Allocated memory is still 296.7 MB. Free memory is still 262.8 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 207.53 ms. Allocated memory is still 296.7 MB. Free memory was 255.8 MB in the beginning and 242.7 MB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 33.83 ms. Allocated memory is still 296.7 MB. Free memory was 242.7 MB in the beginning and 240.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 240.68 ms. Allocated memory is still 296.7 MB. Free memory was 240.8 MB in the beginning and 225.1 MB in the end (delta: 15.6 MB). Peak memory consumption was 15.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 156509.25 ms. Allocated memory was 296.7 MB in the beginning and 522.7 MB in the end (delta: 226.0 MB). Free memory was 225.1 MB in the beginning and 298.2 MB in the end (delta: -73.1 MB). Peak memory consumption was 152.9 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.4s OverallTime, 14 OverallIterations, 4 TraceHistogramMax, 146.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 520 SDtfs, 1093 SDslu, 2886 SDs, 0 SdLazy, 3162 SolverSat, 251 SolverUnsat, 48 SolverUnknown, 0 SolverNotchecked, 88.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 748 GetRequests, 466 SyntacticMatches, 18 SemanticMatches, 263 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1740 ImplicationChecksByTransitivity, 60.6s 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.2s 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-28_22-32-01-594.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-28_22-32-01-594.csv Completed graceful shutdown