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/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf -i ../../../trunk/examples/svcomp/memsafety/test-0234_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ccafca9-m [2018-02-03 23:27:16,099 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-03 23:27:16,101 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-03 23:27:16,113 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-03 23:27:16,113 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-03 23:27:16,114 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-03 23:27:16,115 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-03 23:27:16,116 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-03 23:27:16,118 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-03 23:27:16,118 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-03 23:27:16,119 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-03 23:27:16,119 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-03 23:27:16,120 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-03 23:27:16,121 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-03 23:27:16,122 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-03 23:27:16,124 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-03 23:27:16,125 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-03 23:27:16,127 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-03 23:27:16,128 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-03 23:27:16,129 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-03 23:27:16,130 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-03 23:27:16,130 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-03 23:27:16,131 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-03 23:27:16,132 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-03 23:27:16,133 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-03 23:27:16,134 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-03 23:27:16,134 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-03 23:27:16,134 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-03 23:27:16,135 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-03 23:27:16,135 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-03 23:27:16,135 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-03 23:27:16,136 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf [2018-02-03 23:27:16,145 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-03 23:27:16,146 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-03 23:27:16,147 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-03 23:27:16,147 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-03 23:27:16,147 INFO L133 SettingsManager]: * Use SBE=true [2018-02-03 23:27:16,147 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-03 23:27:16,147 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-03 23:27:16,147 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-03 23:27:16,148 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-03 23:27:16,148 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-03 23:27:16,148 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-03 23:27:16,148 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-03 23:27:16,148 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-03 23:27:16,148 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-03 23:27:16,149 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-03 23:27:16,149 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-03 23:27:16,149 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-03 23:27:16,149 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-03 23:27:16,149 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-03 23:27:16,149 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-03 23:27:16,150 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-03 23:27:16,150 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-03 23:27:16,150 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-03 23:27:16,150 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-03 23:27:16,150 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-03 23:27:16,181 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-03 23:27:16,190 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-03 23:27:16,193 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-03 23:27:16,194 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-03 23:27:16,195 INFO L276 PluginConnector]: CDTParser initialized [2018-02-03 23:27:16,195 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/test-0234_true-valid-memsafety.i [2018-02-03 23:27:16,343 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-03 23:27:16,345 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-03 23:27:16,345 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-03 23:27:16,345 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-03 23:27:16,352 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-03 23:27:16,353 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.02 11:27:16" (1/1) ... [2018-02-03 23:27:16,355 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69a9abb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 11:27:16, skipping insertion in model container [2018-02-03 23:27:16,356 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.02 11:27:16" (1/1) ... [2018-02-03 23:27:16,370 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-03 23:27:16,404 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-03 23:27:16,493 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-03 23:27:16,509 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-03 23:27:16,515 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 11:27:16 WrapperNode [2018-02-03 23:27:16,516 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-03 23:27:16,516 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-03 23:27:16,516 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-03 23:27:16,516 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-03 23:27:16,525 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 11:27:16" (1/1) ... [2018-02-03 23:27:16,525 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 11:27:16" (1/1) ... [2018-02-03 23:27:16,534 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 11:27:16" (1/1) ... [2018-02-03 23:27:16,535 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 11:27:16" (1/1) ... [2018-02-03 23:27:16,540 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 11:27:16" (1/1) ... [2018-02-03 23:27:16,543 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 11:27:16" (1/1) ... [2018-02-03 23:27:16,544 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 11:27:16" (1/1) ... [2018-02-03 23:27:16,546 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-03 23:27:16,547 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-03 23:27:16,547 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-03 23:27:16,547 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-03 23:27:16,547 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 11:27:16" (1/1) ... No working directory specified, using /home/ultimate/work/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-02-03 23:27:16,581 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-03 23:27:16,581 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-03 23:27:16,581 INFO L136 BoogieDeclarations]: Found implementation of procedure calloc_model [2018-02-03 23:27:16,581 INFO L136 BoogieDeclarations]: Found implementation of procedure zalloc_or_die [2018-02-03 23:27:16,581 INFO L136 BoogieDeclarations]: Found implementation of procedure l4_insert [2018-02-03 23:27:16,581 INFO L136 BoogieDeclarations]: Found implementation of procedure l3_insert [2018-02-03 23:27:16,581 INFO L136 BoogieDeclarations]: Found implementation of procedure l2_insert [2018-02-03 23:27:16,581 INFO L136 BoogieDeclarations]: Found implementation of procedure l1_insert [2018-02-03 23:27:16,582 INFO L136 BoogieDeclarations]: Found implementation of procedure l0_insert [2018-02-03 23:27:16,582 INFO L136 BoogieDeclarations]: Found implementation of procedure l4_destroy [2018-02-03 23:27:16,582 INFO L136 BoogieDeclarations]: Found implementation of procedure l3_destroy [2018-02-03 23:27:16,582 INFO L136 BoogieDeclarations]: Found implementation of procedure l2_destroy [2018-02-03 23:27:16,582 INFO L136 BoogieDeclarations]: Found implementation of procedure l1_destroy [2018-02-03 23:27:16,582 INFO L136 BoogieDeclarations]: Found implementation of procedure l0_destroy [2018-02-03 23:27:16,582 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-03 23:27:16,582 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-03 23:27:16,583 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-03 23:27:16,583 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-03 23:27:16,583 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-03 23:27:16,583 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-03 23:27:16,583 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2018-02-03 23:27:16,583 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2018-02-03 23:27:16,583 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-03 23:27:16,583 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-03 23:27:16,583 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-02-03 23:27:16,584 INFO L128 BoogieDeclarations]: Found specification of procedure memset [2018-02-03 23:27:16,584 INFO L128 BoogieDeclarations]: Found specification of procedure calloc_model [2018-02-03 23:27:16,584 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-03 23:27:16,584 INFO L128 BoogieDeclarations]: Found specification of procedure zalloc_or_die [2018-02-03 23:27:16,584 INFO L128 BoogieDeclarations]: Found specification of procedure l4_insert [2018-02-03 23:27:16,584 INFO L128 BoogieDeclarations]: Found specification of procedure l3_insert [2018-02-03 23:27:16,584 INFO L128 BoogieDeclarations]: Found specification of procedure l2_insert [2018-02-03 23:27:16,584 INFO L128 BoogieDeclarations]: Found specification of procedure l1_insert [2018-02-03 23:27:16,585 INFO L128 BoogieDeclarations]: Found specification of procedure l0_insert [2018-02-03 23:27:16,585 INFO L128 BoogieDeclarations]: Found specification of procedure l4_destroy [2018-02-03 23:27:16,585 INFO L128 BoogieDeclarations]: Found specification of procedure l3_destroy [2018-02-03 23:27:16,585 INFO L128 BoogieDeclarations]: Found specification of procedure l2_destroy [2018-02-03 23:27:16,585 INFO L128 BoogieDeclarations]: Found specification of procedure l1_destroy [2018-02-03 23:27:16,585 INFO L128 BoogieDeclarations]: Found specification of procedure l0_destroy [2018-02-03 23:27:16,585 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-03 23:27:16,586 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-03 23:27:16,586 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-03 23:27:16,840 WARN L455 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-02-03 23:27:17,002 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-03 23:27:17,002 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.02 11:27:17 BoogieIcfgContainer [2018-02-03 23:27:17,002 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-03 23:27:17,003 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-03 23:27:17,003 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-03 23:27:17,006 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-03 23:27:17,006 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.02 11:27:16" (1/3) ... [2018-02-03 23:27:17,007 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38d1acf5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.02 11:27:17, skipping insertion in model container [2018-02-03 23:27:17,007 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 11:27:16" (2/3) ... [2018-02-03 23:27:17,008 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38d1acf5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.02 11:27:17, skipping insertion in model container [2018-02-03 23:27:17,008 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.02 11:27:17" (3/3) ... [2018-02-03 23:27:17,009 INFO L107 eAbstractionObserver]: Analyzing ICFG test-0234_true-valid-memsafety.i [2018-02-03 23:27:17,017 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-03 23:27:17,022 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 71 error locations. [2018-02-03 23:27:17,053 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-03 23:27:17,054 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-03 23:27:17,054 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-03 23:27:17,054 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-03 23:27:17,054 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-03 23:27:17,054 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-03 23:27:17,054 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-03 23:27:17,054 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-03 23:27:17,055 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-03 23:27:17,070 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states. [2018-02-03 23:27:17,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-02-03 23:27:17,077 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:27:17,078 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-02-03 23:27:17,078 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-02-03 23:27:17,084 INFO L82 PathProgramCache]: Analyzing trace with hash 12092192, now seen corresponding path program 1 times [2018-02-03 23:27:17,086 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:27:17,087 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:27:17,129 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:27:17,129 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:27:17,129 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:27:17,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:27:17,170 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:27:17,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:27:17,209 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:27:17,209 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-03 23:27:17,211 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-03 23:27:17,282 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-03 23:27:17,282 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-03 23:27:17,284 INFO L87 Difference]: Start difference. First operand 231 states. Second operand 3 states. [2018-02-03 23:27:17,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:27:17,444 INFO L93 Difference]: Finished difference Result 260 states and 279 transitions. [2018-02-03 23:27:17,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-03 23:27:17,445 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-02-03 23:27:17,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:27:17,453 INFO L225 Difference]: With dead ends: 260 [2018-02-03 23:27:17,453 INFO L226 Difference]: Without dead ends: 257 [2018-02-03 23:27:17,455 INFO L554 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-02-03 23:27:17,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2018-02-03 23:27:17,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 226. [2018-02-03 23:27:17,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2018-02-03 23:27:17,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 241 transitions. [2018-02-03 23:27:17,492 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 241 transitions. Word has length 4 [2018-02-03 23:27:17,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:27:17,492 INFO L432 AbstractCegarLoop]: Abstraction has 226 states and 241 transitions. [2018-02-03 23:27:17,492 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-03 23:27:17,492 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 241 transitions. [2018-02-03 23:27:17,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-02-03 23:27:17,493 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:27:17,493 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-02-03 23:27:17,493 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-02-03 23:27:17,493 INFO L82 PathProgramCache]: Analyzing trace with hash 12092193, now seen corresponding path program 1 times [2018-02-03 23:27:17,493 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:27:17,494 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:27:17,494 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:27:17,494 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:27:17,495 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:27:17,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:27:17,506 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:27:17,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:27:17,537 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:27:17,537 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-03 23:27:17,538 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-03 23:27:17,538 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-03 23:27:17,539 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-03 23:27:17,539 INFO L87 Difference]: Start difference. First operand 226 states and 241 transitions. Second operand 3 states. [2018-02-03 23:27:17,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:27:17,628 INFO L93 Difference]: Finished difference Result 233 states and 251 transitions. [2018-02-03 23:27:17,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-03 23:27:17,629 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-02-03 23:27:17,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:27:17,630 INFO L225 Difference]: With dead ends: 233 [2018-02-03 23:27:17,630 INFO L226 Difference]: Without dead ends: 233 [2018-02-03 23:27:17,631 INFO L554 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-02-03 23:27:17,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-02-03 23:27:17,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 225. [2018-02-03 23:27:17,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-02-03 23:27:17,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 240 transitions. [2018-02-03 23:27:17,642 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 240 transitions. Word has length 4 [2018-02-03 23:27:17,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:27:17,642 INFO L432 AbstractCegarLoop]: Abstraction has 225 states and 240 transitions. [2018-02-03 23:27:17,642 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-03 23:27:17,642 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 240 transitions. [2018-02-03 23:27:17,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-03 23:27:17,643 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:27:17,643 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 23:27:17,643 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-02-03 23:27:17,643 INFO L82 PathProgramCache]: Analyzing trace with hash 1806231127, now seen corresponding path program 1 times [2018-02-03 23:27:17,644 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:27:17,644 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:27:17,645 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:27:17,645 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:27:17,645 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:27:17,661 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-03 23:27:17,661 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-03 23:27:17,661 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-03 23:27:17,670 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:27:17,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:27:17,704 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 23:27:17,729 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-02-03 23:27:17,730 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:27:17,732 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:27:17,732 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-03 23:27:17,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:27:17,756 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:27:17,756 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-03 23:27:17,756 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-03 23:27:17,757 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-03 23:27:17,757 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-03 23:27:17,757 INFO L87 Difference]: Start difference. First operand 225 states and 240 transitions. Second operand 4 states. [2018-02-03 23:27:17,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:27:17,896 INFO L93 Difference]: Finished difference Result 224 states and 239 transitions. [2018-02-03 23:27:17,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-03 23:27:17,896 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-02-03 23:27:17,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:27:17,898 INFO L225 Difference]: With dead ends: 224 [2018-02-03 23:27:17,898 INFO L226 Difference]: Without dead ends: 224 [2018-02-03 23:27:17,898 INFO L554 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-02-03 23:27:17,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2018-02-03 23:27:17,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 224. [2018-02-03 23:27:17,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2018-02-03 23:27:17,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 239 transitions. [2018-02-03 23:27:17,907 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 239 transitions. Word has length 17 [2018-02-03 23:27:17,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:27:17,908 INFO L432 AbstractCegarLoop]: Abstraction has 224 states and 239 transitions. [2018-02-03 23:27:17,908 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-03 23:27:17,908 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 239 transitions. [2018-02-03 23:27:17,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-03 23:27:17,908 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:27:17,908 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 23:27:17,909 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-02-03 23:27:17,909 INFO L82 PathProgramCache]: Analyzing trace with hash 1806231128, now seen corresponding path program 1 times [2018-02-03 23:27:17,909 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:27:17,909 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:27:17,910 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:27:17,910 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:27:17,910 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:27:17,922 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-03 23:27:17,922 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-03 23:27:17,922 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-03 23:27:17,930 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:27:17,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:27:17,951 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 23:27:17,959 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-02-03 23:27:17,960 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:27:17,980 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-02-03 23:27:17,980 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:27:17,997 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-03 23:27:17,998 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:46, output treesize:44 [2018-02-03 23:27:18,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:27:18,058 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:27:18,058 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-03 23:27:18,059 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-03 23:27:18,059 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-03 23:27:18,059 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-03 23:27:18,059 INFO L87 Difference]: Start difference. First operand 224 states and 239 transitions. Second operand 4 states. [2018-02-03 23:27:18,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:27:18,218 INFO L93 Difference]: Finished difference Result 223 states and 238 transitions. [2018-02-03 23:27:18,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-03 23:27:18,218 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-02-03 23:27:18,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:27:18,220 INFO L225 Difference]: With dead ends: 223 [2018-02-03 23:27:18,220 INFO L226 Difference]: Without dead ends: 223 [2018-02-03 23:27:18,220 INFO L554 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-02-03 23:27:18,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-02-03 23:27:18,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 223. [2018-02-03 23:27:18,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2018-02-03 23:27:18,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 238 transitions. [2018-02-03 23:27:18,227 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 238 transitions. Word has length 17 [2018-02-03 23:27:18,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:27:18,228 INFO L432 AbstractCegarLoop]: Abstraction has 223 states and 238 transitions. [2018-02-03 23:27:18,228 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-03 23:27:18,228 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 238 transitions. [2018-02-03 23:27:18,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-02-03 23:27:18,231 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:27:18,232 INFO L351 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-02-03 23:27:18,232 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-02-03 23:27:18,232 INFO L82 PathProgramCache]: Analyzing trace with hash 1639542084, now seen corresponding path program 1 times [2018-02-03 23:27:18,232 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:27:18,232 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:27:18,233 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:27:18,233 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:27:18,233 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:27:18,253 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-03 23:27:18,253 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-03 23:27:18,253 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-03 23:27:18,263 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:27:18,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:27:18,368 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 23:27:18,395 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-02-03 23:27:18,396 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:27:18,397 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:27:18,397 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-03 23:27:18,461 WARN L1033 $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-02-03 23:27:18,465 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:27:18,466 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-02-03 23:27:18,466 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:27:18,468 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-02-03 23:27:18,468 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-02-03 23:27:18,475 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_calloc_model_~ptr~0.base_BEFORE_CALL_1 Int)) (= 1 (select |c_#valid| v_calloc_model_~ptr~0.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-02-03 23:27:18,488 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:27:18,489 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:27:18,489 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-02-03 23:27:18,490 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:27:18,495 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-02-03 23:27:18,495 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:20 [2018-02-03 23:27:18,540 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 129 trivial. 9 not checked. [2018-02-03 23:27:18,567 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-03 23:27:18,567 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-03 23:27:18,567 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-03 23:27:18,567 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-03 23:27:18,568 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=125, Unknown=2, NotChecked=46, Total=210 [2018-02-03 23:27:18,568 INFO L87 Difference]: Start difference. First operand 223 states and 238 transitions. Second operand 15 states. [2018-02-03 23:27:19,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:27:19,154 INFO L93 Difference]: Finished difference Result 250 states and 270 transitions. [2018-02-03 23:27:19,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-03 23:27:19,155 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 142 [2018-02-03 23:27:19,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:27:19,156 INFO L225 Difference]: With dead ends: 250 [2018-02-03 23:27:19,156 INFO L226 Difference]: Without dead ends: 250 [2018-02-03 23:27:19,157 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 127 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=313, Unknown=2, NotChecked=74, Total=462 [2018-02-03 23:27:19,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-02-03 23:27:19,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 221. [2018-02-03 23:27:19,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-02-03 23:27:19,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 236 transitions. [2018-02-03 23:27:19,164 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 236 transitions. Word has length 142 [2018-02-03 23:27:19,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:27:19,165 INFO L432 AbstractCegarLoop]: Abstraction has 221 states and 236 transitions. [2018-02-03 23:27:19,165 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-03 23:27:19,165 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 236 transitions. [2018-02-03 23:27:19,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-02-03 23:27:19,167 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:27:19,167 INFO L351 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-02-03 23:27:19,168 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-02-03 23:27:19,168 INFO L82 PathProgramCache]: Analyzing trace with hash 1639542085, now seen corresponding path program 1 times [2018-02-03 23:27:19,168 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:27:19,168 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:27:19,169 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:27:19,169 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:27:19,169 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:27:19,178 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-03 23:27:19,178 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-03 23:27:19,178 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-03 23:27:19,187 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:27:19,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:27:19,278 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 23:27:19,337 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-02-03 23:27:19,355 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:27:19,356 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-03 23:27:19,356 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-03 23:27:19,356 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-03 23:27:19,356 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-03 23:27:19,356 INFO L87 Difference]: Start difference. First operand 221 states and 236 transitions. Second operand 8 states. [2018-02-03 23:27:19,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:27:19,433 INFO L93 Difference]: Finished difference Result 231 states and 246 transitions. [2018-02-03 23:27:19,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-03 23:27:19,433 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 142 [2018-02-03 23:27:19,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:27:19,434 INFO L225 Difference]: With dead ends: 231 [2018-02-03 23:27:19,434 INFO L226 Difference]: Without dead ends: 222 [2018-02-03 23:27:19,435 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-02-03 23:27:19,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2018-02-03 23:27:19,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 222. [2018-02-03 23:27:19,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2018-02-03 23:27:19,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 237 transitions. [2018-02-03 23:27:19,446 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 237 transitions. Word has length 142 [2018-02-03 23:27:19,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:27:19,446 INFO L432 AbstractCegarLoop]: Abstraction has 222 states and 237 transitions. [2018-02-03 23:27:19,446 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-03 23:27:19,446 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 237 transitions. [2018-02-03 23:27:19,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-02-03 23:27:19,448 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:27:19,449 INFO L351 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-02-03 23:27:19,449 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-02-03 23:27:19,449 INFO L82 PathProgramCache]: Analyzing trace with hash -1950053043, now seen corresponding path program 1 times [2018-02-03 23:27:19,449 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:27:19,449 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:27:19,450 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:27:19,450 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:27:19,450 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:27:19,474 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-03 23:27:19,474 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-03 23:27:19,474 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-03 23:27:19,485 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:27:19,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:27:19,707 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 23:27:19,799 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 85 proven. 1 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2018-02-03 23:27:19,820 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-03 23:27:19,820 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-03 23:27:19,821 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-03 23:27:19,821 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-03 23:27:19,821 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-02-03 23:27:19,821 INFO L87 Difference]: Start difference. First operand 222 states and 237 transitions. Second operand 9 states. [2018-02-03 23:27:19,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:27:19,920 INFO L93 Difference]: Finished difference Result 232 states and 247 transitions. [2018-02-03 23:27:19,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-03 23:27:19,927 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 148 [2018-02-03 23:27:19,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:27:19,928 INFO L225 Difference]: With dead ends: 232 [2018-02-03 23:27:19,928 INFO L226 Difference]: Without dead ends: 223 [2018-02-03 23:27:19,928 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-02-03 23:27:19,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-02-03 23:27:19,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 223. [2018-02-03 23:27:19,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2018-02-03 23:27:19,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 238 transitions. [2018-02-03 23:27:19,933 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 238 transitions. Word has length 148 [2018-02-03 23:27:19,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:27:19,934 INFO L432 AbstractCegarLoop]: Abstraction has 223 states and 238 transitions. [2018-02-03 23:27:19,934 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-03 23:27:19,934 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 238 transitions. [2018-02-03 23:27:19,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-02-03 23:27:19,935 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:27:19,935 INFO L351 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-02-03 23:27:19,936 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-02-03 23:27:19,936 INFO L82 PathProgramCache]: Analyzing trace with hash 2122538629, now seen corresponding path program 2 times [2018-02-03 23:27:19,936 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:27:19,936 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:27:19,937 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:27:19,937 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:27:19,937 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:27:19,947 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-03 23:27:19,948 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-03 23:27:19,948 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-03 23:27:19,956 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-03 23:27:20,988 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-03 23:27:20,988 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-03 23:27:20,993 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 23:27:21,093 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 134 proven. 49 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2018-02-03 23:27:21,113 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-03 23:27:21,113 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-03 23:27:21,113 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-03 23:27:21,113 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-03 23:27:21,113 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-02-03 23:27:21,113 INFO L87 Difference]: Start difference. First operand 223 states and 238 transitions. Second operand 11 states. [2018-02-03 23:27:21,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:27:21,227 INFO L93 Difference]: Finished difference Result 233 states and 248 transitions. [2018-02-03 23:27:21,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-03 23:27:21,228 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 154 [2018-02-03 23:27:21,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:27:21,229 INFO L225 Difference]: With dead ends: 233 [2018-02-03 23:27:21,229 INFO L226 Difference]: Without dead ends: 224 [2018-02-03 23:27:21,229 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 142 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2018-02-03 23:27:21,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2018-02-03 23:27:21,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 224. [2018-02-03 23:27:21,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2018-02-03 23:27:21,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 239 transitions. [2018-02-03 23:27:21,234 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 239 transitions. Word has length 154 [2018-02-03 23:27:21,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:27:21,235 INFO L432 AbstractCegarLoop]: Abstraction has 224 states and 239 transitions. [2018-02-03 23:27:21,235 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-03 23:27:21,235 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 239 transitions. [2018-02-03 23:27:21,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-02-03 23:27:21,237 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:27:21,237 INFO L351 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-02-03 23:27:21,237 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-02-03 23:27:21,237 INFO L82 PathProgramCache]: Analyzing trace with hash -1035671411, now seen corresponding path program 3 times [2018-02-03 23:27:21,237 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:27:21,237 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:27:21,238 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:27:21,238 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-03 23:27:21,238 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:27:21,247 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-03 23:27:21,247 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-03 23:27:21,247 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-03 23:27:21,254 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-03 23:27:21,396 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-02-03 23:27:21,396 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-03 23:27:21,400 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 23:27:21,414 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-02-03 23:27:21,414 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:27:21,416 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-02-03 23:27:21,416 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:27:23,819 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-02-03 23:27:23,820 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-03 23:27:23,976 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-02-03 23:27:23,977 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-03 23:27:24,000 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-03 23:27:24,000 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:70, output treesize:66 [2018-02-03 23:27:27,072 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-02-03 23:27:27,073 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:27:27,090 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-02-03 23:27:27,091 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:27:27,107 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 23 treesize of output 22 [2018-02-03 23:27:27,107 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-03 23:27:27,123 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 22 treesize of output 17 [2018-02-03 23:27:27,124 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-03 23:27:27,136 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-02-03 23:27:27,137 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:49, output treesize:37 [2018-02-03 23:27:27,787 WARN L146 SmtUtils]: Spent 112ms on a formula simplification. DAG size of input: 57 DAG size of output 32 [2018-02-03 23:27:27,795 WARN L1033 $PredicateComparison]: unable to prove that (or (exists ((calloc_model_~ptr~0.base Int) (v_prenex_19 Int)) (let ((.cse0 (mod v_prenex_19 4294967296))) (and (= (store |c_old(#length)| calloc_model_~ptr~0.base .cse0) |c_#length|) (= 0 (select |c_old(#valid)| calloc_model_~ptr~0.base)) (<= .cse0 2147483647)))) (exists ((v_prenex_18 Int) (v_prenex_17 Int)) (let ((.cse1 (mod v_prenex_18 4294967296))) (and (= (select |c_old(#valid)| v_prenex_17) 0) (< 2147483647 .cse1) (= |c_#length| (store |c_old(#length)| v_prenex_17 (+ .cse1 (- 4294967296)))))))) is different from true [2018-02-03 23:27:27,806 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:27:27,808 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-02-03 23:27:27,808 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:27:27,825 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:27:27,826 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:27:27,826 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-02-03 23:27:27,826 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:27:27,841 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:27:27,842 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:27:27,842 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-02-03 23:27:27,843 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-03 23:27:27,862 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:27:27,863 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:27:27,864 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-02-03 23:27:27,864 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-03 23:27:27,877 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-02-03 23:27:27,877 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:67, output treesize:49 [2018-02-03 23:27:28,020 INFO L134 CoverageAnalysis]: Checked inductivity of 531 backedges. 260 proven. 30 refuted. 0 times theorem prover too weak. 237 trivial. 4 not checked. [2018-02-03 23:27:28,038 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-03 23:27:28,038 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-03 23:27:28,039 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-03 23:27:28,039 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-03 23:27:28,039 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=469, Unknown=8, NotChecked=44, Total=600 [2018-02-03 23:27:28,039 INFO L87 Difference]: Start difference. First operand 224 states and 239 transitions. Second operand 25 states. [2018-02-03 23:27:32,466 WARN L146 SmtUtils]: Spent 160ms on a formula simplification. DAG size of input: 53 DAG size of output 51 [2018-02-03 23:27:46,343 WARN L146 SmtUtils]: Spent 9498ms on a formula simplification. DAG size of input: 78 DAG size of output 76 [2018-02-03 23:28:06,696 WARN L146 SmtUtils]: Spent 17471ms on a formula simplification. DAG size of input: 83 DAG size of output 54 [2018-02-03 23:28:36,745 WARN L146 SmtUtils]: Spent 29396ms on a formula simplification. DAG size of input: 90 DAG size of output 62 [2018-02-03 23:28:51,607 WARN L143 SmtUtils]: Spent 6909ms on a formula simplification that was a NOOP. DAG size: 61 [2018-02-03 23:28:55,272 WARN L143 SmtUtils]: Spent 319ms on a formula simplification that was a NOOP. DAG size: 31 [2018-02-03 23:29:32,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:29:32,095 INFO L93 Difference]: Finished difference Result 361 states and 396 transitions. [2018-02-03 23:29:32,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-03 23:29:32,095 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 160 [2018-02-03 23:29:32,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:29:32,097 INFO L225 Difference]: With dead ends: 361 [2018-02-03 23:29:32,097 INFO L226 Difference]: Without dead ends: 361 [2018-02-03 23:29:32,098 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 138 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 369 ImplicationChecksByTransitivity, 76.6s TimeCoverageRelationStatistics Valid=215, Invalid=1411, Unknown=18, NotChecked=78, Total=1722 [2018-02-03 23:29:32,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2018-02-03 23:29:32,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 222. [2018-02-03 23:29:32,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2018-02-03 23:29:32,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 237 transitions. [2018-02-03 23:29:32,104 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 237 transitions. Word has length 160 [2018-02-03 23:29:32,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:29:32,104 INFO L432 AbstractCegarLoop]: Abstraction has 222 states and 237 transitions. [2018-02-03 23:29:32,104 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-03 23:29:32,104 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 237 transitions. [2018-02-03 23:29:32,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-02-03 23:29:32,106 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:29:32,106 INFO L351 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, 1, 1] [2018-02-03 23:29:32,106 INFO L371 AbstractCegarLoop]: === Iteration 10 === [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-02-03 23:29:32,106 INFO L82 PathProgramCache]: Analyzing trace with hash 1152192685, now seen corresponding path program 1 times [2018-02-03 23:29:32,106 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:29:32,106 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:29:32,107 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:29:32,107 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-03 23:29:32,107 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:29:32,115 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-03 23:29:32,116 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-03 23:29:32,116 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-02-03 23:29:32,135 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:29:32,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:29:32,203 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 23:29:32,209 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-02-03 23:29:32,209 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:29:32,224 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 27 treesize of output 26 [2018-02-03 23:29:32,224 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:29:32,243 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 23 treesize of output 22 [2018-02-03 23:29:32,243 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-03 23:29:32,245 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 26 treesize of output 25 [2018-02-03 23:29:32,245 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-03 23:29:32,257 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-03 23:29:32,257 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:52, output treesize:48 [2018-02-03 23:29:32,782 WARN L1033 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_48 Int) (v_prenex_47 Int) (v_prenex_46 Int)) (let ((.cse0 (mod (* v_prenex_48 v_prenex_46) 4294967296))) (and (= |c_#length| (store |c_old(#length)| v_prenex_47 .cse0)) (<= .cse0 2147483647) (= 0 (select |c_old(#valid)| v_prenex_47))))) (exists ((calloc_model_~size Int) (|calloc_model_#t~malloc0.base| Int) (calloc_model_~nmemb Int)) (and (= 0 (select |c_old(#valid)| |calloc_model_#t~malloc0.base|)) (= (store |c_old(#length)| |calloc_model_#t~malloc0.base| (+ (mod (* calloc_model_~size calloc_model_~nmemb) 4294967296) (- 4294967296))) |c_#length|) (< 2147483647 (mod (* calloc_model_~nmemb calloc_model_~size) 4294967296))))) is different from true [2018-02-03 23:29:32,786 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 25 treesize of output 20 [2018-02-03 23:29:32,786 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:29:32,799 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-02-03 23:29:32,800 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:29:32,821 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 20 treesize of output 19 [2018-02-03 23:29:32,822 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-03 23:29:32,835 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-02-03 23:29:32,835 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-03 23:29:32,849 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-02-03 23:29:32,849 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:49, output treesize:37 [2018-02-03 23:29:35,436 WARN L143 SmtUtils]: Spent 2565ms on a formula simplification that was a NOOP. DAG size: 27 [2018-02-03 23:29:35,455 WARN L1033 $PredicateComparison]: unable to prove that (let ((.cse0 (exists ((v_prenex_48 Int) (v_prenex_47 Int) (v_prenex_46 Int)) (let ((.cse5 (mod (* v_prenex_48 v_prenex_46) 4294967296))) (and (= .cse5 (select |c_#length| v_prenex_47)) (<= .cse5 2147483647))))) (.cse2 (exists ((v_prenex_55 Int) (v_prenex_51 Int) (v_prenex_53 Int)) (and (= 0 (select |c_old(#valid)| v_prenex_53)) (<= (mod (* v_prenex_51 v_prenex_55) 4294967296) 2147483647) (= (store |c_old(#length)| v_prenex_53 (mod (* v_prenex_55 v_prenex_51) 4294967296)) |c_#length|)))) (.cse3 (exists ((calloc_model_~size Int) (|calloc_model_#t~malloc0.base| Int) (calloc_model_~nmemb Int)) (and (= (+ (select |c_#length| |calloc_model_#t~malloc0.base|) 4294967296) (mod (* calloc_model_~size calloc_model_~nmemb) 4294967296)) (< 2147483647 (mod (* calloc_model_~nmemb calloc_model_~size) 4294967296))))) (.cse1 (exists ((v_prenex_56 Int) (v_prenex_52 Int) (v_prenex_54 Int)) (let ((.cse4 (mod (* v_prenex_56 v_prenex_52) 4294967296))) (and (< 2147483647 .cse4) (= 0 (select |c_old(#valid)| v_prenex_54)) (= (store |c_old(#length)| v_prenex_54 (+ .cse4 (- 4294967296))) |c_#length|)))))) (or (and .cse0 .cse1) (and .cse0 .cse2) (and .cse3 .cse2) (and .cse3 .cse1))) is different from true [2018-02-03 23:29:35,466 WARN L1033 $PredicateComparison]: unable to prove that (or (and (exists ((v_prenex_48 Int) (v_prenex_47 Int) (v_prenex_46 Int)) (let ((.cse0 (mod (* v_prenex_48 v_prenex_46) 4294967296))) (and (= .cse0 (select |c_#length| v_prenex_47)) (<= .cse0 2147483647)))) (exists ((v_prenex_56 Int) (v_prenex_52 Int) (v_prenex_54 Int)) (let ((.cse1 (mod (* v_prenex_56 v_prenex_52) 4294967296))) (and (< 2147483647 .cse1) (= 0 (select |c_old(#valid)| v_prenex_54)) (= (store |c_old(#length)| v_prenex_54 (+ .cse1 (- 4294967296))) |c_#length|))))) (and (exists ((v_prenex_66 Int) (v_prenex_65 Int) (v_prenex_64 Int)) (and (= (store |c_old(#length)| v_prenex_66 (+ (mod (* v_prenex_65 v_prenex_64) 4294967296) (- 4294967296))) |c_#length|) (= 0 (select |c_old(#valid)| v_prenex_66)) (< 2147483647 (mod (* v_prenex_64 v_prenex_65) 4294967296)))) (exists ((v_prenex_67 Int) (v_prenex_68 Int) (v_prenex_63 Int)) (and (< 2147483647 (mod (* v_prenex_68 v_prenex_63) 4294967296)) (= (+ (select |c_#length| v_prenex_67) 4294967296) (mod (* v_prenex_63 v_prenex_68) 4294967296))))) (and (exists ((calloc_model_~size Int) (|calloc_model_#t~malloc0.base| Int) (calloc_model_~nmemb Int)) (and (= (+ (select |c_#length| |calloc_model_#t~malloc0.base|) 4294967296) (mod (* calloc_model_~size calloc_model_~nmemb) 4294967296)) (< 2147483647 (mod (* calloc_model_~nmemb calloc_model_~size) 4294967296)))) (exists ((v_prenex_62 Int) (v_prenex_61 Int) (v_prenex_60 Int)) (let ((.cse2 (mod (* v_prenex_61 v_prenex_60) 4294967296))) (and (= 0 (select |c_old(#valid)| v_prenex_62)) (= (store |c_old(#length)| v_prenex_62 .cse2) |c_#length|) (<= .cse2 2147483647))))) (and (exists ((v_prenex_55 Int) (v_prenex_51 Int) (v_prenex_53 Int)) (and (= 0 (select |c_old(#valid)| v_prenex_53)) (<= (mod (* v_prenex_51 v_prenex_55) 4294967296) 2147483647) (= (store |c_old(#length)| v_prenex_53 (mod (* v_prenex_55 v_prenex_51) 4294967296)) |c_#length|))) (exists ((v_prenex_59 Int) (v_prenex_58 Int) (v_prenex_57 Int)) (let ((.cse3 (mod (* v_prenex_57 v_prenex_59) 4294967296))) (and (<= .cse3 2147483647) (= .cse3 (select |c_#length| v_prenex_58))))))) is different from true [2018-02-03 23:29:35,478 WARN L1033 $PredicateComparison]: unable to prove that (or (and (exists ((v_prenex_48 Int) (v_prenex_47 Int) (v_prenex_46 Int)) (let ((.cse0 (mod (* v_prenex_48 v_prenex_46) 4294967296))) (and (= .cse0 (select |c_#length| v_prenex_47)) (<= .cse0 2147483647)))) (exists ((v_prenex_56 Int) (v_prenex_52 Int) (v_prenex_54 Int)) (let ((.cse1 (mod (* v_prenex_56 v_prenex_52) 4294967296))) (and (< 2147483647 .cse1) (= 0 (select |c_old(#valid)| v_prenex_54)) (= (store |c_old(#length)| v_prenex_54 (+ .cse1 (- 4294967296))) |c_#length|))))) (and (exists ((calloc_model_~size Int) (|calloc_model_#t~malloc0.base| Int) (calloc_model_~nmemb Int)) (and (= (+ (select |c_#length| |calloc_model_#t~malloc0.base|) 4294967296) (mod (* calloc_model_~size calloc_model_~nmemb) 4294967296)) (< 2147483647 (mod (* calloc_model_~nmemb calloc_model_~size) 4294967296)))) (exists ((v_prenex_62 Int) (v_prenex_61 Int) (v_prenex_60 Int)) (let ((.cse2 (mod (* v_prenex_61 v_prenex_60) 4294967296))) (and (= (select |c_old(#valid)| v_prenex_62) 0) (= (store |c_old(#length)| v_prenex_62 .cse2) |c_#length|) (<= .cse2 2147483647))))) (and (exists ((v_prenex_66 Int) (v_prenex_65 Int) (v_prenex_64 Int)) (and (= (store |c_old(#length)| v_prenex_66 (+ (mod (* v_prenex_65 v_prenex_64) 4294967296) (- 4294967296))) |c_#length|) (= 0 (select |c_old(#valid)| v_prenex_66)) (< 2147483647 (mod (* v_prenex_64 v_prenex_65) 4294967296)))) (exists ((v_prenex_67 Int) (v_prenex_68 Int) (v_prenex_63 Int)) (and (< 2147483647 (mod (* v_prenex_68 v_prenex_63) 4294967296)) (= (+ (select |c_#length| v_prenex_67) 4294967296) (mod (* v_prenex_63 v_prenex_68) 4294967296))))) (and (exists ((v_prenex_55 Int) (v_prenex_51 Int) (v_prenex_53 Int)) (and (= 0 (select |c_old(#valid)| v_prenex_53)) (<= (mod (* v_prenex_51 v_prenex_55) 4294967296) 2147483647) (= (store |c_old(#length)| v_prenex_53 (mod (* v_prenex_55 v_prenex_51) 4294967296)) |c_#length|))) (exists ((v_prenex_59 Int) (v_prenex_58 Int) (v_prenex_57 Int)) (let ((.cse3 (mod (* v_prenex_57 v_prenex_59) 4294967296))) (and (<= .cse3 2147483647) (= .cse3 (select |c_#length| v_prenex_58))))))) is different from true [2018-02-03 23:29:35,498 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:29:35,500 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:29:35,500 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 69 treesize of output 63 [2018-02-03 23:29:35,500 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:29:49,074 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:29:49,078 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:29:49,079 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 62 treesize of output 77 [2018-02-03 23:29:49,079 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:29:58,104 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:29:58,105 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:29:58,105 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 64 treesize of output 58 [2018-02-03 23:29:58,105 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-03 23:30:07,466 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:30:07,468 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 60 treesize of output 63 [2018-02-03 23:30:07,468 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-03 23:30:14,302 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:30:14,305 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:30:14,305 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 64 treesize of output 58 [2018-02-03 23:30:14,306 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-03 23:30:23,016 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:30:23,020 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:30:23,020 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 66 treesize of output 60 [2018-02-03 23:30:23,021 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-03 23:30:29,210 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:30:29,211 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 58 treesize of output 67 [2018-02-03 23:30:29,225 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-03 23:30:37,342 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:30:37,343 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 58 treesize of output 69 [2018-02-03 23:30:37,343 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-03 23:30:44,892 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 60 treesize of output 59 [2018-02-03 23:30:44,898 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-02-03 23:30:52,161 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:30:52,167 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:30:52,168 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 59 treesize of output 53 [2018-02-03 23:30:52,168 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-02-03 23:30:58,472 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:30:58,474 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:30:58,474 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 62 treesize of output 56 [2018-02-03 23:30:58,474 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. Received shutdown request... [2018-02-03 23:31:02,958 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-02-03 23:31:02,958 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-03 23:31:02,963 WARN L185 ceAbstractionStarter]: Timeout [2018-02-03 23:31:02,963 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.02 11:31:02 BoogieIcfgContainer [2018-02-03 23:31:02,963 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-03 23:31:02,964 INFO L168 Benchmark]: Toolchain (without parser) took 226620.18 ms. Allocated memory was 400.0 MB in the beginning and 680.5 MB in the end (delta: 280.5 MB). Free memory was 356.9 MB in the beginning and 569.5 MB in the end (delta: -212.6 MB). Peak memory consumption was 237.2 MB. Max. memory is 5.3 GB. [2018-02-03 23:31:02,965 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 400.0 MB. Free memory is still 363.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-03 23:31:02,965 INFO L168 Benchmark]: CACSL2BoogieTranslator took 170.46 ms. Allocated memory is still 400.0 MB. Free memory was 356.9 MB in the beginning and 345.0 MB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 5.3 GB. [2018-02-03 23:31:02,965 INFO L168 Benchmark]: Boogie Preprocessor took 30.39 ms. Allocated memory is still 400.0 MB. Free memory was 345.0 MB in the beginning and 342.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-03 23:31:02,966 INFO L168 Benchmark]: RCFGBuilder took 455.83 ms. Allocated memory is still 400.0 MB. Free memory was 342.4 MB in the beginning and 289.3 MB in the end (delta: 53.1 MB). Peak memory consumption was 53.1 MB. Max. memory is 5.3 GB. [2018-02-03 23:31:02,966 INFO L168 Benchmark]: TraceAbstraction took 225960.18 ms. Allocated memory was 400.0 MB in the beginning and 680.5 MB in the end (delta: 280.5 MB). Free memory was 289.3 MB in the beginning and 569.5 MB in the end (delta: -280.2 MB). Peak memory consumption was 169.6 MB. Max. memory is 5.3 GB. [2018-02-03 23:31:02,967 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.14 ms. Allocated memory is still 400.0 MB. Free memory is still 363.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 170.46 ms. Allocated memory is still 400.0 MB. Free memory was 356.9 MB in the beginning and 345.0 MB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 30.39 ms. Allocated memory is still 400.0 MB. Free memory was 345.0 MB in the beginning and 342.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 455.83 ms. Allocated memory is still 400.0 MB. Free memory was 342.4 MB in the beginning and 289.3 MB in the end (delta: 53.1 MB). Peak memory consumption was 53.1 MB. Max. memory is 5.3 GB. * TraceAbstraction took 225960.18 ms. Allocated memory was 400.0 MB in the beginning and 680.5 MB in the end (delta: 280.5 MB). Free memory was 289.3 MB in the beginning and 569.5 MB in the end (delta: -280.2 MB). Peak memory consumption was 169.6 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 analyzing trace of length 163 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 207. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 829). Cancelled while BasicCegarLoop was analyzing trace of length 163 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 207. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 828). Cancelled while BasicCegarLoop was analyzing trace of length 163 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 207. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 829). Cancelled while BasicCegarLoop was analyzing trace of length 163 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 207. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 830). Cancelled while BasicCegarLoop was analyzing trace of length 163 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 207. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 830). Cancelled while BasicCegarLoop was analyzing trace of length 163 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 207. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 812). Cancelled while BasicCegarLoop was analyzing trace of length 163 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 207. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 812). Cancelled while BasicCegarLoop was analyzing trace of length 163 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 207. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 813). Cancelled while BasicCegarLoop was analyzing trace of length 163 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 207. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 812). Cancelled while BasicCegarLoop was analyzing trace of length 163 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 207. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 813). Cancelled while BasicCegarLoop was analyzing trace of length 163 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 207. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 812). Cancelled while BasicCegarLoop was analyzing trace of length 163 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 207. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 819). Cancelled while BasicCegarLoop was analyzing trace of length 163 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 207. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 820). Cancelled while BasicCegarLoop was analyzing trace of length 163 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 207. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 818). Cancelled while BasicCegarLoop was analyzing trace of length 163 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 207. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 818). Cancelled while BasicCegarLoop was analyzing trace of length 163 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 207. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 818). Cancelled while BasicCegarLoop was analyzing trace of length 163 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 207. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 820). Cancelled while BasicCegarLoop was analyzing trace of length 163 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 207. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 818). Cancelled while BasicCegarLoop was analyzing trace of length 163 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 207. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 819). Cancelled while BasicCegarLoop was analyzing trace of length 163 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 207. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 794). Cancelled while BasicCegarLoop was analyzing trace of length 163 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 207. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 795). Cancelled while BasicCegarLoop was analyzing trace of length 163 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 207. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 794). Cancelled while BasicCegarLoop was analyzing trace of length 163 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 207. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 794). Cancelled while BasicCegarLoop was analyzing trace of length 163 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 207. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 795). Cancelled while BasicCegarLoop was analyzing trace of length 163 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 207. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 794). Cancelled while BasicCegarLoop was analyzing trace of length 163 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 207. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 871). Cancelled while BasicCegarLoop was analyzing trace of length 163 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 207. - TimeoutResultAtElement [Line: 865]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 865). Cancelled while BasicCegarLoop was analyzing trace of length 163 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 207. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 871). Cancelled while BasicCegarLoop was analyzing trace of length 163 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 207. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 786). Cancelled while BasicCegarLoop was analyzing trace of length 163 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 207. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 785). Cancelled while BasicCegarLoop was analyzing trace of length 163 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 207. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 786). Cancelled while BasicCegarLoop was analyzing trace of length 163 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 207. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 785). Cancelled while BasicCegarLoop was analyzing trace of length 163 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 207. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 785). Cancelled while BasicCegarLoop was analyzing trace of length 163 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 207. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 785). Cancelled while BasicCegarLoop was analyzing trace of length 163 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 207. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 804). Cancelled while BasicCegarLoop was analyzing trace of length 163 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 207. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 803). Cancelled while BasicCegarLoop was analyzing trace of length 163 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 207. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 803). Cancelled while BasicCegarLoop was analyzing trace of length 163 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 207. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 803). Cancelled while BasicCegarLoop was analyzing trace of length 163 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 207. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 803). Cancelled while BasicCegarLoop was analyzing trace of length 163 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 207. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 804). Cancelled while BasicCegarLoop was analyzing trace of length 163 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 207. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 860). Cancelled while BasicCegarLoop was analyzing trace of length 163 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 207. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 859). Cancelled while BasicCegarLoop was analyzing trace of length 163 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 207. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 858). Cancelled while BasicCegarLoop was analyzing trace of length 163 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 207. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 858). Cancelled while BasicCegarLoop was analyzing trace of length 163 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 207. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 860). Cancelled while BasicCegarLoop was analyzing trace of length 163 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 207. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 859). Cancelled while BasicCegarLoop was analyzing trace of length 163 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 207. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 742). Cancelled while BasicCegarLoop was analyzing trace of length 163 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 207. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 742). Cancelled while BasicCegarLoop was analyzing trace of length 163 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 207. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 776). Cancelled while BasicCegarLoop was analyzing trace of length 163 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 207. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 776). Cancelled while BasicCegarLoop was analyzing trace of length 163 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 207. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 776). Cancelled while BasicCegarLoop was analyzing trace of length 163 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 207. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 777). Cancelled while BasicCegarLoop was analyzing trace of length 163 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 207. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 776). Cancelled while BasicCegarLoop was analyzing trace of length 163 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 207. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 775). Cancelled while BasicCegarLoop was analyzing trace of length 163 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 207. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 775). Cancelled while BasicCegarLoop was analyzing trace of length 163 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 207. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 777). Cancelled while BasicCegarLoop was analyzing trace of length 163 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 207. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 867). Cancelled while BasicCegarLoop was analyzing trace of length 163 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 207. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 867). Cancelled while BasicCegarLoop was analyzing trace of length 163 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 207. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 849). Cancelled while BasicCegarLoop was analyzing trace of length 163 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 207. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 850). Cancelled while BasicCegarLoop was analyzing trace of length 163 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 207. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 848). Cancelled while BasicCegarLoop was analyzing trace of length 163 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 207. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 848). Cancelled while BasicCegarLoop was analyzing trace of length 163 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 207. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 850). Cancelled while BasicCegarLoop was analyzing trace of length 163 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 207. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 849). Cancelled while BasicCegarLoop was analyzing trace of length 163 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 207. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 838). Cancelled while BasicCegarLoop was analyzing trace of length 163 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 207. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 838). Cancelled while BasicCegarLoop was analyzing trace of length 163 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 207. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 839). Cancelled while BasicCegarLoop was analyzing trace of length 163 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 207. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 840). Cancelled while BasicCegarLoop was analyzing trace of length 163 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 207. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 840). Cancelled while BasicCegarLoop was analyzing trace of length 163 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 207. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 839). Cancelled while BasicCegarLoop was analyzing trace of length 163 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 207. - StatisticsResult: Ultimate Automizer benchmark data CFG has 16 procedures, 231 locations, 71 error locations. TIMEOUT Result, 225.9s OverallTime, 10 OverallIterations, 18 TraceHistogramMax, 125.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1909 SDtfs, 748 SDslu, 8070 SDs, 0 SdLazy, 4307 SolverSat, 151 SolverUnsat, 128 SolverUnknown, 0 SolverNotchecked, 51.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 817 GetRequests, 712 SyntacticMatches, 6 SemanticMatches, 99 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 435 ImplicationChecksByTransitivity, 77.2s 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, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 207 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 7.2s InterpolantComputationTime, 788 NumberOfCodeBlocks, 706 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 779 ConstructedInterpolants, 46 QuantifiedInterpolants, 465046 SizeOfPredicates, 45 NumberOfNonLiveVariables, 3491 ConjunctsInSsa, 198 ConjunctsInUnsatCore, 9 InterpolantComputations, 5 PerfectInterpolantSequences, 1707/1800 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0234_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-03_23-31-02-975.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0234_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-03_23-31-02-975.csv Completed graceful shutdown