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_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 12:27:17,540 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 12:27:17,542 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 12:27:17,555 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 12:27:17,556 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 12:27:17,557 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 12:27:17,558 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 12:27:17,559 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 12:27:17,562 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 12:27:17,563 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 12:27:17,564 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 12:27:17,564 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 12:27:17,565 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 12:27:17,566 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 12:27:17,567 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 12:27:17,570 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 12:27:17,572 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 12:27:17,575 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 12:27:17,576 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 12:27:17,577 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 12:27:17,583 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 12:27:17,583 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 12:27:17,583 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 12:27:17,584 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 12:27:17,585 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 12:27:17,587 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 12:27:17,587 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 12:27:17,588 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 12:27:17,588 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 12:27:17,588 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 12:27:17,589 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 12:27:17,589 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:27:17,599 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 12:27:17,600 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 12:27:17,600 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 12:27:17,601 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 12:27:17,601 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 12:27:17,601 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 12:27:17,601 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 12:27:17,602 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 12:27:17,602 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 12:27:17,602 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 12:27:17,603 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 12:27:17,603 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 12:27:17,603 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 12:27:17,603 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 12:27:17,603 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 12:27:17,604 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 12:27:17,604 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 12:27:17,604 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 12:27:17,604 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 12:27:17,604 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 12:27:17,605 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 12:27:17,605 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 12:27:17,605 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 12:27:17,605 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 12:27:17,605 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 12:27:17,606 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 12:27:17,606 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 12:27:17,606 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 12:27:17,606 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-24 12:27:17,606 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 12:27:17,607 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 12:27:17,607 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 12:27:17,608 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 12:27:17,608 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 12:27:17,643 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 12:27:17,657 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 12:27:17,662 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 12:27:17,664 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 12:27:17,664 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 12:27:17,665 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test17_1_true-valid-memsafety_true-termination.i [2018-01-24 12:27:17,876 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 12:27:17,882 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 12:27:17,882 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 12:27:17,882 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 12:27:17,887 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 12:27:17,888 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 12:27:17" (1/1) ... [2018-01-24 12:27:17,890 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19a251b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:27:17, skipping insertion in model container [2018-01-24 12:27:17,890 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 12:27:17" (1/1) ... [2018-01-24 12:27:17,903 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 12:27:17,954 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 12:27:18,067 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 12:27:18,088 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 12:27:18,096 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:27:18 WrapperNode [2018-01-24 12:27:18,096 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 12:27:18,096 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 12:27:18,097 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 12:27:18,097 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 12:27:18,108 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:27:18" (1/1) ... [2018-01-24 12:27:18,109 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:27:18" (1/1) ... [2018-01-24 12:27:18,119 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:27:18" (1/1) ... [2018-01-24 12:27:18,119 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:27:18" (1/1) ... [2018-01-24 12:27:18,123 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:27:18" (1/1) ... [2018-01-24 12:27:18,126 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:27:18" (1/1) ... [2018-01-24 12:27:18,127 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:27:18" (1/1) ... [2018-01-24 12:27:18,129 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 12:27:18,130 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 12:27:18,130 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 12:27:18,130 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 12:27:18,131 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:27:18" (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:27:18,177 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 12:27:18,178 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 12:27:18,178 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-24 12:27:18,178 INFO L136 BoogieDeclarations]: Found implementation of procedure alloc_17 [2018-01-24 12:27:18,178 INFO L136 BoogieDeclarations]: Found implementation of procedure free_17 [2018-01-24 12:27:18,178 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-24 12:27:18,178 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 12:27:18,178 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-24 12:27:18,178 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-24 12:27:18,178 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 12:27:18,179 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 12:27:18,179 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 12:27:18,179 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-24 12:27:18,179 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-24 12:27:18,179 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 12:27:18,179 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-24 12:27:18,179 INFO L128 BoogieDeclarations]: Found specification of procedure alloc_17 [2018-01-24 12:27:18,179 INFO L128 BoogieDeclarations]: Found specification of procedure free_17 [2018-01-24 12:27:18,179 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-24 12:27:18,180 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 12:27:18,180 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 12:27:18,180 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 12:27:18,458 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 12:27:18,459 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 12:27:18 BoogieIcfgContainer [2018-01-24 12:27:18,459 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 12:27:18,460 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 12:27:18,460 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 12:27:18,461 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 12:27:18,462 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 12:27:17" (1/3) ... [2018-01-24 12:27:18,463 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d3387b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 12:27:18, skipping insertion in model container [2018-01-24 12:27:18,463 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:27:18" (2/3) ... [2018-01-24 12:27:18,463 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d3387b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 12:27:18, skipping insertion in model container [2018-01-24 12:27:18,463 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 12:27:18" (3/3) ... [2018-01-24 12:27:18,465 INFO L105 eAbstractionObserver]: Analyzing ICFG memleaks_test17_1_true-valid-memsafety_true-termination.i [2018-01-24 12:27:18,474 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 12:27:18,483 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 17 error locations. [2018-01-24 12:27:18,531 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 12:27:18,532 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 12:27:18,532 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 12:27:18,532 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 12:27:18,532 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 12:27:18,532 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 12:27:18,532 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 12:27:18,533 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 12:27:18,534 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 12:27:18,555 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states. [2018-01-24 12:27:18,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-24 12:27:18,563 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:27:18,564 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:27:18,564 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, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 12:27:18,569 INFO L82 PathProgramCache]: Analyzing trace with hash -1640721602, now seen corresponding path program 1 times [2018-01-24 12:27:18,571 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:27:18,572 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:27:18,639 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:27:18,639 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:27:18,640 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:27:18,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:27:18,705 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:27:18,884 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:27:18,886 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:27:18,887 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 12:27:18,888 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 12:27:18,966 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 12:27:18,967 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 12:27:18,969 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 5 states. [2018-01-24 12:27:19,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:27:19,032 INFO L93 Difference]: Finished difference Result 148 states and 172 transitions. [2018-01-24 12:27:19,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 12:27:19,034 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-01-24 12:27:19,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:27:19,046 INFO L225 Difference]: With dead ends: 148 [2018-01-24 12:27:19,047 INFO L226 Difference]: Without dead ends: 79 [2018-01-24 12:27:19,051 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:27:19,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-01-24 12:27:19,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 77. [2018-01-24 12:27:19,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-01-24 12:27:19,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 85 transitions. [2018-01-24 12:27:19,097 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 85 transitions. Word has length 17 [2018-01-24 12:27:19,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:27:19,097 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 85 transitions. [2018-01-24 12:27:19,098 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 12:27:19,098 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 85 transitions. [2018-01-24 12:27:19,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-24 12:27:19,099 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:27:19,099 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:27:19,099 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, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 12:27:19,100 INFO L82 PathProgramCache]: Analyzing trace with hash -1639954210, now seen corresponding path program 1 times [2018-01-24 12:27:19,100 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:27:19,100 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:27:19,102 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:27:19,102 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:27:19,102 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:27:19,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:27:19,118 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:27:19,156 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:27:19,156 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:27:19,157 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 12:27:19,158 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 12:27:19,159 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 12:27:19,159 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 12:27:19,159 INFO L87 Difference]: Start difference. First operand 77 states and 85 transitions. Second operand 3 states. [2018-01-24 12:27:19,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:27:19,284 INFO L93 Difference]: Finished difference Result 113 states and 126 transitions. [2018-01-24 12:27:19,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 12:27:19,285 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-01-24 12:27:19,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:27:19,287 INFO L225 Difference]: With dead ends: 113 [2018-01-24 12:27:19,287 INFO L226 Difference]: Without dead ends: 107 [2018-01-24 12:27:19,288 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:27:19,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-01-24 12:27:19,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 75. [2018-01-24 12:27:19,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-01-24 12:27:19,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 82 transitions. [2018-01-24 12:27:19,300 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 82 transitions. Word has length 17 [2018-01-24 12:27:19,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:27:19,300 INFO L432 AbstractCegarLoop]: Abstraction has 75 states and 82 transitions. [2018-01-24 12:27:19,301 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 12:27:19,301 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 82 transitions. [2018-01-24 12:27:19,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 12:27:19,302 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:27:19,302 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:27:19,302 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, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 12:27:19,302 INFO L82 PathProgramCache]: Analyzing trace with hash 202381920, now seen corresponding path program 1 times [2018-01-24 12:27:19,302 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:27:19,303 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:27:19,304 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:27:19,304 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:27:19,304 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:27:19,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:27:19,323 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:27:19,433 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:27:19,433 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:27:19,434 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 12:27:19,434 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 12:27:19,434 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 12:27:19,435 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 12:27:19,435 INFO L87 Difference]: Start difference. First operand 75 states and 82 transitions. Second operand 6 states. [2018-01-24 12:27:19,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:27:19,582 INFO L93 Difference]: Finished difference Result 77 states and 84 transitions. [2018-01-24 12:27:19,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 12:27:19,583 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-01-24 12:27:19,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:27:19,584 INFO L225 Difference]: With dead ends: 77 [2018-01-24 12:27:19,585 INFO L226 Difference]: Without dead ends: 76 [2018-01-24 12:27:19,585 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:27:19,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-01-24 12:27:19,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2018-01-24 12:27:19,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-01-24 12:27:19,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 81 transitions. [2018-01-24 12:27:19,595 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 81 transitions. Word has length 19 [2018-01-24 12:27:19,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:27:19,595 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 81 transitions. [2018-01-24 12:27:19,595 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 12:27:19,596 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 81 transitions. [2018-01-24 12:27:19,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 12:27:19,596 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:27:19,597 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:27:19,597 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, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 12:27:19,597 INFO L82 PathProgramCache]: Analyzing trace with hash 202381921, now seen corresponding path program 1 times [2018-01-24 12:27:19,597 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:27:19,597 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:27:19,599 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:27:19,599 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:27:19,599 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:27:19,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:27:19,619 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:27:19,958 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:27:19,958 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:27:19,959 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 12:27:19,959 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 12:27:19,959 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 12:27:19,960 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-01-24 12:27:19,960 INFO L87 Difference]: Start difference. First operand 74 states and 81 transitions. Second operand 9 states. [2018-01-24 12:27:20,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:27:20,283 INFO L93 Difference]: Finished difference Result 140 states and 152 transitions. [2018-01-24 12:27:20,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 12:27:20,284 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2018-01-24 12:27:20,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:27:20,286 INFO L225 Difference]: With dead ends: 140 [2018-01-24 12:27:20,286 INFO L226 Difference]: Without dead ends: 80 [2018-01-24 12:27:20,287 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2018-01-24 12:27:20,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-01-24 12:27:20,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 77. [2018-01-24 12:27:20,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-01-24 12:27:20,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 84 transitions. [2018-01-24 12:27:20,298 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 84 transitions. Word has length 19 [2018-01-24 12:27:20,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:27:20,298 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 84 transitions. [2018-01-24 12:27:20,299 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 12:27:20,299 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 84 transitions. [2018-01-24 12:27:20,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 12:27:20,299 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:27:20,300 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:27:20,300 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, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 12:27:20,300 INFO L82 PathProgramCache]: Analyzing trace with hash 203149312, now seen corresponding path program 1 times [2018-01-24 12:27:20,300 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:27:20,300 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:27:20,301 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:27:20,302 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:27:20,302 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:27:20,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:27:20,316 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:27:20,369 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:27:20,370 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:27:20,370 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 12:27:20,370 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 12:27:20,371 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 12:27:20,371 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 12:27:20,371 INFO L87 Difference]: Start difference. First operand 77 states and 84 transitions. Second operand 6 states. [2018-01-24 12:27:20,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:27:20,455 INFO L93 Difference]: Finished difference Result 81 states and 87 transitions. [2018-01-24 12:27:20,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 12:27:20,458 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-01-24 12:27:20,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:27:20,459 INFO L225 Difference]: With dead ends: 81 [2018-01-24 12:27:20,460 INFO L226 Difference]: Without dead ends: 77 [2018-01-24 12:27:20,460 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:27:20,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-01-24 12:27:20,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-01-24 12:27:20,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-01-24 12:27:20,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 83 transitions. [2018-01-24 12:27:20,470 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 83 transitions. Word has length 19 [2018-01-24 12:27:20,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:27:20,470 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 83 transitions. [2018-01-24 12:27:20,470 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 12:27:20,470 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 83 transitions. [2018-01-24 12:27:20,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-24 12:27:20,471 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:27:20,471 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:27:20,471 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, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 12:27:20,472 INFO L82 PathProgramCache]: Analyzing trace with hash -136195976, now seen corresponding path program 1 times [2018-01-24 12:27:20,472 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:27:20,472 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:27:20,473 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:27:20,473 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:27:20,474 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:27:20,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:27:20,492 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:27:20,728 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:27:20,728 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:27:20,728 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:27:20,737 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:27:20,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:27:20,779 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:27:20,826 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:27:20,828 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:27:20,871 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:27:20,871 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:27:20,882 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:27:20,882 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-01-24 12:27:21,220 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:27:21,255 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:27:21,261 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2018-01-24 12:27:21,261 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-24 12:27:21,262 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-24 12:27:21,262 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2018-01-24 12:27:21,262 INFO L87 Difference]: Start difference. First operand 77 states and 83 transitions. Second operand 18 states. [2018-01-24 12:27:21,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:27:21,604 INFO L93 Difference]: Finished difference Result 142 states and 153 transitions. [2018-01-24 12:27:21,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 12:27:21,604 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 23 [2018-01-24 12:27:21,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:27:21,605 INFO L225 Difference]: With dead ends: 142 [2018-01-24 12:27:21,605 INFO L226 Difference]: Without dead ends: 82 [2018-01-24 12:27:21,606 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=91, Invalid=461, Unknown=0, NotChecked=0, Total=552 [2018-01-24 12:27:21,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-01-24 12:27:21,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2018-01-24 12:27:21,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-01-24 12:27:21,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 87 transitions. [2018-01-24 12:27:21,613 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 87 transitions. Word has length 23 [2018-01-24 12:27:21,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:27:21,614 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 87 transitions. [2018-01-24 12:27:21,614 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-01-24 12:27:21,614 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 87 transitions. [2018-01-24 12:27:21,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-24 12:27:21,615 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:27:21,615 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:27:21,615 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, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 12:27:21,615 INFO L82 PathProgramCache]: Analyzing trace with hash -1725127921, now seen corresponding path program 2 times [2018-01-24 12:27:21,615 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:27:21,615 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:27:21,616 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:27:21,616 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:27:21,616 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:27:21,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:27:21,635 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:27:21,881 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:27:21,881 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:27:21,881 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:27:21,887 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 12:27:21,900 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:27:21,904 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:27:21,906 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 12:27:21,909 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:27:21,934 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:27:21,935 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:27:21,959 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:27:21,960 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:27:21,972 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:27:21,972 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-01-24 12:27:22,165 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:27:22,185 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:27:22,185 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 22 [2018-01-24 12:27:22,186 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-01-24 12:27:22,186 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-01-24 12:27:22,186 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=416, Unknown=0, NotChecked=0, Total=506 [2018-01-24 12:27:22,186 INFO L87 Difference]: Start difference. First operand 81 states and 87 transitions. Second operand 23 states. [2018-01-24 12:27:22,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:27:22,576 INFO L93 Difference]: Finished difference Result 82 states and 88 transitions. [2018-01-24 12:27:22,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-24 12:27:22,576 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 27 [2018-01-24 12:27:22,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:27:22,577 INFO L225 Difference]: With dead ends: 82 [2018-01-24 12:27:22,578 INFO L226 Difference]: Without dead ends: 81 [2018-01-24 12:27:22,578 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=134, Invalid=568, Unknown=0, NotChecked=0, Total=702 [2018-01-24 12:27:22,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-01-24 12:27:22,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79. [2018-01-24 12:27:22,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-01-24 12:27:22,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 85 transitions. [2018-01-24 12:27:22,585 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 85 transitions. Word has length 27 [2018-01-24 12:27:22,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:27:22,586 INFO L432 AbstractCegarLoop]: Abstraction has 79 states and 85 transitions. [2018-01-24 12:27:22,586 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-01-24 12:27:22,586 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 85 transitions. [2018-01-24 12:27:22,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-24 12:27:22,587 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:27:22,587 INFO L322 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:27:22,587 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, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 12:27:22,588 INFO L82 PathProgramCache]: Analyzing trace with hash 1811355495, now seen corresponding path program 1 times [2018-01-24 12:27:22,588 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:27:22,588 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:27:22,589 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:27:22,589 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 12:27:22,589 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:27:22,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:27:22,604 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:27:22,676 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-01-24 12:27:22,677 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:27:22,677 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 12:27:22,677 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 12:27:22,677 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 12:27:22,678 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 12:27:22,678 INFO L87 Difference]: Start difference. First operand 79 states and 85 transitions. Second operand 5 states. [2018-01-24 12:27:22,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:27:22,708 INFO L93 Difference]: Finished difference Result 140 states and 151 transitions. [2018-01-24 12:27:22,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 12:27:22,708 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2018-01-24 12:27:22,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:27:22,710 INFO L225 Difference]: With dead ends: 140 [2018-01-24 12:27:22,710 INFO L226 Difference]: Without dead ends: 83 [2018-01-24 12:27:22,711 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:27:22,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-01-24 12:27:22,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 81. [2018-01-24 12:27:22,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-01-24 12:27:22,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 87 transitions. [2018-01-24 12:27:22,720 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 87 transitions. Word has length 38 [2018-01-24 12:27:22,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:27:22,721 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 87 transitions. [2018-01-24 12:27:22,721 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 12:27:22,721 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 87 transitions. [2018-01-24 12:27:22,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-01-24 12:27:22,723 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:27:22,723 INFO L322 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:27:22,723 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, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 12:27:22,723 INFO L82 PathProgramCache]: Analyzing trace with hash -1161542589, now seen corresponding path program 1 times [2018-01-24 12:27:22,724 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:27:22,724 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:27:22,725 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:27:22,725 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:27:22,726 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:27:22,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:27:22,741 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:27:22,812 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-24 12:27:22,812 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:27:22,812 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 12:27:22,813 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 12:27:22,813 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 12:27:22,813 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 12:27:22,813 INFO L87 Difference]: Start difference. First operand 81 states and 87 transitions. Second operand 6 states. [2018-01-24 12:27:23,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:27:23,013 INFO L93 Difference]: Finished difference Result 125 states and 138 transitions. [2018-01-24 12:27:23,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 12:27:23,013 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2018-01-24 12:27:23,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:27:23,014 INFO L225 Difference]: With dead ends: 125 [2018-01-24 12:27:23,014 INFO L226 Difference]: Without dead ends: 123 [2018-01-24 12:27:23,015 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:27:23,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-01-24 12:27:23,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 106. [2018-01-24 12:27:23,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-01-24 12:27:23,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 121 transitions. [2018-01-24 12:27:23,023 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 121 transitions. Word has length 39 [2018-01-24 12:27:23,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:27:23,023 INFO L432 AbstractCegarLoop]: Abstraction has 106 states and 121 transitions. [2018-01-24 12:27:23,023 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 12:27:23,023 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 121 transitions. [2018-01-24 12:27:23,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-01-24 12:27:23,024 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:27:23,024 INFO L322 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:27:23,024 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, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 12:27:23,025 INFO L82 PathProgramCache]: Analyzing trace with hash -1161542588, now seen corresponding path program 1 times [2018-01-24 12:27:23,025 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:27:23,025 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:27:23,026 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:27:23,026 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:27:23,026 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:27:23,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:27:23,039 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:27:23,129 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:27:23,129 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:27:23,129 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:27:23,135 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:27:23,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:27:23,158 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:27:23,198 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:27:23,220 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:27:23,220 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-01-24 12:27:23,220 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 12:27:23,221 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 12:27:23,221 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2018-01-24 12:27:23,221 INFO L87 Difference]: Start difference. First operand 106 states and 121 transitions. Second operand 9 states. [2018-01-24 12:27:23,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:27:23,276 INFO L93 Difference]: Finished difference Result 198 states and 227 transitions. [2018-01-24 12:27:23,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 12:27:23,276 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 39 [2018-01-24 12:27:23,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:27:23,278 INFO L225 Difference]: With dead ends: 198 [2018-01-24 12:27:23,278 INFO L226 Difference]: Without dead ends: 112 [2018-01-24 12:27:23,279 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2018-01-24 12:27:23,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-01-24 12:27:23,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 110. [2018-01-24 12:27:23,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-01-24 12:27:23,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 125 transitions. [2018-01-24 12:27:23,290 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 125 transitions. Word has length 39 [2018-01-24 12:27:23,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:27:23,290 INFO L432 AbstractCegarLoop]: Abstraction has 110 states and 125 transitions. [2018-01-24 12:27:23,290 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 12:27:23,290 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 125 transitions. [2018-01-24 12:27:23,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-01-24 12:27:23,291 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:27:23,291 INFO L322 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:27:23,291 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, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 12:27:23,292 INFO L82 PathProgramCache]: Analyzing trace with hash 1952254171, now seen corresponding path program 2 times [2018-01-24 12:27:23,292 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:27:23,292 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:27:23,293 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:27:23,293 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:27:23,293 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:27:23,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:27:23,307 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:27:23,401 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:27:23,402 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:27:23,402 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:27:23,410 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 12:27:23,425 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:27:23,426 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 12:27:23,429 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:27:23,448 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-01-24 12:27:23,468 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-24 12:27:23,468 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2018-01-24 12:27:23,468 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 12:27:23,468 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 12:27:23,468 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-01-24 12:27:23,469 INFO L87 Difference]: Start difference. First operand 110 states and 125 transitions. Second operand 9 states. [2018-01-24 12:27:23,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:27:23,579 INFO L93 Difference]: Finished difference Result 227 states and 258 transitions. [2018-01-24 12:27:23,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 12:27:23,579 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 43 [2018-01-24 12:27:23,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:27:23,581 INFO L225 Difference]: With dead ends: 227 [2018-01-24 12:27:23,581 INFO L226 Difference]: Without dead ends: 138 [2018-01-24 12:27:23,582 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2018-01-24 12:27:23,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-01-24 12:27:23,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 113. [2018-01-24 12:27:23,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-01-24 12:27:23,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 127 transitions. [2018-01-24 12:27:23,593 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 127 transitions. Word has length 43 [2018-01-24 12:27:23,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:27:23,593 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 127 transitions. [2018-01-24 12:27:23,594 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 12:27:23,594 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 127 transitions. [2018-01-24 12:27:23,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-01-24 12:27:23,595 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:27:23,595 INFO L322 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 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:27:23,595 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, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 12:27:23,595 INFO L82 PathProgramCache]: Analyzing trace with hash 491258907, now seen corresponding path program 1 times [2018-01-24 12:27:23,595 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:27:23,595 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:27:23,596 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:27:23,596 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 12:27:23,597 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:27:23,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:27:23,612 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:27:23,670 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-24 12:27:23,670 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:27:23,670 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:27:23,679 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:27:23,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:27:23,710 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:27:23,786 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 6 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:27:23,819 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:27:23,819 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2018-01-24 12:27:23,820 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-24 12:27:23,820 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-24 12:27:23,820 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2018-01-24 12:27:23,820 INFO L87 Difference]: Start difference. First operand 113 states and 127 transitions. Second operand 13 states. [2018-01-24 12:27:23,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:27:23,923 INFO L93 Difference]: Finished difference Result 204 states and 231 transitions. [2018-01-24 12:27:23,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 12:27:23,924 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 48 [2018-01-24 12:27:23,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:27:23,925 INFO L225 Difference]: With dead ends: 204 [2018-01-24 12:27:23,925 INFO L226 Difference]: Without dead ends: 119 [2018-01-24 12:27:23,925 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2018-01-24 12:27:23,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-01-24 12:27:23,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 117. [2018-01-24 12:27:23,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-01-24 12:27:23,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 131 transitions. [2018-01-24 12:27:23,936 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 131 transitions. Word has length 48 [2018-01-24 12:27:23,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:27:23,937 INFO L432 AbstractCegarLoop]: Abstraction has 117 states and 131 transitions. [2018-01-24 12:27:23,937 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-24 12:27:23,937 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 131 transitions. [2018-01-24 12:27:23,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-01-24 12:27:23,938 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:27:23,938 INFO L322 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 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:27:23,938 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, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 12:27:23,938 INFO L82 PathProgramCache]: Analyzing trace with hash 10320228, now seen corresponding path program 2 times [2018-01-24 12:27:23,938 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:27:23,938 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:27:23,939 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:27:23,939 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:27:23,939 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:27:23,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:27:23,953 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:27:24,033 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-24 12:27:24,033 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:27:24,033 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:27:24,062 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 12:27:24,076 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:27:24,095 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:27:24,098 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 12:27:24,102 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:27:24,244 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 6 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:27:24,277 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:27:24,277 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2018-01-24 12:27:24,278 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-24 12:27:24,278 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-24 12:27:24,278 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=120, Unknown=0, NotChecked=0, Total=210 [2018-01-24 12:27:24,278 INFO L87 Difference]: Start difference. First operand 117 states and 131 transitions. Second operand 15 states. [2018-01-24 12:27:24,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:27:24,349 INFO L93 Difference]: Finished difference Result 208 states and 235 transitions. [2018-01-24 12:27:24,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 12:27:24,350 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 52 [2018-01-24 12:27:24,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:27:24,351 INFO L225 Difference]: With dead ends: 208 [2018-01-24 12:27:24,351 INFO L226 Difference]: Without dead ends: 123 [2018-01-24 12:27:24,352 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=120, Unknown=0, NotChecked=0, Total=210 [2018-01-24 12:27:24,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-01-24 12:27:24,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 121. [2018-01-24 12:27:24,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-01-24 12:27:24,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 135 transitions. [2018-01-24 12:27:24,364 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 135 transitions. Word has length 52 [2018-01-24 12:27:24,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:27:24,364 INFO L432 AbstractCegarLoop]: Abstraction has 121 states and 135 transitions. [2018-01-24 12:27:24,364 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-24 12:27:24,364 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 135 transitions. [2018-01-24 12:27:24,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-01-24 12:27:24,365 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:27:24,365 INFO L322 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 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:27:24,365 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, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 12:27:24,366 INFO L82 PathProgramCache]: Analyzing trace with hash -1506467283, now seen corresponding path program 3 times [2018-01-24 12:27:24,366 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:27:24,366 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:27:24,368 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:27:24,368 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 12:27:24,368 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:27:24,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:27:24,384 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:27:24,464 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-24 12:27:24,464 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:27:24,464 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:27:24,476 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-24 12:27:24,490 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 12:27:24,497 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 12:27:24,500 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 12:27:24,505 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:27:24,525 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:27:24,525 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:27:24,555 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:27:24,556 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:27:24,578 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:27:24,579 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 12:27:24,582 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:27:24,582 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:27:24,604 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:27:24,604 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46 [2018-01-24 12:27:24,861 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:27:24,862 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:27:24,864 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:27:24,865 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:27:24,928 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:27:24,929 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:27:24,929 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:27:24,930 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:27:24,949 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:27:24,949 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:27:24,950 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 12:27:24,972 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:27:24,973 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:27:25,007 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:27:25,007 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:73, output treesize:55 [2018-01-24 12:27:25,082 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-01-24 12:27:25,102 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:27:25,102 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 21 [2018-01-24 12:27:25,102 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-24 12:27:25,102 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-24 12:27:25,102 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=357, Unknown=1, NotChecked=0, Total=420 [2018-01-24 12:27:25,103 INFO L87 Difference]: Start difference. First operand 121 states and 135 transitions. Second operand 21 states. [2018-01-24 12:27:45,219 WARN L143 SmtUtils]: Spent 14164ms on a formula simplification that was a NOOP. DAG size: 52 [2018-01-24 12:28:07,507 WARN L146 SmtUtils]: Spent 22233ms on a formula simplification. DAG size of input: 56 DAG size of output 54 [2018-01-24 12:28:07,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:28:07,865 INFO L93 Difference]: Finished difference Result 282 states and 318 transitions. [2018-01-24 12:28:07,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-01-24 12:28:07,865 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 56 [2018-01-24 12:28:07,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:28:07,866 INFO L225 Difference]: With dead ends: 282 [2018-01-24 12:28:07,866 INFO L226 Difference]: Without dead ends: 197 [2018-01-24 12:28:07,867 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 37.3s TimeCoverageRelationStatistics Valid=227, Invalid=1253, Unknown=2, NotChecked=0, Total=1482 [2018-01-24 12:28:07,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-01-24 12:28:07,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 140. [2018-01-24 12:28:07,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-01-24 12:28:07,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 165 transitions. [2018-01-24 12:28:07,884 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 165 transitions. Word has length 56 [2018-01-24 12:28:07,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:28:07,884 INFO L432 AbstractCegarLoop]: Abstraction has 140 states and 165 transitions. [2018-01-24 12:28:07,884 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-24 12:28:07,884 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 165 transitions. [2018-01-24 12:28:07,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-01-24 12:28:07,885 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:28:07,885 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:28:07,885 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, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 12:28:07,885 INFO L82 PathProgramCache]: Analyzing trace with hash -221692299, now seen corresponding path program 1 times [2018-01-24 12:28:07,885 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:28:07,885 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:28:07,886 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:28:07,886 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 12:28:07,886 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:28:07,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:28:07,899 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:28:08,019 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:28:08,019 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:28:08,019 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:28:08,027 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:28:08,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:28:08,052 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:28:08,137 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:28:08,162 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:28:08,162 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2018-01-24 12:28:08,162 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-01-24 12:28:08,162 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-01-24 12:28:08,163 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=199, Unknown=0, NotChecked=0, Total=342 [2018-01-24 12:28:08,163 INFO L87 Difference]: Start difference. First operand 140 states and 165 transitions. Second operand 19 states. [2018-01-24 12:28:08,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:28:08,241 INFO L93 Difference]: Finished difference Result 246 states and 295 transitions. [2018-01-24 12:28:08,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-24 12:28:08,243 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 60 [2018-01-24 12:28:08,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:28:08,245 INFO L225 Difference]: With dead ends: 246 [2018-01-24 12:28:08,245 INFO L226 Difference]: Without dead ends: 146 [2018-01-24 12:28:08,246 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:28:08,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-01-24 12:28:08,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 144. [2018-01-24 12:28:08,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-01-24 12:28:08,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 169 transitions. [2018-01-24 12:28:08,264 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 169 transitions. Word has length 60 [2018-01-24 12:28:08,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:28:08,264 INFO L432 AbstractCegarLoop]: Abstraction has 144 states and 169 transitions. [2018-01-24 12:28:08,264 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-01-24 12:28:08,264 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 169 transitions. [2018-01-24 12:28:08,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-01-24 12:28:08,264 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:28:08,265 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:28:08,265 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, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 12:28:08,265 INFO L82 PathProgramCache]: Analyzing trace with hash 1676938814, now seen corresponding path program 2 times [2018-01-24 12:28:08,265 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:28:08,265 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:28:08,266 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:28:08,266 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:28:08,266 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:28:08,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:28:08,278 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:28:08,406 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:28:08,406 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:28:08,406 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:28:08,412 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 12:28:08,423 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:28:08,434 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:28:08,436 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 12:28:08,438 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:28:08,510 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:28:08,530 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:28:08,530 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2018-01-24 12:28:08,530 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-24 12:28:08,530 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-24 12:28:08,531 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=246, Unknown=0, NotChecked=0, Total=420 [2018-01-24 12:28:08,531 INFO L87 Difference]: Start difference. First operand 144 states and 169 transitions. Second operand 21 states. [2018-01-24 12:28:08,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:28:08,717 INFO L93 Difference]: Finished difference Result 250 states and 299 transitions. [2018-01-24 12:28:08,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-24 12:28:08,718 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 64 [2018-01-24 12:28:08,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:28:08,719 INFO L225 Difference]: With dead ends: 250 [2018-01-24 12:28:08,719 INFO L226 Difference]: Without dead ends: 150 [2018-01-24 12:28:08,719 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=174, Invalid=246, Unknown=0, NotChecked=0, Total=420 [2018-01-24 12:28:08,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-01-24 12:28:08,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 148. [2018-01-24 12:28:08,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-01-24 12:28:08,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 173 transitions. [2018-01-24 12:28:08,734 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 173 transitions. Word has length 64 [2018-01-24 12:28:08,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:28:08,735 INFO L432 AbstractCegarLoop]: Abstraction has 148 states and 173 transitions. [2018-01-24 12:28:08,735 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-24 12:28:08,735 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 173 transitions. [2018-01-24 12:28:08,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-01-24 12:28:08,735 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:28:08,735 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:28:08,735 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, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 12:28:08,736 INFO L82 PathProgramCache]: Analyzing trace with hash -1607478905, now seen corresponding path program 3 times [2018-01-24 12:28:08,736 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:28:08,736 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:28:08,737 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:28:08,737 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 12:28:08,737 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:28:08,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:28:08,748 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:28:08,967 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:28:08,967 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:28:08,967 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:28:08,974 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-24 12:28:08,984 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 12:28:08,989 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 12:28:08,990 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 12:28:08,992 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:28:08,994 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:28:08,995 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:28:08,996 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:28:08,996 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-24 12:28:09,063 WARN L1029 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#t~malloc1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |ldv_malloc_#t~malloc1.base| 1))) is different from true [2018-01-24 12:28:09,070 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-01-24 12:28:09,071 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:28:09,074 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:28:09,075 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-01-24 12:28:09,100 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 162 trivial. 3 not checked. [2018-01-24 12:28:09,134 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:28:09,134 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 21 [2018-01-24 12:28:09,134 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-24 12:28:09,134 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-24 12:28:09,135 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=298, Unknown=1, NotChecked=36, Total=420 [2018-01-24 12:28:09,135 INFO L87 Difference]: Start difference. First operand 148 states and 173 transitions. Second operand 21 states. [2018-01-24 12:28:09,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:28:09,588 INFO L93 Difference]: Finished difference Result 275 states and 332 transitions. [2018-01-24 12:28:09,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-01-24 12:28:09,588 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2018-01-24 12:28:09,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:28:09,589 INFO L225 Difference]: With dead ends: 275 [2018-01-24 12:28:09,589 INFO L226 Difference]: Without dead ends: 175 [2018-01-24 12:28:09,590 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=270, Invalid=1138, Unknown=2, NotChecked=72, Total=1482 [2018-01-24 12:28:09,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-01-24 12:28:09,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 146. [2018-01-24 12:28:09,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-01-24 12:28:09,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 164 transitions. [2018-01-24 12:28:09,603 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 164 transitions. Word has length 68 [2018-01-24 12:28:09,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:28:09,603 INFO L432 AbstractCegarLoop]: Abstraction has 146 states and 164 transitions. [2018-01-24 12:28:09,603 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-24 12:28:09,604 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 164 transitions. [2018-01-24 12:28:09,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-01-24 12:28:09,604 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:28:09,604 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:28:09,604 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, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 12:28:09,604 INFO L82 PathProgramCache]: Analyzing trace with hash -1497729290, now seen corresponding path program 1 times [2018-01-24 12:28:09,605 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:28:09,605 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:28:09,605 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:28:09,605 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 12:28:09,606 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:28:09,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:28:09,619 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:28:09,659 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:28:09,659 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:28:09,659 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 12:28:09,660 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 12:28:09,660 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 12:28:09,660 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 12:28:09,660 INFO L87 Difference]: Start difference. First operand 146 states and 164 transitions. Second operand 4 states. [2018-01-24 12:28:09,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:28:09,795 INFO L93 Difference]: Finished difference Result 196 states and 217 transitions. [2018-01-24 12:28:09,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 12:28:09,795 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2018-01-24 12:28:09,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:28:09,796 INFO L225 Difference]: With dead ends: 196 [2018-01-24 12:28:09,796 INFO L226 Difference]: Without dead ends: 155 [2018-01-24 12:28:09,797 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:28:09,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-01-24 12:28:09,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 149. [2018-01-24 12:28:09,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-01-24 12:28:09,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 166 transitions. [2018-01-24 12:28:09,811 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 166 transitions. Word has length 73 [2018-01-24 12:28:09,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:28:09,811 INFO L432 AbstractCegarLoop]: Abstraction has 149 states and 166 transitions. [2018-01-24 12:28:09,811 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 12:28:09,811 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 166 transitions. [2018-01-24 12:28:09,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-01-24 12:28:09,812 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:28:09,812 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:28:09,812 INFO L371 AbstractCegarLoop]: === Iteration 19 === [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, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 12:28:09,812 INFO L82 PathProgramCache]: Analyzing trace with hash 950466152, now seen corresponding path program 1 times [2018-01-24 12:28:09,812 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:28:09,812 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:28:09,813 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:28:09,813 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:28:09,813 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:28:09,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:28:09,825 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:28:10,047 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:28:10,047 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:28:10,047 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 12:28:10,052 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:28:10,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:28:10,088 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:28:10,110 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:28:10,110 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:28:10,130 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:28:10,139 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:28:10,151 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:28:10,151 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:30 [2018-01-24 12:28:15,379 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:28:15,399 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:28:15,400 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 20] total 30 [2018-01-24 12:28:15,400 INFO L409 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-01-24 12:28:15,400 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-01-24 12:28:15,400 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=816, Unknown=2, NotChecked=0, Total=930 [2018-01-24 12:28:15,401 INFO L87 Difference]: Start difference. First operand 149 states and 166 transitions. Second operand 31 states. Received shutdown request... [2018-01-24 12:28:28,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-24 12:28:28,398 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-24 12:28:28,403 WARN L187 ceAbstractionStarter]: Timeout [2018-01-24 12:28:28,403 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 12:28:28 BoogieIcfgContainer [2018-01-24 12:28:28,404 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 12:28:28,405 INFO L168 Benchmark]: Toolchain (without parser) took 70528.00 ms. Allocated memory was 303.0 MB in the beginning and 593.5 MB in the end (delta: 290.5 MB). Free memory was 262.0 MB in the beginning and 537.7 MB in the end (delta: -275.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 5.3 GB. [2018-01-24 12:28:28,406 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 303.0 MB. Free memory is still 268.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 12:28:28,406 INFO L168 Benchmark]: CACSL2BoogieTranslator took 213.80 ms. Allocated memory is still 303.0 MB. Free memory was 262.0 MB in the beginning and 248.0 MB in the end (delta: 13.9 MB). Peak memory consumption was 13.9 MB. Max. memory is 5.3 GB. [2018-01-24 12:28:28,407 INFO L168 Benchmark]: Boogie Preprocessor took 32.89 ms. Allocated memory is still 303.0 MB. Free memory was 248.0 MB in the beginning and 246.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-24 12:28:28,407 INFO L168 Benchmark]: RCFGBuilder took 329.47 ms. Allocated memory is still 303.0 MB. Free memory was 246.0 MB in the beginning and 223.0 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:28:28,407 INFO L168 Benchmark]: TraceAbstraction took 69943.95 ms. Allocated memory was 303.0 MB in the beginning and 593.5 MB in the end (delta: 290.5 MB). Free memory was 223.0 MB in the beginning and 537.7 MB in the end (delta: -314.8 MB). There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 12:28:28,409 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.24 ms. Allocated memory is still 303.0 MB. Free memory is still 268.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 213.80 ms. Allocated memory is still 303.0 MB. Free memory was 262.0 MB in the beginning and 248.0 MB in the end (delta: 13.9 MB). Peak memory consumption was 13.9 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 32.89 ms. Allocated memory is still 303.0 MB. Free memory was 248.0 MB in the beginning and 246.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 329.47 ms. Allocated memory is still 303.0 MB. Free memory was 246.0 MB in the beginning and 223.0 MB in the end (delta: 23.1 MB). Peak memory consumption was 23.1 MB. Max. memory is 5.3 GB. * TraceAbstraction took 69943.95 ms. Allocated memory was 303.0 MB in the beginning and 593.5 MB in the end (delta: 290.5 MB). Free memory was 223.0 MB in the beginning and 537.7 MB in the end (delta: -314.8 MB). There was no memory consumed. 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 (149states) and interpolant automaton (currently 15 states, 31 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 43 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 (149states) and interpolant automaton (currently 15 states, 31 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 43 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 (149states) and interpolant automaton (currently 15 states, 31 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 43 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 (149states) and interpolant automaton (currently 15 states, 31 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 43 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 (149states) and interpolant automaton (currently 15 states, 31 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 43 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 (149states) and interpolant automaton (currently 15 states, 31 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 43 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 (149states) and interpolant automaton (currently 15 states, 31 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 43 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1451). Cancelled while BasicCegarLoop was constructing difference of abstraction (149states) and interpolant automaton (currently 15 states, 31 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 43 known predicates. - TimeoutResultAtElement [Line: 1478]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 1478). Cancelled while BasicCegarLoop was constructing difference of abstraction (149states) and interpolant automaton (currently 15 states, 31 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 43 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1460). Cancelled while BasicCegarLoop was constructing difference of abstraction (149states) and interpolant automaton (currently 15 states, 31 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 43 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 (149states) and interpolant automaton (currently 15 states, 31 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 43 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1460). Cancelled while BasicCegarLoop was constructing difference of abstraction (149states) and interpolant automaton (currently 15 states, 31 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 43 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 (149states) and interpolant automaton (currently 15 states, 31 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 43 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 (149states) and interpolant automaton (currently 15 states, 31 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 43 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 (149states) and interpolant automaton (currently 15 states, 31 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 43 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1474). Cancelled while BasicCegarLoop was constructing difference of abstraction (149states) and interpolant automaton (currently 15 states, 31 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 43 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1474). Cancelled while BasicCegarLoop was constructing difference of abstraction (149states) and interpolant automaton (currently 15 states, 31 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 43 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 76 locations, 17 error locations. TIMEOUT Result, 69.8s OverallTime, 19 OverallIterations, 11 TraceHistogramMax, 58.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1287 SDtfs, 929 SDslu, 7353 SDs, 0 SdLazy, 3348 SolverSat, 197 SolverUnsat, 20 SolverUnknown, 0 SolverNotchecked, 17.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 785 GetRequests, 502 SyntacticMatches, 3 SemanticMatches, 279 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1358 ImplicationChecksByTransitivity, 48.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=149occurred in iteration=18, 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, 18 MinimizatonAttempts, 188 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 9.6s InterpolantComputationTime, 1363 NumberOfCodeBlocks, 1291 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 1333 ConstructedInterpolants, 72 QuantifiedInterpolants, 463505 SizeOfPredicates, 40 NumberOfNonLiveVariables, 1753 ConjunctsInSsa, 196 ConjunctsInUnsatCore, 30 InterpolantComputations, 9 PerfectInterpolantSequences, 893/1866 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_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_12-28-28-418.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_1_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_12-28-28-418.csv Completed graceful shutdown