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/mempurity-32bit-Automizer_Camel+AI_EQ.epf -i ../../../trunk/examples/svcomp/memsafety-ext2/complex_data_creation_test02_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-47db877 [2018-01-23 14:33:15,160 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-23 14:33:15,161 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-23 14:33:15,176 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-23 14:33:15,176 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-23 14:33:15,177 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-23 14:33:15,178 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-23 14:33:15,180 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-23 14:33:15,182 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-23 14:33:15,183 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-23 14:33:15,184 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-23 14:33:15,184 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-23 14:33:15,185 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-23 14:33:15,186 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-23 14:33:15,187 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-23 14:33:15,189 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-23 14:33:15,191 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-23 14:33:15,193 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-23 14:33:15,195 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-23 14:33:15,196 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-23 14:33:15,198 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-23 14:33:15,199 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-23 14:33:15,199 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-23 14:33:15,200 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-23 14:33:15,201 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-23 14:33:15,202 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-23 14:33:15,202 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-23 14:33:15,203 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-23 14:33:15,203 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-23 14:33:15,203 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-23 14:33:15,204 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-23 14:33:15,204 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/mempurity-32bit-Automizer_Camel+AI_EQ.epf [2018-01-23 14:33:15,213 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-23 14:33:15,213 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-23 14:33:15,214 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-23 14:33:15,214 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-23 14:33:15,214 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-23 14:33:15,214 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-23 14:33:15,214 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-23 14:33:15,215 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-23 14:33:15,215 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-23 14:33:15,215 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-23 14:33:15,215 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-23 14:33:15,215 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-23 14:33:15,215 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-23 14:33:15,216 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-23 14:33:15,216 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-23 14:33:15,216 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-23 14:33:15,216 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-23 14:33:15,216 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-23 14:33:15,216 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-23 14:33:15,216 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-23 14:33:15,216 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-23 14:33:15,217 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-23 14:33:15,217 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-23 14:33:15,217 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-23 14:33:15,217 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-23 14:33:15,218 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-23 14:33:15,218 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-23 14:33:15,218 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-23 14:33:15,218 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-23 14:33:15,218 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-23 14:33:15,218 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-23 14:33:15,218 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-23 14:33:15,218 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-23 14:33:15,219 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-23 14:33:15,219 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-23 14:33:15,219 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-23 14:33:15,220 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-23 14:33:15,252 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-23 14:33:15,263 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-23 14:33:15,266 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-23 14:33:15,267 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-23 14:33:15,267 INFO L276 PluginConnector]: CDTParser initialized [2018-01-23 14:33:15,268 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety-ext2/complex_data_creation_test02_true-valid-memsafety.i [2018-01-23 14:33:15,459 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-23 14:33:15,464 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-23 14:33:15,464 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-23 14:33:15,464 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-23 14:33:15,470 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-23 14:33:15,471 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.01 02:33:15" (1/1) ... [2018-01-23 14:33:15,473 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2eeba7ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:33:15, skipping insertion in model container [2018-01-23 14:33:15,474 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.01 02:33:15" (1/1) ... [2018-01-23 14:33:15,487 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-23 14:33:15,526 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-23 14:33:15,650 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-23 14:33:15,678 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-23 14:33:15,694 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:33:15 WrapperNode [2018-01-23 14:33:15,694 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-23 14:33:15,695 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-23 14:33:15,695 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-23 14:33:15,695 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-23 14:33:15,707 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:33:15" (1/1) ... [2018-01-23 14:33:15,707 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:33:15" (1/1) ... [2018-01-23 14:33:15,716 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:33:15" (1/1) ... [2018-01-23 14:33:15,717 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:33:15" (1/1) ... [2018-01-23 14:33:15,725 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:33:15" (1/1) ... [2018-01-23 14:33:15,728 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:33:15" (1/1) ... [2018-01-23 14:33:15,730 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:33:15" (1/1) ... [2018-01-23 14:33:15,734 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-23 14:33:15,734 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-23 14:33:15,735 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-23 14:33:15,735 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-23 14:33:15,736 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:33:15" (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-23 14:33:15,782 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-23 14:33:15,782 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-23 14:33:15,783 INFO L136 BoogieDeclarations]: Found implementation of procedure create_data [2018-01-23 14:33:15,783 INFO L136 BoogieDeclarations]: Found implementation of procedure freeData [2018-01-23 14:33:15,783 INFO L136 BoogieDeclarations]: Found implementation of procedure append [2018-01-23 14:33:15,783 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-23 14:33:15,783 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-23 14:33:15,783 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-23 14:33:15,783 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-23 14:33:15,783 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-23 14:33:15,783 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-23 14:33:15,784 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-23 14:33:15,784 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-23 14:33:15,784 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-23 14:33:15,784 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-23 14:33:15,784 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-23 14:33:15,784 INFO L128 BoogieDeclarations]: Found specification of procedure create_data [2018-01-23 14:33:15,784 INFO L128 BoogieDeclarations]: Found specification of procedure freeData [2018-01-23 14:33:15,784 INFO L128 BoogieDeclarations]: Found specification of procedure append [2018-01-23 14:33:15,784 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-23 14:33:15,784 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-23 14:33:15,785 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-23 14:33:16,214 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-23 14:33:16,215 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.01 02:33:16 BoogieIcfgContainer [2018-01-23 14:33:16,215 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-23 14:33:16,216 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-23 14:33:16,217 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-23 14:33:16,219 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-23 14:33:16,219 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.01 02:33:15" (1/3) ... [2018-01-23 14:33:16,221 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9686ad3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.01 02:33:16, skipping insertion in model container [2018-01-23 14:33:16,221 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:33:15" (2/3) ... [2018-01-23 14:33:16,221 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9686ad3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.01 02:33:16, skipping insertion in model container [2018-01-23 14:33:16,221 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.01 02:33:16" (3/3) ... [2018-01-23 14:33:16,223 INFO L105 eAbstractionObserver]: Analyzing ICFG complex_data_creation_test02_true-valid-memsafety.i [2018-01-23 14:33:16,233 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-23 14:33:16,242 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2018-01-23 14:33:16,292 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-23 14:33:16,292 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-23 14:33:16,293 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-23 14:33:16,293 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-23 14:33:16,293 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-23 14:33:16,293 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-23 14:33:16,293 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-23 14:33:16,293 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == create_dataErr0EnsuresViolation======== [2018-01-23 14:33:16,294 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-23 14:33:16,317 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states. [2018-01-23 14:33:16,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-23 14:33:16,325 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:33:16,326 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:33:16,326 INFO L371 AbstractCegarLoop]: === Iteration 1 === [create_dataErr0EnsuresViolation]=== [2018-01-23 14:33:16,331 INFO L82 PathProgramCache]: Analyzing trace with hash 15807653, now seen corresponding path program 1 times [2018-01-23 14:33:16,333 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:33:16,334 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:33:16,374 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:33:16,375 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:33:16,375 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:33:16,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:33:16,448 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:33:16,525 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-23 14:33:16,528 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:33:16,528 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-23 14:33:16,530 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-23 14:33:16,621 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-23 14:33:16,622 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-23 14:33:16,625 INFO L87 Difference]: Start difference. First operand 131 states. Second operand 3 states. [2018-01-23 14:33:16,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:33:16,672 INFO L93 Difference]: Finished difference Result 254 states and 292 transitions. [2018-01-23 14:33:16,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-23 14:33:16,674 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-01-23 14:33:16,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:33:16,685 INFO L225 Difference]: With dead ends: 254 [2018-01-23 14:33:16,685 INFO L226 Difference]: Without dead ends: 99 [2018-01-23 14:33:16,690 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-23 14:33:16,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-01-23 14:33:16,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-01-23 14:33:16,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-01-23 14:33:16,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 110 transitions. [2018-01-23 14:33:16,729 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 110 transitions. Word has length 25 [2018-01-23 14:33:16,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:33:16,730 INFO L432 AbstractCegarLoop]: Abstraction has 99 states and 110 transitions. [2018-01-23 14:33:16,730 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-23 14:33:16,730 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 110 transitions. [2018-01-23 14:33:16,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-23 14:33:16,732 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:33:16,732 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:33:16,732 INFO L371 AbstractCegarLoop]: === Iteration 2 === [create_dataErr0EnsuresViolation]=== [2018-01-23 14:33:16,733 INFO L82 PathProgramCache]: Analyzing trace with hash -1450780190, now seen corresponding path program 1 times [2018-01-23 14:33:16,733 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:33:16,733 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:33:16,734 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:33:16,734 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:33:16,734 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:33:16,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:33:16,756 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:33:16,834 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-23 14:33:16,835 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:33:16,835 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-23 14:33:16,837 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-23 14:33:16,837 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-23 14:33:16,837 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-23 14:33:16,837 INFO L87 Difference]: Start difference. First operand 99 states and 110 transitions. Second operand 4 states. [2018-01-23 14:33:16,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:33:16,893 INFO L93 Difference]: Finished difference Result 243 states and 272 transitions. [2018-01-23 14:33:16,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-23 14:33:16,893 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2018-01-23 14:33:16,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:33:16,895 INFO L225 Difference]: With dead ends: 243 [2018-01-23 14:33:16,895 INFO L226 Difference]: Without dead ends: 152 [2018-01-23 14:33:16,896 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-23 14:33:16,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-01-23 14:33:16,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 151. [2018-01-23 14:33:16,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-01-23 14:33:16,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 167 transitions. [2018-01-23 14:33:16,906 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 167 transitions. Word has length 27 [2018-01-23 14:33:16,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:33:16,906 INFO L432 AbstractCegarLoop]: Abstraction has 151 states and 167 transitions. [2018-01-23 14:33:16,906 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-23 14:33:16,906 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 167 transitions. [2018-01-23 14:33:16,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-23 14:33:16,907 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:33:16,907 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:33:16,907 INFO L371 AbstractCegarLoop]: === Iteration 3 === [create_dataErr0EnsuresViolation]=== [2018-01-23 14:33:16,908 INFO L82 PathProgramCache]: Analyzing trace with hash 300506494, now seen corresponding path program 1 times [2018-01-23 14:33:16,908 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:33:16,908 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:33:16,909 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:33:16,909 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:33:16,909 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:33:16,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:33:16,929 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:33:16,959 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-23 14:33:16,961 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:33:16,961 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-23 14:33:16,962 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-23 14:33:16,962 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-23 14:33:16,962 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-23 14:33:16,962 INFO L87 Difference]: Start difference. First operand 151 states and 167 transitions. Second operand 3 states. [2018-01-23 14:33:17,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:33:17,011 INFO L93 Difference]: Finished difference Result 153 states and 169 transitions. [2018-01-23 14:33:17,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-23 14:33:17,012 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-01-23 14:33:17,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:33:17,013 INFO L225 Difference]: With dead ends: 153 [2018-01-23 14:33:17,014 INFO L226 Difference]: Without dead ends: 152 [2018-01-23 14:33:17,014 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-23 14:33:17,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-01-23 14:33:17,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2018-01-23 14:33:17,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-01-23 14:33:17,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 168 transitions. [2018-01-23 14:33:17,027 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 168 transitions. Word has length 29 [2018-01-23 14:33:17,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:33:17,028 INFO L432 AbstractCegarLoop]: Abstraction has 152 states and 168 transitions. [2018-01-23 14:33:17,028 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-23 14:33:17,028 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 168 transitions. [2018-01-23 14:33:17,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-01-23 14:33:17,030 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:33:17,030 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:33:17,030 INFO L371 AbstractCegarLoop]: === Iteration 4 === [create_dataErr0EnsuresViolation]=== [2018-01-23 14:33:17,030 INFO L82 PathProgramCache]: Analyzing trace with hash 1126752096, now seen corresponding path program 1 times [2018-01-23 14:33:17,030 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:33:17,031 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:33:17,031 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:33:17,031 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:33:17,031 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:33:17,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:33:17,058 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:33:17,114 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-23 14:33:17,115 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:33:17,115 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-23 14:33:17,115 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-23 14:33:17,115 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-23 14:33:17,116 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-23 14:33:17,116 INFO L87 Difference]: Start difference. First operand 152 states and 168 transitions. Second operand 3 states. [2018-01-23 14:33:17,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:33:17,154 INFO L93 Difference]: Finished difference Result 310 states and 347 transitions. [2018-01-23 14:33:17,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-23 14:33:17,155 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2018-01-23 14:33:17,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:33:17,156 INFO L225 Difference]: With dead ends: 310 [2018-01-23 14:33:17,157 INFO L226 Difference]: Without dead ends: 166 [2018-01-23 14:33:17,158 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-23 14:33:17,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-01-23 14:33:17,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 156. [2018-01-23 14:33:17,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-01-23 14:33:17,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 172 transitions. [2018-01-23 14:33:17,171 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 172 transitions. Word has length 45 [2018-01-23 14:33:17,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:33:17,172 INFO L432 AbstractCegarLoop]: Abstraction has 156 states and 172 transitions. [2018-01-23 14:33:17,172 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-23 14:33:17,172 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 172 transitions. [2018-01-23 14:33:17,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-01-23 14:33:17,174 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:33:17,174 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:33:17,174 INFO L371 AbstractCegarLoop]: === Iteration 5 === [create_dataErr0EnsuresViolation]=== [2018-01-23 14:33:17,175 INFO L82 PathProgramCache]: Analyzing trace with hash -1796279385, now seen corresponding path program 1 times [2018-01-23 14:33:17,175 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:33:17,175 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:33:17,176 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:33:17,176 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:33:17,176 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:33:17,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:33:17,202 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:33:17,249 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:33:17,249 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:33:17,250 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-23 14:33:17,264 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:33:17,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:33:17,314 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:33:17,342 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:33:17,374 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:33:17,375 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-01-23 14:33:17,375 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-23 14:33:17,375 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-23 14:33:17,375 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-01-23 14:33:17,376 INFO L87 Difference]: Start difference. First operand 156 states and 172 transitions. Second operand 5 states. [2018-01-23 14:33:17,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:33:17,400 INFO L93 Difference]: Finished difference Result 328 states and 365 transitions. [2018-01-23 14:33:17,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-23 14:33:17,401 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2018-01-23 14:33:17,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:33:17,402 INFO L225 Difference]: With dead ends: 328 [2018-01-23 14:33:17,402 INFO L226 Difference]: Without dead ends: 180 [2018-01-23 14:33:17,403 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-01-23 14:33:17,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-01-23 14:33:17,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 170. [2018-01-23 14:33:17,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-01-23 14:33:17,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 186 transitions. [2018-01-23 14:33:17,414 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 186 transitions. Word has length 52 [2018-01-23 14:33:17,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:33:17,415 INFO L432 AbstractCegarLoop]: Abstraction has 170 states and 186 transitions. [2018-01-23 14:33:17,415 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-23 14:33:17,415 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 186 transitions. [2018-01-23 14:33:17,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-01-23 14:33:17,416 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:33:17,416 INFO L322 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:33:17,417 INFO L371 AbstractCegarLoop]: === Iteration 6 === [create_dataErr0EnsuresViolation]=== [2018-01-23 14:33:17,417 INFO L82 PathProgramCache]: Analyzing trace with hash 1063113088, now seen corresponding path program 2 times [2018-01-23 14:33:17,417 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:33:17,417 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:33:17,418 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:33:17,418 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:33:17,418 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:33:17,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:33:17,447 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:33:17,508 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:33:17,508 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:33:17,509 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-23 14:33:17,517 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-23 14:33:17,551 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-23 14:33:17,579 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-23 14:33:17,581 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-23 14:33:17,586 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:33:17,603 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:33:17,637 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:33:17,637 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-01-23 14:33:17,638 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-23 14:33:17,638 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-23 14:33:17,638 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-01-23 14:33:17,638 INFO L87 Difference]: Start difference. First operand 170 states and 186 transitions. Second operand 6 states. [2018-01-23 14:33:17,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:33:17,684 INFO L93 Difference]: Finished difference Result 346 states and 383 transitions. [2018-01-23 14:33:17,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-23 14:33:17,685 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2018-01-23 14:33:17,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:33:17,687 INFO L225 Difference]: With dead ends: 346 [2018-01-23 14:33:17,687 INFO L226 Difference]: Without dead ends: 184 [2018-01-23 14:33:17,688 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-01-23 14:33:17,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-01-23 14:33:17,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2018-01-23 14:33:17,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-01-23 14:33:17,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 200 transitions. [2018-01-23 14:33:17,698 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 200 transitions. Word has length 59 [2018-01-23 14:33:17,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:33:17,699 INFO L432 AbstractCegarLoop]: Abstraction has 184 states and 200 transitions. [2018-01-23 14:33:17,699 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-23 14:33:17,699 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 200 transitions. [2018-01-23 14:33:17,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-01-23 14:33:17,701 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:33:17,701 INFO L322 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:33:17,701 INFO L371 AbstractCegarLoop]: === Iteration 7 === [create_dataErr0EnsuresViolation]=== [2018-01-23 14:33:17,702 INFO L82 PathProgramCache]: Analyzing trace with hash 248208775, now seen corresponding path program 3 times [2018-01-23 14:33:17,702 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:33:17,702 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:33:17,703 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:33:17,703 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-23 14:33:17,703 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:33:17,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-23 14:33:17,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-23 14:33:17,837 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-23 14:33:17,858 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-23 14:33:17,870 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-23 14:33:17,894 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-23 14:33:17,895 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-23 14:33:17,895 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-23 14:33:17,895 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-23 14:33:17,895 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-23 14:33:17,895 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-23 14:33:17,895 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-23 14:33:17,895 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == freeDataErr0EnsuresViolation======== [2018-01-23 14:33:17,895 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-23 14:33:17,898 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states. [2018-01-23 14:33:17,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-23 14:33:17,899 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:33:17,899 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:33:17,899 INFO L371 AbstractCegarLoop]: === Iteration 1 === [freeDataErr0EnsuresViolation]=== [2018-01-23 14:33:17,899 INFO L82 PathProgramCache]: Analyzing trace with hash -1728587143, now seen corresponding path program 1 times [2018-01-23 14:33:17,899 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:33:17,900 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:33:17,901 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:33:17,901 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:33:17,901 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:33:17,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:33:17,906 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:33:17,912 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-23 14:33:17,913 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:33:17,913 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-23 14:33:17,913 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-23 14:33:17,913 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-23 14:33:17,914 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-23 14:33:17,914 INFO L87 Difference]: Start difference. First operand 131 states. Second operand 2 states. [2018-01-23 14:33:17,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:33:17,921 INFO L93 Difference]: Finished difference Result 253 states and 290 transitions. [2018-01-23 14:33:17,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-23 14:33:17,921 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 24 [2018-01-23 14:33:17,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:33:17,923 INFO L225 Difference]: With dead ends: 253 [2018-01-23 14:33:17,923 INFO L226 Difference]: Without dead ends: 119 [2018-01-23 14:33:17,924 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-23 14:33:17,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-01-23 14:33:17,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2018-01-23 14:33:17,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-01-23 14:33:17,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 131 transitions. [2018-01-23 14:33:17,930 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 131 transitions. Word has length 24 [2018-01-23 14:33:17,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:33:17,930 INFO L432 AbstractCegarLoop]: Abstraction has 119 states and 131 transitions. [2018-01-23 14:33:17,930 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-23 14:33:17,931 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 131 transitions. [2018-01-23 14:33:17,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-01-23 14:33:17,932 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:33:17,932 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 14:33:17,932 INFO L371 AbstractCegarLoop]: === Iteration 2 === [freeDataErr0EnsuresViolation]=== [2018-01-23 14:33:17,932 INFO L82 PathProgramCache]: Analyzing trace with hash -1665239383, now seen corresponding path program 1 times [2018-01-23 14:33:17,932 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:33:17,933 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:33:17,933 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:33:17,934 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:33:17,934 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:33:17,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:33:17,944 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:33:17,964 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-23 14:33:17,964 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:33:17,964 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-23 14:33:17,964 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-23 14:33:17,965 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-23 14:33:17,965 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-23 14:33:17,965 INFO L87 Difference]: Start difference. First operand 119 states and 131 transitions. Second operand 3 states. [2018-01-23 14:33:17,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:33:17,978 INFO L93 Difference]: Finished difference Result 231 states and 259 transitions. [2018-01-23 14:33:17,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-23 14:33:17,979 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2018-01-23 14:33:17,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:33:17,980 INFO L225 Difference]: With dead ends: 231 [2018-01-23 14:33:17,980 INFO L226 Difference]: Without dead ends: 120 [2018-01-23 14:33:17,981 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-23 14:33:17,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-01-23 14:33:17,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2018-01-23 14:33:17,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-01-23 14:33:17,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 132 transitions. [2018-01-23 14:33:17,987 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 132 transitions. Word has length 54 [2018-01-23 14:33:17,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:33:17,987 INFO L432 AbstractCegarLoop]: Abstraction has 120 states and 132 transitions. [2018-01-23 14:33:17,987 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-23 14:33:17,988 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 132 transitions. [2018-01-23 14:33:17,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-01-23 14:33:17,989 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:33:17,989 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 14:33:17,989 INFO L371 AbstractCegarLoop]: === Iteration 3 === [freeDataErr0EnsuresViolation]=== [2018-01-23 14:33:17,989 INFO L82 PathProgramCache]: Analyzing trace with hash 1275844236, now seen corresponding path program 1 times [2018-01-23 14:33:17,989 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:33:17,989 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:33:17,990 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:33:17,990 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:33:17,990 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:33:17,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:33:18,000 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:33:18,045 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-23 14:33:18,045 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:33:18,045 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-23 14:33:18,046 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-23 14:33:18,046 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-23 14:33:18,046 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-23 14:33:18,046 INFO L87 Difference]: Start difference. First operand 120 states and 132 transitions. Second operand 4 states. [2018-01-23 14:33:18,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:33:18,069 INFO L93 Difference]: Finished difference Result 281 states and 312 transitions. [2018-01-23 14:33:18,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-23 14:33:18,070 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2018-01-23 14:33:18,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:33:18,076 INFO L225 Difference]: With dead ends: 281 [2018-01-23 14:33:18,076 INFO L226 Difference]: Without dead ends: 169 [2018-01-23 14:33:18,077 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-23 14:33:18,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-01-23 14:33:18,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2018-01-23 14:33:18,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-01-23 14:33:18,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 186 transitions. [2018-01-23 14:33:18,087 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 186 transitions. Word has length 56 [2018-01-23 14:33:18,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:33:18,087 INFO L432 AbstractCegarLoop]: Abstraction has 169 states and 186 transitions. [2018-01-23 14:33:18,087 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-23 14:33:18,087 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 186 transitions. [2018-01-23 14:33:18,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-01-23 14:33:18,089 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:33:18,089 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 14:33:18,089 INFO L371 AbstractCegarLoop]: === Iteration 4 === [freeDataErr0EnsuresViolation]=== [2018-01-23 14:33:18,089 INFO L82 PathProgramCache]: Analyzing trace with hash -712820142, now seen corresponding path program 1 times [2018-01-23 14:33:18,089 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:33:18,090 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:33:18,090 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:33:18,091 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:33:18,091 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:33:18,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:33:18,106 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:33:18,129 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-23 14:33:18,130 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:33:18,130 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-23 14:33:18,130 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-23 14:33:18,130 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-23 14:33:18,130 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-23 14:33:18,131 INFO L87 Difference]: Start difference. First operand 169 states and 186 transitions. Second operand 3 states. [2018-01-23 14:33:18,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:33:18,142 INFO L93 Difference]: Finished difference Result 192 states and 210 transitions. [2018-01-23 14:33:18,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-23 14:33:18,142 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2018-01-23 14:33:18,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:33:18,144 INFO L225 Difference]: With dead ends: 192 [2018-01-23 14:33:18,144 INFO L226 Difference]: Without dead ends: 170 [2018-01-23 14:33:18,145 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-23 14:33:18,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-01-23 14:33:18,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2018-01-23 14:33:18,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-01-23 14:33:18,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 187 transitions. [2018-01-23 14:33:18,153 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 187 transitions. Word has length 58 [2018-01-23 14:33:18,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:33:18,153 INFO L432 AbstractCegarLoop]: Abstraction has 170 states and 187 transitions. [2018-01-23 14:33:18,153 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-23 14:33:18,153 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 187 transitions. [2018-01-23 14:33:18,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-01-23 14:33:18,154 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:33:18,155 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 14:33:18,155 INFO L371 AbstractCegarLoop]: === Iteration 5 === [freeDataErr0EnsuresViolation]=== [2018-01-23 14:33:18,155 INFO L82 PathProgramCache]: Analyzing trace with hash 1993799252, now seen corresponding path program 1 times [2018-01-23 14:33:18,155 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:33:18,155 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:33:18,156 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:33:18,156 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:33:18,156 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:33:18,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:33:18,170 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:33:18,215 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-23 14:33:18,216 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:33:18,216 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-23 14:33:18,216 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-23 14:33:18,216 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-23 14:33:18,216 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-23 14:33:18,217 INFO L87 Difference]: Start difference. First operand 170 states and 187 transitions. Second operand 4 states. [2018-01-23 14:33:18,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:33:18,260 INFO L93 Difference]: Finished difference Result 297 states and 329 transitions. [2018-01-23 14:33:18,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-23 14:33:18,261 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2018-01-23 14:33:18,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:33:18,262 INFO L225 Difference]: With dead ends: 297 [2018-01-23 14:33:18,262 INFO L226 Difference]: Without dead ends: 0 [2018-01-23 14:33:18,263 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-23 14:33:18,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-23 14:33:18,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-23 14:33:18,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-23 14:33:18,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-23 14:33:18,264 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 58 [2018-01-23 14:33:18,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:33:18,264 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-23 14:33:18,264 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-23 14:33:18,264 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-23 14:33:18,264 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-23 14:33:18,268 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-23 14:33:18,268 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-23 14:33:18,268 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-23 14:33:18,268 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-23 14:33:18,268 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-23 14:33:18,268 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-23 14:33:18,268 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-23 14:33:18,269 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-23 14:33:18,269 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-23 14:33:18,271 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states. [2018-01-23 14:33:18,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-23 14:33:18,271 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:33:18,271 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-23 14:33:18,271 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-23 14:33:18,271 INFO L82 PathProgramCache]: Analyzing trace with hash 243161, now seen corresponding path program 1 times [2018-01-23 14:33:18,272 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:33:18,272 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:33:18,272 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:33:18,273 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:33:18,273 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:33:18,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-23 14:33:18,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-23 14:33:18,277 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-23 14:33:18,278 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-23 14:33:18,279 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-23 14:33:18,280 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-23 14:33:18,280 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-23 14:33:18,280 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-23 14:33:18,280 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-23 14:33:18,280 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-23 14:33:18,280 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-23 14:33:18,280 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-23 14:33:18,280 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-23 14:33:18,282 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states. [2018-01-23 14:33:18,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-23 14:33:18,282 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:33:18,283 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:33:18,283 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-23 14:33:18,283 INFO L82 PathProgramCache]: Analyzing trace with hash -1734261875, now seen corresponding path program 1 times [2018-01-23 14:33:18,283 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:33:18,283 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:33:18,284 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:33:18,284 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:33:18,284 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:33:18,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:33:18,288 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:33:18,292 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-23 14:33:18,292 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:33:18,292 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-23 14:33:18,293 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-23 14:33:18,293 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-23 14:33:18,293 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-23 14:33:18,293 INFO L87 Difference]: Start difference. First operand 131 states. Second operand 2 states. [2018-01-23 14:33:18,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:33:18,300 INFO L93 Difference]: Finished difference Result 253 states and 290 transitions. [2018-01-23 14:33:18,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-23 14:33:18,300 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2018-01-23 14:33:18,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:33:18,301 INFO L225 Difference]: With dead ends: 253 [2018-01-23 14:33:18,302 INFO L226 Difference]: Without dead ends: 125 [2018-01-23 14:33:18,302 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-23 14:33:18,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-01-23 14:33:18,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2018-01-23 14:33:18,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-01-23 14:33:18,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 137 transitions. [2018-01-23 14:33:18,308 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 137 transitions. Word has length 16 [2018-01-23 14:33:18,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:33:18,308 INFO L432 AbstractCegarLoop]: Abstraction has 125 states and 137 transitions. [2018-01-23 14:33:18,308 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-23 14:33:18,309 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 137 transitions. [2018-01-23 14:33:18,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-01-23 14:33:18,309 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:33:18,310 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:33:18,310 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-23 14:33:18,310 INFO L82 PathProgramCache]: Analyzing trace with hash 433974604, now seen corresponding path program 1 times [2018-01-23 14:33:18,310 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:33:18,310 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:33:18,311 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:33:18,311 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:33:18,311 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:33:18,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:33:18,319 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:33:18,334 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-23 14:33:18,334 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:33:18,335 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-23 14:33:18,335 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-23 14:33:18,335 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-23 14:33:18,335 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-23 14:33:18,335 INFO L87 Difference]: Start difference. First operand 125 states and 137 transitions. Second operand 3 states. [2018-01-23 14:33:18,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:33:18,349 INFO L93 Difference]: Finished difference Result 243 states and 271 transitions. [2018-01-23 14:33:18,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-23 14:33:18,349 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2018-01-23 14:33:18,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:33:18,350 INFO L225 Difference]: With dead ends: 243 [2018-01-23 14:33:18,350 INFO L226 Difference]: Without dead ends: 126 [2018-01-23 14:33:18,351 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-23 14:33:18,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-01-23 14:33:18,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2018-01-23 14:33:18,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-01-23 14:33:18,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 138 transitions. [2018-01-23 14:33:18,357 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 138 transitions. Word has length 48 [2018-01-23 14:33:18,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:33:18,357 INFO L432 AbstractCegarLoop]: Abstraction has 126 states and 138 transitions. [2018-01-23 14:33:18,357 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-23 14:33:18,357 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 138 transitions. [2018-01-23 14:33:18,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-01-23 14:33:18,358 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:33:18,358 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 14:33:18,358 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-23 14:33:18,358 INFO L82 PathProgramCache]: Analyzing trace with hash -1491225745, now seen corresponding path program 1 times [2018-01-23 14:33:18,358 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:33:18,359 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:33:18,359 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:33:18,360 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:33:18,360 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:33:18,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:33:18,368 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:33:18,410 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-23 14:33:18,411 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:33:18,411 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-23 14:33:18,411 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-23 14:33:18,412 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-23 14:33:18,412 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-23 14:33:18,412 INFO L87 Difference]: Start difference. First operand 126 states and 138 transitions. Second operand 4 states. [2018-01-23 14:33:18,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:33:18,434 INFO L93 Difference]: Finished difference Result 293 states and 324 transitions. [2018-01-23 14:33:18,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-23 14:33:18,435 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2018-01-23 14:33:18,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:33:18,436 INFO L225 Difference]: With dead ends: 293 [2018-01-23 14:33:18,437 INFO L226 Difference]: Without dead ends: 175 [2018-01-23 14:33:18,437 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-23 14:33:18,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-01-23 14:33:18,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2018-01-23 14:33:18,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-01-23 14:33:18,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 192 transitions. [2018-01-23 14:33:18,447 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 192 transitions. Word has length 50 [2018-01-23 14:33:18,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:33:18,448 INFO L432 AbstractCegarLoop]: Abstraction has 175 states and 192 transitions. [2018-01-23 14:33:18,448 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-23 14:33:18,448 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 192 transitions. [2018-01-23 14:33:18,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-01-23 14:33:18,449 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:33:18,450 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 14:33:18,450 INFO L371 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-23 14:33:18,450 INFO L82 PathProgramCache]: Analyzing trace with hash -406527051, now seen corresponding path program 1 times [2018-01-23 14:33:18,450 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:33:18,450 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:33:18,451 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:33:18,451 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:33:18,451 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:33:18,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:33:18,465 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:33:18,489 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-23 14:33:18,489 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:33:18,489 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-23 14:33:18,489 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-23 14:33:18,490 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-23 14:33:18,490 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-23 14:33:18,490 INFO L87 Difference]: Start difference. First operand 175 states and 192 transitions. Second operand 3 states. [2018-01-23 14:33:18,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:33:18,502 INFO L93 Difference]: Finished difference Result 204 states and 222 transitions. [2018-01-23 14:33:18,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-23 14:33:18,502 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2018-01-23 14:33:18,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:33:18,504 INFO L225 Difference]: With dead ends: 204 [2018-01-23 14:33:18,504 INFO L226 Difference]: Without dead ends: 176 [2018-01-23 14:33:18,505 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-23 14:33:18,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-01-23 14:33:18,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 176. [2018-01-23 14:33:18,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-01-23 14:33:18,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 193 transitions. [2018-01-23 14:33:18,516 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 193 transitions. Word has length 52 [2018-01-23 14:33:18,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:33:18,516 INFO L432 AbstractCegarLoop]: Abstraction has 176 states and 193 transitions. [2018-01-23 14:33:18,516 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-23 14:33:18,516 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 193 transitions. [2018-01-23 14:33:18,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-01-23 14:33:18,518 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:33:18,518 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 14:33:18,518 INFO L371 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-23 14:33:18,519 INFO L82 PathProgramCache]: Analyzing trace with hash 294537527, now seen corresponding path program 1 times [2018-01-23 14:33:18,519 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:33:18,519 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:33:18,520 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:33:18,520 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:33:18,520 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:33:18,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:33:18,534 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:33:18,602 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-23 14:33:18,602 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:33:18,602 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-23 14:33:18,603 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-23 14:33:18,603 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-23 14:33:18,603 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-23 14:33:18,603 INFO L87 Difference]: Start difference. First operand 176 states and 193 transitions. Second operand 4 states. [2018-01-23 14:33:18,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:33:18,670 INFO L93 Difference]: Finished difference Result 303 states and 335 transitions. [2018-01-23 14:33:18,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-23 14:33:18,671 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2018-01-23 14:33:18,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:33:18,671 INFO L225 Difference]: With dead ends: 303 [2018-01-23 14:33:18,671 INFO L226 Difference]: Without dead ends: 0 [2018-01-23 14:33:18,672 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-23 14:33:18,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-23 14:33:18,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-23 14:33:18,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-23 14:33:18,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-23 14:33:18,673 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 52 [2018-01-23 14:33:18,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:33:18,673 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-23 14:33:18,673 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-23 14:33:18,674 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-23 14:33:18,674 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-23 14:33:18,676 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-23 14:33:18,676 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-23 14:33:18,676 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-23 14:33:18,676 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-23 14:33:18,676 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-23 14:33:18,676 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-23 14:33:18,676 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-23 14:33:18,676 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-23 14:33:18,676 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-23 14:33:18,678 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states. [2018-01-23 14:33:18,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-23 14:33:18,680 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:33:18,680 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:33:18,680 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-23 14:33:18,680 INFO L82 PathProgramCache]: Analyzing trace with hash -1820797042, now seen corresponding path program 1 times [2018-01-23 14:33:18,681 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:33:18,681 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:33:18,681 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:33:18,682 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:33:18,682 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:33:18,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:33:18,687 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:33:18,691 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-23 14:33:18,691 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:33:18,691 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-23 14:33:18,692 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-23 14:33:18,692 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-23 14:33:18,692 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-23 14:33:18,692 INFO L87 Difference]: Start difference. First operand 131 states. Second operand 2 states. [2018-01-23 14:33:18,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:33:18,699 INFO L93 Difference]: Finished difference Result 253 states and 290 transitions. [2018-01-23 14:33:18,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-23 14:33:18,699 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-01-23 14:33:18,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:33:18,700 INFO L225 Difference]: With dead ends: 253 [2018-01-23 14:33:18,700 INFO L226 Difference]: Without dead ends: 123 [2018-01-23 14:33:18,701 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-23 14:33:18,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-01-23 14:33:18,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2018-01-23 14:33:18,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-01-23 14:33:18,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 135 transitions. [2018-01-23 14:33:18,707 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 135 transitions. Word has length 14 [2018-01-23 14:33:18,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:33:18,707 INFO L432 AbstractCegarLoop]: Abstraction has 123 states and 135 transitions. [2018-01-23 14:33:18,707 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-23 14:33:18,707 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 135 transitions. [2018-01-23 14:33:18,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-01-23 14:33:18,708 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:33:18,708 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:33:18,709 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation]=== [2018-01-23 14:33:18,709 INFO L82 PathProgramCache]: Analyzing trace with hash -821893875, now seen corresponding path program 1 times [2018-01-23 14:33:18,709 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:33:18,709 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:33:18,710 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:33:18,710 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:33:18,710 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:33:18,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:33:18,719 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:33:18,746 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-23 14:33:18,746 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:33:18,746 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-23 14:33:18,746 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-23 14:33:18,747 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-23 14:33:18,747 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-23 14:33:18,747 INFO L87 Difference]: Start difference. First operand 123 states and 135 transitions. Second operand 3 states. [2018-01-23 14:33:18,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:33:18,759 INFO L93 Difference]: Finished difference Result 239 states and 267 transitions. [2018-01-23 14:33:18,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-23 14:33:18,760 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2018-01-23 14:33:18,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:33:18,761 INFO L225 Difference]: With dead ends: 239 [2018-01-23 14:33:18,761 INFO L226 Difference]: Without dead ends: 124 [2018-01-23 14:33:18,762 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-23 14:33:18,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-01-23 14:33:18,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2018-01-23 14:33:18,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-01-23 14:33:18,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 136 transitions. [2018-01-23 14:33:18,767 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 136 transitions. Word has length 46 [2018-01-23 14:33:18,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:33:18,767 INFO L432 AbstractCegarLoop]: Abstraction has 124 states and 136 transitions. [2018-01-23 14:33:18,767 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-23 14:33:18,768 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 136 transitions. [2018-01-23 14:33:18,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-01-23 14:33:18,768 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:33:18,769 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:33:18,769 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation]=== [2018-01-23 14:33:18,769 INFO L82 PathProgramCache]: Analyzing trace with hash 78895088, now seen corresponding path program 1 times [2018-01-23 14:33:18,769 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:33:18,769 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:33:18,770 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:33:18,770 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:33:18,770 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:33:18,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:33:18,778 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:33:18,818 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-23 14:33:18,818 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:33:18,818 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-23 14:33:18,819 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-23 14:33:18,819 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-23 14:33:18,819 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-23 14:33:18,819 INFO L87 Difference]: Start difference. First operand 124 states and 136 transitions. Second operand 4 states. [2018-01-23 14:33:18,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:33:18,841 INFO L93 Difference]: Finished difference Result 289 states and 320 transitions. [2018-01-23 14:33:18,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-23 14:33:18,842 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2018-01-23 14:33:18,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:33:18,843 INFO L225 Difference]: With dead ends: 289 [2018-01-23 14:33:18,844 INFO L226 Difference]: Without dead ends: 173 [2018-01-23 14:33:18,844 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-23 14:33:18,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-01-23 14:33:18,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2018-01-23 14:33:18,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-01-23 14:33:18,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 190 transitions. [2018-01-23 14:33:18,853 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 190 transitions. Word has length 48 [2018-01-23 14:33:18,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:33:18,853 INFO L432 AbstractCegarLoop]: Abstraction has 173 states and 190 transitions. [2018-01-23 14:33:18,853 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-23 14:33:18,853 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 190 transitions. [2018-01-23 14:33:18,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-01-23 14:33:18,854 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:33:18,855 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 14:33:18,855 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation]=== [2018-01-23 14:33:18,855 INFO L82 PathProgramCache]: Analyzing trace with hash -2083102282, now seen corresponding path program 1 times [2018-01-23 14:33:18,855 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:33:18,855 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:33:18,856 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:33:18,856 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:33:18,856 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:33:18,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:33:18,868 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:33:18,888 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-23 14:33:18,889 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:33:18,889 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-23 14:33:18,889 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-23 14:33:18,890 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-23 14:33:18,890 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-23 14:33:18,890 INFO L87 Difference]: Start difference. First operand 173 states and 190 transitions. Second operand 3 states. [2018-01-23 14:33:18,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:33:18,903 INFO L93 Difference]: Finished difference Result 200 states and 218 transitions. [2018-01-23 14:33:18,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-23 14:33:18,903 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-01-23 14:33:18,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:33:18,904 INFO L225 Difference]: With dead ends: 200 [2018-01-23 14:33:18,905 INFO L226 Difference]: Without dead ends: 174 [2018-01-23 14:33:18,905 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-23 14:33:18,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-01-23 14:33:18,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2018-01-23 14:33:18,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-01-23 14:33:18,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 191 transitions. [2018-01-23 14:33:18,912 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 191 transitions. Word has length 50 [2018-01-23 14:33:18,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:33:18,912 INFO L432 AbstractCegarLoop]: Abstraction has 174 states and 191 transitions. [2018-01-23 14:33:18,913 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-23 14:33:18,913 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 191 transitions. [2018-01-23 14:33:18,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-01-23 14:33:18,914 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:33:18,914 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 14:33:18,914 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0EnsuresViolation]=== [2018-01-23 14:33:18,914 INFO L82 PathProgramCache]: Analyzing trace with hash -1403043912, now seen corresponding path program 1 times [2018-01-23 14:33:18,914 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:33:18,914 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:33:18,915 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:33:18,915 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:33:18,915 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:33:18,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:33:18,928 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:33:18,961 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-23 14:33:18,962 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:33:18,962 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-23 14:33:18,962 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-23 14:33:18,962 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-23 14:33:18,963 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-23 14:33:18,963 INFO L87 Difference]: Start difference. First operand 174 states and 191 transitions. Second operand 4 states. [2018-01-23 14:33:19,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:33:19,018 INFO L93 Difference]: Finished difference Result 301 states and 333 transitions. [2018-01-23 14:33:19,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-23 14:33:19,019 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2018-01-23 14:33:19,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:33:19,019 INFO L225 Difference]: With dead ends: 301 [2018-01-23 14:33:19,020 INFO L226 Difference]: Without dead ends: 0 [2018-01-23 14:33:19,021 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-23 14:33:19,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-23 14:33:19,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-23 14:33:19,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-23 14:33:19,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-23 14:33:19,022 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 50 [2018-01-23 14:33:19,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:33:19,022 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-23 14:33:19,022 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-23 14:33:19,022 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-23 14:33:19,022 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-23 14:33:19,023 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-23 14:33:19,024 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-23 14:33:19,024 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-23 14:33:19,024 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-23 14:33:19,024 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-23 14:33:19,024 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-23 14:33:19,024 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-23 14:33:19,024 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == appendErr0EnsuresViolation======== [2018-01-23 14:33:19,024 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-23 14:33:19,026 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states. [2018-01-23 14:33:19,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-23 14:33:19,027 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:33:19,027 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:33:19,027 INFO L371 AbstractCegarLoop]: === Iteration 1 === [appendErr0EnsuresViolation]=== [2018-01-23 14:33:19,027 INFO L82 PathProgramCache]: Analyzing trace with hash -837690628, now seen corresponding path program 1 times [2018-01-23 14:33:19,027 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:33:19,027 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:33:19,028 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:33:19,028 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:33:19,028 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:33:19,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:33:19,036 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:33:19,060 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-23 14:33:19,060 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:33:19,061 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-23 14:33:19,061 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-23 14:33:19,061 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-23 14:33:19,061 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-23 14:33:19,061 INFO L87 Difference]: Start difference. First operand 131 states. Second operand 3 states. [2018-01-23 14:33:19,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:33:19,077 INFO L93 Difference]: Finished difference Result 254 states and 292 transitions. [2018-01-23 14:33:19,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-23 14:33:19,077 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-01-23 14:33:19,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:33:19,078 INFO L225 Difference]: With dead ends: 254 [2018-01-23 14:33:19,078 INFO L226 Difference]: Without dead ends: 99 [2018-01-23 14:33:19,079 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-23 14:33:19,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-01-23 14:33:19,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-01-23 14:33:19,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-01-23 14:33:19,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 110 transitions. [2018-01-23 14:33:19,084 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 110 transitions. Word has length 30 [2018-01-23 14:33:19,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:33:19,085 INFO L432 AbstractCegarLoop]: Abstraction has 99 states and 110 transitions. [2018-01-23 14:33:19,085 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-23 14:33:19,085 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 110 transitions. [2018-01-23 14:33:19,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-23 14:33:19,085 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:33:19,086 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:33:19,086 INFO L371 AbstractCegarLoop]: === Iteration 2 === [appendErr0EnsuresViolation]=== [2018-01-23 14:33:19,086 INFO L82 PathProgramCache]: Analyzing trace with hash 844297183, now seen corresponding path program 1 times [2018-01-23 14:33:19,086 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:33:19,086 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:33:19,087 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:33:19,087 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:33:19,087 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:33:19,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:33:19,095 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:33:19,144 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-23 14:33:19,144 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:33:19,144 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-23 14:33:19,145 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-23 14:33:19,145 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-23 14:33:19,145 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-23 14:33:19,145 INFO L87 Difference]: Start difference. First operand 99 states and 110 transitions. Second operand 4 states. [2018-01-23 14:33:19,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:33:19,166 INFO L93 Difference]: Finished difference Result 239 states and 268 transitions. [2018-01-23 14:33:19,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-23 14:33:19,167 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2018-01-23 14:33:19,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:33:19,168 INFO L225 Difference]: With dead ends: 239 [2018-01-23 14:33:19,168 INFO L226 Difference]: Without dead ends: 148 [2018-01-23 14:33:19,169 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-23 14:33:19,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-01-23 14:33:19,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2018-01-23 14:33:19,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-01-23 14:33:19,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 164 transitions. [2018-01-23 14:33:19,176 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 164 transitions. Word has length 32 [2018-01-23 14:33:19,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:33:19,176 INFO L432 AbstractCegarLoop]: Abstraction has 148 states and 164 transitions. [2018-01-23 14:33:19,176 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-23 14:33:19,176 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 164 transitions. [2018-01-23 14:33:19,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-23 14:33:19,177 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:33:19,177 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:33:19,177 INFO L371 AbstractCegarLoop]: === Iteration 3 === [appendErr0EnsuresViolation]=== [2018-01-23 14:33:19,177 INFO L82 PathProgramCache]: Analyzing trace with hash 1281214885, now seen corresponding path program 1 times [2018-01-23 14:33:19,177 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:33:19,178 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:33:19,178 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:33:19,178 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:33:19,179 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:33:19,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:33:19,190 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:33:19,445 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-23 14:33:19,445 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:33:19,445 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-23 14:33:19,445 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-23 14:33:19,446 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-23 14:33:19,446 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-01-23 14:33:19,446 INFO L87 Difference]: Start difference. First operand 148 states and 164 transitions. Second operand 10 states. [2018-01-23 14:33:20,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:33:20,200 INFO L93 Difference]: Finished difference Result 301 states and 337 transitions. [2018-01-23 14:33:20,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-23 14:33:20,201 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 34 [2018-01-23 14:33:20,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:33:20,202 INFO L225 Difference]: With dead ends: 301 [2018-01-23 14:33:20,202 INFO L226 Difference]: Without dead ends: 161 [2018-01-23 14:33:20,202 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2018-01-23 14:33:20,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-01-23 14:33:20,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 158. [2018-01-23 14:33:20,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-01-23 14:33:20,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 175 transitions. [2018-01-23 14:33:20,208 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 175 transitions. Word has length 34 [2018-01-23 14:33:20,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:33:20,209 INFO L432 AbstractCegarLoop]: Abstraction has 158 states and 175 transitions. [2018-01-23 14:33:20,209 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-23 14:33:20,209 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 175 transitions. [2018-01-23 14:33:20,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-01-23 14:33:20,209 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:33:20,210 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 14:33:20,210 INFO L371 AbstractCegarLoop]: === Iteration 4 === [appendErr0EnsuresViolation]=== [2018-01-23 14:33:20,210 INFO L82 PathProgramCache]: Analyzing trace with hash -1389449951, now seen corresponding path program 1 times [2018-01-23 14:33:20,210 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:33:20,210 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:33:20,211 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:33:20,211 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:33:20,211 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:33:20,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:33:20,225 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:33:20,241 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-23 14:33:20,242 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:33:20,242 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-23 14:33:20,242 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-23 14:33:20,242 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-23 14:33:20,242 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-23 14:33:20,242 INFO L87 Difference]: Start difference. First operand 158 states and 175 transitions. Second operand 3 states. [2018-01-23 14:33:20,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:33:20,273 INFO L93 Difference]: Finished difference Result 312 states and 352 transitions. [2018-01-23 14:33:20,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-23 14:33:20,274 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-01-23 14:33:20,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:33:20,275 INFO L225 Difference]: With dead ends: 312 [2018-01-23 14:33:20,275 INFO L226 Difference]: Without dead ends: 172 [2018-01-23 14:33:20,276 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-23 14:33:20,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-01-23 14:33:20,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 162. [2018-01-23 14:33:20,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-01-23 14:33:20,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 179 transitions. [2018-01-23 14:33:20,281 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 179 transitions. Word has length 50 [2018-01-23 14:33:20,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:33:20,282 INFO L432 AbstractCegarLoop]: Abstraction has 162 states and 179 transitions. [2018-01-23 14:33:20,282 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-23 14:33:20,282 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 179 transitions. [2018-01-23 14:33:20,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-01-23 14:33:20,282 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:33:20,282 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:33:20,282 INFO L371 AbstractCegarLoop]: === Iteration 5 === [appendErr0EnsuresViolation]=== [2018-01-23 14:33:20,282 INFO L82 PathProgramCache]: Analyzing trace with hash 557657402, now seen corresponding path program 1 times [2018-01-23 14:33:20,283 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:33:20,283 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:33:20,283 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:33:20,283 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:33:20,283 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:33:20,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:33:20,295 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:33:20,327 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:33:20,328 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:33:20,328 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-23 14:33:20,346 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:33:20,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:33:20,385 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:33:20,466 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:33:20,499 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:33:20,500 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-01-23 14:33:20,500 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-23 14:33:20,500 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-23 14:33:20,500 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-01-23 14:33:20,500 INFO L87 Difference]: Start difference. First operand 162 states and 179 transitions. Second operand 5 states. [2018-01-23 14:33:20,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:33:20,531 INFO L93 Difference]: Finished difference Result 330 states and 370 transitions. [2018-01-23 14:33:20,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-23 14:33:20,532 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 57 [2018-01-23 14:33:20,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:33:20,533 INFO L225 Difference]: With dead ends: 330 [2018-01-23 14:33:20,533 INFO L226 Difference]: Without dead ends: 186 [2018-01-23 14:33:20,535 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-01-23 14:33:20,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-01-23 14:33:20,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 176. [2018-01-23 14:33:20,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-01-23 14:33:20,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 193 transitions. [2018-01-23 14:33:20,543 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 193 transitions. Word has length 57 [2018-01-23 14:33:20,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:33:20,544 INFO L432 AbstractCegarLoop]: Abstraction has 176 states and 193 transitions. [2018-01-23 14:33:20,544 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-23 14:33:20,544 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 193 transitions. [2018-01-23 14:33:20,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-01-23 14:33:20,544 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:33:20,545 INFO L322 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:33:20,545 INFO L371 AbstractCegarLoop]: === Iteration 6 === [appendErr0EnsuresViolation]=== [2018-01-23 14:33:20,545 INFO L82 PathProgramCache]: Analyzing trace with hash 1557925633, now seen corresponding path program 2 times [2018-01-23 14:33:20,545 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:33:20,545 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:33:20,546 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:33:20,546 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:33:20,546 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:33:20,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:33:20,562 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:33:20,612 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:33:20,613 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:33:20,613 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-23 14:33:20,625 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-23 14:33:20,651 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-23 14:33:20,656 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-23 14:33:20,661 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:33:20,714 WARN L1029 $PredicateComparison]: unable to prove that (exists ((|append_#t~malloc34.base| Int)) (and (= (select |c_old(#valid)| |append_#t~malloc34.base|) 0) (= |c_#valid| (store |c_old(#valid)| |append_#t~malloc34.base| 1)))) is different from true [2018-01-23 14:33:20,743 WARN L1029 $PredicateComparison]: unable to prove that (exists ((|create_data_#t~malloc3.base| Int)) (= |c_#valid| (store |c_old(#valid)| |create_data_#t~malloc3.base| 1))) is different from true [2018-01-23 14:33:20,759 WARN L1029 $PredicateComparison]: unable to prove that (exists ((|create_data_#t~malloc4.base| Int) (|create_data_#t~malloc3.base| Int)) (let ((.cse0 (store |c_old(#valid)| |create_data_#t~malloc3.base| 1))) (and (= (select .cse0 |create_data_#t~malloc4.base|) 0) (= |c_#valid| (store .cse0 |create_data_#t~malloc4.base| 1))))) is different from true [2018-01-23 14:33:20,839 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-01-23 14:33:20,872 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-23 14:33:20,873 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 9 [2018-01-23 14:33:20,873 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-23 14:33:20,873 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-23 14:33:20,874 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=21, Unknown=3, NotChecked=30, Total=72 [2018-01-23 14:33:20,874 INFO L87 Difference]: Start difference. First operand 176 states and 193 transitions. Second operand 9 states. [2018-01-23 14:33:21,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:33:21,049 INFO L93 Difference]: Finished difference Result 387 states and 435 transitions. [2018-01-23 14:33:21,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-23 14:33:21,050 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2018-01-23 14:33:21,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:33:21,052 INFO L225 Difference]: With dead ends: 387 [2018-01-23 14:33:21,052 INFO L226 Difference]: Without dead ends: 225 [2018-01-23 14:33:21,053 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=42, Unknown=9, NotChecked=48, Total=132 [2018-01-23 14:33:21,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-01-23 14:33:21,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 214. [2018-01-23 14:33:21,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2018-01-23 14:33:21,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 237 transitions. [2018-01-23 14:33:21,069 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 237 transitions. Word has length 64 [2018-01-23 14:33:21,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:33:21,069 INFO L432 AbstractCegarLoop]: Abstraction has 214 states and 237 transitions. [2018-01-23 14:33:21,069 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-23 14:33:21,070 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 237 transitions. [2018-01-23 14:33:21,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-01-23 14:33:21,070 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:33:21,071 INFO L322 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 14:33:21,071 INFO L371 AbstractCegarLoop]: === Iteration 7 === [appendErr0EnsuresViolation]=== [2018-01-23 14:33:21,071 INFO L82 PathProgramCache]: Analyzing trace with hash 922982711, now seen corresponding path program 1 times [2018-01-23 14:33:21,071 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:33:21,071 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:33:21,072 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:33:21,072 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-23 14:33:21,072 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:33:21,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:33:21,090 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:33:21,158 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-01-23 14:33:21,158 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:33:21,158 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-23 14:33:21,159 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-23 14:33:21,159 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-23 14:33:21,159 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-23 14:33:21,159 INFO L87 Difference]: Start difference. First operand 214 states and 237 transitions. Second operand 6 states. [2018-01-23 14:33:21,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:33:21,351 INFO L93 Difference]: Finished difference Result 460 states and 519 transitions. [2018-01-23 14:33:21,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-23 14:33:21,352 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 73 [2018-01-23 14:33:21,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:33:21,353 INFO L225 Difference]: With dead ends: 460 [2018-01-23 14:33:21,353 INFO L226 Difference]: Without dead ends: 264 [2018-01-23 14:33:21,354 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-01-23 14:33:21,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2018-01-23 14:33:21,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 222. [2018-01-23 14:33:21,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2018-01-23 14:33:21,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 245 transitions. [2018-01-23 14:33:21,365 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 245 transitions. Word has length 73 [2018-01-23 14:33:21,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:33:21,366 INFO L432 AbstractCegarLoop]: Abstraction has 222 states and 245 transitions. [2018-01-23 14:33:21,366 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-23 14:33:21,366 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 245 transitions. [2018-01-23 14:33:21,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-01-23 14:33:21,366 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:33:21,367 INFO L322 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 14:33:21,367 INFO L371 AbstractCegarLoop]: === Iteration 8 === [appendErr0EnsuresViolation]=== [2018-01-23 14:33:21,367 INFO L82 PathProgramCache]: Analyzing trace with hash 1270628311, now seen corresponding path program 1 times [2018-01-23 14:33:21,367 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:33:21,367 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:33:21,367 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:33:21,368 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:33:21,368 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:33:21,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:33:21,379 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:33:21,433 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-01-23 14:33:21,433 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:33:21,433 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-23 14:33:21,434 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-23 14:33:21,434 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-23 14:33:21,434 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-23 14:33:21,434 INFO L87 Difference]: Start difference. First operand 222 states and 245 transitions. Second operand 4 states. [2018-01-23 14:33:21,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:33:21,494 INFO L93 Difference]: Finished difference Result 434 states and 490 transitions. [2018-01-23 14:33:21,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-23 14:33:21,494 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2018-01-23 14:33:21,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:33:21,496 INFO L225 Difference]: With dead ends: 434 [2018-01-23 14:33:21,496 INFO L226 Difference]: Without dead ends: 230 [2018-01-23 14:33:21,497 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-23 14:33:21,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-01-23 14:33:21,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 228. [2018-01-23 14:33:21,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2018-01-23 14:33:21,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 247 transitions. [2018-01-23 14:33:21,512 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 247 transitions. Word has length 73 [2018-01-23 14:33:21,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:33:21,512 INFO L432 AbstractCegarLoop]: Abstraction has 228 states and 247 transitions. [2018-01-23 14:33:21,513 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-23 14:33:21,513 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 247 transitions. [2018-01-23 14:33:21,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-01-23 14:33:21,514 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:33:21,514 INFO L322 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 14:33:21,514 INFO L371 AbstractCegarLoop]: === Iteration 9 === [appendErr0EnsuresViolation]=== [2018-01-23 14:33:21,514 INFO L82 PathProgramCache]: Analyzing trace with hash -763042188, now seen corresponding path program 1 times [2018-01-23 14:33:21,514 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:33:21,515 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:33:21,515 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:33:21,515 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:33:21,516 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:33:21,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:33:21,538 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:33:21,632 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-01-23 14:33:21,632 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:33:21,633 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-23 14:33:21,633 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-23 14:33:21,633 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-23 14:33:21,633 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-01-23 14:33:21,634 INFO L87 Difference]: Start difference. First operand 228 states and 247 transitions. Second operand 6 states. [2018-01-23 14:33:21,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:33:21,699 INFO L93 Difference]: Finished difference Result 405 states and 438 transitions. [2018-01-23 14:33:21,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-23 14:33:21,700 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 75 [2018-01-23 14:33:21,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:33:21,701 INFO L225 Difference]: With dead ends: 405 [2018-01-23 14:33:21,701 INFO L226 Difference]: Without dead ends: 0 [2018-01-23 14:33:21,702 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-01-23 14:33:21,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-23 14:33:21,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-23 14:33:21,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-23 14:33:21,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-23 14:33:21,703 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 75 [2018-01-23 14:33:21,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:33:21,703 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-23 14:33:21,703 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-23 14:33:21,703 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-23 14:33:21,703 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-23 14:33:21,706 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.01 02:33:21 BoogieIcfgContainer [2018-01-23 14:33:21,706 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-23 14:33:21,707 INFO L168 Benchmark]: Toolchain (without parser) took 6247.04 ms. Allocated memory was 298.8 MB in the beginning and 547.9 MB in the end (delta: 249.0 MB). Free memory was 257.2 MB in the beginning and 437.0 MB in the end (delta: -179.9 MB). Peak memory consumption was 69.2 MB. Max. memory is 5.3 GB. [2018-01-23 14:33:21,708 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 298.8 MB. Free memory is still 263.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-23 14:33:21,708 INFO L168 Benchmark]: CACSL2BoogieTranslator took 230.36 ms. Allocated memory is still 298.8 MB. Free memory was 256.2 MB in the beginning and 245.0 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 5.3 GB. [2018-01-23 14:33:21,709 INFO L168 Benchmark]: Boogie Preprocessor took 38.98 ms. Allocated memory is still 298.8 MB. Free memory was 245.0 MB in the beginning and 243.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-23 14:33:21,709 INFO L168 Benchmark]: RCFGBuilder took 481.06 ms. Allocated memory is still 298.8 MB. Free memory was 243.0 MB in the beginning and 207.2 MB in the end (delta: 35.8 MB). Peak memory consumption was 35.8 MB. Max. memory is 5.3 GB. [2018-01-23 14:33:21,709 INFO L168 Benchmark]: TraceAbstraction took 5489.40 ms. Allocated memory was 298.8 MB in the beginning and 547.9 MB in the end (delta: 249.0 MB). Free memory was 207.2 MB in the beginning and 437.0 MB in the end (delta: -229.9 MB). Peak memory consumption was 19.2 MB. Max. memory is 5.3 GB. [2018-01-23 14:33:21,711 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.15 ms. Allocated memory is still 298.8 MB. Free memory is still 263.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 230.36 ms. Allocated memory is still 298.8 MB. Free memory was 256.2 MB in the beginning and 245.0 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 38.98 ms. Allocated memory is still 298.8 MB. Free memory was 245.0 MB in the beginning and 243.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 481.06 ms. Allocated memory is still 298.8 MB. Free memory was 243.0 MB in the beginning and 207.2 MB in the end (delta: 35.8 MB). Peak memory consumption was 35.8 MB. Max. memory is 5.3 GB. * TraceAbstraction took 5489.40 ms. Allocated memory was 298.8 MB in the beginning and 547.9 MB in the end (delta: 249.0 MB). Free memory was 207.2 MB in the beginning and 437.0 MB in the end (delta: -229.9 MB). Peak memory consumption was 19.2 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 540]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L587] FCALL struct node_t *list = ((void *)0); VAL [list={98:0}] [L588] int dataNotFinished = 0; VAL [dataNotFinished=0, list={98:0}] [L590] CALL append(&list) VAL [pointerToList={98:0}] [L577] EXPR, FCALL malloc(sizeof *node) VAL [malloc(sizeof *node)={85:0}, pointerToList={98:0}, pointerToList={98:0}] [L577] struct node_t *node = malloc(sizeof *node); VAL [malloc(sizeof *node)={85:0}, node={85:0}, pointerToList={98:0}, pointerToList={98:0}] [L578] EXPR, FCALL \read(**pointerToList) VAL [\read(**pointerToList)={0:0}, malloc(sizeof *node)={85:0}, node={85:0}, pointerToList={98:0}, pointerToList={98:0}] [L578] FCALL node->next = *pointerToList VAL [\read(**pointerToList)={0:0}, malloc(sizeof *node)={85:0}, node={85:0}, pointerToList={98:0}, pointerToList={98:0}] [L579] EXPR, FCALL \read(**pointerToList) VAL [\read(**pointerToList)={0:0}, malloc(sizeof *node)={85:0}, node={85:0}, pointerToList={98:0}, pointerToList={98:0}] [L579] COND TRUE *pointerToList == ((void *)0) [L580] CALL create_data(((void *)0)) VAL [prevData={0:0}] [L541] prevData != ((void *)0) && prevData->hasNextPartReference VAL [prevData={0:0}, prevData={0:0}, prevData != ((void *)0) && prevData->hasNextPartReference=0] [L541] COND FALSE !(prevData != ((void *)0) && prevData->hasNextPartReference) [L544] EXPR, FCALL malloc(sizeof *data) VAL [malloc(sizeof *data)={91:0}, prevData={0:0}, prevData={0:0}] [L544] Data data = malloc(sizeof *data); VAL [data={91:0}, malloc(sizeof *data)={91:0}, prevData={0:0}, prevData={0:0}] [L545] EXPR, FCALL malloc(20 * sizeof(data->array)) VAL [data={91:0}, malloc(20 * sizeof(data->array))={95:0}, malloc(sizeof *data)={91:0}, prevData={0:0}, prevData={0:0}] [L545] FCALL data->array = (int*) malloc(20 * sizeof(data->array)) VAL [data={91:0}, malloc(20 * sizeof(data->array))={95:0}, malloc(sizeof *data)={91:0}, prevData={0:0}, prevData={0:0}] [L546] int counter = 0; [L547] counter = 0 VAL [counter=0, data={91:0}, malloc(20 * sizeof(data->array))={95:0}, malloc(sizeof *data)={91:0}, prevData={0:0}, prevData={0:0}] [L547] COND TRUE counter < 3 VAL [counter=0, data={91:0}, malloc(20 * sizeof(data->array))={95:0}, malloc(sizeof *data)={91:0}, prevData={0:0}, prevData={0:0}] [L548] EXPR, FCALL data->array VAL [counter=0, data={91:0}, data->array={95:0}, malloc(20 * sizeof(data->array))={95:0}, malloc(sizeof *data)={91:0}, prevData={0:0}, prevData={0:0}] [L548] FCALL data->array[counter] = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, counter=0, data={91:0}, data->array={95:0}, malloc(20 * sizeof(data->array))={95:0}, malloc(sizeof *data)={91:0}, prevData={0:0}, prevData={0:0}] [L547] counter++ VAL [counter=1, data={91:0}, malloc(20 * sizeof(data->array))={95:0}, malloc(sizeof *data)={91:0}, prevData={0:0}, prevData={0:0}] [L547] COND TRUE counter < 3 VAL [counter=1, data={91:0}, malloc(20 * sizeof(data->array))={95:0}, malloc(sizeof *data)={91:0}, prevData={0:0}, prevData={0:0}] [L548] EXPR, FCALL data->array VAL [counter=1, data={91:0}, data->array={95:0}, malloc(20 * sizeof(data->array))={95:0}, malloc(sizeof *data)={91:0}, prevData={0:0}, prevData={0:0}] [L548] FCALL data->array[counter] = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, counter=1, data={91:0}, data->array={95:0}, malloc(20 * sizeof(data->array))={95:0}, malloc(sizeof *data)={91:0}, prevData={0:0}, prevData={0:0}] [L547] counter++ VAL [counter=2, data={91:0}, malloc(20 * sizeof(data->array))={95:0}, malloc(sizeof *data)={91:0}, prevData={0:0}, prevData={0:0}] [L547] COND TRUE counter < 3 VAL [counter=2, data={91:0}, malloc(20 * sizeof(data->array))={95:0}, malloc(sizeof *data)={91:0}, prevData={0:0}, prevData={0:0}] [L548] EXPR, FCALL data->array VAL [counter=2, data={91:0}, data->array={95:0}, malloc(20 * sizeof(data->array))={95:0}, malloc(sizeof *data)={91:0}, prevData={0:0}, prevData={0:0}] [L548] FCALL data->array[counter] = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, counter=2, data={91:0}, data->array={95:0}, malloc(20 * sizeof(data->array))={95:0}, malloc(sizeof *data)={91:0}, prevData={0:0}, prevData={0:0}] [L547] counter++ VAL [counter=3, data={91:0}, malloc(20 * sizeof(data->array))={95:0}, malloc(sizeof *data)={91:0}, prevData={0:0}, prevData={0:0}] [L547] COND FALSE !(counter < 3) VAL [counter=3, data={91:0}, malloc(20 * sizeof(data->array))={95:0}, malloc(sizeof *data)={91:0}, prevData={0:0}, prevData={0:0}] [L550] FCALL data->number = 0 VAL [counter=3, data={91:0}, malloc(20 * sizeof(data->array))={95:0}, malloc(sizeof *data)={91:0}, prevData={0:0}, prevData={0:0}] [L551] int userInput = __VERIFIER_nondet_int(); [L552] EXPR __VERIFIER_nondet_int() && data->number < 200 VAL [__VERIFIER_nondet_int()=0, __VERIFIER_nondet_int() && data->number < 200=0, counter=3, data={91:0}, malloc(20 * sizeof(data->array))={95:0}, malloc(sizeof *data)={91:0}, prevData={0:0}, prevData={0:0}, userInput=-200] [L552] EXPR __VERIFIER_nondet_int() && data->number < 200 && data->number > -200 VAL [__VERIFIER_nondet_int()=0, __VERIFIER_nondet_int() && data->number < 200=0, __VERIFIER_nondet_int() && data->number < 200 && data->number > -200=0, counter=3, data={91:0}, malloc(20 * sizeof(data->array))={95:0}, malloc(sizeof *data)={91:0}, prevData={0:0}, prevData={0:0}, userInput=-200] [L552] COND FALSE !(__VERIFIER_nondet_int() && data->number < 200 && data->number > -200 && userInput < 200 && userInput > -200) [L556] FCALL data->hasNextPartReference = 0 VAL [counter=3, data={91:0}, malloc(20 * sizeof(data->array))={95:0}, malloc(sizeof *data)={91:0}, prevData={0:0}, prevData={0:0}, userInput=-200] [L557] FCALL data->nextData = ((void *)0) VAL [counter=3, data={91:0}, malloc(20 * sizeof(data->array))={95:0}, malloc(sizeof *data)={91:0}, prevData={0:0}, prevData={0:0}, userInput=-200] [L558] Data origData = data; VAL [counter=3, data={91:0}, malloc(20 * sizeof(data->array))={95:0}, malloc(sizeof *data)={91:0}, origData={91:0}, prevData={0:0}, prevData={0:0}, userInput=-200] [L559] COND FALSE !(__VERIFIER_nondet_int()) [L570] return origData; VAL [\result={91:0}, counter=3, data={91:0}, malloc(20 * sizeof(data->array))={95:0}, malloc(sizeof *data)={91:0}, origData={91:0}, prevData={0:0}, prevData={0:0}, userInput=-200] - StatisticsResult: Ultimate Automizer benchmark data for error location: create_dataErr0EnsuresViolation CFG has 6 procedures, 131 locations, 6 error locations. UNSAFE Result, 1.6s OverallTime, 7 OverallIterations, 4 TraceHistogramMax, 0.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 671 SDtfs, 91 SDslu, 1054 SDs, 0 SdLazy, 73 SolverSat, 12 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 131 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=184occurred in iteration=6, 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.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 21 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 414 NumberOfCodeBlocks, 414 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 340 ConstructedInterpolants, 0 QuantifiedInterpolants, 22280 SizeOfPredicates, 2 NumberOfNonLiveVariables, 382 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 8 InterpolantComputations, 4 PerfectInterpolantSequences, 0/26 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - PositiveResult [Line: 572]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data for error location: freeDataErr0EnsuresViolation CFG has 6 procedures, 131 locations, 6 error locations. SAFE Result, 0.3s OverallTime, 5 OverallIterations, 1 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 667 SDtfs, 123 SDslu, 494 SDs, 0 SdLazy, 49 SolverSat, 8 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=170occurred in iteration=4, 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.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 250 NumberOfCodeBlocks, 250 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 245 ConstructedInterpolants, 0 QuantifiedInterpolants, 20021 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - CounterExampleResult [Line: 1]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.initErr0EnsuresViolation CFG has 6 procedures, 131 locations, 6 error locations. UNSAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=131occurred in iteration=0, 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: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 3 NumberOfCodeBlocks, 3 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - PositiveResult [Line: 1]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0EnsuresViolation CFG has 6 procedures, 131 locations, 6 error locations. SAFE Result, 0.3s OverallTime, 5 OverallIterations, 1 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 685 SDtfs, 123 SDslu, 512 SDs, 0 SdLazy, 49 SolverSat, 8 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=176occurred in iteration=4, 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.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 218 NumberOfCodeBlocks, 218 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 213 ConstructedInterpolants, 0 QuantifiedInterpolants, 16429 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - PositiveResult [Line: 586]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data for error location: mainErr0EnsuresViolation CFG has 6 procedures, 131 locations, 6 error locations. SAFE Result, 0.3s OverallTime, 5 OverallIterations, 1 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 679 SDtfs, 123 SDslu, 506 SDs, 0 SdLazy, 49 SolverSat, 8 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=174occurred in iteration=4, 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.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 208 NumberOfCodeBlocks, 208 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 203 ConstructedInterpolants, 0 QuantifiedInterpolants, 15341 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - PositiveResult [Line: 576]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data for error location: appendErr0EnsuresViolation CFG has 6 procedures, 131 locations, 6 error locations. SAFE Result, 2.6s OverallTime, 9 OverallIterations, 4 TraceHistogramMax, 1.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1003 SDtfs, 281 SDslu, 1965 SDs, 0 SdLazy, 450 SolverSat, 43 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 184 GetRequests, 134 SyntacticMatches, 3 SemanticMatches, 47 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=228occurred in iteration=8, 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.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 78 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 609 NumberOfCodeBlocks, 595 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 598 ConstructedInterpolants, 43 QuantifiedInterpolants, 112074 SizeOfPredicates, 4 NumberOfNonLiveVariables, 378 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 11 InterpolantComputations, 8 PerfectInterpolantSequences, 92/107 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/complex_data_creation_test02_true-valid-memsafety.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-23_14-33-21-721.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/complex_data_creation_test02_true-valid-memsafety.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-23_14-33-21-721.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/complex_data_creation_test02_true-valid-memsafety.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-1-2018-01-23_14-33-21-721.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/complex_data_creation_test02_true-valid-memsafety.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-2-2018-01-23_14-33-21-721.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/complex_data_creation_test02_true-valid-memsafety.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-3-2018-01-23_14-33-21-721.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/complex_data_creation_test02_true-valid-memsafety.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-4-2018-01-23_14-33-21-721.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/complex_data_creation_test02_true-valid-memsafety.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-5-2018-01-23_14-33-21-721.csv Received shutdown request...