java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf -i ../../../trunk/examples/svcomp/memsafety/test-0235_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-a74eeac-m [2018-02-02 18:44:32,394 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 18:44:32,395 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 18:44:32,405 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 18:44:32,406 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 18:44:32,406 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 18:44:32,407 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 18:44:32,409 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 18:44:32,410 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 18:44:32,410 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 18:44:32,411 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 18:44:32,411 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 18:44:32,411 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 18:44:32,412 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 18:44:32,413 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 18:44:32,415 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 18:44:32,416 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 18:44:32,418 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 18:44:32,419 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 18:44:32,419 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 18:44:32,421 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 18:44:32,421 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 18:44:32,421 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 18:44:32,422 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 18:44:32,423 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 18:44:32,424 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 18:44:32,424 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 18:44:32,424 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 18:44:32,424 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 18:44:32,425 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 18:44:32,425 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 18:44:32,425 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf [2018-02-02 18:44:32,434 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 18:44:32,435 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 18:44:32,436 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 18:44:32,436 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 18:44:32,436 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 18:44:32,436 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 18:44:32,436 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 18:44:32,436 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 18:44:32,437 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 18:44:32,437 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 18:44:32,437 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 18:44:32,437 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 18:44:32,437 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 18:44:32,437 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 18:44:32,437 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 18:44:32,438 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 18:44:32,438 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 18:44:32,438 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 18:44:32,438 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 18:44:32,438 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 18:44:32,438 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 18:44:32,439 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 18:44:32,439 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-02 18:44:32,439 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-02 18:44:32,439 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-02 18:44:32,467 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 18:44:32,477 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 18:44:32,480 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 18:44:32,481 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 18:44:32,481 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 18:44:32,482 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/test-0235_true-valid-memsafety.i [2018-02-02 18:44:32,630 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 18:44:32,631 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 18:44:32,631 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 18:44:32,632 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 18:44:32,637 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 18:44:32,638 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 06:44:32" (1/1) ... [2018-02-02 18:44:32,640 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67bada75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:44:32, skipping insertion in model container [2018-02-02 18:44:32,640 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 06:44:32" (1/1) ... [2018-02-02 18:44:32,653 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 18:44:32,683 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 18:44:32,766 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 18:44:32,783 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 18:44:32,793 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:44:32 WrapperNode [2018-02-02 18:44:32,793 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 18:44:32,794 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 18:44:32,794 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 18:44:32,794 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 18:44:32,805 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:44:32" (1/1) ... [2018-02-02 18:44:32,805 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:44:32" (1/1) ... [2018-02-02 18:44:32,815 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:44:32" (1/1) ... [2018-02-02 18:44:32,815 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:44:32" (1/1) ... [2018-02-02 18:44:32,821 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:44:32" (1/1) ... [2018-02-02 18:44:32,824 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:44:32" (1/1) ... [2018-02-02 18:44:32,826 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:44:32" (1/1) ... [2018-02-02 18:44:32,829 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 18:44:32,830 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 18:44:32,830 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 18:44:32,830 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 18:44:32,831 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:44:32" (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 18:44:32,870 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 18:44:32,870 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 18:44:32,870 INFO L136 BoogieDeclarations]: Found implementation of procedure calloc_model [2018-02-02 18:44:32,871 INFO L136 BoogieDeclarations]: Found implementation of procedure zalloc_or_die [2018-02-02 18:44:32,871 INFO L136 BoogieDeclarations]: Found implementation of procedure l4_insert [2018-02-02 18:44:32,871 INFO L136 BoogieDeclarations]: Found implementation of procedure l3_insert [2018-02-02 18:44:32,871 INFO L136 BoogieDeclarations]: Found implementation of procedure l2_insert [2018-02-02 18:44:32,871 INFO L136 BoogieDeclarations]: Found implementation of procedure l1_insert [2018-02-02 18:44:32,871 INFO L136 BoogieDeclarations]: Found implementation of procedure l0_insert [2018-02-02 18:44:32,871 INFO L136 BoogieDeclarations]: Found implementation of procedure l4_destroy [2018-02-02 18:44:32,871 INFO L136 BoogieDeclarations]: Found implementation of procedure l3_destroy [2018-02-02 18:44:32,872 INFO L136 BoogieDeclarations]: Found implementation of procedure l2_destroy [2018-02-02 18:44:32,872 INFO L136 BoogieDeclarations]: Found implementation of procedure l1_destroy [2018-02-02 18:44:32,872 INFO L136 BoogieDeclarations]: Found implementation of procedure l0_destroy [2018-02-02 18:44:32,872 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 18:44:32,872 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-02 18:44:32,872 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-02 18:44:32,872 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 18:44:32,872 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 18:44:32,873 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 18:44:32,873 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2018-02-02 18:44:32,873 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2018-02-02 18:44:32,873 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-02 18:44:32,873 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-02 18:44:32,873 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-02-02 18:44:32,873 INFO L128 BoogieDeclarations]: Found specification of procedure memset [2018-02-02 18:44:32,873 INFO L128 BoogieDeclarations]: Found specification of procedure calloc_model [2018-02-02 18:44:32,874 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 18:44:32,874 INFO L128 BoogieDeclarations]: Found specification of procedure zalloc_or_die [2018-02-02 18:44:32,874 INFO L128 BoogieDeclarations]: Found specification of procedure l4_insert [2018-02-02 18:44:32,874 INFO L128 BoogieDeclarations]: Found specification of procedure l3_insert [2018-02-02 18:44:32,874 INFO L128 BoogieDeclarations]: Found specification of procedure l2_insert [2018-02-02 18:44:32,874 INFO L128 BoogieDeclarations]: Found specification of procedure l1_insert [2018-02-02 18:44:32,874 INFO L128 BoogieDeclarations]: Found specification of procedure l0_insert [2018-02-02 18:44:32,874 INFO L128 BoogieDeclarations]: Found specification of procedure l4_destroy [2018-02-02 18:44:32,875 INFO L128 BoogieDeclarations]: Found specification of procedure l3_destroy [2018-02-02 18:44:32,875 INFO L128 BoogieDeclarations]: Found specification of procedure l2_destroy [2018-02-02 18:44:32,875 INFO L128 BoogieDeclarations]: Found specification of procedure l1_destroy [2018-02-02 18:44:32,875 INFO L128 BoogieDeclarations]: Found specification of procedure l0_destroy [2018-02-02 18:44:32,875 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 18:44:32,875 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 18:44:32,875 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 18:44:33,150 WARN L455 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-02-02 18:44:33,333 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 18:44:33,333 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 06:44:33 BoogieIcfgContainer [2018-02-02 18:44:33,333 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 18:44:33,334 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 18:44:33,334 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 18:44:33,340 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 18:44:33,340 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 06:44:32" (1/3) ... [2018-02-02 18:44:33,341 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50442f14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 06:44:33, skipping insertion in model container [2018-02-02 18:44:33,341 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:44:32" (2/3) ... [2018-02-02 18:44:33,341 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50442f14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 06:44:33, skipping insertion in model container [2018-02-02 18:44:33,342 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 06:44:33" (3/3) ... [2018-02-02 18:44:33,343 INFO L107 eAbstractionObserver]: Analyzing ICFG test-0235_true-valid-memsafety.i [2018-02-02 18:44:33,348 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-02 18:44:33,353 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 83 error locations. [2018-02-02 18:44:33,375 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 18:44:33,375 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 18:44:33,375 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-02 18:44:33,375 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-02 18:44:33,375 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 18:44:33,376 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 18:44:33,376 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 18:44:33,376 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 18:44:33,376 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 18:44:33,389 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states. [2018-02-02 18:44:33,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-02-02 18:44:33,395 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:44:33,395 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-02-02 18:44:33,395 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, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, 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 18:44:33,398 INFO L82 PathProgramCache]: Analyzing trace with hash 15106047, now seen corresponding path program 1 times [2018-02-02 18:44:33,399 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:44:33,399 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:44:33,428 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:44:33,428 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:44:33,428 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:44:33,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:44:33,460 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:44:33,516 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 18:44:33,518 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:44:33,518 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 18:44:33,569 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 18:44:33,582 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 18:44:33,582 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 18:44:33,584 INFO L87 Difference]: Start difference. First operand 270 states. Second operand 3 states. [2018-02-02 18:44:33,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:44:33,746 INFO L93 Difference]: Finished difference Result 277 states and 310 transitions. [2018-02-02 18:44:33,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 18:44:33,748 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-02-02 18:44:33,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:44:33,758 INFO L225 Difference]: With dead ends: 277 [2018-02-02 18:44:33,759 INFO L226 Difference]: Without dead ends: 274 [2018-02-02 18:44:33,760 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 18:44:33,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2018-02-02 18:44:33,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 266. [2018-02-02 18:44:33,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2018-02-02 18:44:33,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 296 transitions. [2018-02-02 18:44:33,807 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 296 transitions. Word has length 4 [2018-02-02 18:44:33,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:44:33,807 INFO L432 AbstractCegarLoop]: Abstraction has 266 states and 296 transitions. [2018-02-02 18:44:33,807 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 18:44:33,807 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 296 transitions. [2018-02-02 18:44:33,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-02-02 18:44:33,808 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:44:33,808 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-02-02 18:44:33,808 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, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, 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 18:44:33,808 INFO L82 PathProgramCache]: Analyzing trace with hash 15106046, now seen corresponding path program 1 times [2018-02-02 18:44:33,808 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:44:33,808 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:44:33,809 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:44:33,809 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:44:33,809 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:44:33,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:44:33,815 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:44:33,842 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 18:44:33,843 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:44:33,843 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 18:44:33,844 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 18:44:33,844 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 18:44:33,844 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 18:44:33,844 INFO L87 Difference]: Start difference. First operand 266 states and 296 transitions. Second operand 3 states. [2018-02-02 18:44:33,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:44:33,986 INFO L93 Difference]: Finished difference Result 382 states and 436 transitions. [2018-02-02 18:44:33,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 18:44:33,986 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-02-02 18:44:33,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:44:33,988 INFO L225 Difference]: With dead ends: 382 [2018-02-02 18:44:33,988 INFO L226 Difference]: Without dead ends: 382 [2018-02-02 18:44:33,988 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 18:44:33,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2018-02-02 18:44:33,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 337. [2018-02-02 18:44:33,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2018-02-02 18:44:34,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 415 transitions. [2018-02-02 18:44:34,001 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 415 transitions. Word has length 4 [2018-02-02 18:44:34,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:44:34,002 INFO L432 AbstractCegarLoop]: Abstraction has 337 states and 415 transitions. [2018-02-02 18:44:34,002 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 18:44:34,002 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 415 transitions. [2018-02-02 18:44:34,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-02 18:44:34,003 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:44:34,003 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 18:44:34,003 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, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, 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 18:44:34,003 INFO L82 PathProgramCache]: Analyzing trace with hash -416211489, now seen corresponding path program 1 times [2018-02-02 18:44:34,003 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:44:34,003 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:44:34,004 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:44:34,005 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:44:34,005 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:44:34,020 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-02 18:44:34,020 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-02 18:44:34,020 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-02-02 18:44:34,030 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:44:34,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:44:34,058 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:44:34,090 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 18:44:34,091 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:44:34,092 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:44:34,092 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-02 18:44:34,101 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 18:44:34,118 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:44:34,118 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 18:44:34,118 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 18:44:34,118 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 18:44:34,119 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 18:44:34,119 INFO L87 Difference]: Start difference. First operand 337 states and 415 transitions. Second operand 4 states. [2018-02-02 18:44:34,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:44:34,251 INFO L93 Difference]: Finished difference Result 336 states and 414 transitions. [2018-02-02 18:44:34,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 18:44:34,252 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-02-02 18:44:34,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:44:34,254 INFO L225 Difference]: With dead ends: 336 [2018-02-02 18:44:34,254 INFO L226 Difference]: Without dead ends: 336 [2018-02-02 18:44:34,254 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 18:44:34,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2018-02-02 18:44:34,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 336. [2018-02-02 18:44:34,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2018-02-02 18:44:34,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 414 transitions. [2018-02-02 18:44:34,268 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 414 transitions. Word has length 17 [2018-02-02 18:44:34,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:44:34,268 INFO L432 AbstractCegarLoop]: Abstraction has 336 states and 414 transitions. [2018-02-02 18:44:34,268 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 18:44:34,269 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 414 transitions. [2018-02-02 18:44:34,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-02 18:44:34,269 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:44:34,269 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 18:44:34,269 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, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, 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 18:44:34,269 INFO L82 PathProgramCache]: Analyzing trace with hash -416211488, now seen corresponding path program 1 times [2018-02-02 18:44:34,269 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:44:34,270 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:44:34,270 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:44:34,270 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:44:34,271 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:44:34,282 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-02 18:44:34,282 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-02 18:44:34,283 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-02-02 18:44:34,289 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:44:34,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:44:34,314 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:44:34,324 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 18:44:34,325 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:44:34,346 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 18:44:34,346 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:44:34,361 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 18:44:34,361 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:46, output treesize:44 [2018-02-02 18:44:34,388 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 18:44:34,405 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:44:34,405 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 18:44:34,405 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 18:44:34,405 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 18:44:34,405 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 18:44:34,405 INFO L87 Difference]: Start difference. First operand 336 states and 414 transitions. Second operand 4 states. [2018-02-02 18:44:34,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:44:34,568 INFO L93 Difference]: Finished difference Result 335 states and 413 transitions. [2018-02-02 18:44:34,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 18:44:34,568 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-02-02 18:44:34,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:44:34,569 INFO L225 Difference]: With dead ends: 335 [2018-02-02 18:44:34,570 INFO L226 Difference]: Without dead ends: 335 [2018-02-02 18:44:34,570 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 18:44:34,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2018-02-02 18:44:34,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 335. [2018-02-02 18:44:34,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2018-02-02 18:44:34,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 413 transitions. [2018-02-02 18:44:34,580 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 413 transitions. Word has length 17 [2018-02-02 18:44:34,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:44:34,580 INFO L432 AbstractCegarLoop]: Abstraction has 335 states and 413 transitions. [2018-02-02 18:44:34,580 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 18:44:34,580 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 413 transitions. [2018-02-02 18:44:34,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-02-02 18:44:34,583 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:44:34,584 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 18:44:34,584 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, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, 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 18:44:34,584 INFO L82 PathProgramCache]: Analyzing trace with hash -1095590031, now seen corresponding path program 1 times [2018-02-02 18:44:34,584 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:44:34,584 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:44:34,585 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:44:34,585 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:44:34,585 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:44:34,602 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-02 18:44:34,602 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-02 18:44:34,602 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-02-02 18:44:34,611 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:44:34,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:44:34,710 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:44:34,723 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 18:44:34,723 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:44:34,725 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:44:34,725 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-02 18:44:34,792 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 18:44:34,798 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:44:34,799 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 18:44:34,799 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:44:34,800 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 18:44:34,800 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-02-02 18:44:34,809 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 18:44:34,821 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:44:34,822 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:44:34,822 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 18:44:34,823 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:44:34,848 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 18:44:34,848 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:20 [2018-02-02 18:44:34,885 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 18:44:34,916 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 18:44:34,916 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-02 18:44:34,917 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 18:44:34,917 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 18:44:34,917 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=125, Unknown=2, NotChecked=46, Total=210 [2018-02-02 18:44:34,917 INFO L87 Difference]: Start difference. First operand 335 states and 413 transitions. Second operand 15 states. [2018-02-02 18:44:35,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:44:35,832 INFO L93 Difference]: Finished difference Result 507 states and 622 transitions. [2018-02-02 18:44:35,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 18:44:35,833 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 142 [2018-02-02 18:44:35,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:44:35,835 INFO L225 Difference]: With dead ends: 507 [2018-02-02 18:44:35,836 INFO L226 Difference]: Without dead ends: 507 [2018-02-02 18:44:35,836 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 18:44:35,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2018-02-02 18:44:35,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 378. [2018-02-02 18:44:35,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2018-02-02 18:44:35,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 488 transitions. [2018-02-02 18:44:35,847 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 488 transitions. Word has length 142 [2018-02-02 18:44:35,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:44:35,848 INFO L432 AbstractCegarLoop]: Abstraction has 378 states and 488 transitions. [2018-02-02 18:44:35,848 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 18:44:35,848 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 488 transitions. [2018-02-02 18:44:35,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-02-02 18:44:35,850 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:44:35,850 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 18:44:35,851 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, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, 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 18:44:35,851 INFO L82 PathProgramCache]: Analyzing trace with hash -1095590030, now seen corresponding path program 1 times [2018-02-02 18:44:35,851 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:44:35,851 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:44:35,852 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:44:35,852 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:44:35,852 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:44:35,864 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-02 18:44:35,864 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-02 18:44:35,864 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-02-02 18:44:35,872 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:44:35,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:44:36,002 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:44:36,083 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 18:44:36,114 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:44:36,114 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 18:44:36,115 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 18:44:36,115 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 18:44:36,115 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-02 18:44:36,115 INFO L87 Difference]: Start difference. First operand 378 states and 488 transitions. Second operand 8 states. [2018-02-02 18:44:36,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:44:36,560 INFO L93 Difference]: Finished difference Result 388 states and 498 transitions. [2018-02-02 18:44:36,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 18:44:36,561 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 142 [2018-02-02 18:44:36,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:44:36,563 INFO L225 Difference]: With dead ends: 388 [2018-02-02 18:44:36,563 INFO L226 Difference]: Without dead ends: 379 [2018-02-02 18:44:36,563 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 18:44:36,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2018-02-02 18:44:36,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 379. [2018-02-02 18:44:36,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2018-02-02 18:44:36,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 489 transitions. [2018-02-02 18:44:36,573 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 489 transitions. Word has length 142 [2018-02-02 18:44:36,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:44:36,573 INFO L432 AbstractCegarLoop]: Abstraction has 379 states and 489 transitions. [2018-02-02 18:44:36,573 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 18:44:36,574 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 489 transitions. [2018-02-02 18:44:36,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-02-02 18:44:36,575 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:44:36,575 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 18:44:36,575 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, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, 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 18:44:36,576 INFO L82 PathProgramCache]: Analyzing trace with hash 1271552274, now seen corresponding path program 1 times [2018-02-02 18:44:36,576 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:44:36,576 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:44:36,577 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:44:36,577 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:44:36,577 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:44:36,589 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-02 18:44:36,589 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-02 18:44:36,589 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-02-02 18:44:36,597 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:44:36,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:44:36,792 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:44:36,873 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 18:44:36,890 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 18:44:36,890 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-02 18:44:36,890 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 18:44:36,891 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 18:44:36,891 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-02-02 18:44:36,891 INFO L87 Difference]: Start difference. First operand 379 states and 489 transitions. Second operand 9 states. [2018-02-02 18:44:37,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:44:37,001 INFO L93 Difference]: Finished difference Result 389 states and 499 transitions. [2018-02-02 18:44:37,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 18:44:37,001 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 148 [2018-02-02 18:44:37,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:44:37,003 INFO L225 Difference]: With dead ends: 389 [2018-02-02 18:44:37,003 INFO L226 Difference]: Without dead ends: 380 [2018-02-02 18:44:37,003 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-02-02 18:44:37,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2018-02-02 18:44:37,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 380. [2018-02-02 18:44:37,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2018-02-02 18:44:37,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 490 transitions. [2018-02-02 18:44:37,012 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 490 transitions. Word has length 148 [2018-02-02 18:44:37,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:44:37,012 INFO L432 AbstractCegarLoop]: Abstraction has 380 states and 490 transitions. [2018-02-02 18:44:37,012 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 18:44:37,012 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 490 transitions. [2018-02-02 18:44:37,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-02-02 18:44:37,013 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:44:37,014 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 18:44:37,014 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, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, 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 18:44:37,014 INFO L82 PathProgramCache]: Analyzing trace with hash -249451022, now seen corresponding path program 2 times [2018-02-02 18:44:37,014 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:44:37,014 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:44:37,015 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:44:37,015 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:44:37,015 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:44:37,026 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-02 18:44:37,026 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-02 18:44:37,026 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-02-02 18:44:37,035 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 18:44:38,535 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-02 18:44:38,535 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 18:44:38,541 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:44:38,652 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 263 proven. 38 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2018-02-02 18:44:38,684 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 18:44:38,685 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-02 18:44:38,685 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 18:44:38,685 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 18:44:38,685 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-02-02 18:44:38,685 INFO L87 Difference]: Start difference. First operand 380 states and 490 transitions. Second operand 10 states. [2018-02-02 18:44:38,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:44:38,803 INFO L93 Difference]: Finished difference Result 390 states and 500 transitions. [2018-02-02 18:44:38,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 18:44:38,812 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 154 [2018-02-02 18:44:38,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:44:38,814 INFO L225 Difference]: With dead ends: 390 [2018-02-02 18:44:38,814 INFO L226 Difference]: Without dead ends: 381 [2018-02-02 18:44:38,814 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-02-02 18:44:38,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2018-02-02 18:44:38,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 381. [2018-02-02 18:44:38,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2018-02-02 18:44:38,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 491 transitions. [2018-02-02 18:44:38,820 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 491 transitions. Word has length 154 [2018-02-02 18:44:38,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:44:38,821 INFO L432 AbstractCegarLoop]: Abstraction has 381 states and 491 transitions. [2018-02-02 18:44:38,821 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 18:44:38,821 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 491 transitions. [2018-02-02 18:44:38,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-02-02 18:44:38,822 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:44:38,822 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 18:44:38,823 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, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, 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 18:44:38,823 INFO L82 PathProgramCache]: Analyzing trace with hash 1814607250, now seen corresponding path program 3 times [2018-02-02 18:44:38,823 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:44:38,823 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:44:38,824 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:44:38,824 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 18:44:38,824 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:44:38,833 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-02 18:44:38,833 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-02 18:44:38,833 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-02-02 18:44:38,840 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-02 18:44:38,976 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-02-02 18:44:38,976 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 18:44:38,981 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:44:38,995 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 32 [2018-02-02 18:44:38,996 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:44:39,144 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 35 [2018-02-02 18:44:39,145 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:44:39,168 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2018-02-02 18:44:39,168 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 18:44:39,169 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 34 [2018-02-02 18:44:39,170 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 18:44:39,201 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 18:44:39,202 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:70, output treesize:66 [2018-02-02 18:44:45,742 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2018-02-02 18:44:45,743 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:44:45,758 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2018-02-02 18:44:45,758 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:44:45,773 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2018-02-02 18:44:45,774 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 18:44:45,788 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2018-02-02 18:44:45,788 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 18:44:45,801 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 4 dim-1 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-02-02 18:44:45,802 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:49, output treesize:37 [2018-02-02 18:44:50,168 WARN L1033 $PredicateComparison]: unable to prove that (let ((.cse1 (exists ((v_prenex_12 Int) (|v_calloc_model_#in~nmemb_BEFORE_CALL_5| Int) (v_calloc_model_~ptr~0.base_BEFORE_CALL_3 Int)) (let ((.cse7 (mod (* |v_calloc_model_#in~nmemb_BEFORE_CALL_5| v_prenex_12) 4294967296))) (and (= .cse7 (select |c_#length| v_calloc_model_~ptr~0.base_BEFORE_CALL_3)) (<= .cse7 2147483647))))) (.cse0 (exists ((v_prenex_18 Int) (v_prenex_17 Int)) (let ((.cse6 (mod (* |c_calloc_model_#in~nmemb| v_prenex_18) 4294967296))) (and (= 0 (select |c_old(#valid)| v_prenex_17)) (= (store |c_old(#length)| v_prenex_17 (+ .cse6 (- 4294967296))) |c_#length|) (< 2147483647 .cse6))))) (.cse3 (exists ((v_prenex_15 Int) (calloc_model_~size Int) (v_prenex_13 Int)) (let ((.cse5 (mod (* v_prenex_13 calloc_model_~size) 4294967296))) (and (= (+ (select |c_#length| v_prenex_15) 4294967296) .cse5) (< 2147483647 .cse5))))) (.cse2 (exists ((calloc_model_~ptr~0.base Int) (v_prenex_19 Int)) (let ((.cse4 (mod (* |c_calloc_model_#in~nmemb| v_prenex_19) 4294967296))) (and (= 0 (select |c_old(#valid)| calloc_model_~ptr~0.base)) (<= .cse4 2147483647) (= (store |c_old(#length)| calloc_model_~ptr~0.base .cse4) |c_#length|)))))) (or (and .cse0 .cse1) (and .cse1 .cse2) (and .cse0 .cse3) (and .cse3 .cse2))) is different from true [2018-02-02 18:44:54,296 WARN L1033 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_23 Int) (v_prenex_24 Int)) (let ((.cse0 (mod v_prenex_23 4294967296))) (and (< 2147483647 .cse0) (= (store |c_old(#length)| v_prenex_24 (+ .cse0 (- 4294967296))) |c_#length|) (= 0 (select |c_old(#valid)| v_prenex_24))))) (exists ((calloc_model_~ptr~0.base Int) (v_prenex_19 Int)) (let ((.cse1 (mod v_prenex_19 4294967296))) (and (= (store |c_old(#length)| calloc_model_~ptr~0.base .cse1) |c_#length|) (= 0 (select |c_old(#valid)| calloc_model_~ptr~0.base)) (<= .cse1 2147483647))))) is different from true [2018-02-02 18:44:54,302 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:44:54,303 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:44:54,303 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 26 [2018-02-02 18:44:54,303 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:44:54,317 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 26 treesize of output 25 [2018-02-02 18:44:54,318 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:44:54,331 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:44:54,332 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:44:54,332 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 47 [2018-02-02 18:44:54,333 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 18:44:54,347 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:44:54,348 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:44:54,348 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 27 [2018-02-02 18:44:54,348 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 18:44:54,361 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-02-02 18:44:54,361 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:67, output treesize:49 [2018-02-02 18:44:54,791 INFO L134 CoverageAnalysis]: Checked inductivity of 531 backedges. 260 proven. 29 refuted. 0 times theorem prover too weak. 237 trivial. 5 not checked. [2018-02-02 18:44:54,807 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 18:44:54,808 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-02 18:44:54,808 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-02 18:44:54,808 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-02 18:44:54,808 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=470, Unknown=9, NotChecked=90, Total=650 [2018-02-02 18:44:54,808 INFO L87 Difference]: Start difference. First operand 381 states and 491 transitions. Second operand 26 states. [2018-02-02 18:44:59,455 WARN L146 SmtUtils]: Spent 265ms on a formula simplification. DAG size of input: 79 DAG size of output 51 [2018-02-02 18:45:23,087 WARN L146 SmtUtils]: Spent 23055ms on a formula simplification. DAG size of input: 78 DAG size of output 76 Received shutdown request... [2018-02-02 18:46:22,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 18:46:22,975 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-02 18:46:22,979 WARN L185 ceAbstractionStarter]: Timeout [2018-02-02 18:46:22,980 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 06:46:22 BoogieIcfgContainer [2018-02-02 18:46:22,980 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 18:46:22,980 INFO L168 Benchmark]: Toolchain (without parser) took 110350.26 ms. Allocated memory was 400.6 MB in the beginning and 707.8 MB in the end (delta: 307.2 MB). Free memory was 357.4 MB in the beginning and 545.8 MB in the end (delta: -188.4 MB). Peak memory consumption was 118.9 MB. Max. memory is 5.3 GB. [2018-02-02 18:46:22,982 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 400.6 MB. Free memory is still 364.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 18:46:22,982 INFO L168 Benchmark]: CACSL2BoogieTranslator took 161.80 ms. Allocated memory is still 400.6 MB. Free memory was 357.4 MB in the beginning and 344.1 MB in the end (delta: 13.3 MB). Peak memory consumption was 13.3 MB. Max. memory is 5.3 GB. [2018-02-02 18:46:22,982 INFO L168 Benchmark]: Boogie Preprocessor took 35.87 ms. Allocated memory is still 400.6 MB. Free memory was 344.1 MB in the beginning and 342.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-02 18:46:22,982 INFO L168 Benchmark]: RCFGBuilder took 503.68 ms. Allocated memory is still 400.6 MB. Free memory was 342.8 MB in the beginning and 281.8 MB in the end (delta: 61.0 MB). Peak memory consumption was 61.0 MB. Max. memory is 5.3 GB. [2018-02-02 18:46:22,983 INFO L168 Benchmark]: TraceAbstraction took 109645.86 ms. Allocated memory was 400.6 MB in the beginning and 707.8 MB in the end (delta: 307.2 MB). Free memory was 281.8 MB in the beginning and 545.8 MB in the end (delta: -264.0 MB). Peak memory consumption was 43.2 MB. Max. memory is 5.3 GB. [2018-02-02 18:46:22,984 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.13 ms. Allocated memory is still 400.6 MB. Free memory is still 364.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 161.80 ms. Allocated memory is still 400.6 MB. Free memory was 357.4 MB in the beginning and 344.1 MB in the end (delta: 13.3 MB). Peak memory consumption was 13.3 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 35.87 ms. Allocated memory is still 400.6 MB. Free memory was 344.1 MB in the beginning and 342.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 503.68 ms. Allocated memory is still 400.6 MB. Free memory was 342.8 MB in the beginning and 281.8 MB in the end (delta: 61.0 MB). Peak memory consumption was 61.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 109645.86 ms. Allocated memory was 400.6 MB in the beginning and 707.8 MB in the end (delta: 307.2 MB). Free memory was 281.8 MB in the beginning and 545.8 MB in the end (delta: -264.0 MB). Peak memory consumption was 43.2 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 constructing difference of abstraction (381states) and interpolant automaton (currently 11 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 127. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 832). Cancelled while BasicCegarLoop was constructing difference of abstraction (381states) and interpolant automaton (currently 11 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 127. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 831). Cancelled while BasicCegarLoop was constructing difference of abstraction (381states) and interpolant automaton (currently 11 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 127. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 832). Cancelled while BasicCegarLoop was constructing difference of abstraction (381states) and interpolant automaton (currently 11 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 127. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 834). Cancelled while BasicCegarLoop was constructing difference of abstraction (381states) and interpolant automaton (currently 11 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 127. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 834). Cancelled while BasicCegarLoop was constructing difference of abstraction (381states) and interpolant automaton (currently 11 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 127. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 812). Cancelled while BasicCegarLoop was constructing difference of abstraction (381states) and interpolant automaton (currently 11 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 127. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 812). Cancelled while BasicCegarLoop was constructing difference of abstraction (381states) and interpolant automaton (currently 11 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 127. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 813). Cancelled while BasicCegarLoop was constructing difference of abstraction (381states) and interpolant automaton (currently 11 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 127. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 812). Cancelled while BasicCegarLoop was constructing difference of abstraction (381states) and interpolant automaton (currently 11 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 127. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 813). Cancelled while BasicCegarLoop was constructing difference of abstraction (381states) and interpolant automaton (currently 11 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 127. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 812). Cancelled while BasicCegarLoop was constructing difference of abstraction (381states) and interpolant automaton (currently 11 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 127. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 820). Cancelled while BasicCegarLoop was constructing difference of abstraction (381states) and interpolant automaton (currently 11 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 127. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 822). Cancelled while BasicCegarLoop was constructing difference of abstraction (381states) and interpolant automaton (currently 11 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 127. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 819). Cancelled while BasicCegarLoop was constructing difference of abstraction (381states) and interpolant automaton (currently 11 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 127. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 819). Cancelled while BasicCegarLoop was constructing difference of abstraction (381states) and interpolant automaton (currently 11 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 127. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 819). Cancelled while BasicCegarLoop was constructing difference of abstraction (381states) and interpolant automaton (currently 11 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 127. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 822). Cancelled while BasicCegarLoop was constructing difference of abstraction (381states) and interpolant automaton (currently 11 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 127. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 819). Cancelled while BasicCegarLoop was constructing difference of abstraction (381states) and interpolant automaton (currently 11 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 127. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 820). Cancelled while BasicCegarLoop was constructing difference of abstraction (381states) and interpolant automaton (currently 11 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 127. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 794). Cancelled while BasicCegarLoop was constructing difference of abstraction (381states) and interpolant automaton (currently 11 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 127. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 795). Cancelled while BasicCegarLoop was constructing difference of abstraction (381states) and interpolant automaton (currently 11 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 127. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 794). Cancelled while BasicCegarLoop was constructing difference of abstraction (381states) and interpolant automaton (currently 11 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 127. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 794). Cancelled while BasicCegarLoop was constructing difference of abstraction (381states) and interpolant automaton (currently 11 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 127. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 795). Cancelled while BasicCegarLoop was constructing difference of abstraction (381states) and interpolant automaton (currently 11 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 127. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 794). Cancelled while BasicCegarLoop was constructing difference of abstraction (381states) and interpolant automaton (currently 11 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 127. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 883). Cancelled while BasicCegarLoop was constructing difference of abstraction (381states) and interpolant automaton (currently 11 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 127. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 887). Cancelled while BasicCegarLoop was constructing difference of abstraction (381states) and interpolant automaton (currently 11 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 127. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 881). Cancelled while BasicCegarLoop was constructing difference of abstraction (381states) and interpolant automaton (currently 11 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 127. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 885). Cancelled while BasicCegarLoop was constructing difference of abstraction (381states) and interpolant automaton (currently 11 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 127. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 881). Cancelled while BasicCegarLoop was constructing difference of abstraction (381states) and interpolant automaton (currently 11 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 127. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 882). Cancelled while BasicCegarLoop was constructing difference of abstraction (381states) and interpolant automaton (currently 11 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 127. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 884). Cancelled while BasicCegarLoop was constructing difference of abstraction (381states) and interpolant automaton (currently 11 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 127. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 886). Cancelled while BasicCegarLoop was constructing difference of abstraction (381states) and interpolant automaton (currently 11 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 127. - TimeoutResultAtElement [Line: 875]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 875). Cancelled while BasicCegarLoop was constructing difference of abstraction (381states) and interpolant automaton (currently 11 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 127. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 885). Cancelled while BasicCegarLoop was constructing difference of abstraction (381states) and interpolant automaton (currently 11 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 127. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 886). Cancelled while BasicCegarLoop was constructing difference of abstraction (381states) and interpolant automaton (currently 11 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 127. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 882). Cancelled while BasicCegarLoop was constructing difference of abstraction (381states) and interpolant automaton (currently 11 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 127. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 883). Cancelled while BasicCegarLoop was constructing difference of abstraction (381states) and interpolant automaton (currently 11 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 127. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 887). Cancelled while BasicCegarLoop was constructing difference of abstraction (381states) and interpolant automaton (currently 11 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 127. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 884). Cancelled while BasicCegarLoop was constructing difference of abstraction (381states) and interpolant automaton (currently 11 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 127. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 786). Cancelled while BasicCegarLoop was constructing difference of abstraction (381states) and interpolant automaton (currently 11 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 127. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 785). Cancelled while BasicCegarLoop was constructing difference of abstraction (381states) and interpolant automaton (currently 11 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 127. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 786). Cancelled while BasicCegarLoop was constructing difference of abstraction (381states) and interpolant automaton (currently 11 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 127. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 785). Cancelled while BasicCegarLoop was constructing difference of abstraction (381states) and interpolant automaton (currently 11 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 127. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 785). Cancelled while BasicCegarLoop was constructing difference of abstraction (381states) and interpolant automaton (currently 11 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 127. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 785). Cancelled while BasicCegarLoop was constructing difference of abstraction (381states) and interpolant automaton (currently 11 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 127. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 804). Cancelled while BasicCegarLoop was constructing difference of abstraction (381states) and interpolant automaton (currently 11 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 127. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 803). Cancelled while BasicCegarLoop was constructing difference of abstraction (381states) and interpolant automaton (currently 11 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 127. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 803). Cancelled while BasicCegarLoop was constructing difference of abstraction (381states) and interpolant automaton (currently 11 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 127. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 803). Cancelled while BasicCegarLoop was constructing difference of abstraction (381states) and interpolant automaton (currently 11 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 127. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 803). Cancelled while BasicCegarLoop was constructing difference of abstraction (381states) and interpolant automaton (currently 11 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 127. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 804). Cancelled while BasicCegarLoop was constructing difference of abstraction (381states) and interpolant automaton (currently 11 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 127. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 870). Cancelled while BasicCegarLoop was constructing difference of abstraction (381states) and interpolant automaton (currently 11 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 127. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 868). Cancelled while BasicCegarLoop was constructing difference of abstraction (381states) and interpolant automaton (currently 11 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 127. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 867). Cancelled while BasicCegarLoop was constructing difference of abstraction (381states) and interpolant automaton (currently 11 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 127. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 867). Cancelled while BasicCegarLoop was constructing difference of abstraction (381states) and interpolant automaton (currently 11 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 127. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 870). Cancelled while BasicCegarLoop was constructing difference of abstraction (381states) and interpolant automaton (currently 11 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 127. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 868). Cancelled while BasicCegarLoop was constructing difference of abstraction (381states) and interpolant automaton (currently 11 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 127. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 742). Cancelled while BasicCegarLoop was constructing difference of abstraction (381states) and interpolant automaton (currently 11 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 127. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 742). Cancelled while BasicCegarLoop was constructing difference of abstraction (381states) and interpolant automaton (currently 11 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 127. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 776). Cancelled while BasicCegarLoop was constructing difference of abstraction (381states) and interpolant automaton (currently 11 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 127. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 776). Cancelled while BasicCegarLoop was constructing difference of abstraction (381states) and interpolant automaton (currently 11 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 127. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 776). Cancelled while BasicCegarLoop was constructing difference of abstraction (381states) and interpolant automaton (currently 11 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 127. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 777). Cancelled while BasicCegarLoop was constructing difference of abstraction (381states) and interpolant automaton (currently 11 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 127. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 776). Cancelled while BasicCegarLoop was constructing difference of abstraction (381states) and interpolant automaton (currently 11 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 127. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 775). Cancelled while BasicCegarLoop was constructing difference of abstraction (381states) and interpolant automaton (currently 11 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 127. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 775). Cancelled while BasicCegarLoop was constructing difference of abstraction (381states) and interpolant automaton (currently 11 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 127. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 777). Cancelled while BasicCegarLoop was constructing difference of abstraction (381states) and interpolant automaton (currently 11 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 127. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 877). Cancelled while BasicCegarLoop was constructing difference of abstraction (381states) and interpolant automaton (currently 11 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 127. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 877). Cancelled while BasicCegarLoop was constructing difference of abstraction (381states) and interpolant automaton (currently 11 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 127. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 856). Cancelled while BasicCegarLoop was constructing difference of abstraction (381states) and interpolant automaton (currently 11 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 127. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 858). Cancelled while BasicCegarLoop was constructing difference of abstraction (381states) and interpolant automaton (currently 11 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 127. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 855). Cancelled while BasicCegarLoop was constructing difference of abstraction (381states) and interpolant automaton (currently 11 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 127. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 855). Cancelled while BasicCegarLoop was constructing difference of abstraction (381states) and interpolant automaton (currently 11 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 127. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 858). Cancelled while BasicCegarLoop was constructing difference of abstraction (381states) and interpolant automaton (currently 11 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 127. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 856). Cancelled while BasicCegarLoop was constructing difference of abstraction (381states) and interpolant automaton (currently 11 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 127. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 843). Cancelled while BasicCegarLoop was constructing difference of abstraction (381states) and interpolant automaton (currently 11 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 127. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 843). Cancelled while BasicCegarLoop was constructing difference of abstraction (381states) and interpolant automaton (currently 11 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 127. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 844). Cancelled while BasicCegarLoop was constructing difference of abstraction (381states) and interpolant automaton (currently 11 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 127. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 846). Cancelled while BasicCegarLoop was constructing difference of abstraction (381states) and interpolant automaton (currently 11 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 127. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 846). Cancelled while BasicCegarLoop was constructing difference of abstraction (381states) and interpolant automaton (currently 11 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 127. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 844). Cancelled while BasicCegarLoop was constructing difference of abstraction (381states) and interpolant automaton (currently 11 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 127. - StatisticsResult: Ultimate Automizer benchmark data CFG has 16 procedures, 270 locations, 83 error locations. TIMEOUT Result, 109.6s OverallTime, 9 OverallIterations, 18 TraceHistogramMax, 90.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2138 SDtfs, 829 SDslu, 8595 SDs, 0 SdLazy, 2742 SolverSat, 147 SolverUnsat, 6 SolverUnknown, 0 SolverNotchecked, 7.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 805 GetRequests, 712 SyntacticMatches, 3 SemanticMatches, 89 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 39.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=381occurred 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, 8 MinimizatonAttempts, 182 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.9s SatisfiabilityAnalysisTime, 16.4s InterpolantComputationTime, 788 NumberOfCodeBlocks, 706 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 779 ConstructedInterpolants, 46 QuantifiedInterpolants, 488236 SizeOfPredicates, 49 NumberOfNonLiveVariables, 3491 ConjunctsInSsa, 228 ConjunctsInUnsatCore, 9 InterpolantComputations, 5 PerfectInterpolantSequences, 1718/1800 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0235_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_18-46-22-993.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0235_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-02_18-46-22-993.csv Completed graceful shutdown