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/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/memsafety/960521-1_false-valid-free.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-5f7ec6e [2018-01-31 10:00:37,372 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-31 10:00:37,374 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-31 10:00:37,392 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-31 10:00:37,392 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-31 10:00:37,393 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-31 10:00:37,394 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-31 10:00:37,397 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-31 10:00:37,399 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-31 10:00:37,400 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-31 10:00:37,401 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-31 10:00:37,402 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-31 10:00:37,403 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-31 10:00:37,404 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-31 10:00:37,405 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-31 10:00:37,415 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-31 10:00:37,417 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-31 10:00:37,419 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-31 10:00:37,420 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-31 10:00:37,421 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-31 10:00:37,423 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-31 10:00:37,423 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-31 10:00:37,423 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-31 10:00:37,424 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-31 10:00:37,425 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-31 10:00:37,427 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-31 10:00:37,427 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-31 10:00:37,427 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-31 10:00:37,428 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-31 10:00:37,428 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-31 10:00:37,428 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-31 10:00:37,429 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf [2018-01-31 10:00:37,438 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-31 10:00:37,439 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-31 10:00:37,441 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-31 10:00:37,442 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-31 10:00:37,442 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-31 10:00:37,442 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-31 10:00:37,442 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-31 10:00:37,443 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-31 10:00:37,443 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-31 10:00:37,443 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-31 10:00:37,443 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-31 10:00:37,443 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-31 10:00:37,444 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-31 10:00:37,444 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-31 10:00:37,444 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-31 10:00:37,444 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-31 10:00:37,444 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-31 10:00:37,445 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-31 10:00:37,445 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-31 10:00:37,445 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-31 10:00:37,445 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-31 10:00:37,445 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-31 10:00:37,446 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-31 10:00:37,446 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-31 10:00:37,446 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-31 10:00:37,446 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-31 10:00:37,446 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-31 10:00:37,447 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-31 10:00:37,447 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-31 10:00:37,447 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-31 10:00:37,447 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-31 10:00:37,447 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-31 10:00:37,448 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-31 10:00:37,448 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-31 10:00:37,499 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-31 10:00:37,514 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-31 10:00:37,518 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-31 10:00:37,519 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-31 10:00:37,520 INFO L276 PluginConnector]: CDTParser initialized [2018-01-31 10:00:37,521 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/960521-1_false-valid-free.i [2018-01-31 10:00:37,702 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-31 10:00:37,711 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-01-31 10:00:37,712 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-31 10:00:37,713 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-31 10:00:37,719 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-31 10:00:37,721 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 10:00:37" (1/1) ... [2018-01-31 10:00:37,725 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e1788b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 10:00:37, skipping insertion in model container [2018-01-31 10:00:37,725 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 10:00:37" (1/1) ... [2018-01-31 10:00:37,745 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-31 10:00:37,807 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-31 10:00:37,976 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-31 10:00:38,001 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-31 10:00:38,013 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 10:00:38 WrapperNode [2018-01-31 10:00:38,013 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-31 10:00:38,015 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-31 10:00:38,015 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-31 10:00:38,015 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-31 10:00:38,031 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 10:00:38" (1/1) ... [2018-01-31 10:00:38,032 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 10:00:38" (1/1) ... [2018-01-31 10:00:38,043 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 10:00:38" (1/1) ... [2018-01-31 10:00:38,044 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 10:00:38" (1/1) ... [2018-01-31 10:00:38,049 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 10:00:38" (1/1) ... [2018-01-31 10:00:38,059 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 10:00:38" (1/1) ... [2018-01-31 10:00:38,060 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 10:00:38" (1/1) ... [2018-01-31 10:00:38,067 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-31 10:00:38,068 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-31 10:00:38,068 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-31 10:00:38,068 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-31 10:00:38,069 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 10:00: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-31 10:00:38,129 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-31 10:00:38,129 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-31 10:00:38,130 INFO L136 BoogieDeclarations]: Found implementation of procedure foo [2018-01-31 10:00:38,130 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-31 10:00:38,130 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-31 10:00:38,130 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-31 10:00:38,130 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-31 10:00:38,130 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-31 10:00:38,131 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-31 10:00:38,131 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-31 10:00:38,131 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-31 10:00:38,131 INFO L128 BoogieDeclarations]: Found specification of procedure foo [2018-01-31 10:00:38,131 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-31 10:00:38,131 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-31 10:00:38,132 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-31 10:00:38,712 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-31 10:00:38,712 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 10:00:38 BoogieIcfgContainer [2018-01-31 10:00:38,747 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-31 10:00:38,747 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-01-31 10:00:38,747 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-01-31 10:00:38,748 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-01-31 10:00:38,753 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 10:00:38" (1/1) ... [2018-01-31 10:00:38,760 INFO L103 apSepIcfgTransformer]: HeapSepIcfgTransformer: Starting heap partitioning [2018-01-31 10:00:38,760 INFO L104 apSepIcfgTransformer]: To be partitioned heap arrays found [#memory_int] [2018-01-31 10:00:38,761 INFO L150 apSepIcfgTransformer]: starting freeze-var-style preprocessing [2018-01-31 10:00:38,817 INFO L162 apSepIcfgTransformer]: finished StoreIndexFreezer, created 13 freeze vars and freeze var literals (each corresponds to one heap write) [2018-01-31 10:00:38,855 INFO L221 apSepIcfgTransformer]: finished preprocessing for the equality analysis [2018-01-31 10:00:38,923 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-31 10:00:58,281 INFO L314 AbstractInterpreter]: Visited 73 different actions 193 times. Merged at 33 different actions 84 times. Widened at 1 different actions 3 times. Found 11 fixpoints after 5 different actions. Largest state had 67 variables. [2018-01-31 10:00:58,283 INFO L229 apSepIcfgTransformer]: finished equality analysis [2018-01-31 10:00:58,296 INFO L244 HeapSepPreAnalysis]: Number of read from array group [#memory_int] : 4 [2018-01-31 10:00:58,297 INFO L241 apSepIcfgTransformer]: Finished pre analysis before partitioning [2018-01-31 10:00:58,297 INFO L242 apSepIcfgTransformer]: array groups: Set: [#memory_int] [2018-01-31 10:00:58,297 INFO L244 apSepIcfgTransformer]: select infos: Set: ((select |v_#memory_int_2| v_~b.base_2), at (SUMMARY for call write~int(-1, ~b.base, ~b.offset + ~i~3 * 4, 4); srcloc: L627)) ((select (select |v_#memory_int_11| v_~b.base_18) (+ v_~b.offset_16 (- 4))), at (SUMMARY for call #t~mem8 := read~int(~b.base, ~b.offset + -4, 4); srcloc: L635')) ((select |v_#memory_int_4| v_~a.base_2), at (SUMMARY for call write~int(-1, ~a.base, ~a.offset + ~i~3 * 4, 4); srcloc: L625)) ((select |v_#memory_int_8| |v_main_#t~post6.base_3|), at (SUMMARY for call write~int(0, #t~post6.base, #t~post6.offset, 4); srcloc: L634'')) [2018-01-31 10:00:58,311 INFO L547 PartitionManager]: partitioning result: [2018-01-31 10:00:58,311 INFO L552 PartitionManager]: location blocks for array group [#memory_int] [2018-01-31 10:00:58,312 INFO L562 PartitionManager]: at dimension 0 [2018-01-31 10:00:58,312 INFO L563 PartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 4 [2018-01-31 10:00:58,312 INFO L564 PartitionManager]: # location blocks :3 [2018-01-31 10:00:58,312 INFO L562 PartitionManager]: at dimension 1 [2018-01-31 10:00:58,312 INFO L563 PartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 3 [2018-01-31 10:00:58,312 INFO L564 PartitionManager]: # location blocks :1 [2018-01-31 10:00:58,313 INFO L86 ransitionTransformer]: executing heap partitioning transformation [2018-01-31 10:00:58,334 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 31.01 10:00:58 BasicIcfg [2018-01-31 10:00:58,334 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-01-31 10:00:58,336 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-31 10:00:58,336 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-31 10:00:58,339 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-31 10:00:58,349 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 10:00:37" (1/4) ... [2018-01-31 10:00:58,350 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d465dd4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 10:00:58, skipping insertion in model container [2018-01-31 10:00:58,350 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 10:00:38" (2/4) ... [2018-01-31 10:00:58,350 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d465dd4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 10:00:58, skipping insertion in model container [2018-01-31 10:00:58,350 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 10:00:38" (3/4) ... [2018-01-31 10:00:58,351 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d465dd4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 10:00:58, skipping insertion in model container [2018-01-31 10:00:58,351 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 31.01 10:00:58" (4/4) ... [2018-01-31 10:00:58,352 INFO L107 eAbstractionObserver]: Analyzing ICFG HeapSeparatedIcfg [2018-01-31 10:00:58,362 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-31 10:00:58,368 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 17 error locations. [2018-01-31 10:00:58,500 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-31 10:00:58,501 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-31 10:00:58,501 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-31 10:00:58,501 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-31 10:00:58,501 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-31 10:00:58,501 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-31 10:00:58,501 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-31 10:00:58,502 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-31 10:00:58,502 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-31 10:00:58,518 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states. [2018-01-31 10:00:58,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-01-31 10:00:58,524 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 10:00:58,525 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 10:00:58,525 INFO L371 AbstractCegarLoop]: === Iteration 1 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-31 10:00:58,529 INFO L82 PathProgramCache]: Analyzing trace with hash 506698167, now seen corresponding path program 1 times [2018-01-31 10:00:58,531 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 10:00:58,531 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 10:00:58,572 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 10:00:58,572 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 10:00:58,572 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 10:00:58,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 10:00:58,631 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 10:00:58,797 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-31 10:00:58,798 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 10:00:58,799 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-31 10:00:58,800 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-31 10:00:58,807 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-31 10:00:58,807 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-31 10:00:58,809 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 5 states. [2018-01-31 10:00:59,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 10:00:59,257 INFO L93 Difference]: Finished difference Result 99 states and 110 transitions. [2018-01-31 10:00:59,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-31 10:00:59,259 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2018-01-31 10:00:59,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 10:00:59,270 INFO L225 Difference]: With dead ends: 99 [2018-01-31 10:00:59,270 INFO L226 Difference]: Without dead ends: 60 [2018-01-31 10:00:59,274 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-31 10:00:59,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-01-31 10:00:59,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-01-31 10:00:59,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-01-31 10:00:59,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2018-01-31 10:00:59,313 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 10 [2018-01-31 10:00:59,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 10:00:59,314 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2018-01-31 10:00:59,314 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-31 10:00:59,314 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2018-01-31 10:00:59,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-01-31 10:00:59,315 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 10:00:59,315 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 10:00:59,315 INFO L371 AbstractCegarLoop]: === Iteration 2 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-31 10:00:59,315 INFO L82 PathProgramCache]: Analyzing trace with hash 506698169, now seen corresponding path program 1 times [2018-01-31 10:00:59,315 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 10:00:59,316 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 10:00:59,317 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 10:00:59,317 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 10:00:59,317 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 10:00:59,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 10:00:59,332 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 10:00:59,468 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-31 10:00:59,469 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 10:00:59,469 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-31 10:00:59,470 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 10:00:59,471 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 10:00:59,471 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-31 10:00:59,471 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand 6 states. [2018-01-31 10:00:59,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 10:00:59,923 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2018-01-31 10:00:59,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-31 10:00:59,924 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2018-01-31 10:00:59,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 10:00:59,925 INFO L225 Difference]: With dead ends: 60 [2018-01-31 10:00:59,925 INFO L226 Difference]: Without dead ends: 59 [2018-01-31 10:00:59,926 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-01-31 10:00:59,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-01-31 10:00:59,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-01-31 10:00:59,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-01-31 10:00:59,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2018-01-31 10:00:59,936 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 10 [2018-01-31 10:00:59,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 10:00:59,936 INFO L432 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2018-01-31 10:00:59,936 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 10:00:59,936 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2018-01-31 10:00:59,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-31 10:00:59,937 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 10:00:59,937 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 10:00:59,937 INFO L371 AbstractCegarLoop]: === Iteration 3 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-31 10:00:59,938 INFO L82 PathProgramCache]: Analyzing trace with hash -1764679198, now seen corresponding path program 1 times [2018-01-31 10:00:59,938 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 10:00:59,938 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 10:00:59,939 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 10:00:59,939 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 10:00:59,939 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 10:00:59,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 10:00:59,967 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 10:01:00,625 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-31 10:01:00,625 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 10:01:00,625 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-31 10:01:00,626 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-31 10:01:00,626 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-31 10:01:00,626 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-01-31 10:01:00,626 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand 8 states. [2018-01-31 10:01:00,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 10:01:00,797 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2018-01-31 10:01:00,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-31 10:01:00,798 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2018-01-31 10:01:00,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 10:01:00,799 INFO L225 Difference]: With dead ends: 59 [2018-01-31 10:01:00,799 INFO L226 Difference]: Without dead ends: 55 [2018-01-31 10:01:00,799 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2018-01-31 10:01:00,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-01-31 10:01:00,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-01-31 10:01:00,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-01-31 10:01:00,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 58 transitions. [2018-01-31 10:01:00,806 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 58 transitions. Word has length 13 [2018-01-31 10:01:00,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 10:01:00,806 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 58 transitions. [2018-01-31 10:01:00,806 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-31 10:01:00,806 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2018-01-31 10:01:00,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-31 10:01:00,807 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 10:01:00,807 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 10:01:00,807 INFO L371 AbstractCegarLoop]: === Iteration 4 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-31 10:01:00,808 INFO L82 PathProgramCache]: Analyzing trace with hash -1158056983, now seen corresponding path program 1 times [2018-01-31 10:01:00,808 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 10:01:00,808 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 10:01:00,809 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 10:01:00,809 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 10:01:00,809 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 10:01:00,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 10:01:00,822 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 10:01:00,945 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-31 10:01:00,945 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 10:01:00,945 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-31 10:01:00,945 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-31 10:01:00,946 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-31 10:01:00,946 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-31 10:01:00,946 INFO L87 Difference]: Start difference. First operand 55 states and 58 transitions. Second operand 4 states. [2018-01-31 10:01:00,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 10:01:00,994 INFO L93 Difference]: Finished difference Result 59 states and 62 transitions. [2018-01-31 10:01:00,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-31 10:01:00,995 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-01-31 10:01:00,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 10:01:00,996 INFO L225 Difference]: With dead ends: 59 [2018-01-31 10:01:00,996 INFO L226 Difference]: Without dead ends: 57 [2018-01-31 10:01:00,996 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-31 10:01:00,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-01-31 10:01:01,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 53. [2018-01-31 10:01:01,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-01-31 10:01:01,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 56 transitions. [2018-01-31 10:01:01,002 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 56 transitions. Word has length 16 [2018-01-31 10:01:01,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 10:01:01,003 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 56 transitions. [2018-01-31 10:01:01,003 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-31 10:01:01,003 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 56 transitions. [2018-01-31 10:01:01,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-31 10:01:01,004 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 10:01:01,004 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 10:01:01,004 INFO L371 AbstractCegarLoop]: === Iteration 5 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-31 10:01:01,004 INFO L82 PathProgramCache]: Analyzing trace with hash -1158056981, now seen corresponding path program 1 times [2018-01-31 10:01:01,004 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 10:01:01,005 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 10:01:01,005 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 10:01:01,005 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 10:01:01,006 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 10:01:01,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 10:01:01,030 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 10:01:01,128 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-31 10:01:01,128 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 10:01:01,129 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-31 10:01:01,129 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-31 10:01:01,129 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-31 10:01:01,129 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-01-31 10:01:01,129 INFO L87 Difference]: Start difference. First operand 53 states and 56 transitions. Second operand 7 states. [2018-01-31 10:01:01,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 10:01:01,234 INFO L93 Difference]: Finished difference Result 53 states and 56 transitions. [2018-01-31 10:01:01,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-31 10:01:01,234 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2018-01-31 10:01:01,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 10:01:01,235 INFO L225 Difference]: With dead ends: 53 [2018-01-31 10:01:01,235 INFO L226 Difference]: Without dead ends: 50 [2018-01-31 10:01:01,235 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-01-31 10:01:01,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-01-31 10:01:01,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-01-31 10:01:01,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-01-31 10:01:01,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2018-01-31 10:01:01,241 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 16 [2018-01-31 10:01:01,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 10:01:01,241 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2018-01-31 10:01:01,242 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-31 10:01:01,242 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2018-01-31 10:01:01,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-31 10:01:01,243 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 10:01:01,243 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 10:01:01,243 INFO L371 AbstractCegarLoop]: === Iteration 6 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-31 10:01:01,243 INFO L82 PathProgramCache]: Analyzing trace with hash -1477104900, now seen corresponding path program 1 times [2018-01-31 10:01:01,243 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 10:01:01,243 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 10:01:01,244 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 10:01:01,244 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 10:01:01,244 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 10:01:01,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 10:01:01,259 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 10:01:01,442 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-31 10:01:01,443 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 10:01:01,443 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-31 10:01:01,443 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-31 10:01:01,444 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-31 10:01:01,444 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-01-31 10:01:01,444 INFO L87 Difference]: Start difference. First operand 50 states and 53 transitions. Second operand 7 states. [2018-01-31 10:01:01,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 10:01:01,692 INFO L93 Difference]: Finished difference Result 84 states and 89 transitions. [2018-01-31 10:01:01,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-31 10:01:01,693 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2018-01-31 10:01:01,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 10:01:01,694 INFO L225 Difference]: With dead ends: 84 [2018-01-31 10:01:01,694 INFO L226 Difference]: Without dead ends: 61 [2018-01-31 10:01:01,694 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-01-31 10:01:01,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-01-31 10:01:01,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 55. [2018-01-31 10:01:01,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-01-31 10:01:01,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 58 transitions. [2018-01-31 10:01:01,701 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 58 transitions. Word has length 17 [2018-01-31 10:01:01,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 10:01:01,701 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 58 transitions. [2018-01-31 10:01:01,701 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-31 10:01:01,701 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2018-01-31 10:01:01,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-31 10:01:01,702 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 10:01:01,702 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 10:01:01,702 INFO L371 AbstractCegarLoop]: === Iteration 7 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-31 10:01:01,703 INFO L82 PathProgramCache]: Analyzing trace with hash -1540027782, now seen corresponding path program 1 times [2018-01-31 10:01:01,703 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 10:01:01,703 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 10:01:01,704 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 10:01:01,704 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 10:01:01,704 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 10:01:01,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 10:01:01,716 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 10:01:01,806 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-31 10:01:01,806 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 10:01:01,806 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-31 10:01:01,806 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-31 10:01:01,807 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-31 10:01:01,807 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-01-31 10:01:01,807 INFO L87 Difference]: Start difference. First operand 55 states and 58 transitions. Second operand 8 states. [2018-01-31 10:01:01,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 10:01:01,946 INFO L93 Difference]: Finished difference Result 55 states and 58 transitions. [2018-01-31 10:01:01,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-31 10:01:01,946 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2018-01-31 10:01:01,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 10:01:01,947 INFO L225 Difference]: With dead ends: 55 [2018-01-31 10:01:01,947 INFO L226 Difference]: Without dead ends: 53 [2018-01-31 10:01:01,948 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2018-01-31 10:01:01,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-01-31 10:01:01,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-01-31 10:01:01,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-01-31 10:01:01,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 56 transitions. [2018-01-31 10:01:01,954 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 56 transitions. Word has length 17 [2018-01-31 10:01:01,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 10:01:01,954 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 56 transitions. [2018-01-31 10:01:01,954 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-31 10:01:01,955 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 56 transitions. [2018-01-31 10:01:01,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-31 10:01:01,955 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 10:01:01,955 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 10:01:01,955 INFO L371 AbstractCegarLoop]: === Iteration 8 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-31 10:01:01,956 INFO L82 PathProgramCache]: Analyzing trace with hash -1540027784, now seen corresponding path program 1 times [2018-01-31 10:01:01,956 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 10:01:01,956 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 10:01:01,957 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 10:01:01,957 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 10:01:01,957 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 10:01:01,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 10:01:01,968 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 10:01:02,119 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-31 10:01:02,120 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 10:01:02,120 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-31 10:01:02,120 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-31 10:01:02,120 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-31 10:01:02,121 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-31 10:01:02,121 INFO L87 Difference]: Start difference. First operand 53 states and 56 transitions. Second operand 8 states. [2018-01-31 10:01:02,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 10:01:02,264 INFO L93 Difference]: Finished difference Result 61 states and 64 transitions. [2018-01-31 10:01:02,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-31 10:01:02,265 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2018-01-31 10:01:02,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 10:01:02,265 INFO L225 Difference]: With dead ends: 61 [2018-01-31 10:01:02,266 INFO L226 Difference]: Without dead ends: 57 [2018-01-31 10:01:02,266 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2018-01-31 10:01:02,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-01-31 10:01:02,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 49. [2018-01-31 10:01:02,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-01-31 10:01:02,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2018-01-31 10:01:02,273 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 17 [2018-01-31 10:01:02,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 10:01:02,273 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2018-01-31 10:01:02,273 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-31 10:01:02,273 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2018-01-31 10:01:02,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-31 10:01:02,274 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 10:01:02,274 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 10:01:02,274 INFO L371 AbstractCegarLoop]: === Iteration 9 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-31 10:01:02,274 INFO L82 PathProgramCache]: Analyzing trace with hash -1539966088, now seen corresponding path program 1 times [2018-01-31 10:01:02,275 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 10:01:02,275 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 10:01:02,275 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 10:01:02,276 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 10:01:02,276 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 10:01:02,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-31 10:01:02,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-31 10:01:02,319 INFO L410 BasicCegarLoop]: Counterexample might be feasible [2018-01-31 10:01:02,325 INFO L84 mationBacktranslator]: Skipped ATE [293] [293] ULTIMATE.startENTRY-->L1: Formula: true InVars {} OutVars{~n=v_~n_4, #valid=|v_#valid_7|, ~a.base=v_~a.base_5, ~b.offset=v_~b.offset_4, #NULL.offset=|v_#NULL.offset_2|, ~a.offset=v_~a.offset_4, #NULL.base=|v_#NULL.base_2|, ~b.base=v_~b.base_5} AuxVars[] AssignedVars[~n, #valid, ~a.base, ~b.offset, #NULL.offset, ~a.offset, #NULL.base, ~b.base] [2018-01-31 10:01:02,325 INFO L84 mationBacktranslator]: Skipped ATE [299] [299] L1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-01-31 10:01:02,326 INFO L84 mationBacktranslator]: Skipped ATE [305] [305] mainENTRY-->L632: Formula: (= v_~n_8 128) InVars {} OutVars{~n=v_~n_8} AuxVars[] AssignedVars[~n] [2018-01-31 10:01:02,326 INFO L84 mationBacktranslator]: Skipped ATE [309] [309] L632-->L632': Formula: (and (= (store |v_#length_9| |v_main_#t~malloc4.base_1| (* 4 v_~n_9)) |v_#length_8|) (= (select |v_#valid_27| |v_main_#t~malloc4.base_1|) 0) (not (= |v_main_#t~malloc4.base_1| 0)) (= |v_main_#t~malloc4.offset_1| 0) (= |v_#valid_26| (store |v_#valid_27| |v_main_#t~malloc4.base_1| 1))) InVars {~n=v_~n_9, #length=|v_#length_9|, #valid=|v_#valid_27|} OutVars{~n=v_~n_9, #length=|v_#length_8|, main_#t~malloc4.base=|v_main_#t~malloc4.base_1|, #valid=|v_#valid_26|, main_#t~malloc4.offset=|v_main_#t~malloc4.offset_1|} AuxVars[] AssignedVars[#valid, #length, main_#t~malloc4.base, main_#t~malloc4.offset] [2018-01-31 10:01:02,326 INFO L84 mationBacktranslator]: Skipped ATE [313] [313] L632'-->L633: Formula: (and (= v_~a.base_13 |v_main_#t~malloc4.base_2|) (= v_~a.offset_12 |v_main_#t~malloc4.offset_2|)) InVars {main_#t~malloc4.base=|v_main_#t~malloc4.base_2|, main_#t~malloc4.offset=|v_main_#t~malloc4.offset_2|} OutVars{main_#t~malloc4.base=|v_main_#t~malloc4.base_2|, ~a.offset=v_~a.offset_12, ~a.base=v_~a.base_13, main_#t~malloc4.offset=|v_main_#t~malloc4.offset_2|} AuxVars[] AssignedVars[~a.base, ~a.offset] [2018-01-31 10:01:02,326 INFO L84 mationBacktranslator]: Skipped ATE [317] [317] L633-->L633': Formula: (and (not (= 0 |v_main_#t~malloc5.base_1|)) (= (store |v_#valid_29| |v_main_#t~malloc5.base_1| 1) |v_#valid_28|) (= |v_main_#t~malloc5.offset_1| 0) (= (store |v_#length_11| |v_main_#t~malloc5.base_1| (* 4 v_~n_10)) |v_#length_10|) (= 0 (select |v_#valid_29| |v_main_#t~malloc5.base_1|))) InVars {~n=v_~n_10, #length=|v_#length_11|, #valid=|v_#valid_29|} OutVars{main_#t~malloc5.offset=|v_main_#t~malloc5.offset_1|, ~n=v_~n_10, #length=|v_#length_10|, main_#t~malloc5.base=|v_main_#t~malloc5.base_1|, #valid=|v_#valid_28|} AuxVars[] AssignedVars[main_#t~malloc5.offset, #valid, #length, main_#t~malloc5.base] [2018-01-31 10:01:02,326 INFO L84 mationBacktranslator]: Skipped ATE [321] [321] L633'-->L634: Formula: (and (= v_~b.offset_13 |v_main_#t~malloc5.offset_2|) (= v_~b.base_15 |v_main_#t~malloc5.base_2|)) InVars {main_#t~malloc5.offset=|v_main_#t~malloc5.offset_2|, main_#t~malloc5.base=|v_main_#t~malloc5.base_2|} OutVars{main_#t~malloc5.offset=|v_main_#t~malloc5.offset_2|, main_#t~malloc5.base=|v_main_#t~malloc5.base_2|, ~b.base=v_~b.base_15, ~b.offset=v_~b.offset_13} AuxVars[] AssignedVars[~b.offset, ~b.base] [2018-01-31 10:01:02,326 INFO L84 mationBacktranslator]: Skipped ATE [325] [325] L634-->L634': Formula: (and (= |v_main_#t~post6.base_1| v_~b.base_16) (= |v_main_#t~post6.offset_1| v_~b.offset_14)) InVars {~b.base=v_~b.base_16, ~b.offset=v_~b.offset_14} OutVars{main_#t~post6.base=|v_main_#t~post6.base_1|, ~b.base=v_~b.base_16, ~b.offset=v_~b.offset_14, main_#t~post6.offset=|v_main_#t~post6.offset_1|} AuxVars[] AssignedVars[main_#t~post6.base, main_#t~post6.offset] [2018-01-31 10:01:02,326 INFO L84 mationBacktranslator]: Skipped ATE [327] [327] L634'-->L634'': Formula: (and (= v_~b.offset_15 (+ |v_main_#t~post6.offset_2| 4)) (= v_~b.base_17 |v_main_#t~post6.base_2|)) InVars {main_#t~post6.base=|v_main_#t~post6.base_2|, main_#t~post6.offset=|v_main_#t~post6.offset_2|} OutVars{~b.base=v_~b.base_17, main_#t~post6.base=|v_main_#t~post6.base_2|, ~b.offset=v_~b.offset_15, main_#t~post6.offset=|v_main_#t~post6.offset_2|} AuxVars[] AssignedVars[~b.offset, ~b.base] [2018-01-31 10:01:02,327 INFO L84 mationBacktranslator]: Skipped ATE [329] [329] L634''-->L634''': Formula: (and (<= 0 |v_main_#t~post6.offset_3|) (<= (+ |v_main_#t~post6.offset_3| 4) (select |v_#length_12| |v_main_#t~post6.base_3|)) (and (= |v_#memory_int_part_locs_76_locs_19_1| (store |v_#memory_int_part_locs_76_locs_19_2| |v_main_#t~post6.base_3| (store (select |v_#memory_int_part_locs_30_locs_19_2| |v_main_#t~post6.base_3|) |v_main_#t~post6.offset_3| 0))) (= |v_#memory_int_part_locs_40_locs_19_1| |v_#memory_int_part_locs_40_locs_19_2|) (= |v_#memory_int_part_locs_30_locs_19_1| |v_#memory_int_part_locs_30_locs_19_2|)) (= (select |v_#valid_30| |v_main_#t~post6.base_3|) 1)) InVars {#memory_int_part_locs_40_locs_19=|v_#memory_int_part_locs_40_locs_19_2|, #memory_int_part_locs_30_locs_19=|v_#memory_int_part_locs_30_locs_19_2|, #valid=|v_#valid_30|, #length=|v_#length_12|, #memory_int_part_locs_76_locs_19=|v_#memory_int_part_locs_76_locs_19_2|, main_#t~post6.base=|v_main_#t~post6.base_3|, main_#t~post6.offset=|v_main_#t~post6.offset_3|} OutVars{#memory_int_part_locs_40_locs_19=|v_#memory_int_part_locs_40_locs_19_1|, #memory_int_part_locs_30_locs_19=|v_#memory_int_part_locs_30_locs_19_1|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_7|, #length=|v_#length_12|, #memory_int_part_locs_76_locs_19=|v_#memory_int_part_locs_76_locs_19_1|, main_#t~post6.base=|v_main_#t~post6.base_3|, main_#t~post6.offset=|v_main_#t~post6.offset_3|} AuxVars[] AssignedVars[#memory_int_part_locs_40_locs_19, #memory_int_part_locs_30_locs_19, #memory_int, #memory_int_part_locs_76_locs_19] [2018-01-31 10:01:02,327 INFO L84 mationBacktranslator]: Skipped ATE [335] [335] L634'''-->L635: Formula: true InVars {} OutVars{main_#t~post6.base=|v_main_#t~post6.base_6|, main_#t~post6.offset=|v_main_#t~post6.offset_5|} AuxVars[] AssignedVars[main_#t~post6.base, main_#t~post6.offset] [2018-01-31 10:01:02,327 INFO L84 mationBacktranslator]: Skipped ATE [337] [337] L635-->L635': Formula: true InVars {} OutVars{#memory_int=|v_#memory_int_9|} AuxVars[] AssignedVars[#memory_int] [2018-01-31 10:01:02,327 INFO L84 mationBacktranslator]: Skipped ATE [341] [341] L635'-->L636: Formula: (and (<= v_~b.offset_16 (select |v_#length_14| v_~b.base_18)) (<= 4 v_~b.offset_16) (= 1 (select |v_#valid_32| v_~b.base_18)) (= |v_main_#t~mem8_5| (select (select |v_#memory_int_part_locs_76_locs_19_3| v_~b.base_18) (+ v_~b.offset_16 (- 4))))) InVars {#length=|v_#length_14|, #memory_int_part_locs_76_locs_19=|v_#memory_int_part_locs_76_locs_19_3|, ~b.base=v_~b.base_18, ~b.offset=v_~b.offset_16, #valid=|v_#valid_32|} OutVars{~b.offset=v_~b.offset_16, #valid=|v_#valid_32|, main_#t~mem8=|v_main_#t~mem8_5|, #length=|v_#length_14|, #memory_int_part_locs_76_locs_19=|v_#memory_int_part_locs_76_locs_19_3|, ~b.base=v_~b.base_18} AuxVars[] AssignedVars[main_#t~mem8] [2018-01-31 10:01:02,327 INFO L84 mationBacktranslator]: Skipped ATE [351] [351] L636-->L636'': Formula: (= |v_main_#t~mem8_3| 0) InVars {main_#t~mem8=|v_main_#t~mem8_3|} OutVars{main_#t~mem8=|v_main_#t~mem8_3|} AuxVars[] AssignedVars[] [2018-01-31 10:01:02,327 INFO L84 mationBacktranslator]: Skipped ATE [357] [357] L636''-->L639: Formula: true InVars {} OutVars{main_#t~mem8=|v_main_#t~mem8_4|} AuxVars[] AssignedVars[main_#t~mem8] [2018-01-31 10:01:02,328 INFO L84 mationBacktranslator]: Skipped ATE [369] [369] L639-->L639': Formula: (let ((.cse0 (= v_~a.base_11 0))) (and (= 0 v_~a.offset_10) (or .cse0 (= 1 (select |v_#valid_19| v_~a.base_11))) (or (= |v_#valid_19| |v_#valid_18|) (not .cse0)) (or (= |v_#valid_18| (store |v_#valid_19| v_~a.base_11 0)) .cse0))) InVars {~a.offset=v_~a.offset_10, #valid=|v_#valid_19|, ~a.base=v_~a.base_11} OutVars{~a.offset=v_~a.offset_10, #valid=|v_#valid_18|, ~a.base=v_~a.base_11} AuxVars[] AssignedVars[#valid] [2018-01-31 10:01:02,328 INFO L84 mationBacktranslator]: Skipped ATE [389] [389] L639'-->mainErr10RequiresViolation: Formula: (not (= v_~b.offset_12 0)) InVars {~b.offset=v_~b.offset_12} OutVars{~b.offset=v_~b.offset_12} AuxVars[] AssignedVars[] [2018-01-31 10:01:02,333 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 10:01:02 BasicIcfg [2018-01-31 10:01:02,333 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-31 10:01:02,335 INFO L168 Benchmark]: Toolchain (without parser) took 24631.44 ms. Allocated memory was 303.0 MB in the beginning and 1.6 GB in the end (delta: 1.2 GB). Free memory was 262.9 MB in the beginning and 1.3 GB in the end (delta: -988.6 MB). Peak memory consumption was 259.2 MB. Max. memory is 5.3 GB. [2018-01-31 10:01:02,335 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 303.0 MB. Free memory is still 268.9 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-31 10:01:02,335 INFO L168 Benchmark]: CACSL2BoogieTranslator took 301.37 ms. Allocated memory is still 303.0 MB. Free memory was 261.9 MB in the beginning and 251.9 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. [2018-01-31 10:01:02,336 INFO L168 Benchmark]: Boogie Preprocessor took 52.44 ms. Allocated memory is still 303.0 MB. Free memory was 251.9 MB in the beginning and 249.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-31 10:01:02,336 INFO L168 Benchmark]: RCFGBuilder took 678.92 ms. Allocated memory is still 303.0 MB. Free memory was 249.8 MB in the beginning and 230.8 MB in the end (delta: 19.0 MB). Peak memory consumption was 19.0 MB. Max. memory is 5.3 GB. [2018-01-31 10:01:02,336 INFO L168 Benchmark]: IcfgTransformer took 19587.48 ms. Allocated memory was 303.0 MB in the beginning and 1.5 GB in the end (delta: 1.1 GB). Free memory was 230.8 MB in the beginning and 462.3 MB in the end (delta: -231.4 MB). Peak memory consumption was 917.3 MB. Max. memory is 5.3 GB. [2018-01-31 10:01:02,337 INFO L168 Benchmark]: TraceAbstraction took 3997.45 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 99.1 MB). Free memory was 462.3 MB in the beginning and 1.3 GB in the end (delta: -789.3 MB). There was no memory consumed. Max. memory is 5.3 GB. [2018-01-31 10:01:02,345 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.18 ms. Allocated memory is still 303.0 MB. Free memory is still 268.9 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 301.37 ms. Allocated memory is still 303.0 MB. Free memory was 261.9 MB in the beginning and 251.9 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 52.44 ms. Allocated memory is still 303.0 MB. Free memory was 251.9 MB in the beginning and 249.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 678.92 ms. Allocated memory is still 303.0 MB. Free memory was 249.8 MB in the beginning and 230.8 MB in the end (delta: 19.0 MB). Peak memory consumption was 19.0 MB. Max. memory is 5.3 GB. * IcfgTransformer took 19587.48 ms. Allocated memory was 303.0 MB in the beginning and 1.5 GB in the end (delta: 1.1 GB). Free memory was 230.8 MB in the beginning and 462.3 MB in the end (delta: -231.4 MB). Peak memory consumption was 917.3 MB. Max. memory is 5.3 GB. * TraceAbstraction took 3997.45 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 99.1 MB). Free memory was 462.3 MB in the beginning and 1.3 GB in the end (delta: -789.3 MB). There was no memory consumed. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 55 LocStat_MAX_WEQGRAPH_SIZE : 4 LocStat_MAX_SIZEOF_WEQEDGELABEL : 2 LocStat_NO_SUPPORTING_EQUALITIES : 1891 LocStat_NO_SUPPORTING_DISEQUALITIES : 1767 LocStat_NO_DISJUNCTIONS : -110 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 82 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 247 TransStat_NO_SUPPORTING_DISEQUALITIES : 30 TransStat_NO_DISJUNCTIONS : 96 TransStat_MAX_NO_DISJUNCTIONS : 4 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.009730 RENAME_VARIABLES(MILLISECONDS) : 2.059534 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.001208 PROJECTAWAY(MILLISECONDS) : 0.298377 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.078774 DISJOIN(MILLISECONDS) : 1.326028 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 2.093541 ADD_EQUALITY(MILLISECONDS) : 0.032890 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.022164 #CONJOIN_DISJUNCTIVE : 332 #RENAME_VARIABLES : 702 #UNFREEZE : 0 #CONJOIN : 691 #PROJECTAWAY : 422 #ADD_WEAK_EQUALITY : 15 #DISJOIN : 86 #RENAME_VARIABLES_DISJUNCTIVE : 666 #ADD_EQUALITY : 206 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 24 * Results from de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation: - StatisticsResult: HeapSeparatorStatistics #COUNT_NEW_ARRAY_VARS_[#memory_int] : 3 COUNT_ARRAY_WRITES_for_[#memory_int]_at_dim_0 : 4 COUNT_BLOCKS_for_[#memory_int]_at_dim_0 : 3 COUNT_ARRAY_WRITES_for_[#memory_int]_at_dim_1 : 3 COUNT_BLOCKS_for_[#memory_int]_at_dim_1 : 1 COUNT_ARRAY_READS for [#memory_int] : 4 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1]: free of unallocated memory possible free of unallocated memory possible We found a FailurePath: - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 66 locations, 17 error locations. UNSAFE Result, 3.8s OverallTime, 9 OverallIterations, 1 TraceHistogramMax, 1.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 355 SDtfs, 611 SDslu, 788 SDs, 0 SdLazy, 475 SolverSat, 74 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 77 GetRequests, 9 SyntacticMatches, 4 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=66occurred 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, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 18 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 133 NumberOfCodeBlocks, 133 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 108 ConstructedInterpolants, 0 QuantifiedInterpolants, 12290 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: 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_false-valid-free.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-Benchmark-0-2018-01-31_10-01-02-363.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/960521-1_false-valid-free.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-VPDomainBenchmark-0-2018-01-31_10-01-02-363.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/960521-1_false-valid-free.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-BenchmarkWithCounters-0-2018-01-31_10-01-02-363.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/960521-1_false-valid-free.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-HeapSeparatorBenchmark-0-2018-01-31_10-01-02-363.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/960521-1_false-valid-free.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-31_10-01-02-363.csv Received shutdown request...