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.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test17_1_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 12:21:31,090 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 12:21:31,118 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 12:21:31,133 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 12:21:31,134 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 12:21:31,135 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 12:21:31,136 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 12:21:31,137 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 12:21:31,139 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 12:21:31,140 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 12:21:31,141 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 12:21:31,141 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 12:21:31,142 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 12:21:31,144 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 12:21:31,144 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 12:21:31,147 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 12:21:31,149 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 12:21:31,151 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 12:21:31,152 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 12:21:31,154 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 12:21:31,156 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 12:21:31,156 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 12:21:31,156 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 12:21:31,158 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 12:21:31,158 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 12:21:31,160 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 12:21:31,160 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 12:21:31,161 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 12:21:31,161 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 12:21:31,161 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 12:21:31,162 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 12:21:31,162 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.epf [2018-01-24 12:21:31,170 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 12:21:31,171 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 12:21:31,172 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 12:21:31,172 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 12:21:31,172 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 12:21:31,172 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 12:21:31,172 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 12:21:31,172 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 12:21:31,173 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 12:21:31,173 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 12:21:31,173 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 12:21:31,173 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 12:21:31,173 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 12:21:31,173 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 12:21:31,173 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 12:21:31,174 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 12:21:31,174 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 12:21:31,174 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 12:21:31,174 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 12:21:31,174 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 12:21:31,174 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 12:21:31,174 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 12:21:31,175 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 12:21:31,175 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 12:21:31,175 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 12:21:31,175 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 12:21:31,176 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 12:21:31,176 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 12:21:31,176 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-24 12:21:31,176 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 12:21:31,176 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 12:21:31,176 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 12:21:31,177 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 12:21:31,177 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 12:21:31,209 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 12:21:31,220 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 12:21:31,223 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 12:21:31,224 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 12:21:31,224 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 12:21:31,225 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test17_1_false-valid-memtrack.i [2018-01-24 12:21:31,405 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 12:21:31,411 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 12:21:31,412 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 12:21:31,412 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 12:21:31,417 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 12:21:31,418 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 12:21:31" (1/1) ... [2018-01-24 12:21:31,421 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2871eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:21:31, skipping insertion in model container [2018-01-24 12:21:31,421 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 12:21:31" (1/1) ... [2018-01-24 12:21:31,434 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 12:21:31,483 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 12:21:31,606 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 12:21:31,628 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 12:21:31,637 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:21:31 WrapperNode [2018-01-24 12:21:31,638 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 12:21:31,639 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 12:21:31,639 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 12:21:31,639 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 12:21:31,653 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:21:31" (1/1) ... [2018-01-24 12:21:31,653 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:21:31" (1/1) ... [2018-01-24 12:21:31,662 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:21:31" (1/1) ... [2018-01-24 12:21:31,662 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:21:31" (1/1) ... [2018-01-24 12:21:31,668 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:21:31" (1/1) ... [2018-01-24 12:21:31,673 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:21:31" (1/1) ... [2018-01-24 12:21:31,674 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:21:31" (1/1) ... [2018-01-24 12:21:31,677 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 12:21:31,677 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 12:21:31,677 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 12:21:31,678 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 12:21:31,679 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:21:31" (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-24 12:21:31,730 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 12:21:31,730 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 12:21:31,730 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-24 12:21:31,731 INFO L136 BoogieDeclarations]: Found implementation of procedure alloc_17 [2018-01-24 12:21:31,731 INFO L136 BoogieDeclarations]: Found implementation of procedure free_17 [2018-01-24 12:21:31,731 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-24 12:21:31,731 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 12:21:31,731 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-24 12:21:31,731 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-24 12:21:31,731 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 12:21:31,731 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 12:21:31,731 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 12:21:31,732 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-24 12:21:31,732 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-24 12:21:31,732 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 12:21:31,732 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-24 12:21:31,732 INFO L128 BoogieDeclarations]: Found specification of procedure alloc_17 [2018-01-24 12:21:31,732 INFO L128 BoogieDeclarations]: Found specification of procedure free_17 [2018-01-24 12:21:31,732 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-24 12:21:31,732 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 12:21:31,732 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 12:21:31,732 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 12:21:31,990 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 12:21:31,990 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 12:21:31 BoogieIcfgContainer [2018-01-24 12:21:31,990 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 12:21:31,991 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 12:21:31,991 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 12:21:31,993 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 12:21:31,993 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 12:21:31" (1/3) ... [2018-01-24 12:21:31,994 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35da08a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 12:21:31, skipping insertion in model container [2018-01-24 12:21:31,994 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:21:31" (2/3) ... [2018-01-24 12:21:31,995 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35da08a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 12:21:31, skipping insertion in model container [2018-01-24 12:21:31,995 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 12:21:31" (3/3) ... [2018-01-24 12:21:31,996 INFO L105 eAbstractionObserver]: Analyzing ICFG memleaks_test17_1_false-valid-memtrack.i [2018-01-24 12:21:32,003 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 12:21:32,011 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-01-24 12:21:32,058 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 12:21:32,058 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 12:21:32,059 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 12:21:32,059 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 12:21:32,059 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 12:21:32,059 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 12:21:32,059 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 12:21:32,059 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 12:21:32,060 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 12:21:32,078 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states. [2018-01-24 12:21:32,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-24 12:21:32,083 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:21:32,084 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:21:32,084 INFO L371 AbstractCegarLoop]: === Iteration 1 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-24 12:21:32,088 INFO L82 PathProgramCache]: Analyzing trace with hash 76531201, now seen corresponding path program 1 times [2018-01-24 12:21:32,090 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:21:32,091 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:21:32,139 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:21:32,139 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:21:32,139 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:21:32,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:21:32,196 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:21:32,278 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-24 12:21:32,281 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:21:32,281 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 12:21:32,283 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 12:21:32,380 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 12:21:32,380 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 12:21:32,383 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 3 states. [2018-01-24 12:21:32,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:21:32,591 INFO L93 Difference]: Finished difference Result 178 states and 218 transitions. [2018-01-24 12:21:32,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 12:21:32,593 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-01-24 12:21:32,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:21:32,609 INFO L225 Difference]: With dead ends: 178 [2018-01-24 12:21:32,609 INFO L226 Difference]: Without dead ends: 115 [2018-01-24 12:21:32,613 INFO L525 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-24 12:21:32,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-01-24 12:21:32,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 99. [2018-01-24 12:21:32,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-01-24 12:21:32,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 121 transitions. [2018-01-24 12:21:32,673 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 121 transitions. Word has length 17 [2018-01-24 12:21:32,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:21:32,673 INFO L432 AbstractCegarLoop]: Abstraction has 99 states and 121 transitions. [2018-01-24 12:21:32,673 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 12:21:32,673 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 121 transitions. [2018-01-24 12:21:32,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-24 12:21:32,675 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:21:32,675 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:21:32,675 INFO L371 AbstractCegarLoop]: === Iteration 2 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-24 12:21:32,676 INFO L82 PathProgramCache]: Analyzing trace with hash 76544328, now seen corresponding path program 1 times [2018-01-24 12:21:32,676 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:21:32,676 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:21:32,678 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:21:32,678 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:21:32,678 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:21:32,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:21:32,695 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:21:32,767 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-24 12:21:32,767 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:21:32,768 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 12:21:32,769 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 12:21:32,769 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 12:21:32,770 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 12:21:32,770 INFO L87 Difference]: Start difference. First operand 99 states and 121 transitions. Second operand 5 states. [2018-01-24 12:21:32,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:21:32,813 INFO L93 Difference]: Finished difference Result 176 states and 206 transitions. [2018-01-24 12:21:32,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 12:21:32,813 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-01-24 12:21:32,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:21:32,815 INFO L225 Difference]: With dead ends: 176 [2018-01-24 12:21:32,816 INFO L226 Difference]: Without dead ends: 92 [2018-01-24 12:21:32,817 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 12:21:32,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-01-24 12:21:32,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 72. [2018-01-24 12:21:32,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-01-24 12:21:32,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 79 transitions. [2018-01-24 12:21:32,828 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 79 transitions. Word has length 17 [2018-01-24 12:21:32,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:21:32,828 INFO L432 AbstractCegarLoop]: Abstraction has 72 states and 79 transitions. [2018-01-24 12:21:32,828 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 12:21:32,828 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 79 transitions. [2018-01-24 12:21:32,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 12:21:32,829 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:21:32,830 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:21:32,830 INFO L371 AbstractCegarLoop]: === Iteration 3 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-24 12:21:32,830 INFO L82 PathProgramCache]: Analyzing trace with hash 1178904547, now seen corresponding path program 1 times [2018-01-24 12:21:32,830 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:21:32,830 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:21:32,832 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:21:32,832 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:21:32,832 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:21:32,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:21:32,850 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:21:32,903 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-24 12:21:32,903 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:21:32,903 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 12:21:32,904 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 12:21:32,904 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 12:21:32,904 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 12:21:32,904 INFO L87 Difference]: Start difference. First operand 72 states and 79 transitions. Second operand 6 states. [2018-01-24 12:21:32,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:21:32,937 INFO L93 Difference]: Finished difference Result 76 states and 82 transitions. [2018-01-24 12:21:32,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 12:21:32,938 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-01-24 12:21:32,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:21:32,939 INFO L225 Difference]: With dead ends: 76 [2018-01-24 12:21:32,939 INFO L226 Difference]: Without dead ends: 72 [2018-01-24 12:21:32,940 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-24 12:21:32,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-01-24 12:21:32,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-01-24 12:21:32,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-01-24 12:21:32,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 78 transitions. [2018-01-24 12:21:32,949 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 78 transitions. Word has length 19 [2018-01-24 12:21:32,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:21:32,949 INFO L432 AbstractCegarLoop]: Abstraction has 72 states and 78 transitions. [2018-01-24 12:21:32,949 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 12:21:32,949 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 78 transitions. [2018-01-24 12:21:32,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 12:21:32,950 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:21:32,950 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:21:32,950 INFO L371 AbstractCegarLoop]: === Iteration 4 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-24 12:21:32,951 INFO L82 PathProgramCache]: Analyzing trace with hash 1178917674, now seen corresponding path program 1 times [2018-01-24 12:21:32,951 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:21:32,951 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:21:32,952 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:21:32,953 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:21:32,953 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:21:32,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:21:32,967 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:21:33,014 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-24 12:21:33,014 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:21:33,014 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 12:21:33,014 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 12:21:33,015 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 12:21:33,015 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 12:21:33,015 INFO L87 Difference]: Start difference. First operand 72 states and 78 transitions. Second operand 6 states. [2018-01-24 12:21:33,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:21:33,108 INFO L93 Difference]: Finished difference Result 72 states and 78 transitions. [2018-01-24 12:21:33,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 12:21:33,109 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-01-24 12:21:33,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:21:33,110 INFO L225 Difference]: With dead ends: 72 [2018-01-24 12:21:33,111 INFO L226 Difference]: Without dead ends: 71 [2018-01-24 12:21:33,111 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-24 12:21:33,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-01-24 12:21:33,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-01-24 12:21:33,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-01-24 12:21:33,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 77 transitions. [2018-01-24 12:21:33,119 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 77 transitions. Word has length 19 [2018-01-24 12:21:33,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:21:33,120 INFO L432 AbstractCegarLoop]: Abstraction has 71 states and 77 transitions. [2018-01-24 12:21:33,120 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 12:21:33,120 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 77 transitions. [2018-01-24 12:21:33,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 12:21:33,121 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:21:33,121 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:21:33,121 INFO L371 AbstractCegarLoop]: === Iteration 5 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-24 12:21:33,121 INFO L82 PathProgramCache]: Analyzing trace with hash 1178917675, now seen corresponding path program 1 times [2018-01-24 12:21:33,122 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:21:33,122 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:21:33,123 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:21:33,123 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:21:33,123 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:21:33,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:21:33,144 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:21:33,394 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-24 12:21:33,394 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:21:33,395 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 12:21:33,395 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 12:21:33,395 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 12:21:33,396 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-01-24 12:21:33,396 INFO L87 Difference]: Start difference. First operand 71 states and 77 transitions. Second operand 9 states. [2018-01-24 12:21:33,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:21:33,610 INFO L93 Difference]: Finished difference Result 132 states and 143 transitions. [2018-01-24 12:21:33,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 12:21:33,611 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2018-01-24 12:21:33,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:21:33,612 INFO L225 Difference]: With dead ends: 132 [2018-01-24 12:21:33,612 INFO L226 Difference]: Without dead ends: 75 [2018-01-24 12:21:33,613 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2018-01-24 12:21:33,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-01-24 12:21:33,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 74. [2018-01-24 12:21:33,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-01-24 12:21:33,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 80 transitions. [2018-01-24 12:21:33,621 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 80 transitions. Word has length 19 [2018-01-24 12:21:33,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:21:33,622 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 80 transitions. [2018-01-24 12:21:33,622 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 12:21:33,622 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 80 transitions. [2018-01-24 12:21:33,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-24 12:21:33,623 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:21:33,623 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:21:33,623 INFO L371 AbstractCegarLoop]: === Iteration 6 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-24 12:21:33,623 INFO L82 PathProgramCache]: Analyzing trace with hash -1797942142, now seen corresponding path program 1 times [2018-01-24 12:21:33,623 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:21:33,624 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:21:33,625 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:21:33,625 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:21:33,625 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:21:33,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:21:33,642 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:21:34,010 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-24 12:21:34,010 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:21:34,011 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-24 12:21:34,030 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:21:34,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:21:34,073 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:21:34,143 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-24 12:21:34,145 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:21:34,158 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-24 12:21:34,158 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:21:34,169 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:21:34,170 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-01-24 12:21:34,496 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-24 12:21:34,525 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:21:34,525 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2018-01-24 12:21:34,526 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-24 12:21:34,526 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-24 12:21:34,526 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2018-01-24 12:21:34,526 INFO L87 Difference]: Start difference. First operand 74 states and 80 transitions. Second operand 18 states. [2018-01-24 12:21:34,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:21:34,879 INFO L93 Difference]: Finished difference Result 136 states and 147 transitions. [2018-01-24 12:21:34,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 12:21:34,880 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 23 [2018-01-24 12:21:34,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:21:34,881 INFO L225 Difference]: With dead ends: 136 [2018-01-24 12:21:34,881 INFO L226 Difference]: Without dead ends: 79 [2018-01-24 12:21:34,882 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=91, Invalid=461, Unknown=0, NotChecked=0, Total=552 [2018-01-24 12:21:34,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-01-24 12:21:34,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 78. [2018-01-24 12:21:34,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-01-24 12:21:34,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 84 transitions. [2018-01-24 12:21:34,888 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 84 transitions. Word has length 23 [2018-01-24 12:21:34,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:21:34,889 INFO L432 AbstractCegarLoop]: Abstraction has 78 states and 84 transitions. [2018-01-24 12:21:34,889 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-01-24 12:21:34,889 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 84 transitions. [2018-01-24 12:21:34,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-24 12:21:34,890 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:21:34,890 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:21:34,890 INFO L371 AbstractCegarLoop]: === Iteration 7 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-24 12:21:34,890 INFO L82 PathProgramCache]: Analyzing trace with hash 1328269913, now seen corresponding path program 2 times [2018-01-24 12:21:34,890 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:21:34,890 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:21:34,892 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:21:34,892 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:21:34,892 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:21:34,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:21:34,908 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:21:35,352 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:21:35,352 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:21:35,352 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-24 12:21:35,358 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 12:21:35,371 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:21:35,375 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:21:35,376 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 12:21:35,378 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:21:35,397 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-24 12:21:35,397 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:21:35,416 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-24 12:21:35,417 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:21:35,427 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:21:35,428 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-01-24 12:21:35,711 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:21:35,731 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:21:35,731 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 20 [2018-01-24 12:21:35,732 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-24 12:21:35,732 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-24 12:21:35,732 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=360, Unknown=0, NotChecked=0, Total=420 [2018-01-24 12:21:35,732 INFO L87 Difference]: Start difference. First operand 78 states and 84 transitions. Second operand 21 states. [2018-01-24 12:21:36,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:21:36,145 INFO L93 Difference]: Finished difference Result 140 states and 151 transitions. [2018-01-24 12:21:36,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-24 12:21:36,146 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 27 [2018-01-24 12:21:36,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:21:36,146 INFO L225 Difference]: With dead ends: 140 [2018-01-24 12:21:36,147 INFO L226 Difference]: Without dead ends: 83 [2018-01-24 12:21:36,147 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=114, Invalid=642, Unknown=0, NotChecked=0, Total=756 [2018-01-24 12:21:36,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-01-24 12:21:36,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 82. [2018-01-24 12:21:36,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-01-24 12:21:36,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 88 transitions. [2018-01-24 12:21:36,155 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 88 transitions. Word has length 27 [2018-01-24 12:21:36,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:21:36,155 INFO L432 AbstractCegarLoop]: Abstraction has 82 states and 88 transitions. [2018-01-24 12:21:36,155 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-24 12:21:36,155 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 88 transitions. [2018-01-24 12:21:36,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-24 12:21:36,156 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:21:36,156 INFO L322 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:21:36,156 INFO L371 AbstractCegarLoop]: === Iteration 8 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-24 12:21:36,156 INFO L82 PathProgramCache]: Analyzing trace with hash -449495888, now seen corresponding path program 3 times [2018-01-24 12:21:36,156 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:21:36,156 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:21:36,157 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:21:36,157 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 12:21:36,157 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:21:36,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:21:36,173 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:21:36,565 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:21:36,565 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:21:36,566 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-24 12:21:36,574 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-24 12:21:36,587 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 12:21:36,594 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 12:21:36,595 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 12:21:36,597 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:21:36,627 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-24 12:21:36,628 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:21:36,645 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-24 12:21:36,645 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:21:36,662 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:21:36,662 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-01-24 12:21:39,079 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-01-24 12:21:39,099 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:21:39,099 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 22 [2018-01-24 12:21:39,100 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-01-24 12:21:39,100 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-01-24 12:21:39,100 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=452, Unknown=1, NotChecked=0, Total=506 [2018-01-24 12:21:39,100 INFO L87 Difference]: Start difference. First operand 82 states and 88 transitions. Second operand 23 states. [2018-01-24 12:21:40,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:21:40,034 INFO L93 Difference]: Finished difference Result 145 states and 158 transitions. [2018-01-24 12:21:40,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-24 12:21:40,035 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 31 [2018-01-24 12:21:40,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:21:40,035 INFO L225 Difference]: With dead ends: 145 [2018-01-24 12:21:40,035 INFO L226 Difference]: Without dead ends: 88 [2018-01-24 12:21:40,036 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=159, Invalid=896, Unknown=1, NotChecked=0, Total=1056 [2018-01-24 12:21:40,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-01-24 12:21:40,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2018-01-24 12:21:40,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-01-24 12:21:40,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 94 transitions. [2018-01-24 12:21:40,046 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 94 transitions. Word has length 31 [2018-01-24 12:21:40,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:21:40,046 INFO L432 AbstractCegarLoop]: Abstraction has 88 states and 94 transitions. [2018-01-24 12:21:40,047 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-01-24 12:21:40,047 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 94 transitions. [2018-01-24 12:21:40,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-01-24 12:21:40,048 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:21:40,048 INFO L322 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 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] [2018-01-24 12:21:40,049 INFO L371 AbstractCegarLoop]: === Iteration 9 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-24 12:21:40,049 INFO L82 PathProgramCache]: Analyzing trace with hash -1460685368, now seen corresponding path program 1 times [2018-01-24 12:21:40,049 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:21:40,049 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:21:40,050 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:21:40,051 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 12:21:40,051 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:21:40,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:21:40,066 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:21:40,147 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-01-24 12:21:40,147 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:21:40,148 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 12:21:40,148 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 12:21:40,148 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 12:21:40,148 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 12:21:40,148 INFO L87 Difference]: Start difference. First operand 88 states and 94 transitions. Second operand 5 states. [2018-01-24 12:21:40,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:21:40,168 INFO L93 Difference]: Finished difference Result 146 states and 157 transitions. [2018-01-24 12:21:40,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 12:21:40,169 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2018-01-24 12:21:40,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:21:40,170 INFO L225 Difference]: With dead ends: 146 [2018-01-24 12:21:40,170 INFO L226 Difference]: Without dead ends: 92 [2018-01-24 12:21:40,171 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 12:21:40,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-01-24 12:21:40,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 90. [2018-01-24 12:21:40,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-01-24 12:21:40,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 96 transitions. [2018-01-24 12:21:40,183 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 96 transitions. Word has length 50 [2018-01-24 12:21:40,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:21:40,184 INFO L432 AbstractCegarLoop]: Abstraction has 90 states and 96 transitions. [2018-01-24 12:21:40,184 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 12:21:40,184 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 96 transitions. [2018-01-24 12:21:40,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-01-24 12:21:40,185 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:21:40,186 INFO L322 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:21:40,186 INFO L371 AbstractCegarLoop]: === Iteration 10 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-24 12:21:40,186 INFO L82 PathProgramCache]: Analyzing trace with hash -76853919, now seen corresponding path program 1 times [2018-01-24 12:21:40,186 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:21:40,186 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:21:40,187 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:21:40,187 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:21:40,187 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:21:40,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:21:40,201 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:21:40,293 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-01-24 12:21:40,293 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:21:40,293 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 12:21:40,294 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 12:21:40,294 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 12:21:40,294 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 12:21:40,294 INFO L87 Difference]: Start difference. First operand 90 states and 96 transitions. Second operand 6 states. [2018-01-24 12:21:40,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:21:40,497 INFO L93 Difference]: Finished difference Result 133 states and 146 transitions. [2018-01-24 12:21:40,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 12:21:40,499 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 51 [2018-01-24 12:21:40,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:21:40,501 INFO L225 Difference]: With dead ends: 133 [2018-01-24 12:21:40,501 INFO L226 Difference]: Without dead ends: 132 [2018-01-24 12:21:40,501 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-01-24 12:21:40,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-01-24 12:21:40,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 114. [2018-01-24 12:21:40,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-01-24 12:21:40,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 128 transitions. [2018-01-24 12:21:40,512 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 128 transitions. Word has length 51 [2018-01-24 12:21:40,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:21:40,513 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 128 transitions. [2018-01-24 12:21:40,513 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 12:21:40,513 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 128 transitions. [2018-01-24 12:21:40,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-01-24 12:21:40,514 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:21:40,514 INFO L322 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:21:40,515 INFO L371 AbstractCegarLoop]: === Iteration 11 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-24 12:21:40,515 INFO L82 PathProgramCache]: Analyzing trace with hash -76853918, now seen corresponding path program 1 times [2018-01-24 12:21:40,515 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:21:40,515 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:21:40,516 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:21:40,516 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:21:40,516 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:21:40,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:21:40,532 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:21:40,696 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:21:40,697 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:21:40,697 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-24 12:21:40,721 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:21:40,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:21:40,748 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:21:40,874 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:21:40,908 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:21:40,908 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2018-01-24 12:21:40,908 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-24 12:21:40,909 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-24 12:21:40,909 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=120, Unknown=0, NotChecked=0, Total=210 [2018-01-24 12:21:40,909 INFO L87 Difference]: Start difference. First operand 114 states and 128 transitions. Second operand 15 states. [2018-01-24 12:21:40,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:21:40,963 INFO L93 Difference]: Finished difference Result 202 states and 229 transitions. [2018-01-24 12:21:40,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 12:21:40,963 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 51 [2018-01-24 12:21:40,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:21:40,964 INFO L225 Difference]: With dead ends: 202 [2018-01-24 12:21:40,964 INFO L226 Difference]: Without dead ends: 120 [2018-01-24 12:21:40,965 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=120, Unknown=0, NotChecked=0, Total=210 [2018-01-24 12:21:40,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-01-24 12:21:40,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 118. [2018-01-24 12:21:40,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-01-24 12:21:40,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 132 transitions. [2018-01-24 12:21:40,975 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 132 transitions. Word has length 51 [2018-01-24 12:21:40,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:21:40,975 INFO L432 AbstractCegarLoop]: Abstraction has 118 states and 132 transitions. [2018-01-24 12:21:40,975 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-24 12:21:40,976 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 132 transitions. [2018-01-24 12:21:40,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-01-24 12:21:40,976 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:21:40,977 INFO L322 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 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-24 12:21:40,977 INFO L371 AbstractCegarLoop]: === Iteration 12 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-24 12:21:40,977 INFO L82 PathProgramCache]: Analyzing trace with hash -1255609671, now seen corresponding path program 2 times [2018-01-24 12:21:40,977 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:21:40,977 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:21:40,978 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:21:40,978 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:21:40,978 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:21:40,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:21:40,991 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:21:41,124 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:21:41,124 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:21:41,124 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-24 12:21:41,133 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 12:21:41,149 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:21:41,151 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 12:21:41,153 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:21:41,184 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-01-24 12:21:41,204 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-24 12:21:41,204 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 12 [2018-01-24 12:21:41,205 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-24 12:21:41,205 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-24 12:21:41,205 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2018-01-24 12:21:41,205 INFO L87 Difference]: Start difference. First operand 118 states and 132 transitions. Second operand 12 states. [2018-01-24 12:21:41,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:21:41,363 INFO L93 Difference]: Finished difference Result 231 states and 260 transitions. [2018-01-24 12:21:41,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-24 12:21:41,364 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 55 [2018-01-24 12:21:41,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:21:41,365 INFO L225 Difference]: With dead ends: 231 [2018-01-24 12:21:41,365 INFO L226 Difference]: Without dead ends: 146 [2018-01-24 12:21:41,366 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=107, Invalid=235, Unknown=0, NotChecked=0, Total=342 [2018-01-24 12:21:41,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-01-24 12:21:41,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 121. [2018-01-24 12:21:41,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-01-24 12:21:41,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 134 transitions. [2018-01-24 12:21:41,375 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 134 transitions. Word has length 55 [2018-01-24 12:21:41,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:21:41,375 INFO L432 AbstractCegarLoop]: Abstraction has 121 states and 134 transitions. [2018-01-24 12:21:41,375 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-24 12:21:41,375 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 134 transitions. [2018-01-24 12:21:41,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-01-24 12:21:41,376 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:21:41,376 INFO L322 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:21:41,377 INFO L371 AbstractCegarLoop]: === Iteration 13 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-24 12:21:41,377 INFO L82 PathProgramCache]: Analyzing trace with hash 1616077308, now seen corresponding path program 1 times [2018-01-24 12:21:41,377 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:21:41,377 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:21:41,378 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:21:41,378 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 12:21:41,378 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:21:41,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:21:41,392 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:21:41,541 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-24 12:21:41,541 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:21:41,542 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-24 12:21:41,548 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:21:41,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:21:41,571 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:21:41,650 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 6 proven. 98 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:21:41,670 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:21:41,670 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2018-01-24 12:21:41,671 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-01-24 12:21:41,671 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-01-24 12:21:41,671 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=199, Unknown=0, NotChecked=0, Total=342 [2018-01-24 12:21:41,671 INFO L87 Difference]: Start difference. First operand 121 states and 134 transitions. Second operand 19 states. [2018-01-24 12:21:41,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:21:41,745 INFO L93 Difference]: Finished difference Result 208 states and 233 transitions. [2018-01-24 12:21:41,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-24 12:21:41,745 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 60 [2018-01-24 12:21:41,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:21:41,746 INFO L225 Difference]: With dead ends: 208 [2018-01-24 12:21:41,746 INFO L226 Difference]: Without dead ends: 127 [2018-01-24 12:21:41,747 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=143, Invalid=199, Unknown=0, NotChecked=0, Total=342 [2018-01-24 12:21:41,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-01-24 12:21:41,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 125. [2018-01-24 12:21:41,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-01-24 12:21:41,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 138 transitions. [2018-01-24 12:21:41,757 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 138 transitions. Word has length 60 [2018-01-24 12:21:41,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:21:41,758 INFO L432 AbstractCegarLoop]: Abstraction has 125 states and 138 transitions. [2018-01-24 12:21:41,758 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-01-24 12:21:41,758 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 138 transitions. [2018-01-24 12:21:41,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-01-24 12:21:41,759 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:21:41,759 INFO L322 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:21:41,759 INFO L371 AbstractCegarLoop]: === Iteration 14 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-24 12:21:41,759 INFO L82 PathProgramCache]: Analyzing trace with hash 1519113861, now seen corresponding path program 2 times [2018-01-24 12:21:41,759 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:21:41,759 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:21:41,760 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:21:41,760 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:21:41,760 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:21:41,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:21:41,775 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:21:41,982 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-24 12:21:41,982 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:21:41,982 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-24 12:21:41,989 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 12:21:42,001 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:21:42,013 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:21:42,018 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 12:21:42,022 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:21:42,108 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 6 proven. 128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:21:42,131 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:21:42,131 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2018-01-24 12:21:42,132 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-24 12:21:42,132 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-24 12:21:42,132 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=246, Unknown=0, NotChecked=0, Total=420 [2018-01-24 12:21:42,132 INFO L87 Difference]: Start difference. First operand 125 states and 138 transitions. Second operand 21 states. [2018-01-24 12:21:42,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:21:42,233 INFO L93 Difference]: Finished difference Result 212 states and 237 transitions. [2018-01-24 12:21:42,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-24 12:21:42,233 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 64 [2018-01-24 12:21:42,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:21:42,234 INFO L225 Difference]: With dead ends: 212 [2018-01-24 12:21:42,234 INFO L226 Difference]: Without dead ends: 131 [2018-01-24 12:21:42,235 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=174, Invalid=246, Unknown=0, NotChecked=0, Total=420 [2018-01-24 12:21:42,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-01-24 12:21:42,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 129. [2018-01-24 12:21:42,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-01-24 12:21:42,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 142 transitions. [2018-01-24 12:21:42,245 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 142 transitions. Word has length 64 [2018-01-24 12:21:42,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:21:42,245 INFO L432 AbstractCegarLoop]: Abstraction has 129 states and 142 transitions. [2018-01-24 12:21:42,245 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-24 12:21:42,245 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 142 transitions. [2018-01-24 12:21:42,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-01-24 12:21:42,246 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:21:42,246 INFO L322 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:21:42,246 INFO L371 AbstractCegarLoop]: === Iteration 15 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-24 12:21:42,247 INFO L82 PathProgramCache]: Analyzing trace with hash -487268722, now seen corresponding path program 3 times [2018-01-24 12:21:42,247 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:21:42,247 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:21:42,248 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:21:42,248 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 12:21:42,248 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:21:42,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:21:42,264 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:21:42,421 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 0 proven. 162 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-24 12:21:42,421 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:21:42,422 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-24 12:21:42,430 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-24 12:21:42,447 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 12:21:42,454 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 12:21:42,457 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 12:21:42,461 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:21:42,482 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-24 12:21:42,482 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:21:42,484 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-01-24 12:21:42,485 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:21:42,532 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2018-01-24 12:21:42,533 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 12:21:42,592 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-24 12:21:42,592 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:21:42,608 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:21:42,608 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46 [2018-01-24 12:21:42,793 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:21:42,798 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:21:42,801 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 35 treesize of output 29 [2018-01-24 12:21:42,801 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:21:42,824 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:21:42,824 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:21:42,825 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 37 treesize of output 31 [2018-01-24 12:21:42,825 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:21:42,851 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 29 treesize of output 28 [2018-01-24 12:21:42,851 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 12:21:42,871 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:21:42,872 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 31 treesize of output 40 [2018-01-24 12:21:42,872 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:21:42,892 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-01-24 12:21:42,892 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:73, output treesize:55 [2018-01-24 12:21:42,964 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2018-01-24 12:21:42,984 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:21:42,984 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 24 [2018-01-24 12:21:42,984 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-01-24 12:21:42,984 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-01-24 12:21:42,985 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=459, Unknown=1, NotChecked=0, Total=552 [2018-01-24 12:21:42,985 INFO L87 Difference]: Start difference. First operand 129 states and 142 transitions. Second operand 24 states. [2018-01-24 12:22:03,145 WARN L143 SmtUtils]: Spent 14161ms on a formula simplification that was a NOOP. DAG size: 52 [2018-01-24 12:22:25,621 WARN L146 SmtUtils]: Spent 22389ms on a formula simplification. DAG size of input: 56 DAG size of output 54 [2018-01-24 12:22:26,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:22:26,004 INFO L93 Difference]: Finished difference Result 283 states and 317 transitions. [2018-01-24 12:22:26,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-01-24 12:22:26,004 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 68 [2018-01-24 12:22:26,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:22:26,005 INFO L225 Difference]: With dead ends: 283 [2018-01-24 12:22:26,005 INFO L226 Difference]: Without dead ends: 202 [2018-01-24 12:22:26,006 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 349 ImplicationChecksByTransitivity, 37.5s TimeCoverageRelationStatistics Valid=332, Invalid=1646, Unknown=2, NotChecked=0, Total=1980 [2018-01-24 12:22:26,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-01-24 12:22:26,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 148. [2018-01-24 12:22:26,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-01-24 12:22:26,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 173 transitions. [2018-01-24 12:22:26,025 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 173 transitions. Word has length 68 [2018-01-24 12:22:26,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:22:26,026 INFO L432 AbstractCegarLoop]: Abstraction has 148 states and 173 transitions. [2018-01-24 12:22:26,026 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-01-24 12:22:26,026 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 173 transitions. [2018-01-24 12:22:26,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-01-24 12:22:26,027 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:22:26,027 INFO L322 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:22:26,027 INFO L371 AbstractCegarLoop]: === Iteration 16 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-24 12:22:26,027 INFO L82 PathProgramCache]: Analyzing trace with hash -2145863146, now seen corresponding path program 1 times [2018-01-24 12:22:26,027 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:22:26,027 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:22:26,029 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:22:26,029 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 12:22:26,029 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:22:26,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:22:26,050 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:22:26,263 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-01-24 12:22:26,264 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:22:26,290 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-24 12:22:26,298 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:22:26,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:22:26,336 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:22:26,340 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 12:22:26,340 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:22:26,341 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:22:26,342 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-24 12:22:26,388 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:22:26,389 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:22:26,390 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-01-24 12:22:26,390 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:22:26,397 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-24 12:22:26,397 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-01-24 12:22:26,430 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-01-24 12:22:26,464 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:22:26,464 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 12 [2018-01-24 12:22:26,465 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-24 12:22:26,465 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-24 12:22:26,465 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-01-24 12:22:26,465 INFO L87 Difference]: Start difference. First operand 148 states and 173 transitions. Second operand 13 states. [2018-01-24 12:22:26,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:22:26,926 INFO L93 Difference]: Finished difference Result 195 states and 229 transitions. [2018-01-24 12:22:26,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-24 12:22:26,926 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 72 [2018-01-24 12:22:26,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:22:26,928 INFO L225 Difference]: With dead ends: 195 [2018-01-24 12:22:26,928 INFO L226 Difference]: Without dead ends: 193 [2018-01-24 12:22:26,928 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 69 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=77, Invalid=343, Unknown=0, NotChecked=0, Total=420 [2018-01-24 12:22:26,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-01-24 12:22:26,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 134. [2018-01-24 12:22:26,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-01-24 12:22:26,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 148 transitions. [2018-01-24 12:22:26,951 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 148 transitions. Word has length 72 [2018-01-24 12:22:26,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:22:26,951 INFO L432 AbstractCegarLoop]: Abstraction has 134 states and 148 transitions. [2018-01-24 12:22:26,951 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-24 12:22:26,952 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 148 transitions. [2018-01-24 12:22:26,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-01-24 12:22:26,952 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:22:26,953 INFO L322 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 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] [2018-01-24 12:22:26,953 INFO L371 AbstractCegarLoop]: === Iteration 17 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-24 12:22:26,953 INFO L82 PathProgramCache]: Analyzing trace with hash 1300106032, now seen corresponding path program 1 times [2018-01-24 12:22:26,953 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:22:26,953 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:22:26,954 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:22:26,954 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:22:26,955 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:22:26,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:22:26,971 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:22:27,024 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2018-01-24 12:22:27,024 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:22:27,025 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 12:22:27,025 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 12:22:27,025 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 12:22:27,025 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 12:22:27,025 INFO L87 Difference]: Start difference. First operand 134 states and 148 transitions. Second operand 4 states. [2018-01-24 12:22:27,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:22:27,098 INFO L93 Difference]: Finished difference Result 181 states and 198 transitions. [2018-01-24 12:22:27,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 12:22:27,099 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2018-01-24 12:22:27,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:22:27,100 INFO L225 Difference]: With dead ends: 181 [2018-01-24 12:22:27,101 INFO L226 Difference]: Without dead ends: 143 [2018-01-24 12:22:27,101 INFO L525 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-24 12:22:27,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-01-24 12:22:27,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 137. [2018-01-24 12:22:27,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-01-24 12:22:27,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 150 transitions. [2018-01-24 12:22:27,128 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 150 transitions. Word has length 73 [2018-01-24 12:22:27,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:22:27,128 INFO L432 AbstractCegarLoop]: Abstraction has 137 states and 150 transitions. [2018-01-24 12:22:27,128 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 12:22:27,129 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 150 transitions. [2018-01-24 12:22:27,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-01-24 12:22:27,129 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:22:27,130 INFO L322 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 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] [2018-01-24 12:22:27,130 INFO L371 AbstractCegarLoop]: === Iteration 18 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-24 12:22:27,130 INFO L82 PathProgramCache]: Analyzing trace with hash -1928926345, now seen corresponding path program 1 times [2018-01-24 12:22:27,130 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:22:27,130 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:22:27,131 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:22:27,131 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:22:27,131 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:22:27,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:22:27,148 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:22:27,419 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 31 proven. 2 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2018-01-24 12:22:27,420 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:22:27,420 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-24 12:22:27,433 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:22:27,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:22:27,475 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:22:27,480 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 14 treesize of output 13 [2018-01-24 12:22:27,481 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:22:27,521 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-24 12:22:27,521 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:22:27,534 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-24 12:22:27,535 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:30 [2018-01-24 12:22:30,721 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 138 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:22:30,754 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:22:30,754 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 20] total 30 [2018-01-24 12:22:30,754 INFO L409 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-01-24 12:22:30,754 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-01-24 12:22:30,755 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=817, Unknown=1, NotChecked=0, Total=930 [2018-01-24 12:22:30,755 INFO L87 Difference]: Start difference. First operand 137 states and 150 transitions. Second operand 31 states. Received shutdown request... [2018-01-24 12:22:41,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-24 12:22:41,374 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-24 12:22:41,378 WARN L187 ceAbstractionStarter]: Timeout [2018-01-24 12:22:41,378 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 12:22:41 BoogieIcfgContainer [2018-01-24 12:22:41,378 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 12:22:41,379 INFO L168 Benchmark]: Toolchain (without parser) took 69972.36 ms. Allocated memory was 307.8 MB in the beginning and 586.2 MB in the end (delta: 278.4 MB). Free memory was 264.7 MB in the beginning and 427.0 MB in the end (delta: -162.3 MB). Peak memory consumption was 116.1 MB. Max. memory is 5.3 GB. [2018-01-24 12:22:41,380 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 307.8 MB. Free memory is still 273.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 12:22:41,380 INFO L168 Benchmark]: CACSL2BoogieTranslator took 226.51 ms. Allocated memory is still 307.8 MB. Free memory was 264.7 MB in the beginning and 250.8 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 5.3 GB. [2018-01-24 12:22:41,380 INFO L168 Benchmark]: Boogie Preprocessor took 38.38 ms. Allocated memory is still 307.8 MB. Free memory was 250.8 MB in the beginning and 249.8 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 5.3 GB. [2018-01-24 12:22:41,380 INFO L168 Benchmark]: RCFGBuilder took 313.20 ms. Allocated memory is still 307.8 MB. Free memory was 249.8 MB in the beginning and 226.6 MB in the end (delta: 23.1 MB). Peak memory consumption was 23.1 MB. Max. memory is 5.3 GB. [2018-01-24 12:22:41,381 INFO L168 Benchmark]: TraceAbstraction took 69386.80 ms. Allocated memory was 307.8 MB in the beginning and 586.2 MB in the end (delta: 278.4 MB). Free memory was 226.6 MB in the beginning and 427.0 MB in the end (delta: -200.3 MB). Peak memory consumption was 78.1 MB. Max. memory is 5.3 GB. [2018-01-24 12:22:41,382 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 307.8 MB. Free memory is still 273.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 226.51 ms. Allocated memory is still 307.8 MB. Free memory was 264.7 MB in the beginning and 250.8 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 38.38 ms. Allocated memory is still 307.8 MB. Free memory was 250.8 MB in the beginning and 249.8 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 5.3 GB. * RCFGBuilder took 313.20 ms. Allocated memory is still 307.8 MB. Free memory was 249.8 MB in the beginning and 226.6 MB in the end (delta: 23.1 MB). Peak memory consumption was 23.1 MB. Max. memory is 5.3 GB. * TraceAbstraction took 69386.80 ms. Allocated memory was 307.8 MB in the beginning and 586.2 MB in the end (delta: 278.4 MB). Free memory was 226.6 MB in the beginning and 427.0 MB in the end (delta: -200.3 MB). Peak memory consumption was 78.1 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 (137states) and interpolant automaton (currently 11 states, 31 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 39 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1452). Cancelled while BasicCegarLoop was constructing difference of abstraction (137states) and interpolant automaton (currently 11 states, 31 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 39 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1451). Cancelled while BasicCegarLoop was constructing difference of abstraction (137states) and interpolant automaton (currently 11 states, 31 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 39 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1446). Cancelled while BasicCegarLoop was constructing difference of abstraction (137states) and interpolant automaton (currently 11 states, 31 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 39 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1446). Cancelled while BasicCegarLoop was constructing difference of abstraction (137states) and interpolant automaton (currently 11 states, 31 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 39 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1452). Cancelled while BasicCegarLoop was constructing difference of abstraction (137states) and interpolant automaton (currently 11 states, 31 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 39 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1451). Cancelled while BasicCegarLoop was constructing difference of abstraction (137states) and interpolant automaton (currently 11 states, 31 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 39 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1451). Cancelled while BasicCegarLoop was constructing difference of abstraction (137states) and interpolant automaton (currently 11 states, 31 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 39 known predicates. - TimeoutResultAtElement [Line: 1477]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 1477). Cancelled while BasicCegarLoop was constructing difference of abstraction (137states) and interpolant automaton (currently 11 states, 31 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 39 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1460). Cancelled while BasicCegarLoop was constructing difference of abstraction (137states) and interpolant automaton (currently 11 states, 31 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 39 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1460). Cancelled while BasicCegarLoop was constructing difference of abstraction (137states) and interpolant automaton (currently 11 states, 31 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 39 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1460). Cancelled while BasicCegarLoop was constructing difference of abstraction (137states) and interpolant automaton (currently 11 states, 31 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 39 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1460). Cancelled while BasicCegarLoop was constructing difference of abstraction (137states) and interpolant automaton (currently 11 states, 31 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 39 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1470). Cancelled while BasicCegarLoop was constructing difference of abstraction (137states) and interpolant automaton (currently 11 states, 31 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 39 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1470). Cancelled while BasicCegarLoop was constructing difference of abstraction (137states) and interpolant automaton (currently 11 states, 31 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 39 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 73 locations, 15 error locations. TIMEOUT Result, 69.3s OverallTime, 18 OverallIterations, 11 TraceHistogramMax, 57.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1173 SDtfs, 1056 SDslu, 7379 SDs, 0 SdLazy, 3351 SolverSat, 246 SolverUnsat, 19 SolverUnknown, 0 SolverNotchecked, 15.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 764 GetRequests, 474 SyntacticMatches, 6 SemanticMatches, 283 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1316 ImplicationChecksByTransitivity, 49.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=148occurred in iteration=15, 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, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 17 MinimizatonAttempts, 209 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 10.6s InterpolantComputationTime, 1329 NumberOfCodeBlocks, 1261 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 1301 ConstructedInterpolants, 89 QuantifiedInterpolants, 547121 SizeOfPredicates, 40 NumberOfNonLiveVariables, 1614 ConjunctsInSsa, 211 ConjunctsInUnsatCore, 28 InterpolantComputations, 9 PerfectInterpolantSequences, 1338/2252 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: 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_1_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_12-22-41-388.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_1_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_12-22-41-388.csv Completed graceful shutdown