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/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf -i ../../../trunk/examples/svcomp/memsafety/test-0235_false-valid-deref.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-26d9e06-m [2018-02-02 08:50:49,269 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 08:50:49,270 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 08:50:49,283 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 08:50:49,283 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 08:50:49,284 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 08:50:49,285 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 08:50:49,286 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 08:50:49,288 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 08:50:49,288 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 08:50:49,289 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 08:50:49,289 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 08:50:49,290 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 08:50:49,291 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 08:50:49,292 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 08:50:49,294 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 08:50:49,295 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 08:50:49,297 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 08:50:49,298 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 08:50:49,299 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 08:50:49,300 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 08:50:49,301 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 08:50:49,301 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 08:50:49,302 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 08:50:49,302 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 08:50:49,303 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 08:50:49,304 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 08:50:49,304 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 08:50:49,304 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 08:50:49,304 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 08:50:49,305 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 08:50:49,305 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf [2018-02-02 08:50:49,314 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 08:50:49,315 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 08:50:49,316 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 08:50:49,316 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 08:50:49,316 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 08:50:49,316 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 08:50:49,316 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 08:50:49,316 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 08:50:49,316 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 08:50:49,317 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 08:50:49,317 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 08:50:49,317 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 08:50:49,317 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 08:50:49,317 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 08:50:49,317 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 08:50:49,317 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 08:50:49,317 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 08:50:49,317 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 08:50:49,317 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 08:50:49,318 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 08:50:49,318 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 08:50:49,318 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 08:50:49,318 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-02 08:50:49,318 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-02 08:50:49,318 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-02 08:50:49,345 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 08:50:49,353 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 08:50:49,356 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 08:50:49,356 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 08:50:49,357 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 08:50:49,357 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/test-0235_false-valid-deref.i [2018-02-02 08:50:49,518 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 08:50:49,519 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 08:50:49,520 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 08:50:49,520 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 08:50:49,524 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 08:50:49,525 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 08:50:49" (1/1) ... [2018-02-02 08:50:49,527 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5858f23f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:50:49, skipping insertion in model container [2018-02-02 08:50:49,527 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 08:50:49" (1/1) ... [2018-02-02 08:50:49,538 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 08:50:49,577 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 08:50:49,685 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 08:50:49,707 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 08:50:49,716 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:50:49 WrapperNode [2018-02-02 08:50:49,717 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 08:50:49,717 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 08:50:49,717 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 08:50:49,717 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 08:50:49,727 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:50:49" (1/1) ... [2018-02-02 08:50:49,727 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:50:49" (1/1) ... [2018-02-02 08:50:49,736 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:50:49" (1/1) ... [2018-02-02 08:50:49,736 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:50:49" (1/1) ... [2018-02-02 08:50:49,744 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:50:49" (1/1) ... [2018-02-02 08:50:49,749 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:50:49" (1/1) ... [2018-02-02 08:50:49,751 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:50:49" (1/1) ... [2018-02-02 08:50:49,754 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 08:50:49,754 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 08:50:49,754 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 08:50:49,754 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 08:50:49,755 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:50:49" (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-02 08:50:49,791 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 08:50:49,791 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 08:50:49,791 INFO L136 BoogieDeclarations]: Found implementation of procedure calloc_model [2018-02-02 08:50:49,792 INFO L136 BoogieDeclarations]: Found implementation of procedure zalloc_or_die [2018-02-02 08:50:49,792 INFO L136 BoogieDeclarations]: Found implementation of procedure l4_insert [2018-02-02 08:50:49,792 INFO L136 BoogieDeclarations]: Found implementation of procedure l3_insert [2018-02-02 08:50:49,792 INFO L136 BoogieDeclarations]: Found implementation of procedure l2_insert [2018-02-02 08:50:49,792 INFO L136 BoogieDeclarations]: Found implementation of procedure l1_insert [2018-02-02 08:50:49,792 INFO L136 BoogieDeclarations]: Found implementation of procedure l0_insert [2018-02-02 08:50:49,792 INFO L136 BoogieDeclarations]: Found implementation of procedure l4_destroy [2018-02-02 08:50:49,792 INFO L136 BoogieDeclarations]: Found implementation of procedure l3_destroy [2018-02-02 08:50:49,792 INFO L136 BoogieDeclarations]: Found implementation of procedure l2_destroy [2018-02-02 08:50:49,792 INFO L136 BoogieDeclarations]: Found implementation of procedure l1_destroy [2018-02-02 08:50:49,792 INFO L136 BoogieDeclarations]: Found implementation of procedure l0_destroy [2018-02-02 08:50:49,792 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 08:50:49,792 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-02 08:50:49,793 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-02 08:50:49,793 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 08:50:49,793 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 08:50:49,793 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 08:50:49,793 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2018-02-02 08:50:49,793 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2018-02-02 08:50:49,793 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-02 08:50:49,793 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-02 08:50:49,793 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-02-02 08:50:49,793 INFO L128 BoogieDeclarations]: Found specification of procedure memset [2018-02-02 08:50:49,793 INFO L128 BoogieDeclarations]: Found specification of procedure calloc_model [2018-02-02 08:50:49,793 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 08:50:49,793 INFO L128 BoogieDeclarations]: Found specification of procedure zalloc_or_die [2018-02-02 08:50:49,793 INFO L128 BoogieDeclarations]: Found specification of procedure l4_insert [2018-02-02 08:50:49,793 INFO L128 BoogieDeclarations]: Found specification of procedure l3_insert [2018-02-02 08:50:49,794 INFO L128 BoogieDeclarations]: Found specification of procedure l2_insert [2018-02-02 08:50:49,794 INFO L128 BoogieDeclarations]: Found specification of procedure l1_insert [2018-02-02 08:50:49,794 INFO L128 BoogieDeclarations]: Found specification of procedure l0_insert [2018-02-02 08:50:49,794 INFO L128 BoogieDeclarations]: Found specification of procedure l4_destroy [2018-02-02 08:50:49,794 INFO L128 BoogieDeclarations]: Found specification of procedure l3_destroy [2018-02-02 08:50:49,794 INFO L128 BoogieDeclarations]: Found specification of procedure l2_destroy [2018-02-02 08:50:49,794 INFO L128 BoogieDeclarations]: Found specification of procedure l1_destroy [2018-02-02 08:50:49,794 INFO L128 BoogieDeclarations]: Found specification of procedure l0_destroy [2018-02-02 08:50:49,794 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 08:50:49,794 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 08:50:49,794 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 08:50:50,181 WARN L455 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-02-02 08:50:50,334 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 08:50:50,334 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 08:50:50 BoogieIcfgContainer [2018-02-02 08:50:50,334 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 08:50:50,335 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 08:50:50,335 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 08:50:50,337 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 08:50:50,337 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 08:50:49" (1/3) ... [2018-02-02 08:50:50,338 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ec80dc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 08:50:50, skipping insertion in model container [2018-02-02 08:50:50,338 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:50:49" (2/3) ... [2018-02-02 08:50:50,338 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ec80dc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 08:50:50, skipping insertion in model container [2018-02-02 08:50:50,338 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 08:50:50" (3/3) ... [2018-02-02 08:50:50,339 INFO L107 eAbstractionObserver]: Analyzing ICFG test-0235_false-valid-deref.i [2018-02-02 08:50:50,345 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-02 08:50:50,351 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 85 error locations. [2018-02-02 08:50:50,375 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 08:50:50,375 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 08:50:50,375 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-02 08:50:50,375 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-02 08:50:50,375 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 08:50:50,375 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 08:50:50,375 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 08:50:50,376 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 08:50:50,376 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 08:50:50,390 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states. [2018-02-02 08:50:50,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-02-02 08:50:50,396 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:50:50,397 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-02-02 08:50:50,397 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, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, 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-02 08:50:50,400 INFO L82 PathProgramCache]: Analyzing trace with hash 15319548, now seen corresponding path program 1 times [2018-02-02 08:50:50,401 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:50:50,402 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:50:50,435 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:50:50,436 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:50:50,436 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:50:50,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:50:50,470 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:50:50,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-02 08:50:50,540 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:50:50,540 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 08:50:50,542 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 08:50:50,623 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 08:50:50,624 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 08:50:50,626 INFO L87 Difference]: Start difference. First operand 275 states. Second operand 3 states. [2018-02-02 08:50:50,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:50:50,896 INFO L93 Difference]: Finished difference Result 394 states and 450 transitions. [2018-02-02 08:50:50,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 08:50:50,898 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-02-02 08:50:50,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:50:50,911 INFO L225 Difference]: With dead ends: 394 [2018-02-02 08:50:50,912 INFO L226 Difference]: Without dead ends: 391 [2018-02-02 08:50:50,913 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-02 08:50:50,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2018-02-02 08:50:50,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 345. [2018-02-02 08:50:50,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2018-02-02 08:50:50,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 426 transitions. [2018-02-02 08:50:50,975 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 426 transitions. Word has length 4 [2018-02-02 08:50:50,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:50:50,975 INFO L432 AbstractCegarLoop]: Abstraction has 345 states and 426 transitions. [2018-02-02 08:50:50,975 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 08:50:50,976 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 426 transitions. [2018-02-02 08:50:50,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-02-02 08:50:50,976 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:50:50,976 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-02-02 08:50:50,976 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, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, 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-02 08:50:50,977 INFO L82 PathProgramCache]: Analyzing trace with hash 15319549, now seen corresponding path program 1 times [2018-02-02 08:50:50,977 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:50:50,977 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:50:50,978 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:50:50,978 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:50:50,978 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:50:50,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:50:50,991 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:50:51,024 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-02 08:50:51,024 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:50:51,024 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 08:50:51,025 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 08:50:51,025 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 08:50:51,025 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 08:50:51,026 INFO L87 Difference]: Start difference. First operand 345 states and 426 transitions. Second operand 3 states. [2018-02-02 08:50:51,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:50:51,132 INFO L93 Difference]: Finished difference Result 352 states and 436 transitions. [2018-02-02 08:50:51,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 08:50:51,133 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-02-02 08:50:51,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:50:51,135 INFO L225 Difference]: With dead ends: 352 [2018-02-02 08:50:51,135 INFO L226 Difference]: Without dead ends: 352 [2018-02-02 08:50:51,136 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-02 08:50:51,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2018-02-02 08:50:51,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 344. [2018-02-02 08:50:51,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2018-02-02 08:50:51,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 425 transitions. [2018-02-02 08:50:51,153 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 425 transitions. Word has length 4 [2018-02-02 08:50:51,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:50:51,154 INFO L432 AbstractCegarLoop]: Abstraction has 344 states and 425 transitions. [2018-02-02 08:50:51,154 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 08:50:51,154 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 425 transitions. [2018-02-02 08:50:51,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-02 08:50:51,154 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:50:51,155 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:50:51,155 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, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, 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-02 08:50:51,155 INFO L82 PathProgramCache]: Analyzing trace with hash 116258063, now seen corresponding path program 1 times [2018-02-02 08:50:51,155 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:50:51,155 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:50:51,156 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:50:51,156 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:50:51,156 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:50:51,172 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-02 08:50:51,172 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-02 08:50:51,172 INFO L209 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-02 08:50:51,181 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:50:51,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:50:51,212 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 08:50:51,247 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-02 08:50:51,249 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 08:50:51,250 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:50:51,251 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-02 08:50:51,260 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-02 08:50:51,278 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:50:51,278 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 08:50:51,279 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 08:50:51,279 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 08:50:51,279 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 08:50:51,279 INFO L87 Difference]: Start difference. First operand 344 states and 425 transitions. Second operand 4 states. [2018-02-02 08:50:51,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:50:51,397 INFO L93 Difference]: Finished difference Result 343 states and 424 transitions. [2018-02-02 08:50:51,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 08:50:51,398 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-02-02 08:50:51,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:50:51,399 INFO L225 Difference]: With dead ends: 343 [2018-02-02 08:50:51,399 INFO L226 Difference]: Without dead ends: 343 [2018-02-02 08:50:51,400 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-02 08:50:51,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2018-02-02 08:50:51,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 343. [2018-02-02 08:50:51,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2018-02-02 08:50:51,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 424 transitions. [2018-02-02 08:50:51,413 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 424 transitions. Word has length 17 [2018-02-02 08:50:51,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:50:51,413 INFO L432 AbstractCegarLoop]: Abstraction has 343 states and 424 transitions. [2018-02-02 08:50:51,413 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 08:50:51,413 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 424 transitions. [2018-02-02 08:50:51,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-02 08:50:51,414 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:50:51,414 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:50:51,414 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, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, 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-02 08:50:51,414 INFO L82 PathProgramCache]: Analyzing trace with hash 116258064, now seen corresponding path program 1 times [2018-02-02 08:50:51,414 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:50:51,415 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:50:51,416 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:50:51,416 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:50:51,416 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:50:51,428 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-02 08:50:51,429 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-02 08:50:51,429 INFO L209 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-02 08:50:51,434 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:50:51,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:50:51,450 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 08:50:51,457 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-02 08:50:51,458 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 08:50:51,474 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-02 08:50:51,474 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:50:51,492 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 08:50:51,492 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:46, output treesize:44 [2018-02-02 08:50:51,525 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-02 08:50:51,549 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:50:51,549 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 08:50:51,549 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 08:50:51,550 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 08:50:51,550 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 08:50:51,550 INFO L87 Difference]: Start difference. First operand 343 states and 424 transitions. Second operand 4 states. [2018-02-02 08:50:51,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:50:51,763 INFO L93 Difference]: Finished difference Result 342 states and 423 transitions. [2018-02-02 08:50:51,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 08:50:51,763 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-02-02 08:50:51,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:50:51,765 INFO L225 Difference]: With dead ends: 342 [2018-02-02 08:50:51,765 INFO L226 Difference]: Without dead ends: 342 [2018-02-02 08:50:51,765 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-02 08:50:51,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2018-02-02 08:50:51,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 342. [2018-02-02 08:50:51,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 342 states. [2018-02-02 08:50:51,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 423 transitions. [2018-02-02 08:50:51,776 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 423 transitions. Word has length 17 [2018-02-02 08:50:51,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:50:51,776 INFO L432 AbstractCegarLoop]: Abstraction has 342 states and 423 transitions. [2018-02-02 08:50:51,776 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 08:50:51,776 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 423 transitions. [2018-02-02 08:50:51,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-02-02 08:50:51,780 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:50:51,780 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-02 08:50:51,780 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, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, 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-02 08:50:51,780 INFO L82 PathProgramCache]: Analyzing trace with hash 2125517946, now seen corresponding path program 1 times [2018-02-02 08:50:51,780 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:50:51,781 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:50:51,781 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:50:51,782 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:50:51,782 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:50:51,801 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-02 08:50:51,802 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-02 08:50:51,802 INFO L209 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-02 08:50:51,807 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:50:51,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:50:51,888 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 08:50:51,899 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-02 08:50:51,899 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 08:50:51,900 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:50:51,900 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-02 08:50:51,958 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-02 08:50:51,963 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:50:51,964 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-02 08:50:51,965 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 08:50:51,966 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-02 08:50:51,966 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-02-02 08:50:51,974 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-02 08:50:51,987 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:50:51,988 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:50:51,989 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-02 08:50:51,989 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 08:50:51,994 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-02 08:50:51,995 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:20 [2018-02-02 08:50:52,028 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-02 08:50:52,046 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 08:50:52,046 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-02 08:50:52,046 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 08:50:52,046 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 08:50:52,047 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=125, Unknown=2, NotChecked=46, Total=210 [2018-02-02 08:50:52,047 INFO L87 Difference]: Start difference. First operand 342 states and 423 transitions. Second operand 15 states. [2018-02-02 08:50:52,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:50:52,975 INFO L93 Difference]: Finished difference Result 518 states and 637 transitions. [2018-02-02 08:50:52,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 08:50:52,975 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 142 [2018-02-02 08:50:52,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:50:52,979 INFO L225 Difference]: With dead ends: 518 [2018-02-02 08:50:52,979 INFO L226 Difference]: Without dead ends: 518 [2018-02-02 08:50:52,979 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-02 08:50:52,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2018-02-02 08:50:52,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 385. [2018-02-02 08:50:52,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2018-02-02 08:50:52,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 498 transitions. [2018-02-02 08:50:52,994 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 498 transitions. Word has length 142 [2018-02-02 08:50:52,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:50:52,995 INFO L432 AbstractCegarLoop]: Abstraction has 385 states and 498 transitions. [2018-02-02 08:50:52,995 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 08:50:52,995 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 498 transitions. [2018-02-02 08:50:52,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-02-02 08:50:52,996 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:50:52,997 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-02 08:50:52,999 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, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, 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-02 08:50:52,999 INFO L82 PathProgramCache]: Analyzing trace with hash 2125517947, now seen corresponding path program 1 times [2018-02-02 08:50:52,999 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:50:52,999 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:50:53,000 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:50:53,000 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:50:53,001 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:50:53,015 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-02 08:50:53,015 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-02 08:50:53,015 INFO L209 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-02 08:50:53,026 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:50:53,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:50:53,120 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 08:50:53,210 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-02 08:50:53,251 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:50:53,251 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 08:50:53,251 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 08:50:53,252 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 08:50:53,252 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-02 08:50:53,252 INFO L87 Difference]: Start difference. First operand 385 states and 498 transitions. Second operand 8 states. [2018-02-02 08:50:53,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:50:53,380 INFO L93 Difference]: Finished difference Result 395 states and 508 transitions. [2018-02-02 08:50:53,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 08:50:53,381 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 142 [2018-02-02 08:50:53,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:50:53,383 INFO L225 Difference]: With dead ends: 395 [2018-02-02 08:50:53,383 INFO L226 Difference]: Without dead ends: 386 [2018-02-02 08:50:53,383 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-02 08:50:53,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2018-02-02 08:50:53,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 386. [2018-02-02 08:50:53,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2018-02-02 08:50:53,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 499 transitions. [2018-02-02 08:50:53,393 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 499 transitions. Word has length 142 [2018-02-02 08:50:53,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:50:53,394 INFO L432 AbstractCegarLoop]: Abstraction has 386 states and 499 transitions. [2018-02-02 08:50:53,394 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 08:50:53,394 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 499 transitions. [2018-02-02 08:50:53,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-02-02 08:50:53,396 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:50:53,396 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-02 08:50:53,396 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, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, 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-02 08:50:53,396 INFO L82 PathProgramCache]: Analyzing trace with hash 370058419, now seen corresponding path program 1 times [2018-02-02 08:50:53,396 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:50:53,397 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:50:53,397 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:50:53,397 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:50:53,398 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:50:53,411 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-02 08:50:53,411 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-02 08:50:53,411 INFO L209 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-02 08:50:53,421 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:50:53,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:50:53,622 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 08:50:53,726 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-02 08:50:53,754 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 08:50:53,754 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-02 08:50:53,755 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 08:50:53,755 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 08:50:53,755 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-02-02 08:50:53,755 INFO L87 Difference]: Start difference. First operand 386 states and 499 transitions. Second operand 9 states. [2018-02-02 08:50:53,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:50:53,902 INFO L93 Difference]: Finished difference Result 396 states and 509 transitions. [2018-02-02 08:50:53,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 08:50:53,903 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 148 [2018-02-02 08:50:53,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:50:53,905 INFO L225 Difference]: With dead ends: 396 [2018-02-02 08:50:53,905 INFO L226 Difference]: Without dead ends: 387 [2018-02-02 08:50:53,905 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-02-02 08:50:53,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2018-02-02 08:50:53,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 387. [2018-02-02 08:50:53,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2018-02-02 08:50:53,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 500 transitions. [2018-02-02 08:50:53,915 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 500 transitions. Word has length 148 [2018-02-02 08:50:53,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:50:53,915 INFO L432 AbstractCegarLoop]: Abstraction has 387 states and 500 transitions. [2018-02-02 08:50:53,915 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 08:50:53,915 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 500 transitions. [2018-02-02 08:50:53,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-02-02 08:50:53,917 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:50:53,917 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-02 08:50:53,917 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, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, 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-02 08:50:53,917 INFO L82 PathProgramCache]: Analyzing trace with hash 1295616315, now seen corresponding path program 2 times [2018-02-02 08:50:53,917 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:50:53,918 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:50:53,918 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:50:53,918 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:50:53,919 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:50:53,930 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-02 08:50:53,930 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-02 08:50:53,930 INFO L209 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-02 08:50:53,941 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 08:50:53,977 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 08:50:54,009 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 08:50:55,859 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 08:50:55,866 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 08:51:07,638 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 130 proven. 3 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2018-02-02 08:51:07,659 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 08:51:07,659 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-02 08:51:07,659 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 08:51:07,659 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 08:51:07,659 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=65, Unknown=8, NotChecked=0, Total=90 [2018-02-02 08:51:07,660 INFO L87 Difference]: Start difference. First operand 387 states and 500 transitions. Second operand 10 states. [2018-02-02 08:51:58,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:51:58,509 INFO L93 Difference]: Finished difference Result 403 states and 519 transitions. [2018-02-02 08:51:58,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 08:51:58,511 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 154 [2018-02-02 08:51:58,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:51:58,514 INFO L225 Difference]: With dead ends: 403 [2018-02-02 08:51:58,514 INFO L226 Difference]: Without dead ends: 403 [2018-02-02 08:51:58,514 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 17.7s TimeCoverageRelationStatistics Valid=29, Invalid=116, Unknown=11, NotChecked=0, Total=156 [2018-02-02 08:51:58,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2018-02-02 08:51:58,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 403. [2018-02-02 08:51:58,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2018-02-02 08:51:58,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 519 transitions. [2018-02-02 08:51:58,525 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 519 transitions. Word has length 154 [2018-02-02 08:51:58,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:51:58,526 INFO L432 AbstractCegarLoop]: Abstraction has 403 states and 519 transitions. [2018-02-02 08:51:58,526 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 08:51:58,526 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 519 transitions. [2018-02-02 08:51:58,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-02-02 08:51:58,528 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:51:58,528 INFO L351 BasicCegarLoop]: trace histogram [17, 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-02 08:51:58,528 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, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, 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-02 08:51:58,528 INFO L82 PathProgramCache]: Analyzing trace with hash 1790041466, now seen corresponding path program 3 times [2018-02-02 08:51:58,528 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:51:58,528 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:51:58,529 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:51:58,529 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 08:51:58,529 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:51:58,541 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-02 08:51:58,541 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-02 08:51:58,541 INFO L209 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-02 08:51:58,556 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-02 08:51:58,596 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-02-02 08:51:58,608 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-02-02 08:51:58,630 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 08:51:58,635 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 08:51:58,924 INFO L134 CoverageAnalysis]: Checked inductivity of 508 backedges. 125 proven. 3 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2018-02-02 08:51:58,944 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 08:51:58,944 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-02 08:51:58,944 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 08:51:58,944 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 08:51:58,944 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-02-02 08:51:58,945 INFO L87 Difference]: Start difference. First operand 403 states and 519 transitions. Second operand 10 states. [2018-02-02 08:51:59,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:51:59,048 INFO L93 Difference]: Finished difference Result 410 states and 525 transitions. [2018-02-02 08:51:59,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 08:51:59,052 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 159 [2018-02-02 08:51:59,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:51:59,053 INFO L225 Difference]: With dead ends: 410 [2018-02-02 08:51:59,053 INFO L226 Difference]: Without dead ends: 401 [2018-02-02 08:51:59,053 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-02-02 08:51:59,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2018-02-02 08:51:59,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 401. [2018-02-02 08:51:59,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 401 states. [2018-02-02 08:51:59,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 514 transitions. [2018-02-02 08:51:59,059 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 514 transitions. Word has length 159 [2018-02-02 08:51:59,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:51:59,059 INFO L432 AbstractCegarLoop]: Abstraction has 401 states and 514 transitions. [2018-02-02 08:51:59,059 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 08:51:59,059 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 514 transitions. [2018-02-02 08:51:59,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-02-02 08:51:59,060 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:51:59,060 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-02 08:51:59,061 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, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, 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-02 08:51:59,061 INFO L82 PathProgramCache]: Analyzing trace with hash -456422541, now seen corresponding path program 4 times [2018-02-02 08:51:59,061 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:51:59,061 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:51:59,061 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:51:59,061 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 08:51:59,062 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:51:59,069 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-02 08:51:59,069 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-02 08:51:59,069 INFO L209 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-02 08:51:59,073 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Received shutdown request... [2018-02-02 08:52:07,208 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 08:52:07,215 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 08:52:07,218 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-02-02 08:52:07,218 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-02 08:52:07,223 WARN L185 ceAbstractionStarter]: Timeout [2018-02-02 08:52:07,223 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 08:52:07 BoogieIcfgContainer [2018-02-02 08:52:07,223 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 08:52:07,224 INFO L168 Benchmark]: Toolchain (without parser) took 77705.13 ms. Allocated memory was 404.8 MB in the beginning and 715.7 MB in the end (delta: 310.9 MB). Free memory was 358.8 MB in the beginning and 582.6 MB in the end (delta: -223.8 MB). Peak memory consumption was 87.1 MB. Max. memory is 5.3 GB. [2018-02-02 08:52:07,225 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 404.8 MB. Free memory is still 365.4 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 08:52:07,225 INFO L168 Benchmark]: CACSL2BoogieTranslator took 197.06 ms. Allocated memory is still 404.8 MB. Free memory was 358.8 MB in the beginning and 345.5 MB in the end (delta: 13.3 MB). Peak memory consumption was 13.3 MB. Max. memory is 5.3 GB. [2018-02-02 08:52:07,225 INFO L168 Benchmark]: Boogie Preprocessor took 36.54 ms. Allocated memory is still 404.8 MB. Free memory was 345.5 MB in the beginning and 344.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-02 08:52:07,225 INFO L168 Benchmark]: RCFGBuilder took 580.12 ms. Allocated memory is still 404.8 MB. Free memory was 344.1 MB in the beginning and 283.1 MB in the end (delta: 61.0 MB). Peak memory consumption was 61.0 MB. Max. memory is 5.3 GB. [2018-02-02 08:52:07,226 INFO L168 Benchmark]: TraceAbstraction took 76888.41 ms. Allocated memory was 404.8 MB in the beginning and 715.7 MB in the end (delta: 310.9 MB). Free memory was 283.1 MB in the beginning and 582.6 MB in the end (delta: -299.5 MB). Peak memory consumption was 11.4 MB. Max. memory is 5.3 GB. [2018-02-02 08:52:07,227 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.11 ms. Allocated memory is still 404.8 MB. Free memory is still 365.4 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 197.06 ms. Allocated memory is still 404.8 MB. Free memory was 358.8 MB in the beginning and 345.5 MB in the end (delta: 13.3 MB). Peak memory consumption was 13.3 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 36.54 ms. Allocated memory is still 404.8 MB. Free memory was 345.5 MB in the beginning and 344.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 580.12 ms. Allocated memory is still 404.8 MB. Free memory was 344.1 MB in the beginning and 283.1 MB in the end (delta: 61.0 MB). Peak memory consumption was 61.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 76888.41 ms. Allocated memory was 404.8 MB in the beginning and 715.7 MB in the end (delta: 310.9 MB). Free memory was 283.1 MB in the beginning and 582.6 MB in the end (delta: -299.5 MB). Peak memory consumption was 11.4 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 831). Cancelled while BasicCegarLoop was analyzing trace of length 161 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 832). Cancelled while BasicCegarLoop was analyzing trace of length 161 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 831). Cancelled while BasicCegarLoop was analyzing trace of length 161 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 832). Cancelled while BasicCegarLoop was analyzing trace of length 161 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 834). Cancelled while BasicCegarLoop was analyzing trace of length 161 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 834). Cancelled while BasicCegarLoop was analyzing trace of length 161 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 812). Cancelled while BasicCegarLoop was analyzing trace of length 161 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 812). Cancelled while BasicCegarLoop was analyzing trace of length 161 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 813). Cancelled while BasicCegarLoop was analyzing trace of length 161 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 812). Cancelled while BasicCegarLoop was analyzing trace of length 161 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 813). Cancelled while BasicCegarLoop was analyzing trace of length 161 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 812). Cancelled while BasicCegarLoop was analyzing trace of length 161 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 820). Cancelled while BasicCegarLoop was analyzing trace of length 161 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 822). Cancelled while BasicCegarLoop was analyzing trace of length 161 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 819). Cancelled while BasicCegarLoop was analyzing trace of length 161 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 819). Cancelled while BasicCegarLoop was analyzing trace of length 161 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 819). Cancelled while BasicCegarLoop was analyzing trace of length 161 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 822). Cancelled while BasicCegarLoop was analyzing trace of length 161 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 819). Cancelled while BasicCegarLoop was analyzing trace of length 161 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 820). Cancelled while BasicCegarLoop was analyzing trace of length 161 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 794). Cancelled while BasicCegarLoop was analyzing trace of length 161 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 795). Cancelled while BasicCegarLoop was analyzing trace of length 161 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 794). Cancelled while BasicCegarLoop was analyzing trace of length 161 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 794). Cancelled while BasicCegarLoop was analyzing trace of length 161 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 795). Cancelled while BasicCegarLoop was analyzing trace of length 161 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 794). Cancelled while BasicCegarLoop was analyzing trace of length 161 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 883). Cancelled while BasicCegarLoop was analyzing trace of length 161 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 887). Cancelled while BasicCegarLoop was analyzing trace of length 161 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 881). Cancelled while BasicCegarLoop was analyzing trace of length 161 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 875]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 875). Cancelled while BasicCegarLoop was analyzing trace of length 161 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 885). Cancelled while BasicCegarLoop was analyzing trace of length 161 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 881). Cancelled while BasicCegarLoop was analyzing trace of length 161 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 882). Cancelled while BasicCegarLoop was analyzing trace of length 161 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 884). Cancelled while BasicCegarLoop was analyzing trace of length 161 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 886). Cancelled while BasicCegarLoop was analyzing trace of length 161 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 885). Cancelled while BasicCegarLoop was analyzing trace of length 161 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 886). Cancelled while BasicCegarLoop was analyzing trace of length 161 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 888). Cancelled while BasicCegarLoop was analyzing trace of length 161 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 882). Cancelled while BasicCegarLoop was analyzing trace of length 161 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 883). Cancelled while BasicCegarLoop was analyzing trace of length 161 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 887). Cancelled while BasicCegarLoop was analyzing trace of length 161 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 884). Cancelled while BasicCegarLoop was analyzing trace of length 161 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 888). Cancelled while BasicCegarLoop was analyzing trace of length 161 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 786). Cancelled while BasicCegarLoop was analyzing trace of length 161 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 785). Cancelled while BasicCegarLoop was analyzing trace of length 161 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 786). Cancelled while BasicCegarLoop was analyzing trace of length 161 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 785). Cancelled while BasicCegarLoop was analyzing trace of length 161 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 785). Cancelled while BasicCegarLoop was analyzing trace of length 161 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 785). Cancelled while BasicCegarLoop was analyzing trace of length 161 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 804). Cancelled while BasicCegarLoop was analyzing trace of length 161 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 803). Cancelled while BasicCegarLoop was analyzing trace of length 161 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 803). Cancelled while BasicCegarLoop was analyzing trace of length 161 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 803). Cancelled while BasicCegarLoop was analyzing trace of length 161 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 803). Cancelled while BasicCegarLoop was analyzing trace of length 161 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 804). Cancelled while BasicCegarLoop was analyzing trace of length 161 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 870). Cancelled while BasicCegarLoop was analyzing trace of length 161 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 868). Cancelled while BasicCegarLoop was analyzing trace of length 161 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 867). Cancelled while BasicCegarLoop was analyzing trace of length 161 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 867). Cancelled while BasicCegarLoop was analyzing trace of length 161 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 870). Cancelled while BasicCegarLoop was analyzing trace of length 161 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 868). Cancelled while BasicCegarLoop was analyzing trace of length 161 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 742). Cancelled while BasicCegarLoop was analyzing trace of length 161 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 742). Cancelled while BasicCegarLoop was analyzing trace of length 161 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 776). Cancelled while BasicCegarLoop was analyzing trace of length 161 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 776). Cancelled while BasicCegarLoop was analyzing trace of length 161 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 776). Cancelled while BasicCegarLoop was analyzing trace of length 161 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 777). Cancelled while BasicCegarLoop was analyzing trace of length 161 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 776). Cancelled while BasicCegarLoop was analyzing trace of length 161 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 775). Cancelled while BasicCegarLoop was analyzing trace of length 161 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 775). Cancelled while BasicCegarLoop was analyzing trace of length 161 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 777). Cancelled while BasicCegarLoop was analyzing trace of length 161 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 877). Cancelled while BasicCegarLoop was analyzing trace of length 161 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 877). Cancelled while BasicCegarLoop was analyzing trace of length 161 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 856). Cancelled while BasicCegarLoop was analyzing trace of length 161 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 858). Cancelled while BasicCegarLoop was analyzing trace of length 161 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 855). Cancelled while BasicCegarLoop was analyzing trace of length 161 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 855). Cancelled while BasicCegarLoop was analyzing trace of length 161 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 858). Cancelled while BasicCegarLoop was analyzing trace of length 161 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 856). Cancelled while BasicCegarLoop was analyzing trace of length 161 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 843). Cancelled while BasicCegarLoop was analyzing trace of length 161 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 843). Cancelled while BasicCegarLoop was analyzing trace of length 161 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 844). Cancelled while BasicCegarLoop was analyzing trace of length 161 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 846). Cancelled while BasicCegarLoop was analyzing trace of length 161 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 846). Cancelled while BasicCegarLoop was analyzing trace of length 161 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 844). Cancelled while BasicCegarLoop was analyzing trace of length 161 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - StatisticsResult: Ultimate Automizer benchmark data CFG has 16 procedures, 275 locations, 85 error locations. TIMEOUT Result, 76.8s OverallTime, 10 OverallIterations, 18 TraceHistogramMax, 52.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2453 SDtfs, 842 SDslu, 10926 SDs, 0 SdLazy, 2642 SolverSat, 132 SolverUnsat, 23 SolverUnknown, 0 SolverNotchecked, 46.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 799 GetRequests, 727 SyntacticMatches, 3 SemanticMatches, 69 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 18.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=403occurred in iteration=8, 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.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 187 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 2.2s SatisfiabilityAnalysisTime, 12.6s InterpolantComputationTime, 787 NumberOfCodeBlocks, 680 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 778 ConstructedInterpolants, 27 QuantifiedInterpolants, 232707 SizeOfPredicates, 29 NumberOfNonLiveVariables, 3366 ConjunctsInSsa, 221 ConjunctsInUnsatCore, 9 InterpolantComputations, 5 PerfectInterpolantSequences, 1761/1777 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-0235_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_08-52-07-236.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0235_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-02_08-52-07-236.csv Completed graceful shutdown