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_test17_3_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cceb4a [2018-01-30 00:03:32,121 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-30 00:03:32,123 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-30 00:03:32,140 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-30 00:03:32,141 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-30 00:03:32,141 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-30 00:03:32,143 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-30 00:03:32,144 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-30 00:03:32,146 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-30 00:03:32,147 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-30 00:03:32,148 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-30 00:03:32,148 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-30 00:03:32,149 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-30 00:03:32,151 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-30 00:03:32,151 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-30 00:03:32,154 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-30 00:03:32,156 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-30 00:03:32,158 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-30 00:03:32,160 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-30 00:03:32,161 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-30 00:03:32,163 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-30 00:03:32,163 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-30 00:03:32,164 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-30 00:03:32,165 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-30 00:03:32,165 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-30 00:03:32,167 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-30 00:03:32,167 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-30 00:03:32,168 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-30 00:03:32,168 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-30 00:03:32,168 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-30 00:03:32,169 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-30 00:03:32,169 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf [2018-01-30 00:03:32,178 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-30 00:03:32,179 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-30 00:03:32,179 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-30 00:03:32,180 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-30 00:03:32,180 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-30 00:03:32,180 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-30 00:03:32,180 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-30 00:03:32,181 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-30 00:03:32,181 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-30 00:03:32,181 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-30 00:03:32,181 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-30 00:03:32,181 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-30 00:03:32,182 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-30 00:03:32,182 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-30 00:03:32,182 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-30 00:03:32,182 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-30 00:03:32,182 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-30 00:03:32,183 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-30 00:03:32,183 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-30 00:03:32,183 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-30 00:03:32,183 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-30 00:03:32,183 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-30 00:03:32,184 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-30 00:03:32,184 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-30 00:03:32,184 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-30 00:03:32,184 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-30 00:03:32,184 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-30 00:03:32,184 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-30 00:03:32,185 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-30 00:03:32,185 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-30 00:03:32,185 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-30 00:03:32,185 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-30 00:03:32,186 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-30 00:03:32,186 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-30 00:03:32,221 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-30 00:03:32,233 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-30 00:03:32,237 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-30 00:03:32,239 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-30 00:03:32,239 INFO L276 PluginConnector]: CDTParser initialized [2018-01-30 00:03:32,240 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test17_3_false-valid-memtrack.i [2018-01-30 00:03:32,422 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-30 00:03:32,427 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-30 00:03:32,428 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-30 00:03:32,428 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-30 00:03:32,434 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-30 00:03:32,435 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 12:03:32" (1/1) ... [2018-01-30 00:03:32,438 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d13a2ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:03:32, skipping insertion in model container [2018-01-30 00:03:32,439 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 12:03:32" (1/1) ... [2018-01-30 00:03:32,457 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-30 00:03:32,508 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-30 00:03:32,627 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-30 00:03:32,643 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-30 00:03:32,650 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:03:32 WrapperNode [2018-01-30 00:03:32,650 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-30 00:03:32,651 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-30 00:03:32,651 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-30 00:03:32,651 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-30 00:03:32,666 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:03:32" (1/1) ... [2018-01-30 00:03:32,666 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:03:32" (1/1) ... [2018-01-30 00:03:32,677 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:03:32" (1/1) ... [2018-01-30 00:03:32,678 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:03:32" (1/1) ... [2018-01-30 00:03:32,682 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:03:32" (1/1) ... [2018-01-30 00:03:32,685 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:03:32" (1/1) ... [2018-01-30 00:03:32,686 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:03:32" (1/1) ... [2018-01-30 00:03:32,688 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-30 00:03:32,688 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-30 00:03:32,688 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-30 00:03:32,688 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-30 00:03:32,689 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:03:32" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-30 00:03:32,736 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-30 00:03:32,737 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-30 00:03:32,737 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-30 00:03:32,737 INFO L136 BoogieDeclarations]: Found implementation of procedure alloc_17 [2018-01-30 00:03:32,737 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-30 00:03:32,737 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-30 00:03:32,737 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-30 00:03:32,737 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-30 00:03:32,737 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-30 00:03:32,737 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-30 00:03:32,738 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-30 00:03:32,738 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-30 00:03:32,738 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-30 00:03:32,738 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-30 00:03:32,738 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-30 00:03:32,738 INFO L128 BoogieDeclarations]: Found specification of procedure alloc_17 [2018-01-30 00:03:32,738 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-30 00:03:32,738 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-30 00:03:32,738 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-30 00:03:32,738 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-30 00:03:32,974 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-30 00:03:32,975 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 12:03:32 BoogieIcfgContainer [2018-01-30 00:03:32,975 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-30 00:03:32,976 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-30 00:03:32,976 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-30 00:03:32,979 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-30 00:03:32,980 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.01 12:03:32" (1/3) ... [2018-01-30 00:03:32,981 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@715c269c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 12:03:32, skipping insertion in model container [2018-01-30 00:03:32,981 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:03:32" (2/3) ... [2018-01-30 00:03:32,981 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@715c269c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 12:03:32, skipping insertion in model container [2018-01-30 00:03:32,981 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 12:03:32" (3/3) ... [2018-01-30 00:03:32,983 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test17_3_false-valid-memtrack.i [2018-01-30 00:03:32,989 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-30 00:03:32,995 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2018-01-30 00:03:33,031 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-30 00:03:33,032 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-30 00:03:33,032 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-30 00:03:33,032 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-30 00:03:33,032 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-30 00:03:33,032 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-30 00:03:33,032 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-30 00:03:33,032 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-30 00:03:33,033 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-30 00:03:33,051 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states. [2018-01-30 00:03:33,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-30 00:03:33,057 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:03:33,058 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:03:33,058 INFO L371 AbstractCegarLoop]: === Iteration 1 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-30 00:03:33,062 INFO L82 PathProgramCache]: Analyzing trace with hash -17133522, now seen corresponding path program 1 times [2018-01-30 00:03:33,064 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:03:33,064 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:03:33,109 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:03:33,110 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:03:33,110 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:03:33,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:03:33,163 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:03:33,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:03:33,261 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:03:33,262 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-30 00:03:33,264 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 00:03:33,349 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 00:03:33,349 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 00:03:33,351 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 3 states. [2018-01-30 00:03:33,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:03:33,561 INFO L93 Difference]: Finished difference Result 190 states and 220 transitions. [2018-01-30 00:03:33,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 00:03:33,596 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-01-30 00:03:33,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:03:33,606 INFO L225 Difference]: With dead ends: 190 [2018-01-30 00:03:33,606 INFO L226 Difference]: Without dead ends: 124 [2018-01-30 00:03:33,610 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 00:03:33,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-01-30 00:03:33,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 84. [2018-01-30 00:03:33,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-01-30 00:03:33,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 91 transitions. [2018-01-30 00:03:33,653 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 91 transitions. Word has length 23 [2018-01-30 00:03:33,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:03:33,653 INFO L432 AbstractCegarLoop]: Abstraction has 84 states and 91 transitions. [2018-01-30 00:03:33,653 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 00:03:33,653 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 91 transitions. [2018-01-30 00:03:33,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-30 00:03:33,655 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:03:33,655 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:03:33,655 INFO L371 AbstractCegarLoop]: === Iteration 2 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-30 00:03:33,655 INFO L82 PathProgramCache]: Analyzing trace with hash 1306909630, now seen corresponding path program 1 times [2018-01-30 00:03:33,655 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:03:33,655 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:03:33,657 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:03:33,658 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:03:33,658 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:03:33,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:03:33,679 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:03:33,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:03:33,757 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:03:33,758 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 00:03:33,759 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 00:03:33,760 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 00:03:33,760 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-30 00:03:33,760 INFO L87 Difference]: Start difference. First operand 84 states and 91 transitions. Second operand 6 states. [2018-01-30 00:03:33,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:03:33,849 INFO L93 Difference]: Finished difference Result 104 states and 113 transitions. [2018-01-30 00:03:33,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-30 00:03:33,850 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-01-30 00:03:33,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:03:33,852 INFO L225 Difference]: With dead ends: 104 [2018-01-30 00:03:33,852 INFO L226 Difference]: Without dead ends: 100 [2018-01-30 00:03:33,853 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-30 00:03:33,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-01-30 00:03:33,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 79. [2018-01-30 00:03:33,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-01-30 00:03:33,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 84 transitions. [2018-01-30 00:03:33,864 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 84 transitions. Word has length 24 [2018-01-30 00:03:33,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:03:33,864 INFO L432 AbstractCegarLoop]: Abstraction has 79 states and 84 transitions. [2018-01-30 00:03:33,864 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 00:03:33,864 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 84 transitions. [2018-01-30 00:03:33,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-30 00:03:33,865 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:03:33,865 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:03:33,865 INFO L371 AbstractCegarLoop]: === Iteration 3 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-30 00:03:33,866 INFO L82 PathProgramCache]: Analyzing trace with hash -557884516, now seen corresponding path program 1 times [2018-01-30 00:03:33,866 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:03:33,866 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:03:33,868 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:03:33,868 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:03:33,868 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:03:33,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:03:33,881 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:03:33,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:03:33,940 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:03:33,940 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-30 00:03:33,941 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-30 00:03:33,941 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-30 00:03:33,941 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-30 00:03:33,941 INFO L87 Difference]: Start difference. First operand 79 states and 84 transitions. Second operand 5 states. [2018-01-30 00:03:33,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:03:33,987 INFO L93 Difference]: Finished difference Result 150 states and 160 transitions. [2018-01-30 00:03:33,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-30 00:03:33,988 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2018-01-30 00:03:33,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:03:33,989 INFO L225 Difference]: With dead ends: 150 [2018-01-30 00:03:33,989 INFO L226 Difference]: Without dead ends: 81 [2018-01-30 00:03:33,990 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-30 00:03:33,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-01-30 00:03:33,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-01-30 00:03:33,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-01-30 00:03:33,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 86 transitions. [2018-01-30 00:03:33,999 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 86 transitions. Word has length 24 [2018-01-30 00:03:33,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:03:33,999 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 86 transitions. [2018-01-30 00:03:33,999 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-30 00:03:33,999 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 86 transitions. [2018-01-30 00:03:34,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-30 00:03:34,000 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:03:34,000 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:03:34,001 INFO L371 AbstractCegarLoop]: === Iteration 4 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-30 00:03:34,001 INFO L82 PathProgramCache]: Analyzing trace with hash 1832747532, now seen corresponding path program 1 times [2018-01-30 00:03:34,001 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:03:34,001 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:03:34,003 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:03:34,003 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:03:34,003 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:03:34,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:03:34,018 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:03:34,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:03:34,080 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:03:34,080 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-30 00:03:34,080 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 00:03:34,081 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 00:03:34,081 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-30 00:03:34,081 INFO L87 Difference]: Start difference. First operand 81 states and 86 transitions. Second operand 6 states. [2018-01-30 00:03:34,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:03:34,184 INFO L93 Difference]: Finished difference Result 81 states and 86 transitions. [2018-01-30 00:03:34,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-30 00:03:34,184 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-01-30 00:03:34,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:03:34,185 INFO L225 Difference]: With dead ends: 81 [2018-01-30 00:03:34,185 INFO L226 Difference]: Without dead ends: 80 [2018-01-30 00:03:34,186 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-30 00:03:34,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-01-30 00:03:34,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-01-30 00:03:34,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-01-30 00:03:34,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 85 transitions. [2018-01-30 00:03:34,194 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 85 transitions. Word has length 25 [2018-01-30 00:03:34,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:03:34,194 INFO L432 AbstractCegarLoop]: Abstraction has 80 states and 85 transitions. [2018-01-30 00:03:34,195 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 00:03:34,195 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 85 transitions. [2018-01-30 00:03:34,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-30 00:03:34,196 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:03:34,196 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:03:34,196 INFO L371 AbstractCegarLoop]: === Iteration 5 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-30 00:03:34,196 INFO L82 PathProgramCache]: Analyzing trace with hash 1832747533, now seen corresponding path program 1 times [2018-01-30 00:03:34,196 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:03:34,196 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:03:34,197 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:03:34,198 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:03:34,198 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:03:34,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:03:34,216 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:03:34,435 WARN L146 SmtUtils]: Spent 108ms on a formula simplification. DAG size of input: 19 DAG size of output 17 [2018-01-30 00:03:34,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:03:34,548 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:03:34,548 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-30 00:03:34,549 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-30 00:03:34,549 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-30 00:03:34,549 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-01-30 00:03:34,549 INFO L87 Difference]: Start difference. First operand 80 states and 85 transitions. Second operand 9 states. [2018-01-30 00:03:34,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:03:34,809 INFO L93 Difference]: Finished difference Result 145 states and 154 transitions. [2018-01-30 00:03:34,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-30 00:03:34,810 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2018-01-30 00:03:34,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:03:34,811 INFO L225 Difference]: With dead ends: 145 [2018-01-30 00:03:34,811 INFO L226 Difference]: Without dead ends: 85 [2018-01-30 00:03:34,812 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2018-01-30 00:03:34,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-01-30 00:03:34,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 83. [2018-01-30 00:03:34,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-01-30 00:03:34,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 88 transitions. [2018-01-30 00:03:34,821 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 88 transitions. Word has length 25 [2018-01-30 00:03:34,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:03:34,821 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 88 transitions. [2018-01-30 00:03:34,821 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-30 00:03:34,822 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 88 transitions. [2018-01-30 00:03:34,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-30 00:03:34,823 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:03:34,823 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:03:34,823 INFO L371 AbstractCegarLoop]: === Iteration 6 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-30 00:03:34,823 INFO L82 PathProgramCache]: Analyzing trace with hash -1263716541, now seen corresponding path program 1 times [2018-01-30 00:03:34,824 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:03:34,824 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:03:34,825 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:03:34,825 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:03:34,825 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:03:34,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:03:34,841 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:03:35,224 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:03:35,224 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:03:35,225 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 00:03:35,238 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:03:35,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:03:35,285 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:03:35,347 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-01-30 00:03:35,349 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:03:35,361 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-01-30 00:03:35,362 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:03:35,375 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-30 00:03:35,376 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-01-30 00:03:35,798 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:03:35,826 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:03:35,826 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2018-01-30 00:03:35,826 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-01-30 00:03:35,826 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-01-30 00:03:35,827 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2018-01-30 00:03:35,827 INFO L87 Difference]: Start difference. First operand 83 states and 88 transitions. Second operand 20 states. [2018-01-30 00:03:36,225 WARN L143 SmtUtils]: Spent 245ms on a formula simplification that was a NOOP. DAG size: 27 [2018-01-30 00:03:36,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:03:36,491 INFO L93 Difference]: Finished difference Result 151 states and 160 transitions. [2018-01-30 00:03:36,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-30 00:03:36,492 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 31 [2018-01-30 00:03:36,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:03:36,493 INFO L225 Difference]: With dead ends: 151 [2018-01-30 00:03:36,493 INFO L226 Difference]: Without dead ends: 91 [2018-01-30 00:03:36,493 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=131, Invalid=681, Unknown=0, NotChecked=0, Total=812 [2018-01-30 00:03:36,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-01-30 00:03:36,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 89. [2018-01-30 00:03:36,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-01-30 00:03:36,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 94 transitions. [2018-01-30 00:03:36,500 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 94 transitions. Word has length 31 [2018-01-30 00:03:36,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:03:36,500 INFO L432 AbstractCegarLoop]: Abstraction has 89 states and 94 transitions. [2018-01-30 00:03:36,500 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-01-30 00:03:36,500 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 94 transitions. [2018-01-30 00:03:36,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-30 00:03:36,501 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:03:36,501 INFO L350 BasicCegarLoop]: trace histogram [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, 1, 1, 1] [2018-01-30 00:03:36,501 INFO L371 AbstractCegarLoop]: === Iteration 7 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-30 00:03:36,501 INFO L82 PathProgramCache]: Analyzing trace with hash 1565633529, now seen corresponding path program 2 times [2018-01-30 00:03:36,501 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:03:36,501 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:03:36,502 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:03:36,503 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:03:36,503 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:03:36,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:03:36,518 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:03:36,769 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:03:36,770 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:03:36,770 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 00:03:36,775 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-30 00:03:36,789 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:03:36,798 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:03:36,800 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 00:03:36,802 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:03:36,818 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-01-30 00:03:36,819 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:03:36,834 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-01-30 00:03:36,835 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:03:36,850 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-30 00:03:36,851 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-01-30 00:03:37,205 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:03:37,225 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:03:37,225 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 23 [2018-01-30 00:03:37,225 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-01-30 00:03:37,225 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-01-30 00:03:37,226 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=479, Unknown=0, NotChecked=0, Total=552 [2018-01-30 00:03:37,226 INFO L87 Difference]: Start difference. First operand 89 states and 94 transitions. Second operand 24 states. [2018-01-30 00:03:38,960 WARN L143 SmtUtils]: Spent 1548ms on a formula simplification that was a NOOP. DAG size: 27 [2018-01-30 00:03:39,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:03:39,383 INFO L93 Difference]: Finished difference Result 157 states and 166 transitions. [2018-01-30 00:03:39,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-30 00:03:39,383 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 37 [2018-01-30 00:03:39,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:03:39,384 INFO L225 Difference]: With dead ends: 157 [2018-01-30 00:03:39,384 INFO L226 Difference]: Without dead ends: 97 [2018-01-30 00:03:39,385 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=177, Invalid=1083, Unknown=0, NotChecked=0, Total=1260 [2018-01-30 00:03:39,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-01-30 00:03:39,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 95. [2018-01-30 00:03:39,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-01-30 00:03:39,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 100 transitions. [2018-01-30 00:03:39,391 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 100 transitions. Word has length 37 [2018-01-30 00:03:39,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:03:39,391 INFO L432 AbstractCegarLoop]: Abstraction has 95 states and 100 transitions. [2018-01-30 00:03:39,391 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-01-30 00:03:39,391 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 100 transitions. [2018-01-30 00:03:39,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-01-30 00:03:39,392 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:03:39,392 INFO L350 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:03:39,392 INFO L371 AbstractCegarLoop]: === Iteration 8 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-30 00:03:39,392 INFO L82 PathProgramCache]: Analyzing trace with hash -377667537, now seen corresponding path program 3 times [2018-01-30 00:03:39,393 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:03:39,393 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:03:39,394 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:03:39,394 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 00:03:39,394 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:03:39,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:03:39,407 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:03:39,725 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:03:39,726 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:03:39,726 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 00:03:39,736 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-30 00:03:39,746 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:03:39,748 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:03:39,749 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 00:03:39,752 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:03:39,779 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-01-30 00:03:39,780 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:03:39,790 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-01-30 00:03:39,791 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:03:39,800 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-30 00:03:39,800 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-01-30 00:03:42,175 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-01-30 00:03:42,194 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:03:42,194 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11] total 26 [2018-01-30 00:03:42,195 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-01-30 00:03:42,195 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-01-30 00:03:42,195 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=636, Unknown=1, NotChecked=0, Total=702 [2018-01-30 00:03:42,195 INFO L87 Difference]: Start difference. First operand 95 states and 100 transitions. Second operand 27 states. [2018-01-30 00:03:44,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:03:44,281 INFO L93 Difference]: Finished difference Result 162 states and 172 transitions. [2018-01-30 00:03:44,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-01-30 00:03:44,281 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 43 [2018-01-30 00:03:44,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:03:44,282 INFO L225 Difference]: With dead ends: 162 [2018-01-30 00:03:44,282 INFO L226 Difference]: Without dead ends: 102 [2018-01-30 00:03:44,283 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 328 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=358, Invalid=1897, Unknown=1, NotChecked=0, Total=2256 [2018-01-30 00:03:44,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-01-30 00:03:44,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 99. [2018-01-30 00:03:44,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-01-30 00:03:44,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 104 transitions. [2018-01-30 00:03:44,290 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 104 transitions. Word has length 43 [2018-01-30 00:03:44,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:03:44,291 INFO L432 AbstractCegarLoop]: Abstraction has 99 states and 104 transitions. [2018-01-30 00:03:44,291 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-01-30 00:03:44,291 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 104 transitions. [2018-01-30 00:03:44,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-01-30 00:03:44,292 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:03:44,292 INFO L350 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:03:44,292 INFO L371 AbstractCegarLoop]: === Iteration 9 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-30 00:03:44,293 INFO L82 PathProgramCache]: Analyzing trace with hash 475868511, now seen corresponding path program 1 times [2018-01-30 00:03:44,293 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:03:44,293 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:03:44,294 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:03:44,294 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 00:03:44,294 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:03:44,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:03:44,306 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:03:44,362 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-01-30 00:03:44,362 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:03:44,362 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-30 00:03:44,362 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 00:03:44,363 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 00:03:44,363 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-30 00:03:44,363 INFO L87 Difference]: Start difference. First operand 99 states and 104 transitions. Second operand 6 states. [2018-01-30 00:03:44,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:03:44,390 INFO L93 Difference]: Finished difference Result 99 states and 104 transitions. [2018-01-30 00:03:44,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-30 00:03:44,391 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 62 [2018-01-30 00:03:44,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:03:44,392 INFO L225 Difference]: With dead ends: 99 [2018-01-30 00:03:44,392 INFO L226 Difference]: Without dead ends: 98 [2018-01-30 00:03:44,393 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-30 00:03:44,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-01-30 00:03:44,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2018-01-30 00:03:44,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-01-30 00:03:44,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 103 transitions. [2018-01-30 00:03:44,406 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 103 transitions. Word has length 62 [2018-01-30 00:03:44,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:03:44,407 INFO L432 AbstractCegarLoop]: Abstraction has 98 states and 103 transitions. [2018-01-30 00:03:44,407 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 00:03:44,407 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 103 transitions. [2018-01-30 00:03:44,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-01-30 00:03:44,408 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:03:44,409 INFO L350 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:03:44,409 INFO L371 AbstractCegarLoop]: === Iteration 10 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-30 00:03:44,409 INFO L82 PathProgramCache]: Analyzing trace with hash 475868512, now seen corresponding path program 1 times [2018-01-30 00:03:44,409 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:03:44,409 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:03:44,410 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:03:44,410 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:03:44,410 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:03:44,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:03:44,422 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:03:44,460 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-01-30 00:03:44,461 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:03:44,461 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 00:03:44,461 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 00:03:44,461 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 00:03:44,462 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 00:03:44,462 INFO L87 Difference]: Start difference. First operand 98 states and 103 transitions. Second operand 4 states. [2018-01-30 00:03:44,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:03:44,635 INFO L93 Difference]: Finished difference Result 127 states and 137 transitions. [2018-01-30 00:03:44,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 00:03:44,635 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2018-01-30 00:03:44,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:03:44,637 INFO L225 Difference]: With dead ends: 127 [2018-01-30 00:03:44,637 INFO L226 Difference]: Without dead ends: 126 [2018-01-30 00:03:44,637 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 00:03:44,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-01-30 00:03:44,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 118. [2018-01-30 00:03:44,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-01-30 00:03:44,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 130 transitions. [2018-01-30 00:03:44,644 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 130 transitions. Word has length 62 [2018-01-30 00:03:44,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:03:44,644 INFO L432 AbstractCegarLoop]: Abstraction has 118 states and 130 transitions. [2018-01-30 00:03:44,644 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 00:03:44,644 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 130 transitions. [2018-01-30 00:03:44,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-01-30 00:03:44,646 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:03:44,646 INFO L350 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:03:44,646 INFO L371 AbstractCegarLoop]: === Iteration 11 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-30 00:03:44,646 INFO L82 PathProgramCache]: Analyzing trace with hash -1088143582, now seen corresponding path program 1 times [2018-01-30 00:03:44,646 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:03:44,647 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:03:44,648 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:03:44,648 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:03:44,648 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:03:44,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:03:44,657 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:03:44,953 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:03:44,953 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:03:44,953 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 00:03:44,963 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:03:44,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:03:44,987 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:03:45,236 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:03:45,257 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:03:45,257 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2018-01-30 00:03:45,257 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-30 00:03:45,257 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-30 00:03:45,257 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2018-01-30 00:03:45,258 INFO L87 Difference]: Start difference. First operand 118 states and 130 transitions. Second operand 21 states. [2018-01-30 00:03:45,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:03:45,392 INFO L93 Difference]: Finished difference Result 205 states and 228 transitions. [2018-01-30 00:03:45,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-30 00:03:45,392 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 65 [2018-01-30 00:03:45,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:03:45,393 INFO L225 Difference]: With dead ends: 205 [2018-01-30 00:03:45,393 INFO L226 Difference]: Without dead ends: 127 [2018-01-30 00:03:45,394 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=254, Invalid=558, Unknown=0, NotChecked=0, Total=812 [2018-01-30 00:03:45,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-01-30 00:03:45,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 124. [2018-01-30 00:03:45,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-01-30 00:03:45,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 136 transitions. [2018-01-30 00:03:45,402 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 136 transitions. Word has length 65 [2018-01-30 00:03:45,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:03:45,403 INFO L432 AbstractCegarLoop]: Abstraction has 124 states and 136 transitions. [2018-01-30 00:03:45,403 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-30 00:03:45,403 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 136 transitions. [2018-01-30 00:03:45,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-01-30 00:03:45,404 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:03:45,404 INFO L350 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:03:45,404 INFO L371 AbstractCegarLoop]: === Iteration 12 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-30 00:03:45,404 INFO L82 PathProgramCache]: Analyzing trace with hash -1815869864, now seen corresponding path program 2 times [2018-01-30 00:03:45,404 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:03:45,405 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:03:45,406 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:03:45,406 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:03:45,406 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:03:45,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:03:45,418 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:03:45,657 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:03:45,657 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:03:45,657 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 00:03:45,663 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-30 00:03:45,680 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:03:45,681 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 00:03:45,687 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:03:45,747 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-01-30 00:03:45,782 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-30 00:03:45,782 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [14] total 17 [2018-01-30 00:03:45,783 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-30 00:03:45,783 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-30 00:03:45,783 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2018-01-30 00:03:45,783 INFO L87 Difference]: Start difference. First operand 124 states and 136 transitions. Second operand 17 states. [2018-01-30 00:03:46,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:03:46,081 INFO L93 Difference]: Finished difference Result 256 states and 288 transitions. [2018-01-30 00:03:46,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-01-30 00:03:46,081 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 71 [2018-01-30 00:03:46,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:03:46,083 INFO L225 Difference]: With dead ends: 256 [2018-01-30 00:03:46,083 INFO L226 Difference]: Without dead ends: 175 [2018-01-30 00:03:46,083 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=283, Invalid=773, Unknown=0, NotChecked=0, Total=1056 [2018-01-30 00:03:46,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-01-30 00:03:46,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 132. [2018-01-30 00:03:46,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-01-30 00:03:46,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 144 transitions. [2018-01-30 00:03:46,093 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 144 transitions. Word has length 71 [2018-01-30 00:03:46,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:03:46,094 INFO L432 AbstractCegarLoop]: Abstraction has 132 states and 144 transitions. [2018-01-30 00:03:46,094 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-30 00:03:46,094 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 144 transitions. [2018-01-30 00:03:46,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-01-30 00:03:46,095 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:03:46,095 INFO L350 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 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, 1, 1] [2018-01-30 00:03:46,095 INFO L371 AbstractCegarLoop]: === Iteration 13 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-30 00:03:46,095 INFO L82 PathProgramCache]: Analyzing trace with hash -587596373, now seen corresponding path program 1 times [2018-01-30 00:03:46,095 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:03:46,095 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:03:46,096 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:03:46,096 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 00:03:46,096 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:03:46,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:03:46,107 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:03:46,168 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-01-30 00:03:46,168 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:03:46,168 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-30 00:03:46,169 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-30 00:03:46,169 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-30 00:03:46,170 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-30 00:03:46,170 INFO L87 Difference]: Start difference. First operand 132 states and 144 transitions. Second operand 5 states. [2018-01-30 00:03:46,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:03:46,214 INFO L93 Difference]: Finished difference Result 202 states and 222 transitions. [2018-01-30 00:03:46,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-30 00:03:46,214 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 80 [2018-01-30 00:03:46,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:03:46,216 INFO L225 Difference]: With dead ends: 202 [2018-01-30 00:03:46,216 INFO L226 Difference]: Without dead ends: 130 [2018-01-30 00:03:46,216 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-30 00:03:46,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-01-30 00:03:46,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 128. [2018-01-30 00:03:46,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-01-30 00:03:46,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 136 transitions. [2018-01-30 00:03:46,226 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 136 transitions. Word has length 80 [2018-01-30 00:03:46,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:03:46,227 INFO L432 AbstractCegarLoop]: Abstraction has 128 states and 136 transitions. [2018-01-30 00:03:46,227 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-30 00:03:46,227 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 136 transitions. [2018-01-30 00:03:46,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-01-30 00:03:46,228 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:03:46,228 INFO L350 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 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, 1, 1, 1, 1, 1, 1] [2018-01-30 00:03:46,228 INFO L371 AbstractCegarLoop]: === Iteration 14 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-30 00:03:46,228 INFO L82 PathProgramCache]: Analyzing trace with hash 1983731205, now seen corresponding path program 1 times [2018-01-30 00:03:46,228 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:03:46,229 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:03:46,230 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:03:46,230 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:03:46,230 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:03:46,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:03:46,244 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:03:46,391 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 102 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-01-30 00:03:46,391 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:03:46,391 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 00:03:46,399 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:03:46,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:03:46,429 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:03:46,578 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 8 proven. 102 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:03:46,597 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:03:46,597 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 29 [2018-01-30 00:03:46,598 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-01-30 00:03:46,598 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-01-30 00:03:46,598 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=610, Unknown=0, NotChecked=0, Total=812 [2018-01-30 00:03:46,598 INFO L87 Difference]: Start difference. First operand 128 states and 136 transitions. Second operand 29 states. [2018-01-30 00:03:46,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:03:46,783 INFO L93 Difference]: Finished difference Result 213 states and 228 transitions. [2018-01-30 00:03:46,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-01-30 00:03:46,783 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 81 [2018-01-30 00:03:46,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:03:46,784 INFO L225 Difference]: With dead ends: 213 [2018-01-30 00:03:46,784 INFO L226 Difference]: Without dead ends: 137 [2018-01-30 00:03:46,784 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 462 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=484, Invalid=1156, Unknown=0, NotChecked=0, Total=1640 [2018-01-30 00:03:46,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-01-30 00:03:46,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 134. [2018-01-30 00:03:46,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-01-30 00:03:46,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 142 transitions. [2018-01-30 00:03:46,793 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 142 transitions. Word has length 81 [2018-01-30 00:03:46,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:03:46,794 INFO L432 AbstractCegarLoop]: Abstraction has 134 states and 142 transitions. [2018-01-30 00:03:46,794 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-01-30 00:03:46,794 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 142 transitions. [2018-01-30 00:03:46,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-01-30 00:03:46,795 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:03:46,795 INFO L350 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 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, 1, 1, 1, 1, 1, 1] [2018-01-30 00:03:46,795 INFO L371 AbstractCegarLoop]: === Iteration 15 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-30 00:03:46,795 INFO L82 PathProgramCache]: Analyzing trace with hash 1011085627, now seen corresponding path program 2 times [2018-01-30 00:03:46,795 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:03:46,796 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:03:46,796 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:03:46,797 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:03:46,797 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:03:46,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:03:46,813 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:03:46,969 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-01-30 00:03:46,969 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:03:46,969 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 00:03:46,974 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-30 00:03:46,985 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:03:46,995 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:03:46,998 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 00:03:47,002 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:03:47,152 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 8 proven. 140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:03:47,172 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:03:47,172 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 33 [2018-01-30 00:03:47,173 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-01-30 00:03:47,173 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-01-30 00:03:47,173 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=801, Unknown=0, NotChecked=0, Total=1056 [2018-01-30 00:03:47,173 INFO L87 Difference]: Start difference. First operand 134 states and 142 transitions. Second operand 33 states. [2018-01-30 00:03:47,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:03:47,413 INFO L93 Difference]: Finished difference Result 219 states and 234 transitions. [2018-01-30 00:03:47,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-01-30 00:03:47,413 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 87 [2018-01-30 00:03:47,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:03:47,414 INFO L225 Difference]: With dead ends: 219 [2018-01-30 00:03:47,414 INFO L226 Difference]: Without dead ends: 143 [2018-01-30 00:03:47,415 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 632 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=626, Invalid=1536, Unknown=0, NotChecked=0, Total=2162 [2018-01-30 00:03:47,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-01-30 00:03:47,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 140. [2018-01-30 00:03:47,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-01-30 00:03:47,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 148 transitions. [2018-01-30 00:03:47,425 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 148 transitions. Word has length 87 [2018-01-30 00:03:47,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:03:47,425 INFO L432 AbstractCegarLoop]: Abstraction has 140 states and 148 transitions. [2018-01-30 00:03:47,425 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-01-30 00:03:47,425 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 148 transitions. [2018-01-30 00:03:47,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-01-30 00:03:47,426 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:03:47,427 INFO L350 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 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, 1, 1, 1, 1, 1, 1] [2018-01-30 00:03:47,427 INFO L371 AbstractCegarLoop]: === Iteration 16 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-30 00:03:47,427 INFO L82 PathProgramCache]: Analyzing trace with hash 1950010353, now seen corresponding path program 3 times [2018-01-30 00:03:47,427 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:03:47,427 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:03:47,428 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:03:47,428 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 00:03:47,428 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:03:47,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:03:47,444 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:03:47,623 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 0 proven. 184 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-01-30 00:03:47,623 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:03:47,623 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 00:03:47,629 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-30 00:03:47,641 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:03:47,649 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:03:47,650 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 00:03:47,656 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:03:47,660 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-30 00:03:47,660 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:03:47,675 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:03:47,676 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-30 00:03:47,771 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#t~malloc1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |ldv_malloc_#t~malloc1.base| 1))) is different from true [2018-01-30 00:03:47,778 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-01-30 00:03:47,778 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:03:47,781 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-30 00:03:47,781 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-01-30 00:03:47,809 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 184 trivial. 3 not checked. [2018-01-30 00:03:47,829 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:03:47,829 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 9] total 28 [2018-01-30 00:03:47,830 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-01-30 00:03:47,830 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-01-30 00:03:47,830 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=586, Unknown=1, NotChecked=50, Total=756 [2018-01-30 00:03:47,830 INFO L87 Difference]: Start difference. First operand 140 states and 148 transitions. Second operand 28 states. [2018-01-30 00:03:48,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:03:48,601 INFO L93 Difference]: Finished difference Result 241 states and 262 transitions. [2018-01-30 00:03:48,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-01-30 00:03:48,601 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 93 [2018-01-30 00:03:48,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:03:48,602 INFO L225 Difference]: With dead ends: 241 [2018-01-30 00:03:48,602 INFO L226 Difference]: Without dead ends: 165 [2018-01-30 00:03:48,604 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 85 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 793 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=719, Invalid=2943, Unknown=2, NotChecked=118, Total=3782 [2018-01-30 00:03:48,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-01-30 00:03:48,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 139. [2018-01-30 00:03:48,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-01-30 00:03:48,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 145 transitions. [2018-01-30 00:03:48,611 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 145 transitions. Word has length 93 [2018-01-30 00:03:48,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:03:48,611 INFO L432 AbstractCegarLoop]: Abstraction has 139 states and 145 transitions. [2018-01-30 00:03:48,611 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-01-30 00:03:48,611 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 145 transitions. [2018-01-30 00:03:48,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-01-30 00:03:48,612 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:03:48,612 INFO L350 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 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, 1, 1, 1, 1, 1, 1] [2018-01-30 00:03:48,612 INFO L371 AbstractCegarLoop]: === Iteration 17 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-30 00:03:48,612 INFO L82 PathProgramCache]: Analyzing trace with hash 97797672, now seen corresponding path program 1 times [2018-01-30 00:03:48,612 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:03:48,612 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:03:48,613 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:03:48,613 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 00:03:48,613 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:03:48,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:03:48,625 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:03:48,979 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 0 proven. 234 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-01-30 00:03:48,980 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:03:48,980 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 00:03:48,986 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:03:49,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:03:49,013 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:03:49,208 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 8 proven. 234 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:03:49,228 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:03:49,228 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 41 [2018-01-30 00:03:49,229 INFO L409 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-01-30 00:03:49,229 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-01-30 00:03:49,229 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=379, Invalid=1261, Unknown=0, NotChecked=0, Total=1640 [2018-01-30 00:03:49,229 INFO L87 Difference]: Start difference. First operand 139 states and 145 transitions. Second operand 41 states. [2018-01-30 00:03:49,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:03:49,543 INFO L93 Difference]: Finished difference Result 217 states and 228 transitions. [2018-01-30 00:03:49,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-01-30 00:03:49,544 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 99 [2018-01-30 00:03:49,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:03:49,545 INFO L225 Difference]: With dead ends: 217 [2018-01-30 00:03:49,545 INFO L226 Difference]: Without dead ends: 148 [2018-01-30 00:03:49,546 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1104 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=997, Invalid=2543, Unknown=0, NotChecked=0, Total=3540 [2018-01-30 00:03:49,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-01-30 00:03:49,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 145. [2018-01-30 00:03:49,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-01-30 00:03:49,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 151 transitions. [2018-01-30 00:03:49,554 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 151 transitions. Word has length 99 [2018-01-30 00:03:49,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:03:49,554 INFO L432 AbstractCegarLoop]: Abstraction has 145 states and 151 transitions. [2018-01-30 00:03:49,554 INFO L433 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-01-30 00:03:49,555 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 151 transitions. [2018-01-30 00:03:49,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-01-30 00:03:49,555 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:03:49,555 INFO L350 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1] [2018-01-30 00:03:49,555 INFO L371 AbstractCegarLoop]: === Iteration 18 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-30 00:03:49,555 INFO L82 PathProgramCache]: Analyzing trace with hash 561692638, now seen corresponding path program 2 times [2018-01-30 00:03:49,556 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:03:49,556 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:03:49,557 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:03:49,557 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:03:49,557 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:03:49,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:03:49,575 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:03:50,095 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 5 proven. 167 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-01-30 00:03:50,096 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:03:50,096 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 00:03:50,101 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-30 00:03:50,113 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:03:50,126 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:03:50,129 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 00:03:50,133 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:03:50,141 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-01-30 00:03:50,142 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:03:50,154 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2018-01-30 00:03:50,154 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:03:50,156 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 19 treesize of output 18 [2018-01-30 00:03:50,156 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-30 00:03:50,167 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-01-30 00:03:50,168 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-30 00:03:50,179 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-30 00:03:50,179 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:44, output treesize:40 [2018-01-30 00:03:52,360 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:03:52,362 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:03:52,365 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 57 treesize of output 51 [2018-01-30 00:03:52,365 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:03:52,409 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:03:52,409 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 51 treesize of output 60 [2018-01-30 00:03:52,410 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:03:52,481 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:03:52,482 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 55 treesize of output 58 [2018-01-30 00:03:52,483 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-30 00:03:52,520 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:03:52,521 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:03:52,526 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 54 treesize of output 48 [2018-01-30 00:03:52,527 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-30 00:03:52,564 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 4 dim-1 vars, End of recursive call: 8 dim-0 vars, and 2 xjuncts. [2018-01-30 00:03:52,564 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 12 variables, input treesize:113, output treesize:95 [2018-01-30 00:03:52,852 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 213 proven. 85 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:03:52,874 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:03:52,874 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 32] total 54 [2018-01-30 00:03:52,875 INFO L409 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-01-30 00:03:52,875 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-01-30 00:03:52,876 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=223, Invalid=2744, Unknown=3, NotChecked=0, Total=2970 [2018-01-30 00:03:52,876 INFO L87 Difference]: Start difference. First operand 145 states and 151 transitions. Second operand 55 states. [2018-01-30 00:03:57,353 WARN L146 SmtUtils]: Spent 4125ms on a formula simplification. DAG size of input: 73 DAG size of output 70 [2018-01-30 00:03:57,635 WARN L146 SmtUtils]: Spent 119ms on a formula simplification. DAG size of input: 75 DAG size of output 68 [2018-01-30 00:03:59,869 WARN L146 SmtUtils]: Spent 2077ms on a formula simplification. DAG size of input: 61 DAG size of output 56 [2018-01-30 00:04:02,248 WARN L146 SmtUtils]: Spent 2112ms on a formula simplification. DAG size of input: 76 DAG size of output 65 [2018-01-30 00:04:02,578 WARN L146 SmtUtils]: Spent 127ms on a formula simplification. DAG size of input: 69 DAG size of output 64 [2018-01-30 00:04:06,751 WARN L146 SmtUtils]: Spent 4076ms on a formula simplification. DAG size of input: 70 DAG size of output 64 [2018-01-30 00:04:07,089 WARN L146 SmtUtils]: Spent 100ms on a formula simplification. DAG size of input: 82 DAG size of output 74 [2018-01-30 00:04:07,574 WARN L146 SmtUtils]: Spent 251ms on a formula simplification. DAG size of input: 71 DAG size of output 65 [2018-01-30 00:04:09,912 WARN L146 SmtUtils]: Spent 2095ms on a formula simplification. DAG size of input: 77 DAG size of output 71 [2018-01-30 00:04:13,133 WARN L146 SmtUtils]: Spent 2088ms on a formula simplification. DAG size of input: 76 DAG size of output 70 [2018-01-30 00:04:13,768 WARN L146 SmtUtils]: Spent 106ms on a formula simplification. DAG size of input: 77 DAG size of output 71 [2018-01-30 00:04:14,105 WARN L146 SmtUtils]: Spent 100ms on a formula simplification. DAG size of input: 68 DAG size of output 64 [2018-01-30 00:04:50,295 WARN L146 SmtUtils]: Spent 24433ms on a formula simplification. DAG size of input: 81 DAG size of output 78 [2018-01-30 00:05:11,008 WARN L146 SmtUtils]: Spent 20607ms on a formula simplification. DAG size of input: 85 DAG size of output 76 [2018-01-30 00:05:18,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:05:18,334 INFO L93 Difference]: Finished difference Result 256 states and 273 transitions. [2018-01-30 00:05:18,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-01-30 00:05:18,335 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 105 [2018-01-30 00:05:18,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:05:18,336 INFO L225 Difference]: With dead ends: 256 [2018-01-30 00:05:18,336 INFO L226 Difference]: Without dead ends: 255 [2018-01-30 00:05:18,338 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3371 ImplicationChecksByTransitivity, 76.9s TimeCoverageRelationStatistics Valid=1532, Invalid=11796, Unknown=12, NotChecked=0, Total=13340 [2018-01-30 00:05:18,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2018-01-30 00:05:18,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 150. [2018-01-30 00:05:18,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-01-30 00:05:18,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 159 transitions. [2018-01-30 00:05:18,356 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 159 transitions. Word has length 105 [2018-01-30 00:05:18,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:05:18,356 INFO L432 AbstractCegarLoop]: Abstraction has 150 states and 159 transitions. [2018-01-30 00:05:18,356 INFO L433 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-01-30 00:05:18,357 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 159 transitions. [2018-01-30 00:05:18,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-01-30 00:05:18,357 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:05:18,358 INFO L350 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1, 1] [2018-01-30 00:05:18,358 INFO L371 AbstractCegarLoop]: === Iteration 19 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-30 00:05:18,358 INFO L82 PathProgramCache]: Analyzing trace with hash 422192379, now seen corresponding path program 1 times [2018-01-30 00:05:18,358 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:05:18,358 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:05:18,359 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:05:18,359 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 00:05:18,359 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:05:18,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:05:18,377 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:05:18,428 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 295 trivial. 0 not checked. [2018-01-30 00:05:18,428 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:05:18,428 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 00:05:18,428 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 00:05:18,429 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 00:05:18,429 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 00:05:18,430 INFO L87 Difference]: Start difference. First operand 150 states and 159 transitions. Second operand 4 states. [2018-01-30 00:05:18,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:05:18,480 INFO L93 Difference]: Finished difference Result 188 states and 198 transitions. [2018-01-30 00:05:18,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-30 00:05:18,481 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 107 [2018-01-30 00:05:18,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:05:18,482 INFO L225 Difference]: With dead ends: 188 [2018-01-30 00:05:18,482 INFO L226 Difference]: Without dead ends: 163 [2018-01-30 00:05:18,482 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-30 00:05:18,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-01-30 00:05:18,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 156. [2018-01-30 00:05:18,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-01-30 00:05:18,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 165 transitions. [2018-01-30 00:05:18,506 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 165 transitions. Word has length 107 [2018-01-30 00:05:18,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:05:18,506 INFO L432 AbstractCegarLoop]: Abstraction has 156 states and 165 transitions. [2018-01-30 00:05:18,506 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 00:05:18,506 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 165 transitions. [2018-01-30 00:05:18,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-01-30 00:05:18,507 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:05:18,508 INFO L350 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:05:18,508 INFO L371 AbstractCegarLoop]: === Iteration 20 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-30 00:05:18,508 INFO L82 PathProgramCache]: Analyzing trace with hash 806275120, now seen corresponding path program 1 times [2018-01-30 00:05:18,508 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:05:18,508 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:05:18,509 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:05:18,509 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:05:18,509 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:05:18,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:05:18,531 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:05:18,791 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 293 trivial. 0 not checked. [2018-01-30 00:05:18,792 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:05:18,792 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 00:05:18,800 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:05:18,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:05:18,845 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:05:19,066 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 293 trivial. 0 not checked. [2018-01-30 00:05:19,099 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:05:19,099 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 12 [2018-01-30 00:05:19,100 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-30 00:05:19,100 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-30 00:05:19,100 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=122, Unknown=9, NotChecked=0, Total=156 [2018-01-30 00:05:19,100 INFO L87 Difference]: Start difference. First operand 156 states and 165 transitions. Second operand 13 states. [2018-01-30 00:05:19,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:05:19,519 INFO L93 Difference]: Finished difference Result 169 states and 177 transitions. [2018-01-30 00:05:19,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-30 00:05:19,519 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 115 [2018-01-30 00:05:19,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:05:19,521 INFO L225 Difference]: With dead ends: 169 [2018-01-30 00:05:19,521 INFO L226 Difference]: Without dead ends: 153 [2018-01-30 00:05:19,521 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 115 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=59, Invalid=274, Unknown=9, NotChecked=0, Total=342 [2018-01-30 00:05:19,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-01-30 00:05:19,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2018-01-30 00:05:19,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-01-30 00:05:19,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 161 transitions. [2018-01-30 00:05:19,544 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 161 transitions. Word has length 115 [2018-01-30 00:05:19,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:05:19,545 INFO L432 AbstractCegarLoop]: Abstraction has 153 states and 161 transitions. [2018-01-30 00:05:19,545 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-30 00:05:19,545 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 161 transitions. [2018-01-30 00:05:19,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-01-30 00:05:19,545 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:05:19,545 INFO L350 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:05:19,546 INFO L371 AbstractCegarLoop]: === Iteration 21 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-30 00:05:19,546 INFO L82 PathProgramCache]: Analyzing trace with hash 1246631654, now seen corresponding path program 1 times [2018-01-30 00:05:19,546 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:05:19,546 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:05:19,547 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:05:19,547 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:05:19,547 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:05:19,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:05:19,558 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:05:19,652 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 295 trivial. 0 not checked. [2018-01-30 00:05:19,653 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:05:19,653 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 00:05:19,653 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 00:05:19,653 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 00:05:19,653 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-30 00:05:19,653 INFO L87 Difference]: Start difference. First operand 153 states and 161 transitions. Second operand 6 states. [2018-01-30 00:05:19,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:05:19,800 INFO L93 Difference]: Finished difference Result 189 states and 198 transitions. [2018-01-30 00:05:19,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-30 00:05:19,801 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 116 [2018-01-30 00:05:19,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:05:19,802 INFO L225 Difference]: With dead ends: 189 [2018-01-30 00:05:19,802 INFO L226 Difference]: Without dead ends: 152 [2018-01-30 00:05:19,802 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-30 00:05:19,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-01-30 00:05:19,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 150. [2018-01-30 00:05:19,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-01-30 00:05:19,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 156 transitions. [2018-01-30 00:05:19,817 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 156 transitions. Word has length 116 [2018-01-30 00:05:19,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:05:19,817 INFO L432 AbstractCegarLoop]: Abstraction has 150 states and 156 transitions. [2018-01-30 00:05:19,817 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 00:05:19,817 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 156 transitions. [2018-01-30 00:05:19,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-01-30 00:05:19,818 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:05:19,818 INFO L350 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:05:19,818 INFO L371 AbstractCegarLoop]: === Iteration 22 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-30 00:05:19,818 INFO L82 PathProgramCache]: Analyzing trace with hash -309581918, now seen corresponding path program 1 times [2018-01-30 00:05:19,818 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:05:19,818 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:05:19,819 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:05:19,819 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:05:19,819 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:05:19,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:05:19,831 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:05:20,016 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 298 trivial. 0 not checked. [2018-01-30 00:05:20,017 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:05:20,017 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 00:05:20,029 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:05:20,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:05:20,072 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:05:20,328 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 298 trivial. 0 not checked. [2018-01-30 00:05:20,349 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:05:20,350 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2018-01-30 00:05:20,350 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-30 00:05:20,350 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-30 00:05:20,350 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-01-30 00:05:20,351 INFO L87 Difference]: Start difference. First operand 150 states and 156 transitions. Second operand 11 states. [2018-01-30 00:05:20,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:05:20,717 INFO L93 Difference]: Finished difference Result 199 states and 209 transitions. [2018-01-30 00:05:20,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 00:05:20,717 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 119 [2018-01-30 00:05:20,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:05:20,719 INFO L225 Difference]: With dead ends: 199 [2018-01-30 00:05:20,719 INFO L226 Difference]: Without dead ends: 189 [2018-01-30 00:05:20,719 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2018-01-30 00:05:20,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-01-30 00:05:20,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 155. [2018-01-30 00:05:20,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-01-30 00:05:20,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 161 transitions. [2018-01-30 00:05:20,744 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 161 transitions. Word has length 119 [2018-01-30 00:05:20,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:05:20,744 INFO L432 AbstractCegarLoop]: Abstraction has 155 states and 161 transitions. [2018-01-30 00:05:20,744 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-30 00:05:20,745 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 161 transitions. [2018-01-30 00:05:20,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-01-30 00:05:20,745 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:05:20,746 INFO L350 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1] [2018-01-30 00:05:20,746 INFO L371 AbstractCegarLoop]: === Iteration 23 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-30 00:05:20,746 INFO L82 PathProgramCache]: Analyzing trace with hash 2014250650, now seen corresponding path program 1 times [2018-01-30 00:05:20,746 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:05:20,746 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:05:20,747 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:05:20,747 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:05:20,747 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:05:20,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:05:20,769 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:05:21,421 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 10 proven. 135 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2018-01-30 00:05:21,421 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:05:21,421 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 00:05:21,426 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:05:21,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:05:21,466 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:05:21,470 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2018-01-30 00:05:21,471 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:05:21,473 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-01-30 00:05:21,473 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:05:21,493 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-01-30 00:05:21,493 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-30 00:05:21,505 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 19 treesize of output 18 [2018-01-30 00:05:21,505 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-30 00:05:21,516 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-30 00:05:21,516 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:44, output treesize:40 [2018-01-30 00:05:23,638 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:05:23,640 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:05:23,640 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 57 treesize of output 51 [2018-01-30 00:05:23,641 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:05:23,685 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:05:23,687 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 55 treesize of output 58 [2018-01-30 00:05:23,687 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:05:23,730 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:05:23,731 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:05:23,732 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 54 treesize of output 48 [2018-01-30 00:05:23,732 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-30 00:05:23,768 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:05:23,769 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 51 treesize of output 60 [2018-01-30 00:05:23,769 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-30 00:05:23,803 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 4 dim-1 vars, End of recursive call: 8 dim-0 vars, and 2 xjuncts. [2018-01-30 00:05:23,803 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 12 variables, input treesize:113, output treesize:95 [2018-01-30 00:05:26,324 WARN L143 SmtUtils]: Spent 2042ms on a formula simplification that was a NOOP. DAG size: 64 [2018-01-30 00:05:28,471 WARN L143 SmtUtils]: Spent 2042ms on a formula simplification that was a NOOP. DAG size: 64 [2018-01-30 00:05:28,568 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:05:28,569 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:05:28,606 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 71 treesize of output 65 [2018-01-30 00:05:28,606 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:05:28,709 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:05:28,711 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:05:28,712 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:05:28,719 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 65 treesize of output 92 [2018-01-30 00:05:28,720 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-30 00:05:28,877 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:05:28,878 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:05:28,878 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 67 [2018-01-30 00:05:28,878 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-30 00:05:29,002 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:05:29,003 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:05:29,004 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:05:29,006 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:05:29,012 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 69 treesize of output 100 [2018-01-30 00:05:29,013 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-01-30 00:05:29,193 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:05:29,201 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 2 case distinctions, treesize of input 71 treesize of output 78 [2018-01-30 00:05:29,201 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-01-30 00:05:29,408 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:05:29,409 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:05:29,415 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 67 treesize of output 90 [2018-01-30 00:05:29,415 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-01-30 00:05:29,661 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:05:29,661 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:05:29,662 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 62 treesize of output 56 [2018-01-30 00:05:29,662 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-01-30 00:05:29,665 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:05:29,665 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:05:29,666 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 64 [2018-01-30 00:05:29,666 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-30 00:05:29,893 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:05:29,894 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:05:29,894 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 62 treesize of output 56 [2018-01-30 00:05:29,895 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-01-30 00:05:29,897 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:05:29,897 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:05:29,898 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 68 treesize of output 62 [2018-01-30 00:05:29,898 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-01-30 00:05:30,118 INFO L267 ElimStorePlain]: Start of recursive call 1: 24 dim-0 vars, 8 dim-1 vars, End of recursive call: 40 dim-0 vars, and 8 xjuncts. [2018-01-30 00:05:30,118 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 32 variables, input treesize:285, output treesize:437 [2018-01-30 00:05:30,477 WARN L146 SmtUtils]: Spent 102ms on a formula simplification. DAG size of input: 240 DAG size of output 61 [2018-01-30 00:05:30,593 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 218 proven. 95 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-01-30 00:05:30,613 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:05:30,613 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 36] total 59 [2018-01-30 00:05:30,613 INFO L409 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-01-30 00:05:30,613 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-01-30 00:05:30,614 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=239, Invalid=3298, Unknown=3, NotChecked=0, Total=3540 [2018-01-30 00:05:30,614 INFO L87 Difference]: Start difference. First operand 155 states and 161 transitions. Second operand 60 states. [2018-01-30 00:05:33,184 WARN L146 SmtUtils]: Spent 2247ms on a formula simplification. DAG size of input: 74 DAG size of output 71 [2018-01-30 00:05:37,520 WARN L146 SmtUtils]: Spent 4156ms on a formula simplification. DAG size of input: 76 DAG size of output 69 [2018-01-30 00:05:40,183 WARN L146 SmtUtils]: Spent 2084ms on a formula simplification. DAG size of input: 78 DAG size of output 67 [2018-01-30 00:05:42,313 WARN L146 SmtUtils]: Spent 2077ms on a formula simplification. DAG size of input: 70 DAG size of output 65 [2018-01-30 00:05:42,670 WARN L146 SmtUtils]: Spent 118ms on a formula simplification. DAG size of input: 79 DAG size of output 70 [2018-01-30 00:05:45,138 WARN L146 SmtUtils]: Spent 2064ms on a formula simplification. DAG size of input: 69 DAG size of output 65 [2018-01-30 00:05:47,768 WARN L146 SmtUtils]: Spent 2068ms on a formula simplification. DAG size of input: 69 DAG size of output 65 [2018-01-30 00:05:51,642 WARN L146 SmtUtils]: Spent 2068ms on a formula simplification. DAG size of input: 69 DAG size of output 65 [2018-01-30 00:05:54,123 WARN L146 SmtUtils]: Spent 2072ms on a formula simplification. DAG size of input: 68 DAG size of output 65 [2018-01-30 00:05:56,661 WARN L146 SmtUtils]: Spent 2087ms on a formula simplification. DAG size of input: 78 DAG size of output 72 Received shutdown request... [2018-01-30 00:05:57,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-01-30 00:05:57,089 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-30 00:05:57,093 WARN L185 ceAbstractionStarter]: Timeout [2018-01-30 00:05:57,093 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.01 12:05:57 BoogieIcfgContainer [2018-01-30 00:05:57,093 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-30 00:05:57,094 INFO L168 Benchmark]: Toolchain (without parser) took 144671.50 ms. Allocated memory was 308.3 MB in the beginning and 572.0 MB in the end (delta: 263.7 MB). Free memory was 265.2 MB in the beginning and 362.4 MB in the end (delta: -97.2 MB). Peak memory consumption was 166.5 MB. Max. memory is 5.3 GB. [2018-01-30 00:05:57,095 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 308.3 MB. Free memory is still 272.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-30 00:05:57,095 INFO L168 Benchmark]: CACSL2BoogieTranslator took 222.38 ms. Allocated memory is still 308.3 MB. Free memory was 265.2 MB in the beginning and 252.2 MB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 5.3 GB. [2018-01-30 00:05:57,095 INFO L168 Benchmark]: Boogie Preprocessor took 36.77 ms. Allocated memory is still 308.3 MB. Free memory was 252.2 MB in the beginning and 250.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-30 00:05:57,096 INFO L168 Benchmark]: RCFGBuilder took 286.83 ms. Allocated memory is still 308.3 MB. Free memory was 250.2 MB in the beginning and 228.0 MB in the end (delta: 22.2 MB). Peak memory consumption was 22.2 MB. Max. memory is 5.3 GB. [2018-01-30 00:05:57,096 INFO L168 Benchmark]: TraceAbstraction took 144117.56 ms. Allocated memory was 308.3 MB in the beginning and 572.0 MB in the end (delta: 263.7 MB). Free memory was 227.0 MB in the beginning and 362.4 MB in the end (delta: -135.4 MB). Peak memory consumption was 128.3 MB. Max. memory is 5.3 GB. [2018-01-30 00:05:57,098 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.17 ms. Allocated memory is still 308.3 MB. Free memory is still 272.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 222.38 ms. Allocated memory is still 308.3 MB. Free memory was 265.2 MB in the beginning and 252.2 MB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 36.77 ms. Allocated memory is still 308.3 MB. Free memory was 252.2 MB in the beginning and 250.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 286.83 ms. Allocated memory is still 308.3 MB. Free memory was 250.2 MB in the beginning and 228.0 MB in the end (delta: 22.2 MB). Peak memory consumption was 22.2 MB. Max. memory is 5.3 GB. * TraceAbstraction took 144117.56 ms. Allocated memory was 308.3 MB in the beginning and 572.0 MB in the end (delta: 263.7 MB). Free memory was 227.0 MB in the beginning and 362.4 MB in the end (delta: -135.4 MB). Peak memory consumption was 128.3 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1451). Cancelled while BasicCegarLoop was constructing difference of abstraction (155states) and interpolant automaton (currently 45 states, 60 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 78. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1452). Cancelled while BasicCegarLoop was constructing difference of abstraction (155states) and interpolant automaton (currently 45 states, 60 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 78. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1451). Cancelled while BasicCegarLoop was constructing difference of abstraction (155states) and interpolant automaton (currently 45 states, 60 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 78. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1446). Cancelled while BasicCegarLoop was constructing difference of abstraction (155states) and interpolant automaton (currently 45 states, 60 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 78. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1446). Cancelled while BasicCegarLoop was constructing difference of abstraction (155states) and interpolant automaton (currently 45 states, 60 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 78. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1452). Cancelled while BasicCegarLoop was constructing difference of abstraction (155states) and interpolant automaton (currently 45 states, 60 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 78. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1451). Cancelled while BasicCegarLoop was constructing difference of abstraction (155states) and interpolant automaton (currently 45 states, 60 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 78. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1451). Cancelled while BasicCegarLoop was constructing difference of abstraction (155states) and interpolant automaton (currently 45 states, 60 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 78. - TimeoutResultAtElement [Line: 1471]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 1471). Cancelled while BasicCegarLoop was constructing difference of abstraction (155states) and interpolant automaton (currently 45 states, 60 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 78. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1463). Cancelled while BasicCegarLoop was constructing difference of abstraction (155states) and interpolant automaton (currently 45 states, 60 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 78. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1463). Cancelled while BasicCegarLoop was constructing difference of abstraction (155states) and interpolant automaton (currently 45 states, 60 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 78. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1467). Cancelled while BasicCegarLoop was constructing difference of abstraction (155states) and interpolant automaton (currently 45 states, 60 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 78. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1467). Cancelled while BasicCegarLoop was constructing difference of abstraction (155states) and interpolant automaton (currently 45 states, 60 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 78. - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 82 locations, 13 error locations. TIMEOUT Result, 144.0s OverallTime, 23 OverallIterations, 11 TraceHistogramMax, 120.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1728 SDtfs, 2056 SDslu, 14698 SDs, 0 SdLazy, 7226 SolverSat, 385 SolverUnsat, 31 SolverUnknown, 0 SolverNotchecked, 14.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1606 GetRequests, 936 SyntacticMatches, 9 SemanticMatches, 660 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 10029 ImplicationChecksByTransitivity, 122.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=156occurred in iteration=19, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 22 MinimizatonAttempts, 309 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 21.3s InterpolantComputationTime, 2686 NumberOfCodeBlocks, 2596 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 2650 ConstructedInterpolants, 222 QuantifiedInterpolants, 2475616 SizeOfPredicates, 163 NumberOfNonLiveVariables, 2603 ConjunctsInSsa, 320 ConjunctsInUnsatCore, 36 InterpolantComputations, 11 PerfectInterpolantSequences, 3065/4912 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_test17_3_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-30_00-05-57-104.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_3_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-30_00-05-57-104.csv Completed graceful shutdown