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/heap-manipulation/dancing_true-unreach-call_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-47db877 [2018-01-23 14:49:09,127 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-23 14:49:09,128 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-23 14:49:09,143 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-23 14:49:09,144 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-23 14:49:09,145 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-23 14:49:09,146 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-23 14:49:09,147 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-23 14:49:09,150 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-23 14:49:09,150 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-23 14:49:09,151 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-23 14:49:09,152 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-23 14:49:09,153 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-23 14:49:09,154 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-23 14:49:09,155 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-23 14:49:09,157 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-23 14:49:09,160 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-23 14:49:09,162 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-23 14:49:09,163 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-23 14:49:09,164 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-23 14:49:09,166 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-23 14:49:09,167 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-23 14:49:09,167 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-23 14:49:09,168 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-23 14:49:09,168 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-23 14:49:09,170 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-23 14:49:09,170 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-23 14:49:09,170 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-23 14:49:09,171 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-23 14:49:09,171 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-23 14:49:09,171 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-23 14:49:09,172 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:49:09,180 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-23 14:49:09,180 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-23 14:49:09,181 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-23 14:49:09,181 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-23 14:49:09,181 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-23 14:49:09,181 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-23 14:49:09,181 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-23 14:49:09,182 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-23 14:49:09,182 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-23 14:49:09,182 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-23 14:49:09,182 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-23 14:49:09,183 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-23 14:49:09,183 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-23 14:49:09,183 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-23 14:49:09,183 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-23 14:49:09,183 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-23 14:49:09,183 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-23 14:49:09,183 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-23 14:49:09,184 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-23 14:49:09,184 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-23 14:49:09,184 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-23 14:49:09,184 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-23 14:49:09,184 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-23 14:49:09,184 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-23 14:49:09,185 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-23 14:49:09,185 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-23 14:49:09,185 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-23 14:49:09,185 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-23 14:49:09,185 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-23 14:49:09,185 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-23 14:49:09,186 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-23 14:49:09,186 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-23 14:49:09,186 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-23 14:49:09,186 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-23 14:49:09,186 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-23 14:49:09,187 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-23 14:49:09,187 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-23 14:49:09,219 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-23 14:49:09,230 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-23 14:49:09,233 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-23 14:49:09,234 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-23 14:49:09,234 INFO L276 PluginConnector]: CDTParser initialized [2018-01-23 14:49:09,235 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/heap-manipulation/dancing_true-unreach-call_false-valid-memtrack.i [2018-01-23 14:49:09,420 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-23 14:49:09,425 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-23 14:49:09,426 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-23 14:49:09,426 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-23 14:49:09,432 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-23 14:49:09,433 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.01 02:49:09" (1/1) ... [2018-01-23 14:49:09,435 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15e9c21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:49:09, skipping insertion in model container [2018-01-23 14:49:09,436 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.01 02:49:09" (1/1) ... [2018-01-23 14:49:09,448 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-23 14:49:09,488 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-23 14:49:09,608 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-23 14:49:09,626 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-23 14:49:09,634 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:49:09 WrapperNode [2018-01-23 14:49:09,634 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-23 14:49:09,635 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-23 14:49:09,635 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-23 14:49:09,636 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-23 14:49:09,653 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:49:09" (1/1) ... [2018-01-23 14:49:09,653 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:49:09" (1/1) ... [2018-01-23 14:49:09,663 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:49:09" (1/1) ... [2018-01-23 14:49:09,664 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:49:09" (1/1) ... [2018-01-23 14:49:09,668 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:49:09" (1/1) ... [2018-01-23 14:49:09,673 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:49:09" (1/1) ... [2018-01-23 14:49:09,675 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:49:09" (1/1) ... [2018-01-23 14:49:09,677 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-23 14:49:09,677 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-23 14:49:09,678 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-23 14:49:09,678 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-23 14:49:09,679 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:49:09" (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:49:09,725 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-23 14:49:09,725 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-23 14:49:09,725 INFO L136 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-01-23 14:49:09,725 INFO L136 BoogieDeclarations]: Found implementation of procedure remove [2018-01-23 14:49:09,725 INFO L136 BoogieDeclarations]: Found implementation of procedure re_insert [2018-01-23 14:49:09,726 INFO L136 BoogieDeclarations]: Found implementation of procedure is_list_containing_x [2018-01-23 14:49:09,726 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-23 14:49:09,726 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-23 14:49:09,726 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-23 14:49:09,726 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-23 14:49:09,726 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-23 14:49:09,726 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-23 14:49:09,726 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2018-01-23 14:49:09,726 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2018-01-23 14:49:09,727 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-23 14:49:09,727 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-01-23 14:49:09,727 INFO L128 BoogieDeclarations]: Found specification of procedure remove [2018-01-23 14:49:09,727 INFO L128 BoogieDeclarations]: Found specification of procedure re_insert [2018-01-23 14:49:09,727 INFO L128 BoogieDeclarations]: Found specification of procedure is_list_containing_x [2018-01-23 14:49:09,728 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-23 14:49:09,728 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-23 14:49:09,728 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-23 14:49:10,036 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-23 14:49:10,037 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.01 02:49:10 BoogieIcfgContainer [2018-01-23 14:49:10,037 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-23 14:49:10,039 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-23 14:49:10,039 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-23 14:49:10,041 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-23 14:49:10,041 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.01 02:49:09" (1/3) ... [2018-01-23 14:49:10,042 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ff134c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.01 02:49:10, skipping insertion in model container [2018-01-23 14:49:10,042 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:49:09" (2/3) ... [2018-01-23 14:49:10,043 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ff134c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.01 02:49:10, skipping insertion in model container [2018-01-23 14:49:10,043 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.01 02:49:10" (3/3) ... [2018-01-23 14:49:10,044 INFO L105 eAbstractionObserver]: Analyzing ICFG dancing_true-unreach-call_false-valid-memtrack.i [2018-01-23 14:49:10,051 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-23 14:49:10,058 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2018-01-23 14:49:10,096 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-23 14:49:10,097 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-23 14:49:10,097 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-23 14:49:10,097 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-23 14:49:10,097 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-23 14:49:10,097 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-23 14:49:10,097 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-23 14:49:10,097 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-23 14:49:10,098 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-23 14:49:10,115 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states. [2018-01-23 14:49:10,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-23 14:49:10,121 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:49:10,123 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-23 14:49:10,123 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-23 14:49:10,127 INFO L82 PathProgramCache]: Analyzing trace with hash 178905, now seen corresponding path program 1 times [2018-01-23 14:49:10,128 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:49:10,129 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:49:10,170 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:49:10,170 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:49:10,170 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:49:10,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-23 14:49:10,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-23 14:49:10,224 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-23 14:49:10,231 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-23 14:49:10,238 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-23 14:49:10,239 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-23 14:49:10,239 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-23 14:49:10,239 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-23 14:49:10,239 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-23 14:49:10,239 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-23 14:49:10,239 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-23 14:49:10,240 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == re_insertErr0EnsuresViolation======== [2018-01-23 14:49:10,240 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-23 14:49:10,243 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states. [2018-01-23 14:49:10,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-01-23 14:49:10,247 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:49:10,247 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] [2018-01-23 14:49:10,247 INFO L371 AbstractCegarLoop]: === Iteration 1 === [re_insertErr0EnsuresViolation]=== [2018-01-23 14:49:10,247 INFO L82 PathProgramCache]: Analyzing trace with hash -1611447727, now seen corresponding path program 1 times [2018-01-23 14:49:10,247 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:49:10,247 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:49:10,248 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:49:10,249 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:49:10,249 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:49:10,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:49:10,280 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:49:10,340 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:49:10,342 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:49:10,343 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-23 14:49:10,344 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-23 14:49:10,433 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-23 14:49:10,434 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-23 14:49:10,437 INFO L87 Difference]: Start difference. First operand 86 states. Second operand 2 states. [2018-01-23 14:49:10,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:49:10,468 INFO L93 Difference]: Finished difference Result 149 states and 181 transitions. [2018-01-23 14:49:10,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-23 14:49:10,469 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 39 [2018-01-23 14:49:10,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:49:10,477 INFO L225 Difference]: With dead ends: 149 [2018-01-23 14:49:10,477 INFO L226 Difference]: Without dead ends: 0 [2018-01-23 14:49:10,482 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:49:10,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-23 14:49:10,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-23 14:49:10,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-23 14:49:10,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-23 14:49:10,510 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 39 [2018-01-23 14:49:10,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:49:10,510 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-23 14:49:10,510 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-23 14:49:10,510 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-23 14:49:10,510 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-23 14:49:10,513 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-23 14:49:10,513 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-23 14:49:10,513 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-23 14:49:10,513 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-23 14:49:10,513 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-23 14:49:10,513 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-23 14:49:10,513 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-23 14:49:10,513 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-23 14:49:10,513 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-23 14:49:10,515 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states. [2018-01-23 14:49:10,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-01-23 14:49:10,518 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:49:10,518 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:10,518 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-23 14:49:10,518 INFO L82 PathProgramCache]: Analyzing trace with hash -715233718, now seen corresponding path program 1 times [2018-01-23 14:49:10,518 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:49:10,518 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:49:10,519 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:49:10,519 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:49:10,519 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:49:10,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:49:10,537 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:49:10,573 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-01-23 14:49:10,574 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:49:10,574 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-23 14:49:10,574 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-23 14:49:10,575 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-23 14:49:10,575 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-23 14:49:10,575 INFO L87 Difference]: Start difference. First operand 86 states. Second operand 2 states. [2018-01-23 14:49:10,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:49:10,586 INFO L93 Difference]: Finished difference Result 149 states and 181 transitions. [2018-01-23 14:49:10,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-23 14:49:10,587 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 56 [2018-01-23 14:49:10,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:49:10,591 INFO L225 Difference]: With dead ends: 149 [2018-01-23 14:49:10,591 INFO L226 Difference]: Without dead ends: 78 [2018-01-23 14:49:10,592 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:49:10,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-01-23 14:49:10,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-01-23 14:49:10,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-01-23 14:49:10,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 91 transitions. [2018-01-23 14:49:10,616 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 91 transitions. Word has length 56 [2018-01-23 14:49:10,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:49:10,616 INFO L432 AbstractCegarLoop]: Abstraction has 78 states and 91 transitions. [2018-01-23 14:49:10,617 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-23 14:49:10,617 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 91 transitions. [2018-01-23 14:49:10,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-01-23 14:49:10,620 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:49:10,621 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:10,621 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-23 14:49:10,621 INFO L82 PathProgramCache]: Analyzing trace with hash 675519653, now seen corresponding path program 1 times [2018-01-23 14:49:10,621 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:49:10,622 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:49:10,623 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:49:10,623 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:49:10,623 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:49:10,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-23 14:49:10,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-23 14:49:10,713 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-23 14:49:10,723 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-23 14:49:10,724 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-23 14:49:10,725 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-23 14:49:10,726 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-23 14:49:10,727 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-23 14:49:10,728 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-23 14:49:10,729 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-23 14:49:10,730 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-23 14:49:10,730 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-23 14:49:10,741 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-23 14:49:10,741 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-23 14:49:10,741 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-23 14:49:10,741 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-23 14:49:10,741 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-23 14:49:10,742 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-23 14:49:10,742 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-23 14:49:10,742 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-23 14:49:10,742 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-23 14:49:10,743 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states. [2018-01-23 14:49:10,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-01-23 14:49:10,745 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:49:10,746 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:49:10,746 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-23 14:49:10,746 INFO L82 PathProgramCache]: Analyzing trace with hash 1572438346, now seen corresponding path program 1 times [2018-01-23 14:49:10,746 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:49:10,746 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:49:10,747 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:49:10,747 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:49:10,747 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:49:10,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:49:10,757 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:49:10,780 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-01-23 14:49:10,780 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:49:10,780 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-23 14:49:10,781 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-23 14:49:10,781 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-23 14:49:10,781 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-23 14:49:10,782 INFO L87 Difference]: Start difference. First operand 86 states. Second operand 2 states. [2018-01-23 14:49:10,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:49:10,792 INFO L93 Difference]: Finished difference Result 149 states and 181 transitions. [2018-01-23 14:49:10,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-23 14:49:10,792 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 54 [2018-01-23 14:49:10,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:49:10,794 INFO L225 Difference]: With dead ends: 149 [2018-01-23 14:49:10,794 INFO L226 Difference]: Without dead ends: 76 [2018-01-23 14:49:10,795 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:49:10,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-01-23 14:49:10,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-01-23 14:49:10,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-01-23 14:49:10,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 89 transitions. [2018-01-23 14:49:10,803 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 89 transitions. Word has length 54 [2018-01-23 14:49:10,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:49:10,804 INFO L432 AbstractCegarLoop]: Abstraction has 76 states and 89 transitions. [2018-01-23 14:49:10,804 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-23 14:49:10,804 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 89 transitions. [2018-01-23 14:49:10,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-01-23 14:49:10,805 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:49:10,806 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:10,806 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation]=== [2018-01-23 14:49:10,806 INFO L82 PathProgramCache]: Analyzing trace with hash 362713701, now seen corresponding path program 1 times [2018-01-23 14:49:10,806 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:49:10,806 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:49:10,807 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:49:10,807 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:49:10,807 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:49:10,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:49:10,831 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:49:10,954 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-01-23 14:49:10,954 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:49:10,954 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-23 14:49:10,955 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-23 14:49:10,955 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-23 14:49:10,955 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-23 14:49:10,956 INFO L87 Difference]: Start difference. First operand 76 states and 89 transitions. Second operand 4 states. [2018-01-23 14:49:11,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:49:11,263 INFO L93 Difference]: Finished difference Result 96 states and 117 transitions. [2018-01-23 14:49:11,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-23 14:49:11,264 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2018-01-23 14:49:11,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:49:11,266 INFO L225 Difference]: With dead ends: 96 [2018-01-23 14:49:11,266 INFO L226 Difference]: Without dead ends: 79 [2018-01-23 14:49:11,268 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 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:49:11,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-01-23 14:49:11,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 78. [2018-01-23 14:49:11,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-01-23 14:49:11,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 91 transitions. [2018-01-23 14:49:11,278 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 91 transitions. Word has length 55 [2018-01-23 14:49:11,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:49:11,279 INFO L432 AbstractCegarLoop]: Abstraction has 78 states and 91 transitions. [2018-01-23 14:49:11,279 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-23 14:49:11,279 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 91 transitions. [2018-01-23 14:49:11,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-01-23 14:49:11,281 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:49:11,281 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:11,281 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation]=== [2018-01-23 14:49:11,282 INFO L82 PathProgramCache]: Analyzing trace with hash 2096216182, now seen corresponding path program 1 times [2018-01-23 14:49:11,282 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:49:11,282 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:49:11,283 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:49:11,283 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:49:11,283 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:49:11,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:49:11,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:49:11,341 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-01-23 14:49:11,341 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:49:11,342 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-23 14:49:11,342 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-23 14:49:11,342 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-23 14:49:11,342 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-23 14:49:11,343 INFO L87 Difference]: Start difference. First operand 78 states and 91 transitions. Second operand 4 states. [2018-01-23 14:49:11,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:49:11,378 INFO L93 Difference]: Finished difference Result 138 states and 161 transitions. [2018-01-23 14:49:11,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-23 14:49:11,379 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2018-01-23 14:49:11,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:49:11,380 INFO L225 Difference]: With dead ends: 138 [2018-01-23 14:49:11,380 INFO L226 Difference]: Without dead ends: 80 [2018-01-23 14:49:11,380 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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:49:11,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-01-23 14:49:11,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 78. [2018-01-23 14:49:11,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-01-23 14:49:11,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 90 transitions. [2018-01-23 14:49:11,387 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 90 transitions. Word has length 58 [2018-01-23 14:49:11,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:49:11,387 INFO L432 AbstractCegarLoop]: Abstraction has 78 states and 90 transitions. [2018-01-23 14:49:11,387 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-23 14:49:11,387 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 90 transitions. [2018-01-23 14:49:11,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-01-23 14:49:11,388 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:49:11,388 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:11,388 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation]=== [2018-01-23 14:49:11,388 INFO L82 PathProgramCache]: Analyzing trace with hash 1351865632, now seen corresponding path program 1 times [2018-01-23 14:49:11,389 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:49:11,389 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:49:11,389 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:49:11,389 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:49:11,389 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:49:11,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:49:11,402 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:49:11,523 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-23 14:49:11,523 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:49:11,523 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:49:11,537 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:49:11,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:49:11,590 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:49:11,623 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-23 14:49:11,624 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:49:11,626 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:49:11,627 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-23 14:49:11,638 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:49:11,639 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:49:11,641 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-23 14:49:11,641 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:49:11,642 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:49:11,643 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2018-01-23 14:49:11,671 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-23 14:49:11,704 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:49:11,704 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 9 [2018-01-23 14:49:11,704 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-23 14:49:11,705 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-23 14:49:11,705 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-01-23 14:49:11,705 INFO L87 Difference]: Start difference. First operand 78 states and 90 transitions. Second operand 9 states. [2018-01-23 14:49:12,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:49:12,070 INFO L93 Difference]: Finished difference Result 163 states and 200 transitions. [2018-01-23 14:49:12,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-23 14:49:12,070 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2018-01-23 14:49:12,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:49:12,073 INFO L225 Difference]: With dead ends: 163 [2018-01-23 14:49:12,073 INFO L226 Difference]: Without dead ends: 106 [2018-01-23 14:49:12,074 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 62 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2018-01-23 14:49:12,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-01-23 14:49:12,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 100. [2018-01-23 14:49:12,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-01-23 14:49:12,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 123 transitions. [2018-01-23 14:49:12,091 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 123 transitions. Word has length 64 [2018-01-23 14:49:12,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:49:12,092 INFO L432 AbstractCegarLoop]: Abstraction has 100 states and 123 transitions. [2018-01-23 14:49:12,092 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-23 14:49:12,092 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 123 transitions. [2018-01-23 14:49:12,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-01-23 14:49:12,093 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:49:12,093 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:12,094 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0EnsuresViolation]=== [2018-01-23 14:49:12,094 INFO L82 PathProgramCache]: Analyzing trace with hash 998777250, now seen corresponding path program 1 times [2018-01-23 14:49:12,094 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:49:12,094 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:49:12,095 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:49:12,095 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:49:12,095 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:49:12,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:49:12,118 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:49:12,472 WARN L146 SmtUtils]: Spent 122ms on a formula simplification. DAG size of input: 17 DAG size of output 16 [2018-01-23 14:49:12,610 WARN L146 SmtUtils]: Spent 111ms on a formula simplification. DAG size of input: 17 DAG size of output 16 [2018-01-23 14:49:12,874 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-01-23 14:49:12,874 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:49:12,874 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:49:12,882 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:49:12,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:49:12,925 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:49:13,003 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-23 14:49:13,005 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-23 14:49:13,005 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:49:13,007 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:49:13,009 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:49:13,009 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:10 [2018-01-23 14:49:13,186 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:49:13,218 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:49:13,218 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2018-01-23 14:49:13,219 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-23 14:49:13,219 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-23 14:49:13,219 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2018-01-23 14:49:13,220 INFO L87 Difference]: Start difference. First operand 100 states and 123 transitions. Second operand 21 states. [2018-01-23 14:49:53,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:49:53,472 INFO L93 Difference]: Finished difference Result 231 states and 281 transitions. [2018-01-23 14:49:53,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-01-23 14:49:53,472 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 64 [2018-01-23 14:49:53,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:49:53,474 INFO L225 Difference]: With dead ends: 231 [2018-01-23 14:49:53,474 INFO L226 Difference]: Without dead ends: 189 [2018-01-23 14:49:53,475 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 57 SyntacticMatches, 5 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 438 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=195, Invalid=1287, Unknown=0, NotChecked=0, Total=1482 [2018-01-23 14:49:53,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-01-23 14:49:53,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 157. [2018-01-23 14:49:53,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-01-23 14:49:53,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 197 transitions. [2018-01-23 14:49:53,498 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 197 transitions. Word has length 64 [2018-01-23 14:49:53,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:49:53,498 INFO L432 AbstractCegarLoop]: Abstraction has 157 states and 197 transitions. [2018-01-23 14:49:53,499 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-23 14:49:53,499 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 197 transitions. [2018-01-23 14:49:53,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-01-23 14:49:53,500 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:49:53,500 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:53,500 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0EnsuresViolation]=== [2018-01-23 14:49:53,501 INFO L82 PathProgramCache]: Analyzing trace with hash 970429150, now seen corresponding path program 1 times [2018-01-23 14:49:53,501 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:49:53,501 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:49:53,502 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:49:53,502 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:49:53,502 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:49:53,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:49:53,527 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:49:54,332 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-23 14:49:54,333 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:49:54,333 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:49:54,342 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:49:54,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:49:54,370 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:49:54,373 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-23 14:49:54,374 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:49:54,375 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:49:54,376 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-23 14:49:54,410 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:49:54,411 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:49:54,411 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-23 14:49:54,411 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:49:54,415 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:49:54,415 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2018-01-23 14:49:54,483 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-23 14:49:54,485 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-23 14:49:54,486 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:49:54,487 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:49:54,491 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:49:54,492 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:21 [2018-01-23 14:49:56,813 WARN L1029 $PredicateComparison]: unable to prove that (exists ((|remove_#t~mem4.base| Int) (|remove_#t~mem2.offset| Int)) (= |c_#memory_$Pointer$.base| (let ((.cse0 (select (select |c_old(#memory_$Pointer$.base)| |c_remove_#in~x.base|) (+ |c_remove_#in~x.offset| 4)))) (store |c_old(#memory_$Pointer$.base)| .cse0 (store (select |c_old(#memory_$Pointer$.base)| .cse0) |remove_#t~mem2.offset| |remove_#t~mem4.base|))))) is different from true [2018-01-23 14:49:56,823 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 38 [2018-01-23 14:49:56,825 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-01-23 14:49:56,825 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:49:56,830 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:49:56,834 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:49:56,834 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:44, output treesize:21 [2018-01-23 14:49:59,804 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:49:59,823 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:49:59,824 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 16] total 34 [2018-01-23 14:49:59,824 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-01-23 14:49:59,824 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-01-23 14:49:59,825 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=958, Unknown=2, NotChecked=62, Total=1122 [2018-01-23 14:49:59,825 INFO L87 Difference]: Start difference. First operand 157 states and 197 transitions. Second operand 34 states. Received shutdown request... [2018-01-23 14:50:26,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-23 14:50:26,861 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-23 14:50:26,865 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-23 14:50:26,865 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-23 14:50:26,865 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-23 14:50:26,865 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-23 14:50:26,866 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-23 14:50:26,866 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-23 14:50:26,866 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-23 14:50:26,866 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == is_list_containing_xErr0EnsuresViolation======== [2018-01-23 14:50:26,866 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-23 14:50:26,867 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states. [2018-01-23 14:50:26,868 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-23 14:50:26,869 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-23 14:50:26,869 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-23 14:50:26,869 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-23 14:50:26,869 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-23 14:50:26,869 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-23 14:50:26,869 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-23 14:50:26,869 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-23 14:50:26,870 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == __VERIFIER_assertErr0EnsuresViolation======== [2018-01-23 14:50:26,870 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-23 14:50:26,871 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states. [2018-01-23 14:50:26,871 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-23 14:50:26,872 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-23 14:50:26,872 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-23 14:50:26,872 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-23 14:50:26,872 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-23 14:50:26,872 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-23 14:50:26,872 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-23 14:50:26,872 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-23 14:50:26,872 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == removeErr0EnsuresViolation======== [2018-01-23 14:50:26,872 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-23 14:50:26,873 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states. [2018-01-23 14:50:26,873 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-23 14:50:26,874 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.01 02:50:26 BoogieIcfgContainer [2018-01-23 14:50:26,874 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-23 14:50:26,875 INFO L168 Benchmark]: Toolchain (without parser) took 77454.11 ms. Allocated memory was 305.7 MB in the beginning and 545.3 MB in the end (delta: 239.6 MB). Free memory was 265.6 MB in the beginning and 327.7 MB in the end (delta: -62.1 MB). Peak memory consumption was 177.5 MB. Max. memory is 5.3 GB. [2018-01-23 14:50:26,876 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 305.7 MB. Free memory is still 271.6 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-23 14:50:26,876 INFO L168 Benchmark]: CACSL2BoogieTranslator took 208.71 ms. Allocated memory is still 305.7 MB. Free memory was 264.6 MB in the beginning and 253.6 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 5.3 GB. [2018-01-23 14:50:26,876 INFO L168 Benchmark]: Boogie Preprocessor took 41.97 ms. Allocated memory is still 305.7 MB. Free memory was 253.6 MB in the beginning and 251.6 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:50:26,877 INFO L168 Benchmark]: RCFGBuilder took 360.15 ms. Allocated memory is still 305.7 MB. Free memory was 251.6 MB in the beginning and 227.6 MB in the end (delta: 24.0 MB). Peak memory consumption was 24.0 MB. Max. memory is 5.3 GB. [2018-01-23 14:50:26,877 INFO L168 Benchmark]: TraceAbstraction took 76835.46 ms. Allocated memory was 305.7 MB in the beginning and 545.3 MB in the end (delta: 239.6 MB). Free memory was 226.6 MB in the beginning and 327.7 MB in the end (delta: -101.1 MB). Peak memory consumption was 138.5 MB. Max. memory is 5.3 GB. [2018-01-23 14:50:26,879 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 305.7 MB. Free memory is still 271.6 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 208.71 ms. Allocated memory is still 305.7 MB. Free memory was 264.6 MB in the beginning and 253.6 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 41.97 ms. Allocated memory is still 305.7 MB. Free memory was 253.6 MB in the beginning and 251.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 360.15 ms. Allocated memory is still 305.7 MB. Free memory was 251.6 MB in the beginning and 227.6 MB in the end (delta: 24.0 MB). Peak memory consumption was 24.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 76835.46 ms. Allocated memory was 305.7 MB in the beginning and 545.3 MB in the end (delta: 239.6 MB). Free memory was 226.6 MB in the beginning and 327.7 MB in the end (delta: -101.1 MB). Peak memory consumption was 138.5 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) - 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) - 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) - 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: 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 7 procedures, 86 locations, 7 error locations. UNSAFE Result, 0.1s 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=86occurred 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: 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: re_insertErr0EnsuresViolation CFG has 7 procedures, 86 locations, 7 error locations. SAFE Result, 0.2s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 95 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=86occurred 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: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 39 NumberOfCodeBlocks, 39 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 38 ConstructedInterpolants, 0 QuantifiedInterpolants, 1444 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 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: [L589] FCALL struct node list; VAL [list={10:0}] [L590] FCALL list.L=0 VAL [list={10:0}] [L591] FCALL list.R=0 VAL [list={10:0}] [L592] struct node *x=&list, *tail=&list; VAL [list={10:0}, tail={10:0}, x={10:0}] [L593] COND FALSE !(__VERIFIER_nondet_bool()) [L604] CALL is_list_containing_x(&list, x) VAL [l={10:0}, x={10:0}] [L581] COND TRUE l==x [L582] RET return 1; VAL [\result=1, l={10:0}, l={10:0}, x={10:0}, x={10:0}] [L604] is_list_containing_x(&list, x) VAL [is_list_containing_x(&list, x)=1, list={10:0}, tail={10:0}, x={10:0}] [L605] CALL remove(x) VAL [x={10:0}] [L567] FCALL x->R VAL [x={10:0}, x={10:0}, x->R={0:0}] [L567] COND FALSE !(x->R) [L569] FCALL x->L VAL [x={10:0}, x={10:0}, x->L={0:0}] [L569] COND FALSE, RET !(x->L) [L605] remove(x) VAL [list={10:0}, tail={10:0}, x={10:0}] [L606] EXPR &list==x || !is_list_containing_x(&list, x) VAL [&list==x || !is_list_containing_x(&list, x)=1, list={10:0}, tail={10:0}, x={10:0}] [L606] CALL __VERIFIER_assert(&list==x || !is_list_containing_x(&list, x)) VAL [\old(cond)=1] [L5] COND FALSE, RET !(!(cond)) VAL [\old(cond)=1, cond=1] [L606] __VERIFIER_assert(&list==x || !is_list_containing_x(&list, x)) VAL [&list==x || !is_list_containing_x(&list, x)=1, list={10:0}, tail={10:0}, x={10:0}] [L607] CALL re_insert(x) VAL [x={10:0}] [L574] FCALL x->R VAL [x={10:0}, x={10:0}, x->R={0:0}] [L574] COND FALSE !(x->R) [L576] FCALL x->L VAL [x={10:0}, x={10:0}, x->L={0:0}] [L576] COND FALSE, RET !(x->L) [L607] re_insert(x) VAL [list={10:0}, tail={10:0}, x={10:0}] [L608] CALL, EXPR is_list_containing_x(&list, x) VAL [l={10:0}, x={10:0}] [L581] COND TRUE l==x [L582] RET return 1; VAL [\result=1, l={10:0}, l={10:0}, x={10:0}, x={10:0}] [L608] EXPR is_list_containing_x(&list, x) VAL [is_list_containing_x(&list, x)=1, list={10:0}, tail={10:0}, x={10:0}] [L608] CALL __VERIFIER_assert(is_list_containing_x(&list, x)) VAL [\old(cond)=1] [L5] COND FALSE, RET !(!(cond)) VAL [\old(cond)=1, cond=1] [L608] __VERIFIER_assert(is_list_containing_x(&list, x)) VAL [is_list_containing_x(&list, x)=1, list={10:0}, tail={10:0}, x={10:0}] [L609] return 0; VAL [\result=0, list={10:0}, tail={10:0}, x={10:0}] [L609] return 0; - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0EnsuresViolation CFG has 7 procedures, 86 locations, 7 error locations. UNSAFE Result, 0.2s OverallTime, 2 OverallIterations, 2 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 95 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=86occurred 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: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 113 NumberOfCodeBlocks, 113 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 55 ConstructedInterpolants, 0 QuantifiedInterpolants, 3025 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 8/8 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - TimeoutResultAtElement [Line: 587]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 587). Cancelled while BasicCegarLoop was constructing difference of abstraction (157states) and interpolant automaton (currently 15 states, 34 states before enhancement), while ReachableStatesComputation was computing reachable states (77 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data for error location: mainErr0EnsuresViolation CFG has 7 procedures, 86 locations, 7 error locations. TIMEOUT Result, 76.1s OverallTime, 6 OverallIterations, 2 TraceHistogramMax, 68.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 468 SDtfs, 576 SDslu, 1508 SDs, 0 SdLazy, 1971 SolverSat, 307 SolverUnsat, 31 SolverUnknown, 0 SolverNotchecked, 64.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 300 GetRequests, 184 SyntacticMatches, 15 SemanticMatches, 101 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 801 ImplicationChecksByTransitivity, 9.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=157occurred in iteration=5, 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, 41 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 7.6s InterpolantComputationTime, 559 NumberOfCodeBlocks, 559 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 550 ConstructedInterpolants, 21 QuantifiedInterpolants, 204206 SizeOfPredicates, 31 NumberOfNonLiveVariables, 653 ConjunctsInSsa, 87 ConjunctsInUnsatCore, 9 InterpolantComputations, 3 PerfectInterpolantSequences, 66/84 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - TimeoutResultAtElement [Line: 579]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 579). Cancelled while IsEmpty was searching accepting run (input had 86 states). - StatisticsResult: Ultimate Automizer benchmark data for error location: is_list_containing_xErr0EnsuresViolation CFG has 7 procedures, 86 locations, 7 error locations. TIMEOUT Result, 0.0s OverallTime, 0 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=86occurred 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: No data available, REUSE_STATISTICS: No data available - TimeoutResultAtElement [Line: 4]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 4). Cancelled while IsEmpty was searching accepting run (input had 86 states). - StatisticsResult: Ultimate Automizer benchmark data for error location: __VERIFIER_assertErr0EnsuresViolation CFG has 7 procedures, 86 locations, 7 error locations. TIMEOUT Result, 0.0s OverallTime, 0 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=86occurred 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: No data available, REUSE_STATISTICS: No data available - TimeoutResultAtElement [Line: 565]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 565). Cancelled while IsEmpty was searching accepting run (input had 86 states). - StatisticsResult: Ultimate Automizer benchmark data for error location: removeErr0EnsuresViolation CFG has 7 procedures, 86 locations, 7 error locations. TIMEOUT Result, 0.0s OverallTime, 0 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=86occurred 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: 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/dancing_true-unreach-call_false-valid-memtrack.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-23_14-50-26-889.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dancing_true-unreach-call_false-valid-memtrack.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-23_14-50-26-889.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dancing_true-unreach-call_false-valid-memtrack.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-1-2018-01-23_14-50-26-889.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dancing_true-unreach-call_false-valid-memtrack.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-2-2018-01-23_14-50-26-889.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dancing_true-unreach-call_false-valid-memtrack.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-3-2018-01-23_14-50-26-889.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dancing_true-unreach-call_false-valid-memtrack.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-4-2018-01-23_14-50-26-889.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dancing_true-unreach-call_false-valid-memtrack.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-5-2018-01-23_14-50-26-889.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dancing_true-unreach-call_false-valid-memtrack.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-6-2018-01-23_14-50-26-889.csv Completed graceful shutdown