java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf -i ../../../trunk/examples/svcomp/memsafety/test-0234_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-26d9e06-m [2018-02-02 08:54:14,480 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 08:54:14,482 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 08:54:14,491 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 08:54:14,491 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 08:54:14,492 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 08:54:14,493 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 08:54:14,495 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 08:54:14,497 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 08:54:14,497 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 08:54:14,498 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 08:54:14,498 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 08:54:14,499 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 08:54:14,500 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 08:54:14,501 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 08:54:14,502 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 08:54:14,504 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 08:54:14,506 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 08:54:14,507 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 08:54:14,508 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 08:54:14,510 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 08:54:14,510 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 08:54:14,510 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 08:54:14,511 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 08:54:14,512 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 08:54:14,513 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 08:54:14,513 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 08:54:14,514 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 08:54:14,514 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 08:54:14,514 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 08:54:14,514 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 08:54:14,515 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf [2018-02-02 08:54:14,525 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 08:54:14,525 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 08:54:14,526 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 08:54:14,526 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 08:54:14,527 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 08:54:14,527 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 08:54:14,527 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 08:54:14,527 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 08:54:14,527 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 08:54:14,527 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 08:54:14,527 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 08:54:14,528 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 08:54:14,528 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 08:54:14,528 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 08:54:14,528 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 08:54:14,528 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 08:54:14,528 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 08:54:14,529 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 08:54:14,529 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 08:54:14,529 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 08:54:14,529 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 08:54:14,529 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 08:54:14,529 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-02 08:54:14,530 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-02 08:54:14,530 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-02 08:54:14,558 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 08:54:14,567 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 08:54:14,571 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 08:54:14,572 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 08:54:14,572 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 08:54:14,573 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/test-0234_false-valid-memtrack.i [2018-02-02 08:54:14,737 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 08:54:14,738 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 08:54:14,739 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 08:54:14,739 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 08:54:14,745 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 08:54:14,746 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 08:54:14" (1/1) ... [2018-02-02 08:54:14,748 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49389d2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:54:14, skipping insertion in model container [2018-02-02 08:54:14,748 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 08:54:14" (1/1) ... [2018-02-02 08:54:14,763 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 08:54:14,800 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 08:54:14,882 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 08:54:14,898 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 08:54:14,905 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:54:14 WrapperNode [2018-02-02 08:54:14,905 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 08:54:14,906 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 08:54:14,906 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 08:54:14,906 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 08:54:14,915 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:54:14" (1/1) ... [2018-02-02 08:54:14,915 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:54:14" (1/1) ... [2018-02-02 08:54:14,925 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:54:14" (1/1) ... [2018-02-02 08:54:14,925 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:54:14" (1/1) ... [2018-02-02 08:54:14,931 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:54:14" (1/1) ... [2018-02-02 08:54:14,934 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:54:14" (1/1) ... [2018-02-02 08:54:14,935 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:54:14" (1/1) ... [2018-02-02 08:54:14,937 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 08:54:14,937 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 08:54:14,937 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 08:54:14,937 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 08:54:14,938 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:54:14" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 08:54:14,972 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 08:54:14,972 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 08:54:14,972 INFO L136 BoogieDeclarations]: Found implementation of procedure calloc_model [2018-02-02 08:54:14,972 INFO L136 BoogieDeclarations]: Found implementation of procedure zalloc_or_die [2018-02-02 08:54:14,972 INFO L136 BoogieDeclarations]: Found implementation of procedure l4_insert [2018-02-02 08:54:14,973 INFO L136 BoogieDeclarations]: Found implementation of procedure l3_insert [2018-02-02 08:54:14,973 INFO L136 BoogieDeclarations]: Found implementation of procedure l2_insert [2018-02-02 08:54:14,973 INFO L136 BoogieDeclarations]: Found implementation of procedure l1_insert [2018-02-02 08:54:14,973 INFO L136 BoogieDeclarations]: Found implementation of procedure l0_insert [2018-02-02 08:54:14,973 INFO L136 BoogieDeclarations]: Found implementation of procedure l4_destroy [2018-02-02 08:54:14,973 INFO L136 BoogieDeclarations]: Found implementation of procedure l3_destroy [2018-02-02 08:54:14,973 INFO L136 BoogieDeclarations]: Found implementation of procedure l2_destroy [2018-02-02 08:54:14,973 INFO L136 BoogieDeclarations]: Found implementation of procedure l1_destroy [2018-02-02 08:54:14,973 INFO L136 BoogieDeclarations]: Found implementation of procedure l0_destroy [2018-02-02 08:54:14,973 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 08:54:14,973 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-02 08:54:14,973 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-02 08:54:14,974 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 08:54:14,974 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 08:54:14,974 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 08:54:14,974 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2018-02-02 08:54:14,974 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2018-02-02 08:54:14,974 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-02 08:54:14,974 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-02 08:54:14,974 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-02-02 08:54:14,974 INFO L128 BoogieDeclarations]: Found specification of procedure memset [2018-02-02 08:54:14,974 INFO L128 BoogieDeclarations]: Found specification of procedure calloc_model [2018-02-02 08:54:14,974 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 08:54:14,974 INFO L128 BoogieDeclarations]: Found specification of procedure zalloc_or_die [2018-02-02 08:54:14,975 INFO L128 BoogieDeclarations]: Found specification of procedure l4_insert [2018-02-02 08:54:14,975 INFO L128 BoogieDeclarations]: Found specification of procedure l3_insert [2018-02-02 08:54:14,975 INFO L128 BoogieDeclarations]: Found specification of procedure l2_insert [2018-02-02 08:54:14,975 INFO L128 BoogieDeclarations]: Found specification of procedure l1_insert [2018-02-02 08:54:14,975 INFO L128 BoogieDeclarations]: Found specification of procedure l0_insert [2018-02-02 08:54:14,975 INFO L128 BoogieDeclarations]: Found specification of procedure l4_destroy [2018-02-02 08:54:14,975 INFO L128 BoogieDeclarations]: Found specification of procedure l3_destroy [2018-02-02 08:54:14,975 INFO L128 BoogieDeclarations]: Found specification of procedure l2_destroy [2018-02-02 08:54:14,976 INFO L128 BoogieDeclarations]: Found specification of procedure l1_destroy [2018-02-02 08:54:14,976 INFO L128 BoogieDeclarations]: Found specification of procedure l0_destroy [2018-02-02 08:54:14,976 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 08:54:14,976 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 08:54:14,976 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 08:54:15,251 WARN L455 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-02-02 08:54:15,420 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 08:54:15,420 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 08:54:15 BoogieIcfgContainer [2018-02-02 08:54:15,420 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 08:54:15,421 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 08:54:15,421 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 08:54:15,423 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 08:54:15,423 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 08:54:14" (1/3) ... [2018-02-02 08:54:15,424 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32c71c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 08:54:15, skipping insertion in model container [2018-02-02 08:54:15,424 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:54:14" (2/3) ... [2018-02-02 08:54:15,424 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32c71c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 08:54:15, skipping insertion in model container [2018-02-02 08:54:15,424 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 08:54:15" (3/3) ... [2018-02-02 08:54:15,425 INFO L107 eAbstractionObserver]: Analyzing ICFG test-0234_false-valid-memtrack.i [2018-02-02 08:54:15,432 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-02 08:54:15,437 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 67 error locations. [2018-02-02 08:54:15,462 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 08:54:15,462 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 08:54:15,462 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-02 08:54:15,462 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-02 08:54:15,462 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 08:54:15,462 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 08:54:15,463 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 08:54:15,463 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 08:54:15,463 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 08:54:15,476 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states. [2018-02-02 08:54:15,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-02-02 08:54:15,482 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:54:15,483 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-02-02 08:54:15,483 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_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr0RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-02 08:54:15,486 INFO L82 PathProgramCache]: Analyzing trace with hash 11876704, now seen corresponding path program 1 times [2018-02-02 08:54:15,487 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:54:15,488 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:54:15,518 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:54:15,518 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:54:15,518 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:54:15,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:54:15,546 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:54:15,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:54:15,582 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:54:15,582 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 08:54:15,583 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 08:54:15,645 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 08:54:15,645 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 08:54:15,647 INFO L87 Difference]: Start difference. First operand 224 states. Second operand 3 states. [2018-02-02 08:54:15,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:54:15,807 INFO L93 Difference]: Finished difference Result 254 states and 273 transitions. [2018-02-02 08:54:15,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 08:54:15,808 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-02-02 08:54:15,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:54:15,819 INFO L225 Difference]: With dead ends: 254 [2018-02-02 08:54:15,819 INFO L226 Difference]: Without dead ends: 251 [2018-02-02 08:54:15,821 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 08:54:15,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2018-02-02 08:54:15,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 219. [2018-02-02 08:54:15,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-02-02 08:54:15,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 234 transitions. [2018-02-02 08:54:15,855 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 234 transitions. Word has length 4 [2018-02-02 08:54:15,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:54:15,856 INFO L432 AbstractCegarLoop]: Abstraction has 219 states and 234 transitions. [2018-02-02 08:54:15,856 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 08:54:15,856 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 234 transitions. [2018-02-02 08:54:15,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-02-02 08:54:15,856 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:54:15,856 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-02-02 08:54:15,857 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_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr0RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-02 08:54:15,857 INFO L82 PathProgramCache]: Analyzing trace with hash 11876705, now seen corresponding path program 1 times [2018-02-02 08:54:15,857 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:54:15,857 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:54:15,858 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:54:15,858 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:54:15,858 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:54:15,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:54:15,872 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:54:15,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:54:15,908 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:54:15,908 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 08:54:15,909 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 08:54:15,909 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 08:54:15,909 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 08:54:15,909 INFO L87 Difference]: Start difference. First operand 219 states and 234 transitions. Second operand 3 states. [2018-02-02 08:54:16,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:54:16,018 INFO L93 Difference]: Finished difference Result 226 states and 244 transitions. [2018-02-02 08:54:16,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 08:54:16,018 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-02-02 08:54:16,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:54:16,020 INFO L225 Difference]: With dead ends: 226 [2018-02-02 08:54:16,020 INFO L226 Difference]: Without dead ends: 226 [2018-02-02 08:54:16,021 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 08:54:16,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2018-02-02 08:54:16,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 218. [2018-02-02 08:54:16,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-02-02 08:54:16,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 233 transitions. [2018-02-02 08:54:16,033 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 233 transitions. Word has length 4 [2018-02-02 08:54:16,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:54:16,034 INFO L432 AbstractCegarLoop]: Abstraction has 218 states and 233 transitions. [2018-02-02 08:54:16,034 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 08:54:16,034 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 233 transitions. [2018-02-02 08:54:16,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-02 08:54:16,035 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:54:16,035 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:54:16,035 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_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr0RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-02 08:54:16,035 INFO L82 PathProgramCache]: Analyzing trace with hash -1969754800, now seen corresponding path program 1 times [2018-02-02 08:54:16,035 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:54:16,035 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:54:16,036 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:54:16,036 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:54:16,037 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:54:16,052 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-02 08:54:16,052 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-02 08:54:16,052 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-02-02 08:54:16,059 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:54:16,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:54:16,081 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 08:54:16,110 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-02 08:54:16,112 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 08:54:16,131 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:54:16,131 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-02 08:54:16,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:54:16,158 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:54:16,158 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 08:54:16,159 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 08:54:16,159 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 08:54:16,159 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 08:54:16,159 INFO L87 Difference]: Start difference. First operand 218 states and 233 transitions. Second operand 4 states. [2018-02-02 08:54:16,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:54:16,264 INFO L93 Difference]: Finished difference Result 217 states and 232 transitions. [2018-02-02 08:54:16,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 08:54:16,265 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-02-02 08:54:16,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:54:16,266 INFO L225 Difference]: With dead ends: 217 [2018-02-02 08:54:16,266 INFO L226 Difference]: Without dead ends: 217 [2018-02-02 08:54:16,266 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 08:54:16,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-02-02 08:54:16,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2018-02-02 08:54:16,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-02-02 08:54:16,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 232 transitions. [2018-02-02 08:54:16,272 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 232 transitions. Word has length 17 [2018-02-02 08:54:16,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:54:16,272 INFO L432 AbstractCegarLoop]: Abstraction has 217 states and 232 transitions. [2018-02-02 08:54:16,272 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 08:54:16,273 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 232 transitions. [2018-02-02 08:54:16,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-02 08:54:16,273 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:54:16,273 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:54:16,273 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_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr0RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-02 08:54:16,273 INFO L82 PathProgramCache]: Analyzing trace with hash -1969754799, now seen corresponding path program 1 times [2018-02-02 08:54:16,273 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:54:16,273 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:54:16,274 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:54:16,274 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:54:16,274 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:54:16,284 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-02 08:54:16,284 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-02 08:54:16,284 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-02-02 08:54:16,292 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:54:16,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:54:16,309 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 08:54:16,323 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2018-02-02 08:54:16,324 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 08:54:16,350 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2018-02-02 08:54:16,350 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:54:16,384 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 08:54:16,384 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:46, output treesize:44 [2018-02-02 08:54:16,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:54:16,435 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:54:16,435 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 08:54:16,435 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 08:54:16,435 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 08:54:16,435 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 08:54:16,436 INFO L87 Difference]: Start difference. First operand 217 states and 232 transitions. Second operand 4 states. [2018-02-02 08:54:16,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:54:16,597 INFO L93 Difference]: Finished difference Result 216 states and 231 transitions. [2018-02-02 08:54:16,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 08:54:16,597 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-02-02 08:54:16,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:54:16,598 INFO L225 Difference]: With dead ends: 216 [2018-02-02 08:54:16,598 INFO L226 Difference]: Without dead ends: 216 [2018-02-02 08:54:16,599 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 08:54:16,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2018-02-02 08:54:16,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2018-02-02 08:54:16,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-02-02 08:54:16,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 231 transitions. [2018-02-02 08:54:16,606 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 231 transitions. Word has length 17 [2018-02-02 08:54:16,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:54:16,607 INFO L432 AbstractCegarLoop]: Abstraction has 216 states and 231 transitions. [2018-02-02 08:54:16,607 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 08:54:16,607 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 231 transitions. [2018-02-02 08:54:16,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-02-02 08:54:16,610 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:54:16,611 INFO L351 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:54:16,611 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_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr0RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-02 08:54:16,611 INFO L82 PathProgramCache]: Analyzing trace with hash -772454620, now seen corresponding path program 1 times [2018-02-02 08:54:16,611 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:54:16,611 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:54:16,612 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:54:16,612 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:54:16,612 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:54:16,629 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-02 08:54:16,629 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-02 08:54:16,629 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-02-02 08:54:16,635 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:54:16,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:54:16,739 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 08:54:16,746 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-02 08:54:16,746 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 08:54:16,747 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:54:16,747 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-02 08:54:16,801 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|calloc_model_#t~malloc0.base| Int)) (and (= 0 (select |c_old(#valid)| |calloc_model_#t~malloc0.base|)) (= |c_#valid| (store |c_old(#valid)| |calloc_model_#t~malloc0.base| 1)))) is different from true [2018-02-02 08:54:16,806 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:54:16,808 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2018-02-02 08:54:16,808 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 08:54:16,809 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 08:54:16,809 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-02-02 08:54:16,818 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_calloc_model_~ptr~0.base_BEFORE_CALL_1 Int)) (= 1 (select |c_#valid| v_calloc_model_~ptr~0.base_BEFORE_CALL_1))) (exists ((|calloc_model_#t~malloc0.base| Int)) (and (= 0 (select |c_old(#valid)| |calloc_model_#t~malloc0.base|)) (= |c_#valid| (store |c_old(#valid)| |calloc_model_#t~malloc0.base| 1))))) is different from true [2018-02-02 08:54:16,835 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:54:16,836 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:54:16,837 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-02-02 08:54:16,837 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 08:54:16,842 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-02 08:54:16,842 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:20 [2018-02-02 08:54:16,886 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 129 trivial. 9 not checked. [2018-02-02 08:54:16,912 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 08:54:16,912 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-02 08:54:16,912 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 08:54:16,912 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 08:54:16,913 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=125, Unknown=2, NotChecked=46, Total=210 [2018-02-02 08:54:16,913 INFO L87 Difference]: Start difference. First operand 216 states and 231 transitions. Second operand 15 states. [2018-02-02 08:54:17,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:54:17,570 INFO L93 Difference]: Finished difference Result 244 states and 264 transitions. [2018-02-02 08:54:17,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 08:54:17,570 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 142 [2018-02-02 08:54:17,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:54:17,572 INFO L225 Difference]: With dead ends: 244 [2018-02-02 08:54:17,573 INFO L226 Difference]: Without dead ends: 244 [2018-02-02 08:54:17,573 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 127 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=313, Unknown=2, NotChecked=74, Total=462 [2018-02-02 08:54:17,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2018-02-02 08:54:17,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 214. [2018-02-02 08:54:17,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2018-02-02 08:54:17,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 229 transitions. [2018-02-02 08:54:17,584 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 229 transitions. Word has length 142 [2018-02-02 08:54:17,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:54:17,585 INFO L432 AbstractCegarLoop]: Abstraction has 214 states and 229 transitions. [2018-02-02 08:54:17,585 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 08:54:17,585 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 229 transitions. [2018-02-02 08:54:17,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-02-02 08:54:17,588 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:54:17,589 INFO L351 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:54:17,591 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_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr0RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-02 08:54:17,591 INFO L82 PathProgramCache]: Analyzing trace with hash -772454619, now seen corresponding path program 1 times [2018-02-02 08:54:17,591 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:54:17,591 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:54:17,592 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:54:17,592 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:54:17,592 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:54:17,606 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-02 08:54:17,606 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-02 08:54:17,606 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-02-02 08:54:17,626 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:54:17,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:54:17,710 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 08:54:17,774 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-02-02 08:54:17,792 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:54:17,792 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 08:54:17,793 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 08:54:17,793 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 08:54:17,793 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-02 08:54:17,793 INFO L87 Difference]: Start difference. First operand 214 states and 229 transitions. Second operand 8 states. [2018-02-02 08:54:17,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:54:17,872 INFO L93 Difference]: Finished difference Result 224 states and 239 transitions. [2018-02-02 08:54:17,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 08:54:17,875 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 142 [2018-02-02 08:54:17,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:54:17,877 INFO L225 Difference]: With dead ends: 224 [2018-02-02 08:54:17,877 INFO L226 Difference]: Without dead ends: 215 [2018-02-02 08:54:17,877 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-02-02 08:54:17,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-02-02 08:54:17,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2018-02-02 08:54:17,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2018-02-02 08:54:17,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 230 transitions. [2018-02-02 08:54:17,883 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 230 transitions. Word has length 142 [2018-02-02 08:54:17,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:54:17,884 INFO L432 AbstractCegarLoop]: Abstraction has 215 states and 230 transitions. [2018-02-02 08:54:17,884 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 08:54:17,884 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 230 transitions. [2018-02-02 08:54:17,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-02-02 08:54:17,886 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:54:17,886 INFO L351 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:54:17,886 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_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr0RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-02 08:54:17,887 INFO L82 PathProgramCache]: Analyzing trace with hash 152413325, now seen corresponding path program 1 times [2018-02-02 08:54:17,887 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:54:17,887 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:54:17,888 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:54:17,888 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:54:17,888 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:54:17,901 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-02 08:54:17,901 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-02 08:54:17,901 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-02-02 08:54:17,910 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:54:18,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:54:18,130 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 08:54:18,231 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 85 proven. 1 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2018-02-02 08:54:18,251 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 08:54:18,251 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-02 08:54:18,252 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 08:54:18,252 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 08:54:18,252 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-02-02 08:54:18,252 INFO L87 Difference]: Start difference. First operand 215 states and 230 transitions. Second operand 9 states. [2018-02-02 08:54:18,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:54:18,366 INFO L93 Difference]: Finished difference Result 225 states and 240 transitions. [2018-02-02 08:54:18,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 08:54:18,367 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 148 [2018-02-02 08:54:18,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:54:18,368 INFO L225 Difference]: With dead ends: 225 [2018-02-02 08:54:18,368 INFO L226 Difference]: Without dead ends: 216 [2018-02-02 08:54:18,369 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-02-02 08:54:18,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2018-02-02 08:54:18,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2018-02-02 08:54:18,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-02-02 08:54:18,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 231 transitions. [2018-02-02 08:54:18,374 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 231 transitions. Word has length 148 [2018-02-02 08:54:18,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:54:18,374 INFO L432 AbstractCegarLoop]: Abstraction has 216 states and 231 transitions. [2018-02-02 08:54:18,375 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 08:54:18,375 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 231 transitions. [2018-02-02 08:54:18,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-02-02 08:54:18,376 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:54:18,376 INFO L351 BasicCegarLoop]: trace histogram [12, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:54:18,377 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_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr0RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-02 08:54:18,377 INFO L82 PathProgramCache]: Analyzing trace with hash -677500123, now seen corresponding path program 2 times [2018-02-02 08:54:18,377 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:54:18,377 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:54:18,378 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:54:18,378 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:54:18,378 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:54:18,391 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-02 08:54:18,391 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-02 08:54:18,391 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-02-02 08:54:18,398 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 08:54:18,432 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 08:54:18,483 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 08:54:19,893 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 08:54:19,902 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 08:54:20,356 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 99 proven. 56 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2018-02-02 08:54:20,374 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 08:54:20,374 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-02 08:54:20,374 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 08:54:20,375 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 08:54:20,375 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-02-02 08:54:20,375 INFO L87 Difference]: Start difference. First operand 216 states and 231 transitions. Second operand 10 states. [2018-02-02 08:54:20,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:54:20,481 INFO L93 Difference]: Finished difference Result 226 states and 241 transitions. [2018-02-02 08:54:20,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 08:54:20,481 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 154 [2018-02-02 08:54:20,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:54:20,482 INFO L225 Difference]: With dead ends: 226 [2018-02-02 08:54:20,482 INFO L226 Difference]: Without dead ends: 217 [2018-02-02 08:54:20,483 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 144 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-02-02 08:54:20,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-02-02 08:54:20,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2018-02-02 08:54:20,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-02-02 08:54:20,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 232 transitions. [2018-02-02 08:54:20,486 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 232 transitions. Word has length 154 [2018-02-02 08:54:20,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:54:20,486 INFO L432 AbstractCegarLoop]: Abstraction has 217 states and 232 transitions. [2018-02-02 08:54:20,486 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 08:54:20,486 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 232 transitions. [2018-02-02 08:54:20,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-02-02 08:54:20,487 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:54:20,487 INFO L351 BasicCegarLoop]: trace histogram [18, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:54:20,487 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_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr0RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-02 08:54:20,487 INFO L82 PathProgramCache]: Analyzing trace with hash -626793843, now seen corresponding path program 3 times [2018-02-02 08:54:20,487 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:54:20,487 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:54:20,488 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:54:20,488 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 08:54:20,488 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:54:20,495 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-02 08:54:20,495 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-02 08:54:20,495 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-02-02 08:54:20,502 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-02 08:54:20,522 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-02-02 08:54:20,529 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-02-02 08:54:20,550 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-02-02 08:54:20,601 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 08:54:20,604 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 08:54:20,688 INFO L134 CoverageAnalysis]: Checked inductivity of 531 backedges. 145 proven. 6 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2018-02-02 08:54:20,715 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 08:54:20,715 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-02 08:54:20,715 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 08:54:20,715 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 08:54:20,716 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-02-02 08:54:20,716 INFO L87 Difference]: Start difference. First operand 217 states and 232 transitions. Second operand 11 states. [2018-02-02 08:54:20,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:54:20,813 INFO L93 Difference]: Finished difference Result 227 states and 242 transitions. [2018-02-02 08:54:20,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 08:54:20,813 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 160 [2018-02-02 08:54:20,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:54:20,814 INFO L225 Difference]: With dead ends: 227 [2018-02-02 08:54:20,814 INFO L226 Difference]: Without dead ends: 218 [2018-02-02 08:54:20,814 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2018-02-02 08:54:20,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-02-02 08:54:20,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2018-02-02 08:54:20,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-02-02 08:54:20,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 233 transitions. [2018-02-02 08:54:20,818 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 233 transitions. Word has length 160 [2018-02-02 08:54:20,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:54:20,818 INFO L432 AbstractCegarLoop]: Abstraction has 218 states and 233 transitions. [2018-02-02 08:54:20,818 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 08:54:20,818 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 233 transitions. [2018-02-02 08:54:20,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-02-02 08:54:20,819 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:54:20,820 INFO L351 BasicCegarLoop]: trace histogram [24, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:54:20,820 INFO L371 AbstractCegarLoop]: === Iteration 10 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr0RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-02 08:54:20,820 INFO L82 PathProgramCache]: Analyzing trace with hash 262360869, now seen corresponding path program 4 times [2018-02-02 08:54:20,820 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:54:20,820 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:54:20,821 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:54:20,821 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 08:54:20,821 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:54:20,830 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-02 08:54:20,830 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-02 08:54:20,830 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-02-02 08:54:20,837 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-02 08:54:23,892 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 08:54:23,899 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 08:54:23,989 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 447 proven. 23 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-02-02 08:54:24,034 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 08:54:24,034 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-02 08:54:24,034 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 08:54:24,034 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 08:54:24,034 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-02-02 08:54:24,035 INFO L87 Difference]: Start difference. First operand 218 states and 233 transitions. Second operand 12 states. [2018-02-02 08:54:24,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:54:24,177 INFO L93 Difference]: Finished difference Result 228 states and 243 transitions. [2018-02-02 08:54:24,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 08:54:24,177 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 166 [2018-02-02 08:54:24,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:54:24,178 INFO L225 Difference]: With dead ends: 228 [2018-02-02 08:54:24,178 INFO L226 Difference]: Without dead ends: 219 [2018-02-02 08:54:24,179 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2018-02-02 08:54:24,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-02-02 08:54:24,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2018-02-02 08:54:24,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-02-02 08:54:24,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 234 transitions. [2018-02-02 08:54:24,181 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 234 transitions. Word has length 166 [2018-02-02 08:54:24,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:54:24,182 INFO L432 AbstractCegarLoop]: Abstraction has 219 states and 234 transitions. [2018-02-02 08:54:24,182 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 08:54:24,182 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 234 transitions. [2018-02-02 08:54:24,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-02-02 08:54:24,183 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:54:24,183 INFO L351 BasicCegarLoop]: trace histogram [30, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:54:24,183 INFO L371 AbstractCegarLoop]: === Iteration 11 === [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_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr0RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-02 08:54:24,183 INFO L82 PathProgramCache]: Analyzing trace with hash -668999539, now seen corresponding path program 5 times [2018-02-02 08:54:24,183 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:54:24,183 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:54:24,184 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:54:24,184 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 08:54:24,184 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:54:24,191 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-02 08:54:24,191 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-02 08:54:24,191 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-02-02 08:54:24,196 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-02 08:54:24,214 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 08:54:24,215 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 08:54:24,219 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 08:54:24,238 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 08:54:30,661 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 08:54:32,969 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 08:54:32,975 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 08:54:33,076 INFO L134 CoverageAnalysis]: Checked inductivity of 885 backedges. 437 proven. 60 refuted. 0 times theorem prover too weak. 388 trivial. 0 not checked. [2018-02-02 08:54:33,095 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 08:54:33,096 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-02 08:54:33,096 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 08:54:33,096 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 08:54:33,096 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-02-02 08:54:33,096 INFO L87 Difference]: Start difference. First operand 219 states and 234 transitions. Second operand 13 states. [2018-02-02 08:54:33,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:54:33,244 INFO L93 Difference]: Finished difference Result 229 states and 244 transitions. [2018-02-02 08:54:33,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 08:54:33,244 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 172 [2018-02-02 08:54:33,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:54:33,245 INFO L225 Difference]: With dead ends: 229 [2018-02-02 08:54:33,245 INFO L226 Difference]: Without dead ends: 220 [2018-02-02 08:54:33,245 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2018-02-02 08:54:33,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-02-02 08:54:33,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2018-02-02 08:54:33,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-02-02 08:54:33,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 235 transitions. [2018-02-02 08:54:33,249 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 235 transitions. Word has length 172 [2018-02-02 08:54:33,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:54:33,249 INFO L432 AbstractCegarLoop]: Abstraction has 220 states and 235 transitions. [2018-02-02 08:54:33,249 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 08:54:33,250 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 235 transitions. [2018-02-02 08:54:33,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-02-02 08:54:33,251 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:54:33,251 INFO L351 BasicCegarLoop]: trace histogram [36, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:54:33,252 INFO L371 AbstractCegarLoop]: === Iteration 12 === [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_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr0RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-02 08:54:33,252 INFO L82 PathProgramCache]: Analyzing trace with hash -954944731, now seen corresponding path program 6 times [2018-02-02 08:54:33,252 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:54:33,252 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:54:33,253 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:54:33,253 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 08:54:33,253 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:54:33,264 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-02 08:54:33,264 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-02 08:54:33,264 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-02-02 08:54:33,279 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-02 08:54:33,308 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-02-02 08:54:33,313 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-02-02 08:54:33,324 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-02-02 08:54:33,362 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-02-02 08:54:33,522 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-02-02 08:54:35,388 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 08:54:35,394 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 08:54:35,423 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2018-02-02 08:54:35,424 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 08:54:35,444 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 29 [2018-02-02 08:54:35,445 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:54:35,460 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 08:54:35,461 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:58, output treesize:56 [2018-02-02 08:54:37,189 WARN L1033 $PredicateComparison]: unable to prove that (or (exists ((v_calloc_model_~nmemb_BEFORE_CALL_7 Int) (v_calloc_model_~ptr~0.base_BEFORE_CALL_2 Int) (v_calloc_model_~size_BEFORE_CALL_7 Int)) (let ((.cse0 (mod (* v_calloc_model_~nmemb_BEFORE_CALL_7 v_calloc_model_~size_BEFORE_CALL_7) 4294967296))) (and (= (select |c_#length| v_calloc_model_~ptr~0.base_BEFORE_CALL_2) .cse0) (<= .cse0 2147483647)))) (exists ((v_prenex_4 Int) (v_prenex_5 Int) (v_prenex_3 Int)) (let ((.cse1 (mod (* v_prenex_3 v_prenex_5) 4294967296))) (and (= (+ (select |c_#length| v_prenex_4) 4294967296) .cse1) (< 2147483647 .cse1))))) is different from true [2018-02-02 08:54:39,134 WARN L143 SmtUtils]: Spent 1925ms on a formula simplification that was a NOOP. DAG size: 32 [2018-02-02 08:54:42,683 WARN L143 SmtUtils]: Spent 3495ms on a formula simplification that was a NOOP. DAG size: 34 [2018-02-02 08:54:44,281 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 08:54:44,282 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 08:54:44,300 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 08:54:44,300 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:54:44,317 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 08:54:44,317 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 08:54:44,334 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 08:54:44,334 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 08:54:44,352 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 08:54:44,352 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:49, output treesize:37 [2018-02-02 08:54:52,148 WARN L143 SmtUtils]: Spent 3160ms on a formula simplification that was a NOOP. DAG size: 25 [2018-02-02 08:54:54,172 WARN L1033 $PredicateComparison]: unable to prove that (let ((.cse1 (exists ((v_prenex_18 Int) (|v_calloc_model_#in~nmemb_BEFORE_CALL_8| Int) (v_calloc_model_~ptr~0.base_BEFORE_CALL_3 Int)) (let ((.cse7 (mod (* |v_calloc_model_#in~nmemb_BEFORE_CALL_8| v_prenex_18) 4294967296))) (and (= .cse7 (+ (select |c_#length| v_calloc_model_~ptr~0.base_BEFORE_CALL_3) 4294967296)) (< 2147483647 .cse7))))) (.cse0 (exists ((calloc_model_~size Int) (v_prenex_17 Int)) (let ((.cse6 (mod (* |c_calloc_model_#in~nmemb| calloc_model_~size) 4294967296))) (and (< 2147483647 .cse6) (= 0 (select |c_old(#valid)| v_prenex_17)) (= (store |c_old(#length)| v_prenex_17 (+ .cse6 (- 4294967296))) |c_#length|))))) (.cse2 (exists ((v_prenex_12 Int) (calloc_model_~ptr~0.base Int)) (let ((.cse5 (mod (* |c_calloc_model_#in~nmemb| v_prenex_12) 4294967296))) (and (= 0 (select |c_old(#valid)| calloc_model_~ptr~0.base)) (= |c_#length| (store |c_old(#length)| calloc_model_~ptr~0.base .cse5)) (<= .cse5 2147483647))))) (.cse3 (exists ((v_prenex_15 Int) (v_prenex_13 Int) (v_prenex_19 Int)) (let ((.cse4 (mod (* v_prenex_13 v_prenex_19) 4294967296))) (and (= (select |c_#length| v_prenex_15) .cse4) (<= .cse4 2147483647)))))) (or (and .cse0 .cse1) (and .cse2 .cse1) (and .cse0 .cse3) (and .cse2 .cse3))) is different from true [2018-02-02 08:54:54,191 WARN L1033 $PredicateComparison]: unable to prove that (or (and (exists ((calloc_model_~size Int) (v_prenex_17 Int)) (let ((.cse0 (mod (* |c_calloc_model_#in~nmemb| calloc_model_~size) 4294967296))) (and (< 2147483647 .cse0) (= 0 (select |c_old(#valid)| v_prenex_17)) (= (store |c_old(#length)| v_prenex_17 (+ .cse0 (- 4294967296))) |c_#length|)))) (exists ((v_prenex_18 Int) (|v_calloc_model_#in~nmemb_BEFORE_CALL_8| Int) (v_calloc_model_~ptr~0.base_BEFORE_CALL_3 Int)) (let ((.cse1 (mod (* |v_calloc_model_#in~nmemb_BEFORE_CALL_8| v_prenex_18) 4294967296))) (and (= .cse1 (+ (select |c_#length| v_calloc_model_~ptr~0.base_BEFORE_CALL_3) 4294967296)) (< 2147483647 .cse1))))) (and (exists ((v_prenex_27 Int) (v_prenex_29 Int) (v_prenex_25 Int)) (let ((.cse2 (mod (* v_prenex_27 v_prenex_29) 4294967296))) (and (= (select |c_#length| v_prenex_25) .cse2) (<= .cse2 2147483647)))) (exists ((v_prenex_26 Int) (v_prenex_28 Int)) (let ((.cse3 (mod (* |c_calloc_model_#in~nmemb| v_prenex_26) 4294967296))) (and (= |c_#length| (store |c_old(#length)| v_prenex_28 .cse3)) (<= .cse3 2147483647) (= 0 (select |c_old(#valid)| v_prenex_28)))))) (and (exists ((v_prenex_23 Int) (v_prenex_24 Int)) (let ((.cse4 (mod (* |c_calloc_model_#in~nmemb| v_prenex_23) 4294967296))) (and (= 0 (select |c_old(#valid)| v_prenex_24)) (= (store |c_old(#length)| v_prenex_24 (+ .cse4 (- 4294967296))) |c_#length|) (< 2147483647 .cse4)))) (exists ((v_prenex_15 Int) (v_prenex_13 Int) (v_prenex_19 Int)) (let ((.cse5 (mod (* v_prenex_13 v_prenex_19) 4294967296))) (and (= (select |c_#length| v_prenex_15) .cse5) (<= .cse5 2147483647))))) (and (exists ((v_prenex_22 Int) (v_prenex_21 Int) (v_prenex_20 Int)) (let ((.cse6 (mod (* v_prenex_21 v_prenex_20) 4294967296))) (and (= .cse6 (+ (select |c_#length| v_prenex_22) 4294967296)) (< 2147483647 .cse6)))) (exists ((v_prenex_12 Int) (calloc_model_~ptr~0.base Int)) (let ((.cse7 (mod (* |c_calloc_model_#in~nmemb| v_prenex_12) 4294967296))) (and (= 0 (select |c_old(#valid)| calloc_model_~ptr~0.base)) (= |c_#length| (store |c_old(#length)| calloc_model_~ptr~0.base .cse7)) (<= .cse7 2147483647)))))) is different from true [2018-02-02 08:55:14,388 WARN L146 SmtUtils]: Spent 17866ms on a formula simplification. DAG size of input: 96 DAG size of output 29 [2018-02-02 08:55:14,397 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:55:14,398 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:55:14,399 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 08:55:14,399 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 08:55:14,425 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:55:14,425 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:55:14,426 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 08:55:14,426 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:55:14,439 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:55:14,440 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:55:14,440 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 08:55:14,440 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 08:55:14,461 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 08:55:14,461 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 08:55:14,473 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 08:55:14,473 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:67, output treesize:49 [2018-02-02 08:55:16,586 INFO L134 CoverageAnalysis]: Checked inductivity of 1116 backedges. 522 proven. 66 refuted. 0 times theorem prover too weak. 524 trivial. 4 not checked. [2018-02-02 08:55:16,604 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 08:55:16,604 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-02 08:55:16,604 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-02 08:55:16,604 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-02 08:55:16,605 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=439, Unknown=9, NotChecked=132, Total=650 [2018-02-02 08:55:16,605 INFO L87 Difference]: Start difference. First operand 220 states and 235 transitions. Second operand 26 states. [2018-02-02 08:55:20,400 WARN L146 SmtUtils]: Spent 108ms on a formula simplification. DAG size of input: 49 DAG size of output 47 [2018-02-02 08:55:21,422 WARN L146 SmtUtils]: Spent 834ms on a formula simplification. DAG size of input: 72 DAG size of output 70 [2018-02-02 08:55:23,391 WARN L143 SmtUtils]: Spent 1717ms on a formula simplification that was a NOOP. DAG size: 37 [2018-02-02 08:55:25,470 WARN L143 SmtUtils]: Spent 2036ms on a formula simplification that was a NOOP. DAG size: 40 [2018-02-02 08:55:25,648 WARN L146 SmtUtils]: Spent 127ms on a formula simplification. DAG size of input: 45 DAG size of output 42 Received shutdown request... [2018-02-02 08:55:35,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 08:55:35,411 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-02 08:55:35,415 WARN L185 ceAbstractionStarter]: Timeout [2018-02-02 08:55:35,415 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 08:55:35 BoogieIcfgContainer [2018-02-02 08:55:35,415 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 08:55:35,416 INFO L168 Benchmark]: Toolchain (without parser) took 80678.34 ms. Allocated memory was 391.6 MB in the beginning and 691.0 MB in the end (delta: 299.4 MB). Free memory was 348.1 MB in the beginning and 642.2 MB in the end (delta: -294.1 MB). Peak memory consumption was 272.8 MB. Max. memory is 5.3 GB. [2018-02-02 08:55:35,417 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 391.6 MB. Free memory is still 354.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 08:55:35,417 INFO L168 Benchmark]: CACSL2BoogieTranslator took 166.65 ms. Allocated memory is still 391.6 MB. Free memory was 348.1 MB in the beginning and 336.2 MB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 5.3 GB. [2018-02-02 08:55:35,417 INFO L168 Benchmark]: Boogie Preprocessor took 31.25 ms. Allocated memory is still 391.6 MB. Free memory was 336.2 MB in the beginning and 333.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-02 08:55:35,417 INFO L168 Benchmark]: RCFGBuilder took 483.23 ms. Allocated memory is still 391.6 MB. Free memory was 333.6 MB in the beginning and 281.8 MB in the end (delta: 51.8 MB). Peak memory consumption was 51.8 MB. Max. memory is 5.3 GB. [2018-02-02 08:55:35,417 INFO L168 Benchmark]: TraceAbstraction took 79994.41 ms. Allocated memory was 391.6 MB in the beginning and 691.0 MB in the end (delta: 299.4 MB). Free memory was 281.8 MB in the beginning and 642.2 MB in the end (delta: -360.4 MB). Peak memory consumption was 206.5 MB. Max. memory is 5.3 GB. [2018-02-02 08:55:35,418 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.15 ms. Allocated memory is still 391.6 MB. Free memory is still 354.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 166.65 ms. Allocated memory is still 391.6 MB. Free memory was 348.1 MB in the beginning and 336.2 MB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 31.25 ms. Allocated memory is still 391.6 MB. Free memory was 336.2 MB in the beginning and 333.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 483.23 ms. Allocated memory is still 391.6 MB. Free memory was 333.6 MB in the beginning and 281.8 MB in the end (delta: 51.8 MB). Peak memory consumption was 51.8 MB. Max. memory is 5.3 GB. * TraceAbstraction took 79994.41 ms. Allocated memory was 391.6 MB in the beginning and 691.0 MB in the end (delta: 299.4 MB). Free memory was 281.8 MB in the beginning and 642.2 MB in the end (delta: -360.4 MB). Peak memory consumption was 206.5 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 827). Cancelled while BasicCegarLoop was constructing difference of abstraction (220states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 116. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 828). Cancelled while BasicCegarLoop was constructing difference of abstraction (220states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 116. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 827). Cancelled while BasicCegarLoop was constructing difference of abstraction (220states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 116. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 828). Cancelled while BasicCegarLoop was constructing difference of abstraction (220states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 116. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 829). Cancelled while BasicCegarLoop was constructing difference of abstraction (220states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 116. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 829). Cancelled while BasicCegarLoop was constructing difference of abstraction (220states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 116. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 812). Cancelled while BasicCegarLoop was constructing difference of abstraction (220states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 116. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 812). Cancelled while BasicCegarLoop was constructing difference of abstraction (220states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 116. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 813). Cancelled while BasicCegarLoop was constructing difference of abstraction (220states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 116. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 812). Cancelled while BasicCegarLoop was constructing difference of abstraction (220states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 116. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 813). Cancelled while BasicCegarLoop was constructing difference of abstraction (220states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 116. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 812). Cancelled while BasicCegarLoop was constructing difference of abstraction (220states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 116. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 819). Cancelled while BasicCegarLoop was constructing difference of abstraction (220states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 116. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 819). Cancelled while BasicCegarLoop was constructing difference of abstraction (220states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 116. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 818). Cancelled while BasicCegarLoop was constructing difference of abstraction (220states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 116. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 818). Cancelled while BasicCegarLoop was constructing difference of abstraction (220states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 116. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 794). Cancelled while BasicCegarLoop was constructing difference of abstraction (220states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 116. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 795). Cancelled while BasicCegarLoop was constructing difference of abstraction (220states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 116. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 794). Cancelled while BasicCegarLoop was constructing difference of abstraction (220states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 116. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 794). Cancelled while BasicCegarLoop was constructing difference of abstraction (220states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 116. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 795). Cancelled while BasicCegarLoop was constructing difference of abstraction (220states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 116. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 794). Cancelled while BasicCegarLoop was constructing difference of abstraction (220states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 116. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 870). Cancelled while BasicCegarLoop was constructing difference of abstraction (220states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 116. - TimeoutResultAtElement [Line: 864]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 864). Cancelled while BasicCegarLoop was constructing difference of abstraction (220states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 116. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 870). Cancelled while BasicCegarLoop was constructing difference of abstraction (220states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 116. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 786). Cancelled while BasicCegarLoop was constructing difference of abstraction (220states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 116. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 785). Cancelled while BasicCegarLoop was constructing difference of abstraction (220states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 116. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 786). Cancelled while BasicCegarLoop was constructing difference of abstraction (220states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 116. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 785). Cancelled while BasicCegarLoop was constructing difference of abstraction (220states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 116. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 785). Cancelled while BasicCegarLoop was constructing difference of abstraction (220states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 116. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 785). Cancelled while BasicCegarLoop was constructing difference of abstraction (220states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 116. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 804). Cancelled while BasicCegarLoop was constructing difference of abstraction (220states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 116. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 803). Cancelled while BasicCegarLoop was constructing difference of abstraction (220states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 116. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 803). Cancelled while BasicCegarLoop was constructing difference of abstraction (220states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 116. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 803). Cancelled while BasicCegarLoop was constructing difference of abstraction (220states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 116. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 803). Cancelled while BasicCegarLoop was constructing difference of abstraction (220states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 116. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 804). Cancelled while BasicCegarLoop was constructing difference of abstraction (220states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 116. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 859). Cancelled while BasicCegarLoop was constructing difference of abstraction (220states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 116. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 858). Cancelled while BasicCegarLoop was constructing difference of abstraction (220states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 116. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 857). Cancelled while BasicCegarLoop was constructing difference of abstraction (220states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 116. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 857). Cancelled while BasicCegarLoop was constructing difference of abstraction (220states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 116. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 859). Cancelled while BasicCegarLoop was constructing difference of abstraction (220states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 116. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 858). Cancelled while BasicCegarLoop was constructing difference of abstraction (220states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 116. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 742). Cancelled while BasicCegarLoop was constructing difference of abstraction (220states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 116. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 742). Cancelled while BasicCegarLoop was constructing difference of abstraction (220states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 116. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 776). Cancelled while BasicCegarLoop was constructing difference of abstraction (220states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 116. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 776). Cancelled while BasicCegarLoop was constructing difference of abstraction (220states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 116. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 776). Cancelled while BasicCegarLoop was constructing difference of abstraction (220states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 116. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 777). Cancelled while BasicCegarLoop was constructing difference of abstraction (220states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 116. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 776). Cancelled while BasicCegarLoop was constructing difference of abstraction (220states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 116. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 775). Cancelled while BasicCegarLoop was constructing difference of abstraction (220states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 116. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 775). Cancelled while BasicCegarLoop was constructing difference of abstraction (220states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 116. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 777). Cancelled while BasicCegarLoop was constructing difference of abstraction (220states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 116. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 866). Cancelled while BasicCegarLoop was constructing difference of abstraction (220states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 116. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 866). Cancelled while BasicCegarLoop was constructing difference of abstraction (220states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 116. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 848). Cancelled while BasicCegarLoop was constructing difference of abstraction (220states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 116. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 849). Cancelled while BasicCegarLoop was constructing difference of abstraction (220states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 116. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 847). Cancelled while BasicCegarLoop was constructing difference of abstraction (220states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 116. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 847). Cancelled while BasicCegarLoop was constructing difference of abstraction (220states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 116. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 849). Cancelled while BasicCegarLoop was constructing difference of abstraction (220states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 116. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 848). Cancelled while BasicCegarLoop was constructing difference of abstraction (220states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 116. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 837). Cancelled while BasicCegarLoop was constructing difference of abstraction (220states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 116. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 837). Cancelled while BasicCegarLoop was constructing difference of abstraction (220states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 116. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 838). Cancelled while BasicCegarLoop was constructing difference of abstraction (220states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 116. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 839). Cancelled while BasicCegarLoop was constructing difference of abstraction (220states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 116. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 839). Cancelled while BasicCegarLoop was constructing difference of abstraction (220states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 116. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 838). Cancelled while BasicCegarLoop was constructing difference of abstraction (220states) and interpolant automaton (currently 12 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 116. - StatisticsResult: Ultimate Automizer benchmark data CFG has 16 procedures, 224 locations, 67 error locations. TIMEOUT Result, 79.9s OverallTime, 12 OverallIterations, 36 TraceHistogramMax, 20.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2368 SDtfs, 488 SDslu, 12908 SDs, 0 SdLazy, 2668 SolverSat, 115 SolverUnsat, 3 SolverUnknown, 0 SolverNotchecked, 7.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1329 GetRequests, 1194 SyntacticMatches, 5 SemanticMatches, 129 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 47.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=224occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 70 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 15.8s SatisfiabilityAnalysisTime, 42.5s InterpolantComputationTime, 1304 NumberOfCodeBlocks, 1022 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 1292 ConstructedInterpolants, 52 QuantifiedInterpolants, 759547 SizeOfPredicates, 63 NumberOfNonLiveVariables, 5050 ConjunctsInSsa, 308 ConjunctsInUnsatCore, 12 InterpolantComputations, 5 PerfectInterpolantSequences, 4266/4491 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0234_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_08-55-35-423.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0234_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-02_08-55-35-423.csv Completed graceful shutdown