java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ.epf -i ../../../trunk/examples/svcomp/memsafety/test-0234_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 12:00:00,727 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 12:00:00,729 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 12:00:00,744 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 12:00:00,744 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 12:00:00,745 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 12:00:00,747 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 12:00:00,749 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 12:00:00,751 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 12:00:00,752 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 12:00:00,752 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 12:00:00,753 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 12:00:00,754 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 12:00:00,755 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 12:00:00,756 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 12:00:00,759 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 12:00:00,761 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 12:00:00,764 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 12:00:00,765 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 12:00:00,766 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 12:00:00,769 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 12:00:00,769 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 12:00:00,769 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 12:00:00,770 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 12:00:00,771 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 12:00:00,772 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 12:00:00,773 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 12:00:00,773 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 12:00:00,774 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 12:00:00,774 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 12:00:00,775 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 12:00:00,775 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ.epf [2018-01-24 12:00:00,786 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 12:00:00,786 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 12:00:00,787 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 12:00:00,787 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 12:00:00,787 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 12:00:00,788 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 12:00:00,788 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 12:00:00,789 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 12:00:00,789 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 12:00:00,789 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 12:00:00,789 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 12:00:00,789 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 12:00:00,790 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 12:00:00,790 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 12:00:00,790 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 12:00:00,790 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 12:00:00,790 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 12:00:00,791 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 12:00:00,791 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 12:00:00,791 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 12:00:00,791 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 12:00:00,791 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 12:00:00,792 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 12:00:00,792 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 12:00:00,792 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 12:00:00,792 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 12:00:00,793 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 12:00:00,793 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 12:00:00,793 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-24 12:00:00,793 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 12:00:00,793 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 12:00:00,793 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 12:00:00,794 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 12:00:00,795 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 12:00:00,831 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 12:00:00,843 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 12:00:00,847 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 12:00:00,849 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 12:00:00,849 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 12:00:00,850 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/test-0234_true-valid-memsafety.i [2018-01-24 12:00:01,057 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 12:00:01,063 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 12:00:01,065 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 12:00:01,065 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 12:00:01,071 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 12:00:01,072 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 12:00:01" (1/1) ... [2018-01-24 12:00:01,076 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c6a7c09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:00:01, skipping insertion in model container [2018-01-24 12:00:01,076 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 12:00:01" (1/1) ... [2018-01-24 12:00:01,098 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 12:00:01,147 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 12:00:01,295 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 12:00:01,331 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 12:00:01,351 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:00:01 WrapperNode [2018-01-24 12:00:01,352 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 12:00:01,353 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 12:00:01,353 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 12:00:01,353 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 12:00:01,367 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:00:01" (1/1) ... [2018-01-24 12:00:01,367 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:00:01" (1/1) ... [2018-01-24 12:00:01,381 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:00:01" (1/1) ... [2018-01-24 12:00:01,382 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:00:01" (1/1) ... [2018-01-24 12:00:01,391 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:00:01" (1/1) ... [2018-01-24 12:00:01,397 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:00:01" (1/1) ... [2018-01-24 12:00:01,399 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:00:01" (1/1) ... [2018-01-24 12:00:01,403 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 12:00:01,404 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 12:00:01,404 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 12:00:01,404 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 12:00:01,405 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:00:01" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 12:00:01,458 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 12:00:01,458 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 12:00:01,459 INFO L136 BoogieDeclarations]: Found implementation of procedure calloc_model [2018-01-24 12:00:01,459 INFO L136 BoogieDeclarations]: Found implementation of procedure zalloc_or_die [2018-01-24 12:00:01,459 INFO L136 BoogieDeclarations]: Found implementation of procedure l4_insert [2018-01-24 12:00:01,459 INFO L136 BoogieDeclarations]: Found implementation of procedure l3_insert [2018-01-24 12:00:01,459 INFO L136 BoogieDeclarations]: Found implementation of procedure l2_insert [2018-01-24 12:00:01,459 INFO L136 BoogieDeclarations]: Found implementation of procedure l1_insert [2018-01-24 12:00:01,460 INFO L136 BoogieDeclarations]: Found implementation of procedure l0_insert [2018-01-24 12:00:01,460 INFO L136 BoogieDeclarations]: Found implementation of procedure l4_destroy [2018-01-24 12:00:01,460 INFO L136 BoogieDeclarations]: Found implementation of procedure l3_destroy [2018-01-24 12:00:01,460 INFO L136 BoogieDeclarations]: Found implementation of procedure l2_destroy [2018-01-24 12:00:01,460 INFO L136 BoogieDeclarations]: Found implementation of procedure l1_destroy [2018-01-24 12:00:01,460 INFO L136 BoogieDeclarations]: Found implementation of procedure l0_destroy [2018-01-24 12:00:01,461 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 12:00:01,461 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-24 12:00:01,461 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-24 12:00:01,461 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 12:00:01,461 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 12:00:01,461 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 12:00:01,461 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2018-01-24 12:00:01,462 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2018-01-24 12:00:01,462 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-24 12:00:01,462 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-24 12:00:01,462 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-01-24 12:00:01,462 INFO L128 BoogieDeclarations]: Found specification of procedure memset [2018-01-24 12:00:01,463 INFO L128 BoogieDeclarations]: Found specification of procedure calloc_model [2018-01-24 12:00:01,463 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 12:00:01,463 INFO L128 BoogieDeclarations]: Found specification of procedure zalloc_or_die [2018-01-24 12:00:01,463 INFO L128 BoogieDeclarations]: Found specification of procedure l4_insert [2018-01-24 12:00:01,463 INFO L128 BoogieDeclarations]: Found specification of procedure l3_insert [2018-01-24 12:00:01,463 INFO L128 BoogieDeclarations]: Found specification of procedure l2_insert [2018-01-24 12:00:01,464 INFO L128 BoogieDeclarations]: Found specification of procedure l1_insert [2018-01-24 12:00:01,464 INFO L128 BoogieDeclarations]: Found specification of procedure l0_insert [2018-01-24 12:00:01,464 INFO L128 BoogieDeclarations]: Found specification of procedure l4_destroy [2018-01-24 12:00:01,464 INFO L128 BoogieDeclarations]: Found specification of procedure l3_destroy [2018-01-24 12:00:01,464 INFO L128 BoogieDeclarations]: Found specification of procedure l2_destroy [2018-01-24 12:00:01,464 INFO L128 BoogieDeclarations]: Found specification of procedure l1_destroy [2018-01-24 12:00:01,464 INFO L128 BoogieDeclarations]: Found specification of procedure l0_destroy [2018-01-24 12:00:01,465 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 12:00:01,465 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 12:00:01,465 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 12:00:01,838 WARN L455 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-01-24 12:00:02,098 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 12:00:02,099 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 12:00:02 BoogieIcfgContainer [2018-01-24 12:00:02,099 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 12:00:02,100 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 12:00:02,100 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 12:00:02,103 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 12:00:02,103 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 12:00:01" (1/3) ... [2018-01-24 12:00:02,105 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74b6e304 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 12:00:02, skipping insertion in model container [2018-01-24 12:00:02,105 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:00:01" (2/3) ... [2018-01-24 12:00:02,105 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74b6e304 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 12:00:02, skipping insertion in model container [2018-01-24 12:00:02,105 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 12:00:02" (3/3) ... [2018-01-24 12:00:02,107 INFO L105 eAbstractionObserver]: Analyzing ICFG test-0234_true-valid-memsafety.i [2018-01-24 12:00:02,118 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 12:00:02,129 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 71 error locations. [2018-01-24 12:00:02,186 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 12:00:02,187 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 12:00:02,187 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 12:00:02,187 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 12:00:02,187 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 12:00:02,187 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 12:00:02,188 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 12:00:02,188 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 12:00:02,189 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 12:00:02,217 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states. [2018-01-24 12:00:02,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-01-24 12:00:02,222 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:00:02,223 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-01-24 12:00:02,224 INFO L371 AbstractCegarLoop]: === Iteration 1 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-01-24 12:00:02,229 INFO L82 PathProgramCache]: Analyzing trace with hash 12092192, now seen corresponding path program 1 times [2018-01-24 12:00:02,231 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:00:02,231 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:00:02,274 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:00:02,274 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:00:02,274 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:00:02,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:00:02,321 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:00:02,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:00:02,398 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:00:02,398 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 12:00:02,400 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 12:00:02,497 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 12:00:02,497 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 12:00:02,499 INFO L87 Difference]: Start difference. First operand 231 states. Second operand 3 states. [2018-01-24 12:00:02,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:00:02,780 INFO L93 Difference]: Finished difference Result 483 states and 565 transitions. [2018-01-24 12:00:02,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 12:00:02,782 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-01-24 12:00:02,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:00:02,798 INFO L225 Difference]: With dead ends: 483 [2018-01-24 12:00:02,799 INFO L226 Difference]: Without dead ends: 257 [2018-01-24 12:00:02,806 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 12:00:02,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2018-01-24 12:00:02,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 226. [2018-01-24 12:00:02,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2018-01-24 12:00:02,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 241 transitions. [2018-01-24 12:00:02,867 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 241 transitions. Word has length 4 [2018-01-24 12:00:02,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:00:02,868 INFO L432 AbstractCegarLoop]: Abstraction has 226 states and 241 transitions. [2018-01-24 12:00:02,868 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 12:00:02,868 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 241 transitions. [2018-01-24 12:00:02,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-01-24 12:00:02,868 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:00:02,869 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-01-24 12:00:02,869 INFO L371 AbstractCegarLoop]: === Iteration 2 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-01-24 12:00:02,869 INFO L82 PathProgramCache]: Analyzing trace with hash 12092193, now seen corresponding path program 1 times [2018-01-24 12:00:02,869 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:00:02,869 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:00:02,870 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:00:02,870 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:00:02,871 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:00:02,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:00:02,887 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:00:02,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:00:02,949 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:00:02,949 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 12:00:02,951 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 12:00:02,951 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 12:00:02,951 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 12:00:02,951 INFO L87 Difference]: Start difference. First operand 226 states and 241 transitions. Second operand 3 states. [2018-01-24 12:00:03,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:00:03,124 INFO L93 Difference]: Finished difference Result 234 states and 252 transitions. [2018-01-24 12:00:03,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 12:00:03,124 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-01-24 12:00:03,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:00:03,127 INFO L225 Difference]: With dead ends: 234 [2018-01-24 12:00:03,127 INFO L226 Difference]: Without dead ends: 233 [2018-01-24 12:00:03,129 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 12:00:03,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-01-24 12:00:03,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 225. [2018-01-24 12:00:03,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-01-24 12:00:03,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 240 transitions. [2018-01-24 12:00:03,150 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 240 transitions. Word has length 4 [2018-01-24 12:00:03,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:00:03,150 INFO L432 AbstractCegarLoop]: Abstraction has 225 states and 240 transitions. [2018-01-24 12:00:03,151 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 12:00:03,151 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 240 transitions. [2018-01-24 12:00:03,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-24 12:00:03,152 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:00:03,152 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:00:03,152 INFO L371 AbstractCegarLoop]: === Iteration 3 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-01-24 12:00:03,152 INFO L82 PathProgramCache]: Analyzing trace with hash 1806231127, now seen corresponding path program 1 times [2018-01-24 12:00:03,152 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:00:03,153 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:00:03,154 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:00:03,154 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:00:03,154 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:00:03,176 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-01-24 12:00:03,176 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-01-24 12:00:03,176 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-01-24 12:00:03,190 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:00:03,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:00:03,223 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:00:03,259 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 12:00:03,261 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:00:03,263 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:00:03,263 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-24 12:00:03,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:00:03,309 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:00:03,310 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 12:00:03,310 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 12:00:03,310 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 12:00:03,311 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 12:00:03,311 INFO L87 Difference]: Start difference. First operand 225 states and 240 transitions. Second operand 4 states. [2018-01-24 12:00:03,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:00:03,496 INFO L93 Difference]: Finished difference Result 225 states and 240 transitions. [2018-01-24 12:00:03,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 12:00:03,496 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-01-24 12:00:03,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:00:03,498 INFO L225 Difference]: With dead ends: 225 [2018-01-24 12:00:03,498 INFO L226 Difference]: Without dead ends: 224 [2018-01-24 12:00:03,498 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 12:00:03,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2018-01-24 12:00:03,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 224. [2018-01-24 12:00:03,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2018-01-24 12:00:03,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 239 transitions. [2018-01-24 12:00:03,516 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 239 transitions. Word has length 17 [2018-01-24 12:00:03,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:00:03,517 INFO L432 AbstractCegarLoop]: Abstraction has 224 states and 239 transitions. [2018-01-24 12:00:03,517 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 12:00:03,517 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 239 transitions. [2018-01-24 12:00:03,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-24 12:00:03,517 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:00:03,517 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:00:03,518 INFO L371 AbstractCegarLoop]: === Iteration 4 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-01-24 12:00:03,518 INFO L82 PathProgramCache]: Analyzing trace with hash 1806231128, now seen corresponding path program 1 times [2018-01-24 12:00:03,518 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:00:03,518 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:00:03,519 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:00:03,519 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:00:03,519 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:00:03,537 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-01-24 12:00:03,537 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-01-24 12:00:03,537 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-01-24 12:00:03,545 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:00:03,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:00:03,571 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:00:03,586 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2018-01-24 12:00:03,586 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:00:03,610 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2018-01-24 12:00:03,611 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:00:03,630 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:00:03,630 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:46, output treesize:44 [2018-01-24 12:00:03,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:00:03,720 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:00:03,720 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 12:00:03,720 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 12:00:03,720 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 12:00:03,720 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 12:00:03,721 INFO L87 Difference]: Start difference. First operand 224 states and 239 transitions. Second operand 4 states. [2018-01-24 12:00:03,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:00:03,968 INFO L93 Difference]: Finished difference Result 224 states and 239 transitions. [2018-01-24 12:00:03,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 12:00:03,968 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-01-24 12:00:03,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:00:03,970 INFO L225 Difference]: With dead ends: 224 [2018-01-24 12:00:03,970 INFO L226 Difference]: Without dead ends: 223 [2018-01-24 12:00:03,971 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 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-24 12:00:03,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-01-24 12:00:03,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 223. [2018-01-24 12:00:03,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2018-01-24 12:00:03,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 238 transitions. [2018-01-24 12:00:03,985 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 238 transitions. Word has length 17 [2018-01-24 12:00:03,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:00:03,985 INFO L432 AbstractCegarLoop]: Abstraction has 223 states and 238 transitions. [2018-01-24 12:00:03,985 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 12:00:03,985 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 238 transitions. [2018-01-24 12:00:03,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-01-24 12:00:03,989 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:00:03,989 INFO L322 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:00:03,989 INFO L371 AbstractCegarLoop]: === Iteration 5 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-01-24 12:00:03,989 INFO L82 PathProgramCache]: Analyzing trace with hash 1639542084, now seen corresponding path program 1 times [2018-01-24 12:00:03,990 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:00:03,990 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:00:03,991 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:00:03,991 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:00:03,991 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:00:04,017 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-01-24 12:00:04,018 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-01-24 12:00:04,018 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-01-24 12:00:04,031 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:00:04,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:00:04,157 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:00:04,175 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 12:00:04,176 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:00:04,186 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:00:04,186 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-24 12:00:04,294 WARN L1029 $PredicateComparison]: unable to prove that (exists ((|calloc_model_#t~malloc0.base| Int)) (and (= 0 (select |c_old(#valid)| |calloc_model_#t~malloc0.base|)) (= |c_#valid| (store |c_old(#valid)| |calloc_model_#t~malloc0.base| 1)))) is different from true [2018-01-24 12:00:04,300 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:00:04,303 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2018-01-24 12:00:04,303 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:00:04,305 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 12:00:04,305 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-01-24 12:00:04,318 WARN L1029 $PredicateComparison]: unable to prove that (and (exists ((v_calloc_model_~ptr~5.base_BEFORE_CALL_1 Int)) (= 1 (select |c_#valid| v_calloc_model_~ptr~5.base_BEFORE_CALL_1))) (exists ((|calloc_model_#t~malloc0.base| Int)) (and (= 0 (select |c_old(#valid)| |calloc_model_#t~malloc0.base|)) (= |c_#valid| (store |c_old(#valid)| |calloc_model_#t~malloc0.base| 1))))) is different from true [2018-01-24 12:00:04,350 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:00:04,355 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:00:04,356 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-01-24 12:00:04,357 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:00:04,368 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-24 12:00:04,369 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:20 [2018-01-24 12:00:04,413 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 129 trivial. 9 not checked. [2018-01-24 12:00:04,438 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-01-24 12:00:04,438 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-01-24 12:00:04,439 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-24 12:00:04,439 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-24 12:00:04,440 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=125, Unknown=2, NotChecked=46, Total=210 [2018-01-24 12:00:04,440 INFO L87 Difference]: Start difference. First operand 223 states and 238 transitions. Second operand 15 states. [2018-01-24 12:00:05,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:00:05,592 INFO L93 Difference]: Finished difference Result 252 states and 272 transitions. [2018-01-24 12:00:05,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-24 12:00:05,592 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 142 [2018-01-24 12:00:05,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:00:05,595 INFO L225 Difference]: With dead ends: 252 [2018-01-24 12:00:05,595 INFO L226 Difference]: Without dead ends: 250 [2018-01-24 12:00:05,596 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 127 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=313, Unknown=2, NotChecked=74, Total=462 [2018-01-24 12:00:05,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-01-24 12:00:05,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 221. [2018-01-24 12:00:05,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-01-24 12:00:05,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 236 transitions. [2018-01-24 12:00:05,613 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 236 transitions. Word has length 142 [2018-01-24 12:00:05,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:00:05,614 INFO L432 AbstractCegarLoop]: Abstraction has 221 states and 236 transitions. [2018-01-24 12:00:05,614 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-24 12:00:05,614 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 236 transitions. [2018-01-24 12:00:05,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-01-24 12:00:05,615 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:00:05,616 INFO L322 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:00:05,616 INFO L371 AbstractCegarLoop]: === Iteration 6 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-01-24 12:00:05,616 INFO L82 PathProgramCache]: Analyzing trace with hash 1639542085, now seen corresponding path program 1 times [2018-01-24 12:00:05,616 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:00:05,616 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:00:05,617 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:00:05,617 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:00:05,617 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:00:05,635 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-01-24 12:00:05,635 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-01-24 12:00:05,636 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-01-24 12:00:05,644 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:00:05,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:00:05,755 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:00:05,879 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-01-24 12:00:05,901 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:00:05,901 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 12:00:05,902 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 12:00:05,902 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 12:00:05,902 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-01-24 12:00:05,902 INFO L87 Difference]: Start difference. First operand 221 states and 236 transitions. Second operand 8 states. [2018-01-24 12:00:06,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:00:06,024 INFO L93 Difference]: Finished difference Result 445 states and 486 transitions. [2018-01-24 12:00:06,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 12:00:06,024 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 142 [2018-01-24 12:00:06,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:00:06,026 INFO L225 Difference]: With dead ends: 445 [2018-01-24 12:00:06,027 INFO L226 Difference]: Without dead ends: 222 [2018-01-24 12:00:06,028 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-01-24 12:00:06,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2018-01-24 12:00:06,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 222. [2018-01-24 12:00:06,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2018-01-24 12:00:06,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 237 transitions. [2018-01-24 12:00:06,046 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 237 transitions. Word has length 142 [2018-01-24 12:00:06,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:00:06,047 INFO L432 AbstractCegarLoop]: Abstraction has 222 states and 237 transitions. [2018-01-24 12:00:06,047 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 12:00:06,047 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 237 transitions. [2018-01-24 12:00:06,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-01-24 12:00:06,049 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:00:06,050 INFO L322 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:00:06,050 INFO L371 AbstractCegarLoop]: === Iteration 7 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-01-24 12:00:06,050 INFO L82 PathProgramCache]: Analyzing trace with hash -1950053043, now seen corresponding path program 1 times [2018-01-24 12:00:06,050 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:00:06,050 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:00:06,051 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:00:06,052 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:00:06,052 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:00:06,070 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-01-24 12:00:06,070 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-01-24 12:00:06,070 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-01-24 12:00:06,083 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:00:06,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:00:06,485 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:00:06,738 WARN L146 SmtUtils]: Spent 107ms on a formula simplification. DAG size of input: 22 DAG size of output 10 [2018-01-24 12:00:06,777 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 85 proven. 1 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2018-01-24 12:00:06,800 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-01-24 12:00:06,800 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-01-24 12:00:06,801 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 12:00:06,801 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 12:00:06,801 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-01-24 12:00:06,801 INFO L87 Difference]: Start difference. First operand 222 states and 237 transitions. Second operand 9 states. [2018-01-24 12:00:07,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:00:07,405 INFO L93 Difference]: Finished difference Result 447 states and 488 transitions. [2018-01-24 12:00:07,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 12:00:07,406 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 148 [2018-01-24 12:00:07,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:00:07,408 INFO L225 Difference]: With dead ends: 447 [2018-01-24 12:00:07,408 INFO L226 Difference]: Without dead ends: 223 [2018-01-24 12:00:07,410 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-01-24 12:00:07,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-01-24 12:00:07,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 223. [2018-01-24 12:00:07,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2018-01-24 12:00:07,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 238 transitions. [2018-01-24 12:00:07,429 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 238 transitions. Word has length 148 [2018-01-24 12:00:07,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:00:07,430 INFO L432 AbstractCegarLoop]: Abstraction has 223 states and 238 transitions. [2018-01-24 12:00:07,430 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 12:00:07,430 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 238 transitions. [2018-01-24 12:00:07,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-01-24 12:00:07,434 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:00:07,434 INFO L322 BasicCegarLoop]: trace histogram [12, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:00:07,434 INFO L371 AbstractCegarLoop]: === Iteration 8 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-01-24 12:00:07,434 INFO L82 PathProgramCache]: Analyzing trace with hash 2122538629, now seen corresponding path program 2 times [2018-01-24 12:00:07,435 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:00:07,435 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:00:07,436 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:00:07,436 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:00:07,436 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:00:07,466 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-01-24 12:00:07,466 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-01-24 12:00:07,466 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-01-24 12:00:07,487 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 12:00:07,525 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:00:07,566 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:00:09,044 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 12:00:09,052 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:00:09,187 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 99 proven. 56 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2018-01-24 12:00:09,209 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-01-24 12:00:09,210 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-01-24 12:00:09,210 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-24 12:00:09,210 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-24 12:00:09,210 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-01-24 12:00:09,211 INFO L87 Difference]: Start difference. First operand 223 states and 238 transitions. Second operand 10 states. [2018-01-24 12:00:09,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:00:09,390 INFO L93 Difference]: Finished difference Result 449 states and 490 transitions. [2018-01-24 12:00:09,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 12:00:09,391 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 154 [2018-01-24 12:00:09,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:00:09,393 INFO L225 Difference]: With dead ends: 449 [2018-01-24 12:00:09,393 INFO L226 Difference]: Without dead ends: 224 [2018-01-24 12:00:09,394 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 144 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-01-24 12:00:09,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2018-01-24 12:00:09,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 224. [2018-01-24 12:00:09,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2018-01-24 12:00:09,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 239 transitions. [2018-01-24 12:00:09,412 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 239 transitions. Word has length 154 [2018-01-24 12:00:09,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:00:09,412 INFO L432 AbstractCegarLoop]: Abstraction has 224 states and 239 transitions. [2018-01-24 12:00:09,413 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-24 12:00:09,413 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 239 transitions. [2018-01-24 12:00:09,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-01-24 12:00:09,415 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:00:09,415 INFO L322 BasicCegarLoop]: trace histogram [18, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:00:09,415 INFO L371 AbstractCegarLoop]: === Iteration 9 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-01-24 12:00:09,416 INFO L82 PathProgramCache]: Analyzing trace with hash -1035671411, now seen corresponding path program 3 times [2018-01-24 12:00:09,416 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:00:09,416 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:00:09,417 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:00:09,417 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 12:00:09,417 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:00:09,435 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-01-24 12:00:09,435 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-01-24 12:00:09,435 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-01-24 12:00:09,450 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-24 12:00:09,496 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 12:00:09,508 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 12:00:09,528 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 12:00:09,653 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 12:00:09,662 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:00:09,701 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 35 [2018-01-24 12:00:09,701 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:00:09,704 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 32 [2018-01-24 12:00:09,705 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:00:10,003 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 34 [2018-01-24 12:00:10,004 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 12:00:10,376 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2018-01-24 12:00:10,377 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:00:10,811 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:00:10,811 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:70, output treesize:66 [2018-01-24 12:00:14,417 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-01-24 12:00:14,417 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:00:14,444 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-01-24 12:00:14,445 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:00:14,481 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2018-01-24 12:00:14,482 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 12:00:14,511 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2018-01-24 12:00:14,512 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:00:14,535 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 4 dim-1 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-01-24 12:00:14,535 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:49, output treesize:37 [2018-01-24 12:00:16,545 WARN L1029 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_26 Int) (v_prenex_25 Int) (v_prenex_24 Int)) (let ((.cse0 (mod (* v_prenex_26 v_prenex_24) 4294967296))) (and (= .cse0 (select |c_#length| v_prenex_25)) (<= .cse0 2147483647)))) (exists ((v_calloc_model_~ptr~5.base_BEFORE_CALL_3 Int) (calloc_model_~size Int) (|v_calloc_model_#in~nmemb_BEFORE_CALL_5| Int)) (let ((.cse1 (mod (* |v_calloc_model_#in~nmemb_BEFORE_CALL_5| calloc_model_~size) 4294967296))) (and (< 2147483647 .cse1) (= (+ (select |c_#length| v_calloc_model_~ptr~5.base_BEFORE_CALL_3) 4294967296) .cse1))))) is different from true [2018-01-24 12:00:16,610 WARN L1029 $PredicateComparison]: unable to prove that (let ((.cse2 (exists ((v_prenex_29 Int) (v_prenex_31 Int)) (let ((.cse7 (mod (* |c_calloc_model_#in~nmemb| v_prenex_31) 4294967296))) (and (<= .cse7 2147483647) (= (select |c_old(#valid)| v_prenex_29) 0) (= |c_#length| (store |c_old(#length)| v_prenex_29 .cse7)))))) (.cse0 (exists ((v_prenex_26 Int) (v_prenex_25 Int) (v_prenex_24 Int)) (let ((.cse6 (mod (* v_prenex_26 v_prenex_24) 4294967296))) (and (= .cse6 (select |c_#length| v_prenex_25)) (<= .cse6 2147483647))))) (.cse1 (exists ((calloc_model_~ptr~5.base Int) (v_prenex_30 Int)) (let ((.cse5 (mod (* |c_calloc_model_#in~nmemb| v_prenex_30) 4294967296))) (and (= (store |c_old(#length)| calloc_model_~ptr~5.base (+ .cse5 (- 4294967296))) |c_#length|) (= (select |c_old(#valid)| calloc_model_~ptr~5.base) 0) (< 2147483647 .cse5))))) (.cse3 (exists ((v_calloc_model_~ptr~5.base_BEFORE_CALL_3 Int) (calloc_model_~size Int) (|v_calloc_model_#in~nmemb_BEFORE_CALL_5| Int)) (let ((.cse4 (mod (* |v_calloc_model_#in~nmemb_BEFORE_CALL_5| calloc_model_~size) 4294967296))) (and (< 2147483647 .cse4) (= (+ (select |c_#length| v_calloc_model_~ptr~5.base_BEFORE_CALL_3) 4294967296) .cse4)))))) (or (and .cse0 .cse1) (and .cse2 .cse3) (and .cse2 .cse0) (and .cse1 .cse3))) is different from true [2018-01-24 12:00:16,639 WARN L1029 $PredicateComparison]: unable to prove that (or (and (exists ((v_prenex_26 Int) (v_prenex_25 Int) (v_prenex_24 Int)) (let ((.cse0 (mod (* v_prenex_26 v_prenex_24) 4294967296))) (and (= .cse0 (select |c_#length| v_prenex_25)) (<= .cse0 2147483647)))) (exists ((calloc_model_~ptr~5.base Int) (v_prenex_30 Int)) (let ((.cse1 (mod (* |c_calloc_model_#in~nmemb| v_prenex_30) 4294967296))) (and (= (store |c_old(#length)| calloc_model_~ptr~5.base (+ .cse1 (- 4294967296))) |c_#length|) (= (select |c_old(#valid)| calloc_model_~ptr~5.base) 0) (< 2147483647 .cse1))))) (and (exists ((v_prenex_29 Int) (v_prenex_31 Int)) (let ((.cse2 (mod (* |c_calloc_model_#in~nmemb| v_prenex_31) 4294967296))) (and (<= .cse2 2147483647) (= (select |c_old(#valid)| v_prenex_29) 0) (= |c_#length| (store |c_old(#length)| v_prenex_29 .cse2))))) (exists ((v_calloc_model_~ptr~5.base_BEFORE_CALL_3 Int) (calloc_model_~size Int) (|v_calloc_model_#in~nmemb_BEFORE_CALL_5| Int)) (let ((.cse3 (mod (* |v_calloc_model_#in~nmemb_BEFORE_CALL_5| calloc_model_~size) 4294967296))) (and (< 2147483647 .cse3) (= (+ (select |c_#length| v_calloc_model_~ptr~5.base_BEFORE_CALL_3) 4294967296) .cse3))))) (and (exists ((v_prenex_33 Int) (v_prenex_36 Int)) (let ((.cse4 (mod (* |c_calloc_model_#in~nmemb| v_prenex_36) 4294967296))) (and (= |c_#length| (store |c_old(#length)| v_prenex_33 .cse4)) (<= .cse4 2147483647) (= (select |c_old(#valid)| v_prenex_33) 0)))) (exists ((v_prenex_34 Int) (v_prenex_35 Int) (v_prenex_32 Int)) (let ((.cse5 (mod (* v_prenex_32 v_prenex_35) 4294967296))) (and (= .cse5 (select |c_#length| v_prenex_34)) (<= .cse5 2147483647))))) (and (exists ((v_prenex_38 Int) (v_prenex_40 Int)) (let ((.cse6 (mod (* |c_calloc_model_#in~nmemb| v_prenex_40) 4294967296))) (and (= (store |c_old(#length)| v_prenex_38 (+ .cse6 (- 4294967296))) |c_#length|) (= (select |c_old(#valid)| v_prenex_38) 0) (< 2147483647 .cse6)))) (exists ((v_prenex_37 Int) (v_prenex_39 Int) (v_prenex_41 Int)) (let ((.cse7 (mod (* v_prenex_41 v_prenex_39) 4294967296))) (and (< 2147483647 .cse7) (= (+ (select |c_#length| v_prenex_37) 4294967296) .cse7)))))) is different from true [2018-01-24 12:00:27,068 WARN L146 SmtUtils]: Spent 6178ms on a formula simplification. DAG size of input: 96 DAG size of output 29 [2018-01-24 12:00:27,084 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:00:27,085 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:00:27,086 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 47 [2018-01-24 12:00:27,087 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:00:27,118 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:00:27,120 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:00:27,120 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 27 [2018-01-24 12:00:27,121 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:00:27,159 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:00:27,161 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 35 [2018-01-24 12:00:27,162 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 12:00:27,190 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:00:27,191 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:00:27,192 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2018-01-24 12:00:27,192 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:00:27,219 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-01-24 12:00:27,219 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:67, output treesize:49 [2018-01-24 12:00:27,335 INFO L134 CoverageAnalysis]: Checked inductivity of 531 backedges. 260 proven. 11 refuted. 0 times theorem prover too weak. 237 trivial. 23 not checked. [2018-01-24 12:00:27,356 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-01-24 12:00:27,356 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-01-24 12:00:27,356 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-01-24 12:00:27,357 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-01-24 12:00:27,357 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=445, Unknown=8, NotChecked=132, Total=650 [2018-01-24 12:00:27,357 INFO L87 Difference]: Start difference. First operand 224 states and 239 transitions. Second operand 26 states. [2018-01-24 12:00:29,185 WARN L146 SmtUtils]: Spent 243ms on a formula simplification. DAG size of input: 79 DAG size of output 51 [2018-01-24 12:00:50,819 WARN L146 SmtUtils]: Spent 21099ms on a formula simplification. DAG size of input: 78 DAG size of output 76 [2018-01-24 12:01:04,099 WARN L146 SmtUtils]: Spent 10428ms on a formula simplification. DAG size of input: 127 DAG size of output 54 Received shutdown request... [2018-01-24 12:01:12,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-24 12:01:12,520 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-24 12:01:12,526 WARN L187 ceAbstractionStarter]: Timeout [2018-01-24 12:01:12,526 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 12:01:12 BoogieIcfgContainer [2018-01-24 12:01:12,527 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 12:01:12,528 INFO L168 Benchmark]: Toolchain (without parser) took 71470.23 ms. Allocated memory was 306.2 MB in the beginning and 599.8 MB in the end (delta: 293.6 MB). Free memory was 265.2 MB in the beginning and 459.8 MB in the end (delta: -194.6 MB). Peak memory consumption was 99.0 MB. Max. memory is 5.3 GB. [2018-01-24 12:01:12,529 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 306.2 MB. Free memory is still 271.2 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 12:01:12,529 INFO L168 Benchmark]: CACSL2BoogieTranslator took 287.74 ms. Allocated memory is still 306.2 MB. Free memory was 265.2 MB in the beginning and 251.3 MB in the end (delta: 13.9 MB). Peak memory consumption was 13.9 MB. Max. memory is 5.3 GB. [2018-01-24 12:01:12,530 INFO L168 Benchmark]: Boogie Preprocessor took 50.51 ms. Allocated memory is still 306.2 MB. Free memory was 251.3 MB in the beginning and 249.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-24 12:01:12,530 INFO L168 Benchmark]: RCFGBuilder took 695.59 ms. Allocated memory is still 306.2 MB. Free memory was 249.3 MB in the beginning and 200.3 MB in the end (delta: 49.0 MB). Peak memory consumption was 49.0 MB. Max. memory is 5.3 GB. [2018-01-24 12:01:12,530 INFO L168 Benchmark]: TraceAbstraction took 70426.51 ms. Allocated memory was 306.2 MB in the beginning and 599.8 MB in the end (delta: 293.6 MB). Free memory was 200.3 MB in the beginning and 459.8 MB in the end (delta: -259.5 MB). Peak memory consumption was 34.1 MB. Max. memory is 5.3 GB. [2018-01-24 12:01:12,533 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.23 ms. Allocated memory is still 306.2 MB. Free memory is still 271.2 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 287.74 ms. Allocated memory is still 306.2 MB. Free memory was 265.2 MB in the beginning and 251.3 MB in the end (delta: 13.9 MB). Peak memory consumption was 13.9 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 50.51 ms. Allocated memory is still 306.2 MB. Free memory was 251.3 MB in the beginning and 249.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 695.59 ms. Allocated memory is still 306.2 MB. Free memory was 249.3 MB in the beginning and 200.3 MB in the end (delta: 49.0 MB). Peak memory consumption was 49.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 70426.51 ms. Allocated memory was 306.2 MB in the beginning and 599.8 MB in the end (delta: 293.6 MB). Free memory was 200.3 MB in the beginning and 459.8 MB in the end (delta: -259.5 MB). Peak memory consumption was 34.1 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 828). Cancelled while BasicCegarLoop was constructing difference of abstraction (224states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 178. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 829). Cancelled while BasicCegarLoop was constructing difference of abstraction (224states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 178. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 828). Cancelled while BasicCegarLoop was constructing difference of abstraction (224states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 178. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 829). Cancelled while BasicCegarLoop was constructing difference of abstraction (224states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 178. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 830). Cancelled while BasicCegarLoop was constructing difference of abstraction (224states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 178. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 830). Cancelled while BasicCegarLoop was constructing difference of abstraction (224states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 178. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 812). Cancelled while BasicCegarLoop was constructing difference of abstraction (224states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 178. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 812). Cancelled while BasicCegarLoop was constructing difference of abstraction (224states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 178. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 813). Cancelled while BasicCegarLoop was constructing difference of abstraction (224states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 178. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 812). Cancelled while BasicCegarLoop was constructing difference of abstraction (224states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 178. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 813). Cancelled while BasicCegarLoop was constructing difference of abstraction (224states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 178. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 812). Cancelled while BasicCegarLoop was constructing difference of abstraction (224states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 178. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 819). Cancelled while BasicCegarLoop was constructing difference of abstraction (224states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 178. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 820). Cancelled while BasicCegarLoop was constructing difference of abstraction (224states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 178. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 818). Cancelled while BasicCegarLoop was constructing difference of abstraction (224states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 178. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 818). Cancelled while BasicCegarLoop was constructing difference of abstraction (224states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 178. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 818). Cancelled while BasicCegarLoop was constructing difference of abstraction (224states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 178. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 820). Cancelled while BasicCegarLoop was constructing difference of abstraction (224states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 178. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 818). Cancelled while BasicCegarLoop was constructing difference of abstraction (224states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 178. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 819). Cancelled while BasicCegarLoop was constructing difference of abstraction (224states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 178. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 794). Cancelled while BasicCegarLoop was constructing difference of abstraction (224states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 178. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 795). Cancelled while BasicCegarLoop was constructing difference of abstraction (224states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 178. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 794). Cancelled while BasicCegarLoop was constructing difference of abstraction (224states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 178. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 794). Cancelled while BasicCegarLoop was constructing difference of abstraction (224states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 178. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 795). Cancelled while BasicCegarLoop was constructing difference of abstraction (224states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 178. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 794). Cancelled while BasicCegarLoop was constructing difference of abstraction (224states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 178. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 871). Cancelled while BasicCegarLoop was constructing difference of abstraction (224states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 178. - TimeoutResultAtElement [Line: 865]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 865). Cancelled while BasicCegarLoop was constructing difference of abstraction (224states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 178. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 871). Cancelled while BasicCegarLoop was constructing difference of abstraction (224states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 178. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 786). Cancelled while BasicCegarLoop was constructing difference of abstraction (224states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 178. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 785). Cancelled while BasicCegarLoop was constructing difference of abstraction (224states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 178. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 786). Cancelled while BasicCegarLoop was constructing difference of abstraction (224states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 178. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 785). Cancelled while BasicCegarLoop was constructing difference of abstraction (224states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 178. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 785). Cancelled while BasicCegarLoop was constructing difference of abstraction (224states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 178. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 785). Cancelled while BasicCegarLoop was constructing difference of abstraction (224states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 178. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 804). Cancelled while BasicCegarLoop was constructing difference of abstraction (224states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 178. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 803). Cancelled while BasicCegarLoop was constructing difference of abstraction (224states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 178. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 803). Cancelled while BasicCegarLoop was constructing difference of abstraction (224states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 178. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 803). Cancelled while BasicCegarLoop was constructing difference of abstraction (224states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 178. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 803). Cancelled while BasicCegarLoop was constructing difference of abstraction (224states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 178. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 804). Cancelled while BasicCegarLoop was constructing difference of abstraction (224states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 178. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 860). Cancelled while BasicCegarLoop was constructing difference of abstraction (224states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 178. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 859). Cancelled while BasicCegarLoop was constructing difference of abstraction (224states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 178. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 858). Cancelled while BasicCegarLoop was constructing difference of abstraction (224states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 178. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 858). Cancelled while BasicCegarLoop was constructing difference of abstraction (224states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 178. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 860). Cancelled while BasicCegarLoop was constructing difference of abstraction (224states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 178. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 859). Cancelled while BasicCegarLoop was constructing difference of abstraction (224states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 178. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 742). Cancelled while BasicCegarLoop was constructing difference of abstraction (224states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 178. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 742). Cancelled while BasicCegarLoop was constructing difference of abstraction (224states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 178. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 776). Cancelled while BasicCegarLoop was constructing difference of abstraction (224states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 178. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 776). Cancelled while BasicCegarLoop was constructing difference of abstraction (224states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 178. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 776). Cancelled while BasicCegarLoop was constructing difference of abstraction (224states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 178. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 777). Cancelled while BasicCegarLoop was constructing difference of abstraction (224states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 178. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 776). Cancelled while BasicCegarLoop was constructing difference of abstraction (224states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 178. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 775). Cancelled while BasicCegarLoop was constructing difference of abstraction (224states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 178. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 775). Cancelled while BasicCegarLoop was constructing difference of abstraction (224states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 178. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 777). Cancelled while BasicCegarLoop was constructing difference of abstraction (224states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 178. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 867). Cancelled while BasicCegarLoop was constructing difference of abstraction (224states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 178. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 867). Cancelled while BasicCegarLoop was constructing difference of abstraction (224states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 178. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 849). Cancelled while BasicCegarLoop was constructing difference of abstraction (224states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 178. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 850). Cancelled while BasicCegarLoop was constructing difference of abstraction (224states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 178. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 848). Cancelled while BasicCegarLoop was constructing difference of abstraction (224states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 178. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 848). Cancelled while BasicCegarLoop was constructing difference of abstraction (224states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 178. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 850). Cancelled while BasicCegarLoop was constructing difference of abstraction (224states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 178. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 849). Cancelled while BasicCegarLoop was constructing difference of abstraction (224states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 178. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 838). Cancelled while BasicCegarLoop was constructing difference of abstraction (224states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 178. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 838). Cancelled while BasicCegarLoop was constructing difference of abstraction (224states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 178. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 839). Cancelled while BasicCegarLoop was constructing difference of abstraction (224states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 178. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 840). Cancelled while BasicCegarLoop was constructing difference of abstraction (224states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 178. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 840). Cancelled while BasicCegarLoop was constructing difference of abstraction (224states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 178. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 839). Cancelled while BasicCegarLoop was constructing difference of abstraction (224states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 178. - StatisticsResult: Ultimate Automizer benchmark data CFG has 16 procedures, 231 locations, 71 error locations. TIMEOUT Result, 70.3s OverallTime, 9 OverallIterations, 18 TraceHistogramMax, 48.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1769 SDtfs, 458 SDslu, 6892 SDs, 0 SdLazy, 2230 SolverSat, 100 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 3.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 807 GetRequests, 711 SyntacticMatches, 5 SemanticMatches, 90 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 51.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=231occurred 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.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 68 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 2.2s SatisfiabilityAnalysisTime, 18.8s InterpolantComputationTime, 788 NumberOfCodeBlocks, 706 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 779 ConstructedInterpolants, 46 QuantifiedInterpolants, 523690 SizeOfPredicates, 42 NumberOfNonLiveVariables, 3491 ConjunctsInSsa, 189 ConjunctsInUnsatCore, 9 InterpolantComputations, 5 PerfectInterpolantSequences, 1700/1800 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0234_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_12-01-12-544.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0234_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_12-01-12-544.csv Completed graceful shutdown