java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf -i ../../../trunk/examples/svcomp/memsafety/test-0237_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c17473d-m [2018-02-04 12:47:06,155 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 12:47:06,157 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 12:47:06,170 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 12:47:06,170 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 12:47:06,171 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 12:47:06,172 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 12:47:06,173 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 12:47:06,175 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 12:47:06,176 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 12:47:06,176 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 12:47:06,176 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 12:47:06,177 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 12:47:06,178 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 12:47:06,179 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 12:47:06,181 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 12:47:06,182 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 12:47:06,183 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 12:47:06,184 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 12:47:06,185 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 12:47:06,187 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 12:47:06,187 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 12:47:06,187 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 12:47:06,188 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 12:47:06,188 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 12:47:06,189 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 12:47:06,189 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 12:47:06,190 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 12:47:06,190 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 12:47:06,190 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 12:47:06,191 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 12:47:06,191 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf [2018-02-04 12:47:06,200 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 12:47:06,200 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 12:47:06,201 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 12:47:06,201 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 12:47:06,201 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 12:47:06,202 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 12:47:06,202 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 12:47:06,202 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 12:47:06,202 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 12:47:06,202 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 12:47:06,202 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 12:47:06,202 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 12:47:06,203 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 12:47:06,203 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 12:47:06,203 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 12:47:06,203 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 12:47:06,203 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 12:47:06,203 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 12:47:06,203 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 12:47:06,204 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 12:47:06,204 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 12:47:06,204 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 12:47:06,204 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 12:47:06,204 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-04 12:47:06,231 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 12:47:06,243 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 12:47:06,246 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 12:47:06,250 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 12:47:06,250 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 12:47:06,250 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/test-0237_true-valid-memsafety.i [2018-02-04 12:47:06,399 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 12:47:06,401 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 12:47:06,401 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 12:47:06,401 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 12:47:06,406 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 12:47:06,407 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 12:47:06" (1/1) ... [2018-02-04 12:47:06,410 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34e66bcf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:47:06, skipping insertion in model container [2018-02-04 12:47:06,410 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 12:47:06" (1/1) ... [2018-02-04 12:47:06,423 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 12:47:06,455 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 12:47:06,556 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 12:47:06,576 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 12:47:06,585 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:47:06 WrapperNode [2018-02-04 12:47:06,585 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 12:47:06,585 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 12:47:06,586 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 12:47:06,586 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 12:47:06,595 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:47:06" (1/1) ... [2018-02-04 12:47:06,596 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:47:06" (1/1) ... [2018-02-04 12:47:06,604 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:47:06" (1/1) ... [2018-02-04 12:47:06,604 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:47:06" (1/1) ... [2018-02-04 12:47:06,612 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:47:06" (1/1) ... [2018-02-04 12:47:06,616 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:47:06" (1/1) ... [2018-02-04 12:47:06,617 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:47:06" (1/1) ... [2018-02-04 12:47:06,620 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 12:47:06,621 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 12:47:06,621 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 12:47:06,621 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 12:47:06,622 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:47:06" (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-04 12:47:06,654 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 12:47:06,654 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 12:47:06,654 INFO L136 BoogieDeclarations]: Found implementation of procedure calloc_model [2018-02-04 12:47:06,654 INFO L136 BoogieDeclarations]: Found implementation of procedure zalloc_or_die [2018-02-04 12:47:06,654 INFO L136 BoogieDeclarations]: Found implementation of procedure l4_insert [2018-02-04 12:47:06,654 INFO L136 BoogieDeclarations]: Found implementation of procedure l3_insert [2018-02-04 12:47:06,655 INFO L136 BoogieDeclarations]: Found implementation of procedure l2_insert [2018-02-04 12:47:06,655 INFO L136 BoogieDeclarations]: Found implementation of procedure l1_insert [2018-02-04 12:47:06,655 INFO L136 BoogieDeclarations]: Found implementation of procedure l0_insert [2018-02-04 12:47:06,655 INFO L136 BoogieDeclarations]: Found implementation of procedure l4_destroy [2018-02-04 12:47:06,655 INFO L136 BoogieDeclarations]: Found implementation of procedure l3_destroy [2018-02-04 12:47:06,655 INFO L136 BoogieDeclarations]: Found implementation of procedure l2_destroy [2018-02-04 12:47:06,655 INFO L136 BoogieDeclarations]: Found implementation of procedure l1_destroy [2018-02-04 12:47:06,655 INFO L136 BoogieDeclarations]: Found implementation of procedure l0_destroy [2018-02-04 12:47:06,656 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 12:47:06,656 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-04 12:47:06,656 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-04 12:47:06,656 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 12:47:06,656 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 12:47:06,656 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 12:47:06,656 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2018-02-04 12:47:06,656 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2018-02-04 12:47:06,656 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-04 12:47:06,657 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-04 12:47:06,657 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-02-04 12:47:06,657 INFO L128 BoogieDeclarations]: Found specification of procedure memset [2018-02-04 12:47:06,657 INFO L128 BoogieDeclarations]: Found specification of procedure calloc_model [2018-02-04 12:47:06,657 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 12:47:06,657 INFO L128 BoogieDeclarations]: Found specification of procedure zalloc_or_die [2018-02-04 12:47:06,657 INFO L128 BoogieDeclarations]: Found specification of procedure l4_insert [2018-02-04 12:47:06,657 INFO L128 BoogieDeclarations]: Found specification of procedure l3_insert [2018-02-04 12:47:06,657 INFO L128 BoogieDeclarations]: Found specification of procedure l2_insert [2018-02-04 12:47:06,658 INFO L128 BoogieDeclarations]: Found specification of procedure l1_insert [2018-02-04 12:47:06,658 INFO L128 BoogieDeclarations]: Found specification of procedure l0_insert [2018-02-04 12:47:06,658 INFO L128 BoogieDeclarations]: Found specification of procedure l4_destroy [2018-02-04 12:47:06,658 INFO L128 BoogieDeclarations]: Found specification of procedure l3_destroy [2018-02-04 12:47:06,658 INFO L128 BoogieDeclarations]: Found specification of procedure l2_destroy [2018-02-04 12:47:06,658 INFO L128 BoogieDeclarations]: Found specification of procedure l1_destroy [2018-02-04 12:47:06,658 INFO L128 BoogieDeclarations]: Found specification of procedure l0_destroy [2018-02-04 12:47:06,659 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 12:47:06,659 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 12:47:06,659 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 12:47:06,917 WARN L455 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-02-04 12:47:07,110 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 12:47:07,111 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 12:47:07 BoogieIcfgContainer [2018-02-04 12:47:07,111 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 12:47:07,112 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 12:47:07,112 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 12:47:07,114 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 12:47:07,114 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 12:47:06" (1/3) ... [2018-02-04 12:47:07,115 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7694873 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 12:47:07, skipping insertion in model container [2018-02-04 12:47:07,115 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:47:06" (2/3) ... [2018-02-04 12:47:07,115 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7694873 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 12:47:07, skipping insertion in model container [2018-02-04 12:47:07,116 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 12:47:07" (3/3) ... [2018-02-04 12:47:07,117 INFO L107 eAbstractionObserver]: Analyzing ICFG test-0237_true-valid-memsafety.i [2018-02-04 12:47:07,124 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 12:47:07,131 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 83 error locations. [2018-02-04 12:47:07,162 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 12:47:07,162 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 12:47:07,163 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 12:47:07,163 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 12:47:07,163 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 12:47:07,163 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 12:47:07,163 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 12:47:07,163 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 12:47:07,164 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 12:47:07,177 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states. [2018-02-04 12:47:07,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-02-04 12:47:07,184 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:47:07,185 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-02-04 12:47:07,185 INFO L371 AbstractCegarLoop]: === Iteration 1 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr7RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr6RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr7RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr6RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr7RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr13RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr8RequiresViolation, l4_insertErr10RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr9RequiresViolation, l4_insertErr12RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr11RequiresViolation, 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-04 12:47:07,189 INFO L82 PathProgramCache]: Analyzing trace with hash 12677088, now seen corresponding path program 1 times [2018-02-04 12:47:07,190 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:47:07,191 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:47:07,232 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:47:07,232 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:47:07,232 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:47:07,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:47:07,262 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:47:07,297 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-04 12:47:07,299 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:47:07,299 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 12:47:07,300 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 12:47:07,309 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 12:47:07,309 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 12:47:07,310 INFO L87 Difference]: Start difference. First operand 250 states. Second operand 3 states. [2018-02-04 12:47:07,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:47:07,561 INFO L93 Difference]: Finished difference Result 279 states and 298 transitions. [2018-02-04 12:47:07,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 12:47:07,562 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-02-04 12:47:07,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:47:07,572 INFO L225 Difference]: With dead ends: 279 [2018-02-04 12:47:07,572 INFO L226 Difference]: Without dead ends: 276 [2018-02-04 12:47:07,573 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-04 12:47:07,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2018-02-04 12:47:07,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 245. [2018-02-04 12:47:07,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-02-04 12:47:07,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 260 transitions. [2018-02-04 12:47:07,614 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 260 transitions. Word has length 4 [2018-02-04 12:47:07,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:47:07,614 INFO L432 AbstractCegarLoop]: Abstraction has 245 states and 260 transitions. [2018-02-04 12:47:07,614 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 12:47:07,614 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 260 transitions. [2018-02-04 12:47:07,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-02-04 12:47:07,614 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:47:07,615 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-02-04 12:47:07,615 INFO L371 AbstractCegarLoop]: === Iteration 2 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr7RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr6RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr7RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr6RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr7RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr13RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr8RequiresViolation, l4_insertErr10RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr9RequiresViolation, l4_insertErr12RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr11RequiresViolation, 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-04 12:47:07,615 INFO L82 PathProgramCache]: Analyzing trace with hash 12677089, now seen corresponding path program 1 times [2018-02-04 12:47:07,615 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:47:07,615 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:47:07,616 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:47:07,616 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:47:07,616 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:47:07,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:47:07,631 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:47:07,666 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-04 12:47:07,666 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:47:07,666 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 12:47:07,667 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 12:47:07,667 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 12:47:07,668 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 12:47:07,668 INFO L87 Difference]: Start difference. First operand 245 states and 260 transitions. Second operand 3 states. [2018-02-04 12:47:07,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:47:07,754 INFO L93 Difference]: Finished difference Result 252 states and 270 transitions. [2018-02-04 12:47:07,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 12:47:07,754 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-02-04 12:47:07,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:47:07,759 INFO L225 Difference]: With dead ends: 252 [2018-02-04 12:47:07,759 INFO L226 Difference]: Without dead ends: 252 [2018-02-04 12:47:07,760 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 12:47:07,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2018-02-04 12:47:07,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 244. [2018-02-04 12:47:07,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2018-02-04 12:47:07,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 259 transitions. [2018-02-04 12:47:07,771 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 259 transitions. Word has length 4 [2018-02-04 12:47:07,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:47:07,772 INFO L432 AbstractCegarLoop]: Abstraction has 244 states and 259 transitions. [2018-02-04 12:47:07,772 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 12:47:07,772 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 259 transitions. [2018-02-04 12:47:07,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 12:47:07,772 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:47:07,773 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:47:07,773 INFO L371 AbstractCegarLoop]: === Iteration 3 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr7RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr6RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr7RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr6RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr7RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr13RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr8RequiresViolation, l4_insertErr10RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr9RequiresViolation, l4_insertErr12RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr11RequiresViolation, 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-04 12:47:07,773 INFO L82 PathProgramCache]: Analyzing trace with hash -144742640, now seen corresponding path program 1 times [2018-02-04 12:47:07,773 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:47:07,773 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:47:07,774 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:47:07,774 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:47:07,774 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:47:07,790 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-04 12:47:07,790 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-04 12:47:07,790 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-02-04 12:47:07,802 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:47:07,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:47:07,828 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:47:07,851 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-04 12:47:07,852 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:47:07,853 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:47:07,853 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 12:47:07,860 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-04 12:47:07,889 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:47:07,889 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 12:47:07,889 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 12:47:07,889 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 12:47:07,890 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 12:47:07,890 INFO L87 Difference]: Start difference. First operand 244 states and 259 transitions. Second operand 4 states. [2018-02-04 12:47:08,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:47:08,011 INFO L93 Difference]: Finished difference Result 243 states and 258 transitions. [2018-02-04 12:47:08,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 12:47:08,012 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-02-04 12:47:08,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:47:08,013 INFO L225 Difference]: With dead ends: 243 [2018-02-04 12:47:08,013 INFO L226 Difference]: Without dead ends: 243 [2018-02-04 12:47:08,013 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-04 12:47:08,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-02-04 12:47:08,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 243. [2018-02-04 12:47:08,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-02-04 12:47:08,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 258 transitions. [2018-02-04 12:47:08,023 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 258 transitions. Word has length 17 [2018-02-04 12:47:08,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:47:08,023 INFO L432 AbstractCegarLoop]: Abstraction has 243 states and 258 transitions. [2018-02-04 12:47:08,023 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 12:47:08,023 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 258 transitions. [2018-02-04 12:47:08,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 12:47:08,024 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:47:08,024 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:47:08,024 INFO L371 AbstractCegarLoop]: === Iteration 4 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr7RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr6RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr7RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr6RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr7RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr13RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr8RequiresViolation, l4_insertErr10RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr9RequiresViolation, l4_insertErr12RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr11RequiresViolation, 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-04 12:47:08,024 INFO L82 PathProgramCache]: Analyzing trace with hash -144742639, now seen corresponding path program 1 times [2018-02-04 12:47:08,024 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:47:08,025 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:47:08,025 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:47:08,026 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:47:08,026 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:47:08,037 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-04 12:47:08,037 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-04 12:47:08,037 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-02-04 12:47:08,042 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:47:08,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:47:08,058 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:47:08,065 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-04 12:47:08,066 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:47:08,078 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-04 12:47:08,078 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:47:08,090 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 12:47:08,091 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:46, output treesize:44 [2018-02-04 12:47:08,119 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-04 12:47:08,137 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:47:08,137 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 12:47:08,137 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 12:47:08,137 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 12:47:08,138 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 12:47:08,138 INFO L87 Difference]: Start difference. First operand 243 states and 258 transitions. Second operand 4 states. [2018-02-04 12:47:08,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:47:08,309 INFO L93 Difference]: Finished difference Result 242 states and 257 transitions. [2018-02-04 12:47:08,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 12:47:08,309 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-02-04 12:47:08,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:47:08,311 INFO L225 Difference]: With dead ends: 242 [2018-02-04 12:47:08,311 INFO L226 Difference]: Without dead ends: 242 [2018-02-04 12:47:08,311 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-04 12:47:08,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-02-04 12:47:08,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2018-02-04 12:47:08,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2018-02-04 12:47:08,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 257 transitions. [2018-02-04 12:47:08,319 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 257 transitions. Word has length 17 [2018-02-04 12:47:08,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:47:08,319 INFO L432 AbstractCegarLoop]: Abstraction has 242 states and 257 transitions. [2018-02-04 12:47:08,319 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 12:47:08,319 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 257 transitions. [2018-02-04 12:47:08,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-02-04 12:47:08,322 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:47:08,323 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-04 12:47:08,323 INFO L371 AbstractCegarLoop]: === Iteration 5 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr7RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr6RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr7RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr6RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr7RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr13RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr8RequiresViolation, l4_insertErr10RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr9RequiresViolation, l4_insertErr12RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr11RequiresViolation, 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-04 12:47:08,323 INFO L82 PathProgramCache]: Analyzing trace with hash -515979882, now seen corresponding path program 1 times [2018-02-04 12:47:08,323 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:47:08,323 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:47:08,324 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:47:08,324 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:47:08,324 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:47:08,348 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-04 12:47:08,348 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-04 12:47:08,348 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-02-04 12:47:08,353 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:47:08,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:47:08,435 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:47:08,441 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-04 12:47:08,442 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:47:08,443 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:47:08,443 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 12:47:08,498 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-04 12:47:08,502 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:47:08,503 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-04 12:47:08,503 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:47:08,504 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-04 12:47:08,504 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-02-04 12:47:08,513 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-04 12:47:08,527 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:47:08,528 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:47:08,528 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-04 12:47:08,529 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:47:08,534 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-04 12:47:08,534 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:20 [2018-02-04 12:47:08,575 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-04 12:47:08,607 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 12:47:08,607 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-04 12:47:08,607 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 12:47:08,607 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 12:47:08,608 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=125, Unknown=2, NotChecked=46, Total=210 [2018-02-04 12:47:08,608 INFO L87 Difference]: Start difference. First operand 242 states and 257 transitions. Second operand 15 states. [2018-02-04 12:47:09,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:47:09,239 INFO L93 Difference]: Finished difference Result 267 states and 287 transitions. [2018-02-04 12:47:09,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 12:47:09,240 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 142 [2018-02-04 12:47:09,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:47:09,242 INFO L225 Difference]: With dead ends: 267 [2018-02-04 12:47:09,242 INFO L226 Difference]: Without dead ends: 267 [2018-02-04 12:47:09,242 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-04 12:47:09,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2018-02-04 12:47:09,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 238. [2018-02-04 12:47:09,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2018-02-04 12:47:09,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 253 transitions. [2018-02-04 12:47:09,250 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 253 transitions. Word has length 142 [2018-02-04 12:47:09,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:47:09,250 INFO L432 AbstractCegarLoop]: Abstraction has 238 states and 253 transitions. [2018-02-04 12:47:09,251 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 12:47:09,251 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 253 transitions. [2018-02-04 12:47:09,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-02-04 12:47:09,252 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:47:09,252 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-04 12:47:09,253 INFO L371 AbstractCegarLoop]: === Iteration 6 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr7RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr6RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr7RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr6RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr7RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr13RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr8RequiresViolation, l4_insertErr10RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr9RequiresViolation, l4_insertErr12RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr11RequiresViolation, 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-04 12:47:09,254 INFO L82 PathProgramCache]: Analyzing trace with hash -515979881, now seen corresponding path program 1 times [2018-02-04 12:47:09,254 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:47:09,254 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:47:09,255 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:47:09,255 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:47:09,255 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:47:09,268 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-04 12:47:09,268 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-04 12:47:09,268 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-02-04 12:47:09,278 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:47:09,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:47:09,402 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:47:09,489 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-02-04 12:47:09,521 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:47:09,522 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 12:47:09,522 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 12:47:09,522 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 12:47:09,522 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-04 12:47:09,523 INFO L87 Difference]: Start difference. First operand 238 states and 253 transitions. Second operand 8 states. [2018-02-04 12:47:09,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:47:09,638 INFO L93 Difference]: Finished difference Result 248 states and 263 transitions. [2018-02-04 12:47:09,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 12:47:09,639 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 142 [2018-02-04 12:47:09,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:47:09,640 INFO L225 Difference]: With dead ends: 248 [2018-02-04 12:47:09,640 INFO L226 Difference]: Without dead ends: 239 [2018-02-04 12:47:09,640 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-04 12:47:09,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-02-04 12:47:09,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 239. [2018-02-04 12:47:09,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2018-02-04 12:47:09,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 254 transitions. [2018-02-04 12:47:09,645 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 254 transitions. Word has length 142 [2018-02-04 12:47:09,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:47:09,645 INFO L432 AbstractCegarLoop]: Abstraction has 239 states and 254 transitions. [2018-02-04 12:47:09,645 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 12:47:09,645 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 254 transitions. [2018-02-04 12:47:09,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-02-04 12:47:09,647 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:47:09,647 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-04 12:47:09,647 INFO L371 AbstractCegarLoop]: === Iteration 7 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr7RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr6RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr7RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr6RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr7RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr13RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr8RequiresViolation, l4_insertErr10RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr9RequiresViolation, l4_insertErr12RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr11RequiresViolation, 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-04 12:47:09,647 INFO L82 PathProgramCache]: Analyzing trace with hash 1585380729, now seen corresponding path program 1 times [2018-02-04 12:47:09,647 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:47:09,647 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:47:09,648 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:47:09,648 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:47:09,648 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:47:09,659 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-04 12:47:09,659 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-04 12:47:09,659 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-02-04 12:47:09,670 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:47:09,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:47:09,939 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:47:10,031 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 105 proven. 1 refuted. 0 times theorem prover too weak. 215 trivial. 0 not checked. [2018-02-04 12:47:10,059 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 12:47:10,059 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-04 12:47:10,059 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 12:47:10,060 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 12:47:10,060 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-02-04 12:47:10,060 INFO L87 Difference]: Start difference. First operand 239 states and 254 transitions. Second operand 9 states. [2018-02-04 12:47:10,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:47:10,230 INFO L93 Difference]: Finished difference Result 249 states and 264 transitions. [2018-02-04 12:47:10,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 12:47:10,235 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 148 [2018-02-04 12:47:10,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:47:10,236 INFO L225 Difference]: With dead ends: 249 [2018-02-04 12:47:10,236 INFO L226 Difference]: Without dead ends: 240 [2018-02-04 12:47:10,237 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-04 12:47:10,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2018-02-04 12:47:10,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 240. [2018-02-04 12:47:10,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2018-02-04 12:47:10,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 255 transitions. [2018-02-04 12:47:10,242 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 255 transitions. Word has length 148 [2018-02-04 12:47:10,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:47:10,242 INFO L432 AbstractCegarLoop]: Abstraction has 240 states and 255 transitions. [2018-02-04 12:47:10,242 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 12:47:10,242 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 255 transitions. [2018-02-04 12:47:10,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-02-04 12:47:10,244 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:47:10,244 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-04 12:47:10,244 INFO L371 AbstractCegarLoop]: === Iteration 8 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr7RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr6RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr7RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr6RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr7RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr13RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr8RequiresViolation, l4_insertErr10RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr9RequiresViolation, l4_insertErr12RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr11RequiresViolation, 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-04 12:47:10,244 INFO L82 PathProgramCache]: Analyzing trace with hash 1111849367, now seen corresponding path program 2 times [2018-02-04 12:47:10,244 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:47:10,244 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:47:10,245 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:47:10,245 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:47:10,245 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:47:10,257 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-04 12:47:10,257 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-04 12:47:10,257 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-02-04 12:47:10,274 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 12:47:12,231 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 12:47:12,232 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 12:47:12,238 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:47:19,888 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 267 proven. 29 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-02-04 12:47:19,906 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 12:47:19,907 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-04 12:47:19,907 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 12:47:19,907 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 12:47:19,907 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=105, Unknown=4, NotChecked=0, Total=132 [2018-02-04 12:47:19,907 INFO L87 Difference]: Start difference. First operand 240 states and 255 transitions. Second operand 12 states. [2018-02-04 12:47:20,381 WARN L143 SmtUtils]: Spent 460ms on a formula simplification that was a NOOP. DAG size: 19 [2018-02-04 12:47:32,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:47:32,574 INFO L93 Difference]: Finished difference Result 250 states and 265 transitions. [2018-02-04 12:47:32,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 12:47:32,575 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 154 [2018-02-04 12:47:32,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:47:32,576 INFO L225 Difference]: With dead ends: 250 [2018-02-04 12:47:32,576 INFO L226 Difference]: Without dead ends: 241 [2018-02-04 12:47:32,576 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=43, Invalid=191, Unknown=6, NotChecked=0, Total=240 [2018-02-04 12:47:32,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2018-02-04 12:47:32,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 241. [2018-02-04 12:47:32,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-02-04 12:47:32,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 256 transitions. [2018-02-04 12:47:32,581 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 256 transitions. Word has length 154 [2018-02-04 12:47:32,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:47:32,582 INFO L432 AbstractCegarLoop]: Abstraction has 241 states and 256 transitions. [2018-02-04 12:47:32,582 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 12:47:32,582 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 256 transitions. [2018-02-04 12:47:32,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-02-04 12:47:32,583 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:47:32,584 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-04 12:47:32,584 INFO L371 AbstractCegarLoop]: === Iteration 9 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr7RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr6RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr7RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr6RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr7RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr13RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr8RequiresViolation, l4_insertErr10RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr9RequiresViolation, l4_insertErr12RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr11RequiresViolation, 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-04 12:47:32,584 INFO L82 PathProgramCache]: Analyzing trace with hash 668249593, now seen corresponding path program 3 times [2018-02-04 12:47:32,584 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:47:32,584 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:47:32,585 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:47:32,585 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 12:47:32,585 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:47:32,596 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-04 12:47:32,596 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-04 12:47:32,596 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-02-04 12:47:32,616 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 12:47:32,766 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-02-04 12:47:32,766 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 12:47:32,771 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:47:32,791 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 32 [2018-02-04 12:47:32,791 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:47:32,861 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 35 [2018-02-04 12:47:32,861 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:47:32,884 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2018-02-04 12:47:32,884 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 12:47:32,886 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 34 [2018-02-04 12:47:32,887 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 12:47:32,905 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 12:47:32,905 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:70, output treesize:66 [2018-02-04 12:47:39,434 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2018-02-04 12:47:39,434 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:47:39,449 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-02-04 12:47:39,449 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:47:39,465 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-04 12:47:39,465 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 12:47:39,482 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-04 12:47:39,482 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 12:47:39,498 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-04 12:47:39,498 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:49, output treesize:37 [2018-02-04 12:47:52,570 WARN L143 SmtUtils]: Spent 6017ms on a formula simplification that was a NOOP. DAG size: 29 [2018-02-04 12:47:56,684 WARN L143 SmtUtils]: Spent 4023ms on a formula simplification that was a NOOP. DAG size: 37 [2018-02-04 12:47:59,259 WARN L143 SmtUtils]: Spent 2538ms on a formula simplification that was a NOOP. DAG size: 37 [2018-02-04 12:48:05,411 WARN L146 SmtUtils]: Spent 6110ms on a formula simplification. DAG size of input: 39 DAG size of output 37 [2018-02-04 12:48:05,683 WARN L1033 $PredicateComparison]: unable to prove that (exists ((v_prenex_38 Int) (v_prenex_34 Int)) (let ((.cse0 (mod v_prenex_34 4294967296))) (and (<= .cse0 3) (= (select |c_old(#valid)| v_prenex_38) 0) (< 2 .cse0) (= |c_#length| (store |c_old(#length)| v_prenex_38 .cse0)) (<= .cse0 2147483647)))) is different from true [2018-02-04 12:48:05,688 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:48:05,689 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:48:05,689 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 14 treesize of output 25 [2018-02-04 12:48:05,689 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:48:05,700 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:48:05,700 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:48:05,701 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 11 treesize of output 4 [2018-02-04 12:48:05,701 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:48:05,706 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 12:48:05,706 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:42, output treesize:26 [2018-02-04 12:48:07,175 INFO L134 CoverageAnalysis]: Checked inductivity of 531 backedges. 260 proven. 36 refuted. 0 times theorem prover too weak. 231 trivial. 4 not checked. [2018-02-04 12:48:07,192 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 12:48:07,192 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-02-04 12:48:07,193 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-02-04 12:48:07,193 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-02-04 12:48:07,193 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=712, Unknown=13, NotChecked=54, Total=870 [2018-02-04 12:48:07,194 INFO L87 Difference]: Start difference. First operand 241 states and 256 transitions. Second operand 30 states. [2018-02-04 12:48:13,938 WARN L146 SmtUtils]: Spent 875ms on a formula simplification. DAG size of input: 78 DAG size of output 40 [2018-02-04 12:48:14,508 WARN L146 SmtUtils]: Spent 345ms on a formula simplification. DAG size of input: 79 DAG size of output 47 [2018-02-04 12:48:18,156 WARN L146 SmtUtils]: Spent 3469ms on a formula simplification. DAG size of input: 83 DAG size of output 48 [2018-02-04 12:48:29,114 WARN L146 SmtUtils]: Spent 7779ms on a formula simplification. DAG size of input: 57 DAG size of output 51 [2018-02-04 12:48:32,831 WARN L146 SmtUtils]: Spent 730ms on a formula simplification. DAG size of input: 40 DAG size of output 34 [2018-02-04 12:48:35,483 WARN L146 SmtUtils]: Spent 2577ms on a formula simplification. DAG size of input: 70 DAG size of output 59 [2018-02-04 12:48:37,729 WARN L146 SmtUtils]: Spent 2064ms on a formula simplification. DAG size of input: 53 DAG size of output 42 [2018-02-04 12:48:41,949 WARN L146 SmtUtils]: Spent 2037ms on a formula simplification. DAG size of input: 46 DAG size of output 20 Received shutdown request... [2018-02-04 12:50:55,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-04 12:50:55,247 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-04 12:50:55,252 WARN L185 ceAbstractionStarter]: Timeout [2018-02-04 12:50:55,253 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 12:50:55 BoogieIcfgContainer [2018-02-04 12:50:55,253 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 12:50:55,254 INFO L168 Benchmark]: Toolchain (without parser) took 228853.79 ms. Allocated memory was 404.2 MB in the beginning and 690.0 MB in the end (delta: 285.7 MB). Free memory was 360.9 MB in the beginning and 627.2 MB in the end (delta: -266.3 MB). Peak memory consumption was 19.5 MB. Max. memory is 5.3 GB. [2018-02-04 12:50:55,255 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 404.2 MB. Free memory is still 367.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 12:50:55,255 INFO L168 Benchmark]: CACSL2BoogieTranslator took 183.99 ms. Allocated memory is still 404.2 MB. Free memory was 360.9 MB in the beginning and 348.9 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. [2018-02-04 12:50:55,255 INFO L168 Benchmark]: Boogie Preprocessor took 35.11 ms. Allocated memory is still 404.2 MB. Free memory was 347.6 MB in the beginning and 346.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-04 12:50:55,256 INFO L168 Benchmark]: RCFGBuilder took 490.11 ms. Allocated memory is still 404.2 MB. Free memory was 346.2 MB in the beginning and 289.2 MB in the end (delta: 57.0 MB). Peak memory consumption was 57.0 MB. Max. memory is 5.3 GB. [2018-02-04 12:50:55,256 INFO L168 Benchmark]: TraceAbstraction took 228141.43 ms. Allocated memory was 404.2 MB in the beginning and 690.0 MB in the end (delta: 285.7 MB). Free memory was 289.2 MB in the beginning and 627.2 MB in the end (delta: -338.0 MB). There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 12:50:55,257 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.20 ms. Allocated memory is still 404.2 MB. Free memory is still 367.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 183.99 ms. Allocated memory is still 404.2 MB. Free memory was 360.9 MB in the beginning and 348.9 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 35.11 ms. Allocated memory is still 404.2 MB. Free memory was 347.6 MB in the beginning and 346.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 490.11 ms. Allocated memory is still 404.2 MB. Free memory was 346.2 MB in the beginning and 289.2 MB in the end (delta: 57.0 MB). Peak memory consumption was 57.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 228141.43 ms. Allocated memory was 404.2 MB in the beginning and 690.0 MB in the end (delta: 285.7 MB). Free memory was 289.2 MB in the beginning and 627.2 MB in the end (delta: -338.0 MB). There was no memory consumed. 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 837). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 31 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 54 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 838). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 31 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 54 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 837). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 31 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 54 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 838). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 31 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 54 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 839). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 31 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 54 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 839). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 31 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 54 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 821). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 31 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 54 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 821). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 31 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 54 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 822). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 31 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 54 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 821). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 31 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 54 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 822). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 31 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 54 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 821). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 31 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 54 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 828). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 31 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 54 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 829). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 31 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 54 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 827). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 31 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 54 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 827). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 31 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 54 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 827). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 31 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 54 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 829). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 31 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 54 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 827). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 31 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 54 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 828). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 31 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 54 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 802). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 31 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 54 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 802). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 31 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 54 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 801). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 31 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 54 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 801). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 31 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 54 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 803). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 31 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 54 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 802). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 31 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 54 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 803). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 31 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 54 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 802). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 31 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 54 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 880). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 31 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 54 known predicates. - TimeoutResultAtElement [Line: 874]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 874). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 31 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 54 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 880). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 31 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 54 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 793). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 31 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 54 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 792). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 31 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 54 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 791). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 31 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 54 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 792). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 31 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 54 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 792). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 31 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 54 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 791). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 31 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 54 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 793). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 31 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 54 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 792). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 31 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 54 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 812). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 31 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 54 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 811). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 31 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 54 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 813). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 31 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 54 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 812). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 31 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 54 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 812). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 31 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 54 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 811). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 31 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 54 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 813). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 31 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 54 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 812). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 31 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 54 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 869). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 31 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 54 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 868). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 31 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 54 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 867). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 31 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 54 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 867). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 31 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 54 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 869). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 31 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 54 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 868). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 31 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 54 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 742). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 31 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 54 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 742). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 31 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 54 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 780). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 31 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 54 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 783). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 31 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 54 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 781). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 31 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 54 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 782). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 31 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 54 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 782). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 31 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 54 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 779). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 31 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 54 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 780). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 31 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 54 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 782). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 31 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 54 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 783). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 31 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 54 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 780). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 31 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 54 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 780). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 31 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 54 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 779). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 31 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 54 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 782). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 31 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 54 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 781). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 31 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 54 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 876). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 31 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 54 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 876). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 31 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 54 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 858). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 31 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 54 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 859). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 31 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 54 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 857). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 31 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 54 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 857). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 31 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 54 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 859). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 31 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 54 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 858). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 31 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 54 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 847). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 31 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 54 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 847). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 31 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 54 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 848). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 31 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 54 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 849). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 31 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 54 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 849). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 31 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 54 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 848). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 31 states, 30 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 54 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 16 procedures, 250 locations, 83 error locations. TIMEOUT Result, 228.0s OverallTime, 9 OverallIterations, 18 TraceHistogramMax, 182.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2099 SDtfs, 633 SDslu, 8559 SDs, 0 SdLazy, 4184 SolverSat, 194 SolverUnsat, 104 SolverUnknown, 0 SolverNotchecked, 147.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 826 GetRequests, 709 SyntacticMatches, 3 SemanticMatches, 113 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 632 ImplicationChecksByTransitivity, 74.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=250occurred 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, 8 MinimizatonAttempts, 68 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 2.4s SatisfiabilityAnalysisTime, 42.5s InterpolantComputationTime, 788 NumberOfCodeBlocks, 706 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 779 ConstructedInterpolants, 47 QuantifiedInterpolants, 466642 SizeOfPredicates, 42 NumberOfNonLiveVariables, 3563 ConjunctsInSsa, 236 ConjunctsInUnsatCore, 9 InterpolantComputations, 5 PerfectInterpolantSequences, 1721/1800 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0237_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_12-50-55-266.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0237_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_12-50-55-266.csv Completed graceful shutdown