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/list-ext-properties/960521-1_1_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2f49842 [2018-01-20 22:08:37,948 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-20 22:08:37,950 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-20 22:08:37,966 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-20 22:08:37,966 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-20 22:08:37,968 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-20 22:08:37,969 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-20 22:08:37,971 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-20 22:08:37,973 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-20 22:08:37,974 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-20 22:08:37,975 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-20 22:08:37,975 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-20 22:08:37,976 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-20 22:08:37,978 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-20 22:08:37,979 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-20 22:08:37,982 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-20 22:08:37,984 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-20 22:08:37,986 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-20 22:08:37,988 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-20 22:08:37,989 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-20 22:08:37,992 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-20 22:08:37,992 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-20 22:08:37,992 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-20 22:08:37,993 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-20 22:08:37,994 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-20 22:08:37,996 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-20 22:08:37,996 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-20 22:08:37,997 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-20 22:08:37,997 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-20 22:08:37,997 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-20 22:08:37,998 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-20 22:08:37,998 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-20 22:08:38,009 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-20 22:08:38,009 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-20 22:08:38,010 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-20 22:08:38,010 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-20 22:08:38,010 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-20 22:08:38,010 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-20 22:08:38,011 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-20 22:08:38,011 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-20 22:08:38,012 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-20 22:08:38,012 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-20 22:08:38,012 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-20 22:08:38,012 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-20 22:08:38,012 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-20 22:08:38,012 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-20 22:08:38,013 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-20 22:08:38,013 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-20 22:08:38,013 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-20 22:08:38,013 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-20 22:08:38,013 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-20 22:08:38,014 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-20 22:08:38,014 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-20 22:08:38,014 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-20 22:08:38,014 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-20 22:08:38,014 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-20 22:08:38,015 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-20 22:08:38,015 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-20 22:08:38,015 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-20 22:08:38,015 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-20 22:08:38,015 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-20 22:08:38,015 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-20 22:08:38,016 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-20 22:08:38,016 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-20 22:08:38,016 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-20 22:08:38,016 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-20 22:08:38,016 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-20 22:08:38,017 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-20 22:08:38,017 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-20 22:08:38,054 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-20 22:08:38,067 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-20 22:08:38,071 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-20 22:08:38,073 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-20 22:08:38,074 INFO L276 PluginConnector]: CDTParser initialized [2018-01-20 22:08:38,074 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext-properties/960521-1_1_true-valid-memsafety.i [2018-01-20 22:08:38,237 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-20 22:08:38,243 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-20 22:08:38,244 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-20 22:08:38,244 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-20 22:08:38,252 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-20 22:08:38,253 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.01 10:08:38" (1/1) ... [2018-01-20 22:08:38,257 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@560d234b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:08:38, skipping insertion in model container [2018-01-20 22:08:38,257 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.01 10:08:38" (1/1) ... [2018-01-20 22:08:38,278 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-20 22:08:38,320 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-20 22:08:38,464 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-20 22:08:38,479 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-20 22:08:38,484 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:08:38 WrapperNode [2018-01-20 22:08:38,485 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-20 22:08:38,485 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-20 22:08:38,485 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-20 22:08:38,485 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-20 22:08:38,503 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:08:38" (1/1) ... [2018-01-20 22:08:38,504 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:08:38" (1/1) ... [2018-01-20 22:08:38,515 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:08:38" (1/1) ... [2018-01-20 22:08:38,516 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:08:38" (1/1) ... [2018-01-20 22:08:38,520 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:08:38" (1/1) ... [2018-01-20 22:08:38,523 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:08:38" (1/1) ... [2018-01-20 22:08:38,524 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:08:38" (1/1) ... [2018-01-20 22:08:38,525 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-20 22:08:38,526 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-20 22:08:38,526 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-20 22:08:38,526 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-20 22:08:38,527 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:08:38" (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-20 22:08:38,570 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-20 22:08:38,570 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-20 22:08:38,571 INFO L136 BoogieDeclarations]: Found implementation of procedure foo [2018-01-20 22:08:38,571 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-20 22:08:38,571 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-20 22:08:38,571 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-20 22:08:38,571 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-20 22:08:38,571 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-20 22:08:38,571 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-20 22:08:38,571 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-20 22:08:38,571 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-20 22:08:38,572 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-20 22:08:38,572 INFO L128 BoogieDeclarations]: Found specification of procedure foo [2018-01-20 22:08:38,572 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-20 22:08:38,572 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-20 22:08:38,572 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-20 22:08:38,784 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-20 22:08:38,784 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.01 10:08:38 BoogieIcfgContainer [2018-01-20 22:08:38,785 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-20 22:08:38,786 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-20 22:08:38,786 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-20 22:08:38,788 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-20 22:08:38,788 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.01 10:08:38" (1/3) ... [2018-01-20 22:08:38,789 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14874ad1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.01 10:08:38, skipping insertion in model container [2018-01-20 22:08:38,789 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:08:38" (2/3) ... [2018-01-20 22:08:38,790 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14874ad1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.01 10:08:38, skipping insertion in model container [2018-01-20 22:08:38,790 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.01 10:08:38" (3/3) ... [2018-01-20 22:08:38,791 INFO L105 eAbstractionObserver]: Analyzing ICFG 960521-1_1_true-valid-memsafety.i [2018-01-20 22:08:38,799 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-20 22:08:38,805 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2018-01-20 22:08:38,857 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 22:08:38,857 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 22:08:38,857 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 22:08:38,857 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 22:08:38,857 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 22:08:38,858 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 22:08:38,858 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 22:08:38,858 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-20 22:08:38,861 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 22:08:38,879 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2018-01-20 22:08:38,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-20 22:08:38,885 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:08:38,886 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-20 22:08:38,886 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-20 22:08:38,890 INFO L82 PathProgramCache]: Analyzing trace with hash 104751, now seen corresponding path program 1 times [2018-01-20 22:08:38,892 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:08:38,892 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:08:38,935 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:08:38,935 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:08:38,935 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:08:38,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 22:08:38,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 22:08:39,008 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-20 22:08:39,017 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 22:08:39,030 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 22:08:39,030 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 22:08:39,030 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 22:08:39,030 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 22:08:39,030 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 22:08:39,030 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 22:08:39,031 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 22:08:39,031 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == fooErr0EnsuresViolation======== [2018-01-20 22:08:39,031 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 22:08:39,033 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2018-01-20 22:08:39,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-20 22:08:39,034 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:08:39,034 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:08:39,034 INFO L371 AbstractCegarLoop]: === Iteration 1 === [fooErr0EnsuresViolation]=== [2018-01-20 22:08:39,035 INFO L82 PathProgramCache]: Analyzing trace with hash -387558155, now seen corresponding path program 1 times [2018-01-20 22:08:39,035 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:08:39,035 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:08:39,036 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:08:39,037 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:08:39,037 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:08:39,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:08:39,062 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:08:39,102 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-20 22:08:39,104 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:08:39,104 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-20 22:08:39,106 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-20 22:08:39,120 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-20 22:08:39,120 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-20 22:08:39,123 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 2 states. [2018-01-20 22:08:39,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:08:39,228 INFO L93 Difference]: Finished difference Result 77 states and 89 transitions. [2018-01-20 22:08:39,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-20 22:08:39,230 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 19 [2018-01-20 22:08:39,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:08:39,236 INFO L225 Difference]: With dead ends: 77 [2018-01-20 22:08:39,236 INFO L226 Difference]: Without dead ends: 0 [2018-01-20 22:08:39,240 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-20 22:08:39,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-20 22:08:39,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-20 22:08:39,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-20 22:08:39,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-20 22:08:39,262 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 19 [2018-01-20 22:08:39,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:08:39,262 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-20 22:08:39,262 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-20 22:08:39,262 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-20 22:08:39,262 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-20 22:08:39,265 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 22:08:39,265 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 22:08:39,265 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 22:08:39,266 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 22:08:39,266 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 22:08:39,266 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 22:08:39,266 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 22:08:39,266 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-20 22:08:39,266 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 22:08:39,268 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2018-01-20 22:08:39,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-20 22:08:39,270 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:08:39,270 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:08:39,270 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 22:08:39,271 INFO L82 PathProgramCache]: Analyzing trace with hash 1865714460, now seen corresponding path program 1 times [2018-01-20 22:08:39,271 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:08:39,271 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:08:39,272 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:08:39,272 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:08:39,272 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:08:39,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:08:39,288 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:08:39,310 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-20 22:08:39,311 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:08:39,311 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-20 22:08:39,311 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-20 22:08:39,312 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-20 22:08:39,312 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-20 22:08:39,312 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 2 states. [2018-01-20 22:08:39,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:08:39,319 INFO L93 Difference]: Finished difference Result 77 states and 89 transitions. [2018-01-20 22:08:39,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-20 22:08:39,319 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 29 [2018-01-20 22:08:39,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:08:39,321 INFO L225 Difference]: With dead ends: 77 [2018-01-20 22:08:39,321 INFO L226 Difference]: Without dead ends: 40 [2018-01-20 22:08:39,322 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-20 22:08:39,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-01-20 22:08:39,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-01-20 22:08:39,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-01-20 22:08:39,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2018-01-20 22:08:39,334 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 29 [2018-01-20 22:08:39,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:08:39,334 INFO L432 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2018-01-20 22:08:39,334 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-20 22:08:39,334 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2018-01-20 22:08:39,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-20 22:08:39,336 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:08:39,336 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] [2018-01-20 22:08:39,336 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 22:08:39,336 INFO L82 PathProgramCache]: Analyzing trace with hash -880196222, now seen corresponding path program 1 times [2018-01-20 22:08:39,337 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:08:39,337 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:08:39,338 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:08:39,338 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:08:39,338 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:08:39,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:08:39,372 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:08:39,466 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-20 22:08:39,466 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:08:39,466 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-20 22:08:39,468 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-20 22:08:39,468 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-20 22:08:39,468 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-01-20 22:08:39,468 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand 5 states. [2018-01-20 22:08:39,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:08:39,568 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2018-01-20 22:08:39,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-20 22:08:39,569 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2018-01-20 22:08:39,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:08:39,570 INFO L225 Difference]: With dead ends: 45 [2018-01-20 22:08:39,570 INFO L226 Difference]: Without dead ends: 38 [2018-01-20 22:08:39,571 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-01-20 22:08:39,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-01-20 22:08:39,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-01-20 22:08:39,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-01-20 22:08:39,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2018-01-20 22:08:39,581 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 33 [2018-01-20 22:08:39,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:08:39,581 INFO L432 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2018-01-20 22:08:39,581 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-20 22:08:39,581 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2018-01-20 22:08:39,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-20 22:08:39,584 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:08:39,584 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] [2018-01-20 22:08:39,584 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 22:08:39,585 INFO L82 PathProgramCache]: Analyzing trace with hash -1506938106, now seen corresponding path program 1 times [2018-01-20 22:08:39,585 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:08:39,585 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:08:39,586 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:08:39,586 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:08:39,586 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:08:39,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:08:39,616 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:08:39,684 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-20 22:08:39,684 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:08:39,684 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-20 22:08:39,685 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-20 22:08:39,685 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-20 22:08:39,685 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-20 22:08:39,686 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand 5 states. [2018-01-20 22:08:39,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:08:39,752 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2018-01-20 22:08:39,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-20 22:08:39,753 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2018-01-20 22:08:39,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:08:39,757 INFO L225 Difference]: With dead ends: 65 [2018-01-20 22:08:39,757 INFO L226 Difference]: Without dead ends: 48 [2018-01-20 22:08:39,757 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-20 22:08:39,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-01-20 22:08:39,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 40. [2018-01-20 22:08:39,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-01-20 22:08:39,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 42 transitions. [2018-01-20 22:08:39,765 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 42 transitions. Word has length 33 [2018-01-20 22:08:39,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:08:39,765 INFO L432 AbstractCegarLoop]: Abstraction has 40 states and 42 transitions. [2018-01-20 22:08:39,765 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-20 22:08:39,765 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2018-01-20 22:08:39,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-20 22:08:39,767 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:08:39,767 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:08:39,767 INFO L371 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 22:08:39,767 INFO L82 PathProgramCache]: Analyzing trace with hash 1981787469, now seen corresponding path program 1 times [2018-01-20 22:08:39,767 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:08:39,767 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:08:39,768 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:08:39,768 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:08:39,768 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:08:39,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 22:08:39,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 22:08:39,833 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-20 22:08:39,844 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 22:08:39,851 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 22:08:39,854 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 22:08:39,855 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 22:08:39,871 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 22:08:39,872 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 22:08:39,872 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 22:08:39,872 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 22:08:39,872 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 22:08:39,872 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 22:08:39,872 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 22:08:39,872 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-20 22:08:39,873 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 22:08:39,874 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2018-01-20 22:08:39,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-20 22:08:39,875 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:08:39,875 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:08:39,876 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-20 22:08:39,876 INFO L82 PathProgramCache]: Analyzing trace with hash -1942190490, now seen corresponding path program 1 times [2018-01-20 22:08:39,876 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:08:39,876 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:08:39,877 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:08:39,877 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:08:39,877 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:08:39,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:08:39,884 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:08:39,894 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-20 22:08:39,894 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:08:39,895 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-20 22:08:39,895 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-20 22:08:39,895 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-20 22:08:39,895 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-20 22:08:39,896 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 2 states. [2018-01-20 22:08:39,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:08:39,901 INFO L93 Difference]: Finished difference Result 77 states and 89 transitions. [2018-01-20 22:08:39,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-20 22:08:39,901 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 27 [2018-01-20 22:08:39,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:08:39,902 INFO L225 Difference]: With dead ends: 77 [2018-01-20 22:08:39,902 INFO L226 Difference]: Without dead ends: 38 [2018-01-20 22:08:39,903 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-20 22:08:39,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-01-20 22:08:39,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-01-20 22:08:39,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-01-20 22:08:39,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2018-01-20 22:08:39,907 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 27 [2018-01-20 22:08:39,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:08:39,908 INFO L432 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2018-01-20 22:08:39,908 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-20 22:08:39,908 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2018-01-20 22:08:39,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-20 22:08:39,909 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:08:39,909 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] [2018-01-20 22:08:39,909 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation]=== [2018-01-20 22:08:39,910 INFO L82 PathProgramCache]: Analyzing trace with hash -215440820, now seen corresponding path program 1 times [2018-01-20 22:08:39,910 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:08:39,910 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:08:39,911 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:08:39,911 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:08:39,911 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:08:39,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:08:39,924 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:08:39,970 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-20 22:08:39,970 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:08:39,970 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-20 22:08:39,971 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-20 22:08:39,971 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-20 22:08:39,971 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-01-20 22:08:39,971 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand 5 states. [2018-01-20 22:08:40,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:08:40,029 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2018-01-20 22:08:40,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-20 22:08:40,030 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2018-01-20 22:08:40,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:08:40,031 INFO L225 Difference]: With dead ends: 41 [2018-01-20 22:08:40,031 INFO L226 Difference]: Without dead ends: 36 [2018-01-20 22:08:40,032 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-01-20 22:08:40,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-01-20 22:08:40,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-01-20 22:08:40,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-01-20 22:08:40,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2018-01-20 22:08:40,037 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 31 [2018-01-20 22:08:40,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:08:40,037 INFO L432 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2018-01-20 22:08:40,037 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-20 22:08:40,037 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-01-20 22:08:40,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-20 22:08:40,038 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:08:40,038 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] [2018-01-20 22:08:40,039 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation]=== [2018-01-20 22:08:40,039 INFO L82 PathProgramCache]: Analyzing trace with hash -211623728, now seen corresponding path program 1 times [2018-01-20 22:08:40,039 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:08:40,039 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:08:40,040 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:08:40,040 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:08:40,040 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:08:40,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:08:40,052 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:08:40,097 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-20 22:08:40,098 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:08:40,098 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-20 22:08:40,098 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-20 22:08:40,098 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-20 22:08:40,099 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-20 22:08:40,099 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 5 states. [2018-01-20 22:08:40,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:08:40,190 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2018-01-20 22:08:40,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-20 22:08:40,190 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2018-01-20 22:08:40,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:08:40,191 INFO L225 Difference]: With dead ends: 61 [2018-01-20 22:08:40,192 INFO L226 Difference]: Without dead ends: 46 [2018-01-20 22:08:40,192 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-20 22:08:40,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-01-20 22:08:40,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 38. [2018-01-20 22:08:40,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-01-20 22:08:40,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2018-01-20 22:08:40,198 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 31 [2018-01-20 22:08:40,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:08:40,198 INFO L432 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2018-01-20 22:08:40,198 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-20 22:08:40,198 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2018-01-20 22:08:40,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-20 22:08:40,200 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:08:40,200 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:08:40,200 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation]=== [2018-01-20 22:08:40,200 INFO L82 PathProgramCache]: Analyzing trace with hash 1396474071, now seen corresponding path program 1 times [2018-01-20 22:08:40,200 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:08:40,201 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:08:40,201 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:08:40,202 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:08:40,202 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:08:40,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:08:40,218 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:08:40,766 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-20 22:08:40,766 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:08:40,766 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-20 22:08:40,767 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-20 22:08:40,767 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-20 22:08:40,767 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-01-20 22:08:40,767 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand 9 states. [2018-01-20 22:08:41,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:08:41,014 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2018-01-20 22:08:41,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-20 22:08:41,014 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2018-01-20 22:08:41,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:08:41,014 INFO L225 Difference]: With dead ends: 38 [2018-01-20 22:08:41,014 INFO L226 Difference]: Without dead ends: 0 [2018-01-20 22:08:41,015 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2018-01-20 22:08:41,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-20 22:08:41,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-20 22:08:41,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-20 22:08:41,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-20 22:08:41,016 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 35 [2018-01-20 22:08:41,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:08:41,017 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-20 22:08:41,017 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-20 22:08:41,017 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-20 22:08:41,017 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-20 22:08:41,020 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.01 10:08:41 BoogieIcfgContainer [2018-01-20 22:08:41,020 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-20 22:08:41,021 INFO L168 Benchmark]: Toolchain (without parser) took 2783.44 ms. Allocated memory was 305.1 MB in the beginning and 478.7 MB in the end (delta: 173.5 MB). Free memory was 262.4 MB in the beginning and 386.7 MB in the end (delta: -124.3 MB). Peak memory consumption was 49.3 MB. Max. memory is 5.3 GB. [2018-01-20 22:08:41,023 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 305.1 MB. Free memory is still 268.4 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-20 22:08:41,023 INFO L168 Benchmark]: CACSL2BoogieTranslator took 241.09 ms. Allocated memory is still 305.1 MB. Free memory was 262.4 MB in the beginning and 252.5 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-01-20 22:08:41,023 INFO L168 Benchmark]: Boogie Preprocessor took 40.21 ms. Allocated memory is still 305.1 MB. Free memory was 252.5 MB in the beginning and 250.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-20 22:08:41,024 INFO L168 Benchmark]: RCFGBuilder took 259.17 ms. Allocated memory is still 305.1 MB. Free memory was 250.5 MB in the beginning and 233.9 MB in the end (delta: 16.6 MB). Peak memory consumption was 16.6 MB. Max. memory is 5.3 GB. [2018-01-20 22:08:41,024 INFO L168 Benchmark]: TraceAbstraction took 2234.63 ms. Allocated memory was 305.1 MB in the beginning and 478.7 MB in the end (delta: 173.5 MB). Free memory was 233.9 MB in the beginning and 386.7 MB in the end (delta: -152.8 MB). Peak memory consumption was 20.7 MB. Max. memory is 5.3 GB. [2018-01-20 22:08:41,026 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.22 ms. Allocated memory is still 305.1 MB. Free memory is still 268.4 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 241.09 ms. Allocated memory is still 305.1 MB. Free memory was 262.4 MB in the beginning and 252.5 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 40.21 ms. Allocated memory is still 305.1 MB. Free memory was 252.5 MB in the beginning and 250.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 259.17 ms. Allocated memory is still 305.1 MB. Free memory was 250.5 MB in the beginning and 233.9 MB in the end (delta: 16.6 MB). Peak memory consumption was 16.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 2234.63 ms. Allocated memory was 305.1 MB in the beginning and 478.7 MB in the end (delta: 173.5 MB). Free memory was 233.9 MB in the beginning and 386.7 MB in the end (delta: -152.8 MB). Peak memory consumption was 20.7 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) * 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: [L619] int *a, *b; [L620] int n; VAL [\old(a)=4, \old(a)=7, \old(b)=2, \old(b)=3, \old(n)=5, a={0:0}, b={0:0}, n=0] - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.initErr0EnsuresViolation CFG has 4 procedures, 44 locations, 4 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=44occurred 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: 622]: 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: fooErr0EnsuresViolation CFG has 4 procedures, 44 locations, 4 error locations. SAFE Result, 0.2s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 46 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=44occurred 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, 19 NumberOfCodeBlocks, 19 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 18 ConstructedInterpolants, 0 QuantifiedInterpolants, 324 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: [L619] int *a, *b; [L620] int n; VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={0:0}, b={0:0}, n=0] [L632] n = 1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={0:0}, b={0:0}, n=1] [L633] COND FALSE !(__VERIFIER_nondet_int() && n < 30) [L636] EXPR, FCALL malloc (n * sizeof(*a)) VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={0:0}, b={0:0}, malloc (n * sizeof(*a))={7:0}, n=1] [L636] a = malloc (n * sizeof(*a)) VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={0:0}, malloc (n * sizeof(*a))={7:0}, n=1] [L637] EXPR, FCALL malloc (n * sizeof(*b)) VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={0:0}, malloc (n * sizeof(*a))={7:0}, malloc (n * sizeof(*b))={13:0}, n=1] [L637] b = malloc (n * sizeof(*b)) [L638] EXPR b++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={13:4}, b++={13:0}, malloc (n * sizeof(*a))={7:0}, malloc (n * sizeof(*b))={13:0}, n=1] [L638] FCALL *b++ = n VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={13:4}, b++={13:0}, malloc (n * sizeof(*a))={7:0}, malloc (n * sizeof(*b))={13:0}, n=1] [L639] CALL foo () VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={13:4}, n=1] [L624] int i; [L625] i = 0 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={13:4}, i=0, n=1] [L625] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={13:4}, i=0, n=1] [L626] FCALL a[i] = n VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={13:4}, i=0, n=1] [L625] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={13:4}, i=1, n=1] [L625] COND FALSE !(i < n) VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={13:4}, i=1, n=1] [L627] i = 0 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={13:4}, i=0, n=1] [L627] COND FALSE, RET !(i < n - 1) VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={13:4}, i=0, n=1] [L639] foo () VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={13:4}, malloc (n * sizeof(*a))={7:0}, malloc (n * sizeof(*b))={13:0}, n=1] [L640] EXPR, FCALL b[-1] VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={13:4}, b[-1]=1, malloc (n * sizeof(*a))={7:0}, malloc (n * sizeof(*b))={13:0}, n=1] [L640] EXPR, FCALL b[n - 2] VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={13:4}, b[-1]=1, b[n - 2]=1, malloc (n * sizeof(*a))={7:0}, malloc (n * sizeof(*b))={13:0}, n=1] [L640] COND FALSE !(b[-1] - b[n - 2]) [L643] FCALL free(a) VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={13:4}, malloc (n * sizeof(*a))={7:0}, malloc (n * sizeof(*b))={13:0}, n=1] [L643] FCALL free(b-1) VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={13:4}, malloc (n * sizeof(*a))={7:0}, malloc (n * sizeof(*b))={13:0}, n=1] [L644] return 0; VAL [a={7:0}, b={13:4}, n=1] - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0EnsuresViolation CFG has 4 procedures, 44 locations, 4 error locations. UNSAFE Result, 0.6s OverallTime, 4 OverallIterations, 2 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 107 SDtfs, 74 SDslu, 114 SDs, 0 SdLazy, 67 SolverSat, 10 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=44occurred 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, 3 MinimizatonAttempts, 8 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 132 NumberOfCodeBlocks, 132 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 92 ConstructedInterpolants, 0 QuantifiedInterpolants, 4688 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - PositiveResult [Line: 630]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data for error location: mainErr0EnsuresViolation CFG has 4 procedures, 44 locations, 4 error locations. SAFE Result, 1.1s OverallTime, 4 OverallIterations, 2 TraceHistogramMax, 0.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 129 SDtfs, 97 SDslu, 149 SDs, 0 SdLazy, 239 SolverSat, 19 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 32 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=44occurred 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, 4 MinimizatonAttempts, 8 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 124 NumberOfCodeBlocks, 124 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 120 ConstructedInterpolants, 0 QuantifiedInterpolants, 14824 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 2/2 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/960521-1_1_true-valid-memsafety.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-20_22-08-41-035.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/960521-1_1_true-valid-memsafety.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-20_22-08-41-035.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/960521-1_1_true-valid-memsafety.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-1-2018-01-20_22-08-41-035.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/960521-1_1_true-valid-memsafety.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-2-2018-01-20_22-08-41-035.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/960521-1_1_true-valid-memsafety.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-3-2018-01-20_22-08-41-035.csv Received shutdown request...