java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf -i ../../../trunk/examples/svcomp/memsafety/test-0234_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c17473d-m [2018-02-04 12:30:30,682 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 12:30:30,683 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 12:30:30,693 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 12:30:30,693 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 12:30:30,694 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 12:30:30,694 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 12:30:30,695 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 12:30:30,696 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 12:30:30,697 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 12:30:30,698 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 12:30:30,698 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 12:30:30,699 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 12:30:30,699 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 12:30:30,700 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 12:30:30,702 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 12:30:30,703 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 12:30:30,705 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 12:30:30,706 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 12:30:30,707 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 12:30:30,708 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 12:30:30,709 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 12:30:30,709 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 12:30:30,710 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 12:30:30,710 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 12:30:30,711 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 12:30:30,711 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 12:30:30,712 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 12:30:30,712 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 12:30:30,712 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 12:30:30,713 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 12:30:30,713 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:30:30,722 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 12:30:30,722 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 12:30:30,723 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 12:30:30,723 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 12:30:30,724 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 12:30:30,724 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 12:30:30,724 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 12:30:30,724 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 12:30:30,724 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 12:30:30,724 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 12:30:30,725 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 12:30:30,725 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 12:30:30,725 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 12:30:30,725 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 12:30:30,725 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 12:30:30,725 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 12:30:30,725 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 12:30:30,726 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 12:30:30,726 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 12:30:30,726 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 12:30:30,726 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 12:30:30,726 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 12:30:30,726 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 12:30:30,727 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-04 12:30:30,758 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 12:30:30,769 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 12:30:30,772 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 12:30:30,773 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 12:30:30,774 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 12:30:30,775 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/test-0234_false-valid-memtrack.i [2018-02-04 12:30:30,932 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 12:30:30,934 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 12:30:30,934 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 12:30:30,934 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 12:30:30,940 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 12:30:30,941 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 12:30:30" (1/1) ... [2018-02-04 12:30:30,943 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69a9abb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:30:30, skipping insertion in model container [2018-02-04 12:30:30,943 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 12:30:30" (1/1) ... [2018-02-04 12:30:30,958 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 12:30:30,988 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 12:30:31,082 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 12:30:31,098 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 12:30:31,108 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:30:31 WrapperNode [2018-02-04 12:30:31,108 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 12:30:31,108 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 12:30:31,109 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 12:30:31,109 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 12:30:31,119 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:30:31" (1/1) ... [2018-02-04 12:30:31,120 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:30:31" (1/1) ... [2018-02-04 12:30:31,127 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:30:31" (1/1) ... [2018-02-04 12:30:31,127 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:30:31" (1/1) ... [2018-02-04 12:30:31,134 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:30:31" (1/1) ... [2018-02-04 12:30:31,137 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:30:31" (1/1) ... [2018-02-04 12:30:31,138 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:30:31" (1/1) ... [2018-02-04 12:30:31,140 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 12:30:31,140 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 12:30:31,140 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 12:30:31,140 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 12:30:31,141 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:30:31" (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:30:31,174 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 12:30:31,174 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 12:30:31,175 INFO L136 BoogieDeclarations]: Found implementation of procedure calloc_model [2018-02-04 12:30:31,175 INFO L136 BoogieDeclarations]: Found implementation of procedure zalloc_or_die [2018-02-04 12:30:31,175 INFO L136 BoogieDeclarations]: Found implementation of procedure l4_insert [2018-02-04 12:30:31,175 INFO L136 BoogieDeclarations]: Found implementation of procedure l3_insert [2018-02-04 12:30:31,175 INFO L136 BoogieDeclarations]: Found implementation of procedure l2_insert [2018-02-04 12:30:31,175 INFO L136 BoogieDeclarations]: Found implementation of procedure l1_insert [2018-02-04 12:30:31,175 INFO L136 BoogieDeclarations]: Found implementation of procedure l0_insert [2018-02-04 12:30:31,175 INFO L136 BoogieDeclarations]: Found implementation of procedure l4_destroy [2018-02-04 12:30:31,176 INFO L136 BoogieDeclarations]: Found implementation of procedure l3_destroy [2018-02-04 12:30:31,176 INFO L136 BoogieDeclarations]: Found implementation of procedure l2_destroy [2018-02-04 12:30:31,176 INFO L136 BoogieDeclarations]: Found implementation of procedure l1_destroy [2018-02-04 12:30:31,176 INFO L136 BoogieDeclarations]: Found implementation of procedure l0_destroy [2018-02-04 12:30:31,176 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 12:30:31,176 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-04 12:30:31,176 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-04 12:30:31,176 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 12:30:31,176 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 12:30:31,176 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 12:30:31,177 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2018-02-04 12:30:31,177 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2018-02-04 12:30:31,177 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-04 12:30:31,177 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-04 12:30:31,177 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-02-04 12:30:31,177 INFO L128 BoogieDeclarations]: Found specification of procedure memset [2018-02-04 12:30:31,177 INFO L128 BoogieDeclarations]: Found specification of procedure calloc_model [2018-02-04 12:30:31,177 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 12:30:31,177 INFO L128 BoogieDeclarations]: Found specification of procedure zalloc_or_die [2018-02-04 12:30:31,178 INFO L128 BoogieDeclarations]: Found specification of procedure l4_insert [2018-02-04 12:30:31,178 INFO L128 BoogieDeclarations]: Found specification of procedure l3_insert [2018-02-04 12:30:31,178 INFO L128 BoogieDeclarations]: Found specification of procedure l2_insert [2018-02-04 12:30:31,178 INFO L128 BoogieDeclarations]: Found specification of procedure l1_insert [2018-02-04 12:30:31,178 INFO L128 BoogieDeclarations]: Found specification of procedure l0_insert [2018-02-04 12:30:31,178 INFO L128 BoogieDeclarations]: Found specification of procedure l4_destroy [2018-02-04 12:30:31,178 INFO L128 BoogieDeclarations]: Found specification of procedure l3_destroy [2018-02-04 12:30:31,179 INFO L128 BoogieDeclarations]: Found specification of procedure l2_destroy [2018-02-04 12:30:31,179 INFO L128 BoogieDeclarations]: Found specification of procedure l1_destroy [2018-02-04 12:30:31,179 INFO L128 BoogieDeclarations]: Found specification of procedure l0_destroy [2018-02-04 12:30:31,179 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 12:30:31,179 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 12:30:31,179 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 12:30:31,451 WARN L455 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-02-04 12:30:31,625 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 12:30:31,626 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 12:30:31 BoogieIcfgContainer [2018-02-04 12:30:31,626 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 12:30:31,627 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 12:30:31,627 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 12:30:31,629 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 12:30:31,629 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 12:30:30" (1/3) ... [2018-02-04 12:30:31,629 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c4a1c23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 12:30:31, skipping insertion in model container [2018-02-04 12:30:31,629 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:30:31" (2/3) ... [2018-02-04 12:30:31,629 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c4a1c23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 12:30:31, skipping insertion in model container [2018-02-04 12:30:31,630 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 12:30:31" (3/3) ... [2018-02-04 12:30:31,631 INFO L107 eAbstractionObserver]: Analyzing ICFG test-0234_false-valid-memtrack.i [2018-02-04 12:30:31,636 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 12:30:31,641 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 67 error locations. [2018-02-04 12:30:31,664 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 12:30:31,664 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 12:30:31,664 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 12:30:31,664 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 12:30:31,664 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 12:30:31,664 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 12:30:31,664 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 12:30:31,665 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 12:30:31,665 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 12:30:31,677 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states. [2018-02-04 12:30:31,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-02-04 12:30:31,683 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:30:31,684 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-02-04 12:30:31,684 INFO L371 AbstractCegarLoop]: === Iteration 1 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr0RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-04 12:30:31,687 INFO L82 PathProgramCache]: Analyzing trace with hash 11876704, now seen corresponding path program 1 times [2018-02-04 12:30:31,688 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:30:31,689 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:30:31,719 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:30:31,719 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:30:31,719 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:30:31,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:30:31,748 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:30:31,788 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:30:31,790 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:30:31,790 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 12:30:31,791 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 12:30:31,799 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 12:30:31,799 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 12:30:31,800 INFO L87 Difference]: Start difference. First operand 224 states. Second operand 3 states. [2018-02-04 12:30:32,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:30:32,002 INFO L93 Difference]: Finished difference Result 254 states and 273 transitions. [2018-02-04 12:30:32,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 12:30:32,003 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-02-04 12:30:32,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:30:32,012 INFO L225 Difference]: With dead ends: 254 [2018-02-04 12:30:32,012 INFO L226 Difference]: Without dead ends: 251 [2018-02-04 12:30:32,013 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:30:32,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2018-02-04 12:30:32,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 219. [2018-02-04 12:30:32,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-02-04 12:30:32,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 234 transitions. [2018-02-04 12:30:32,048 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 234 transitions. Word has length 4 [2018-02-04 12:30:32,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:30:32,048 INFO L432 AbstractCegarLoop]: Abstraction has 219 states and 234 transitions. [2018-02-04 12:30:32,049 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 12:30:32,049 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 234 transitions. [2018-02-04 12:30:32,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-02-04 12:30:32,049 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:30:32,049 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-02-04 12:30:32,049 INFO L371 AbstractCegarLoop]: === Iteration 2 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr0RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-04 12:30:32,050 INFO L82 PathProgramCache]: Analyzing trace with hash 11876705, now seen corresponding path program 1 times [2018-02-04 12:30:32,050 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:30:32,050 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:30:32,051 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:30:32,051 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:30:32,051 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:30:32,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:30:32,065 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:30:32,114 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:30:32,114 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:30:32,114 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 12:30:32,115 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 12:30:32,115 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 12:30:32,115 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 12:30:32,115 INFO L87 Difference]: Start difference. First operand 219 states and 234 transitions. Second operand 3 states. [2018-02-04 12:30:32,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:30:32,194 INFO L93 Difference]: Finished difference Result 226 states and 244 transitions. [2018-02-04 12:30:32,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 12:30:32,194 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-02-04 12:30:32,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:30:32,196 INFO L225 Difference]: With dead ends: 226 [2018-02-04 12:30:32,196 INFO L226 Difference]: Without dead ends: 226 [2018-02-04 12:30:32,197 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:30:32,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2018-02-04 12:30:32,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 218. [2018-02-04 12:30:32,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-02-04 12:30:32,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 233 transitions. [2018-02-04 12:30:32,208 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 233 transitions. Word has length 4 [2018-02-04 12:30:32,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:30:32,209 INFO L432 AbstractCegarLoop]: Abstraction has 218 states and 233 transitions. [2018-02-04 12:30:32,209 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 12:30:32,209 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 233 transitions. [2018-02-04 12:30:32,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 12:30:32,209 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:30:32,209 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:30:32,210 INFO L371 AbstractCegarLoop]: === Iteration 3 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr0RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-04 12:30:32,210 INFO L82 PathProgramCache]: Analyzing trace with hash -1969754800, now seen corresponding path program 1 times [2018-02-04 12:30:32,210 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:30:32,210 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:30:32,211 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:30:32,211 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:30:32,211 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:30:32,227 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-04 12:30:32,227 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-04 12:30:32,227 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:30:32,235 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:30:32,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:30:32,257 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:30:32,295 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:30:32,296 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:30:32,298 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:30:32,298 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 12:30:32,306 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:30:32,323 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:30:32,323 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 12:30:32,324 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 12:30:32,324 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 12:30:32,324 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 12:30:32,324 INFO L87 Difference]: Start difference. First operand 218 states and 233 transitions. Second operand 4 states. [2018-02-04 12:30:32,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:30:32,469 INFO L93 Difference]: Finished difference Result 217 states and 232 transitions. [2018-02-04 12:30:32,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 12:30:32,469 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-02-04 12:30:32,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:30:32,470 INFO L225 Difference]: With dead ends: 217 [2018-02-04 12:30:32,470 INFO L226 Difference]: Without dead ends: 217 [2018-02-04 12:30:32,471 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:30:32,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-02-04 12:30:32,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2018-02-04 12:30:32,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-02-04 12:30:32,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 232 transitions. [2018-02-04 12:30:32,481 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 232 transitions. Word has length 17 [2018-02-04 12:30:32,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:30:32,481 INFO L432 AbstractCegarLoop]: Abstraction has 217 states and 232 transitions. [2018-02-04 12:30:32,481 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 12:30:32,481 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 232 transitions. [2018-02-04 12:30:32,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 12:30:32,482 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:30:32,482 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:30:32,482 INFO L371 AbstractCegarLoop]: === Iteration 4 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr0RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-04 12:30:32,482 INFO L82 PathProgramCache]: Analyzing trace with hash -1969754799, now seen corresponding path program 1 times [2018-02-04 12:30:32,482 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:30:32,483 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:30:32,483 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:30:32,484 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:30:32,484 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:30:32,495 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-04 12:30:32,495 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-04 12:30:32,496 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:30:32,501 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:30:32,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:30:32,530 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:30:32,550 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:30:32,551 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:30:32,578 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:30:32,578 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:30:32,590 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 12:30:32,591 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:46, output treesize:44 [2018-02-04 12:30:32,630 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:30:32,652 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:30:32,652 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 12:30:32,652 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 12:30:32,652 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 12:30:32,652 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 12:30:32,653 INFO L87 Difference]: Start difference. First operand 217 states and 232 transitions. Second operand 4 states. [2018-02-04 12:30:32,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:30:32,869 INFO L93 Difference]: Finished difference Result 216 states and 231 transitions. [2018-02-04 12:30:32,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 12:30:32,869 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-02-04 12:30:32,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:30:32,871 INFO L225 Difference]: With dead ends: 216 [2018-02-04 12:30:32,871 INFO L226 Difference]: Without dead ends: 216 [2018-02-04 12:30:32,872 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:30:32,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2018-02-04 12:30:32,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2018-02-04 12:30:32,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-02-04 12:30:32,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 231 transitions. [2018-02-04 12:30:32,879 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 231 transitions. Word has length 17 [2018-02-04 12:30:32,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:30:32,880 INFO L432 AbstractCegarLoop]: Abstraction has 216 states and 231 transitions. [2018-02-04 12:30:32,880 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 12:30:32,880 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 231 transitions. [2018-02-04 12:30:32,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-02-04 12:30:32,882 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:30:32,882 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:30:32,882 INFO L371 AbstractCegarLoop]: === Iteration 5 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr0RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-04 12:30:32,883 INFO L82 PathProgramCache]: Analyzing trace with hash -772454620, now seen corresponding path program 1 times [2018-02-04 12:30:32,883 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:30:32,883 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:30:32,883 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:30:32,883 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:30:32,884 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:30:32,901 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-04 12:30:32,901 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-04 12:30:32,901 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:30:32,913 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:30:33,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:30:33,028 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:30:33,037 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:30:33,037 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:30:33,039 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:30:33,039 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 12:30:33,098 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:30:33,102 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:30:33,104 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:30:33,104 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:30:33,105 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:30:33,105 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-02-04 12:30:33,113 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:30:33,136 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:30:33,137 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:30:33,138 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:30:33,138 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:30:33,143 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:30:33,143 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:20 [2018-02-04 12:30:33,176 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:30:33,195 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 12:30:33,195 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-04 12:30:33,195 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 12:30:33,195 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 12:30:33,196 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=125, Unknown=2, NotChecked=46, Total=210 [2018-02-04 12:30:33,196 INFO L87 Difference]: Start difference. First operand 216 states and 231 transitions. Second operand 15 states. [2018-02-04 12:30:33,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:30:33,894 INFO L93 Difference]: Finished difference Result 244 states and 264 transitions. [2018-02-04 12:30:33,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 12:30:33,895 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 142 [2018-02-04 12:30:33,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:30:33,897 INFO L225 Difference]: With dead ends: 244 [2018-02-04 12:30:33,897 INFO L226 Difference]: Without dead ends: 244 [2018-02-04 12:30:33,897 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:30:33,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2018-02-04 12:30:33,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 214. [2018-02-04 12:30:33,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2018-02-04 12:30:33,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 229 transitions. [2018-02-04 12:30:33,905 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 229 transitions. Word has length 142 [2018-02-04 12:30:33,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:30:33,906 INFO L432 AbstractCegarLoop]: Abstraction has 214 states and 229 transitions. [2018-02-04 12:30:33,906 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 12:30:33,906 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 229 transitions. [2018-02-04 12:30:33,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-02-04 12:30:33,907 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:30:33,908 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:30:33,908 INFO L371 AbstractCegarLoop]: === Iteration 6 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr0RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-04 12:30:33,908 INFO L82 PathProgramCache]: Analyzing trace with hash -772454619, now seen corresponding path program 1 times [2018-02-04 12:30:33,908 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:30:33,908 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:30:33,909 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:30:33,909 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:30:33,909 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:30:33,920 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-04 12:30:33,920 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-04 12:30:33,920 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:30:33,937 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:30:34,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:30:34,030 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:30:34,152 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-02-04 12:30:34,169 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:30:34,170 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 12:30:34,170 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 12:30:34,170 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 12:30:34,170 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-04 12:30:34,171 INFO L87 Difference]: Start difference. First operand 214 states and 229 transitions. Second operand 8 states. [2018-02-04 12:30:34,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:30:34,255 INFO L93 Difference]: Finished difference Result 224 states and 239 transitions. [2018-02-04 12:30:34,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 12:30:34,263 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 142 [2018-02-04 12:30:34,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:30:34,264 INFO L225 Difference]: With dead ends: 224 [2018-02-04 12:30:34,264 INFO L226 Difference]: Without dead ends: 215 [2018-02-04 12:30:34,265 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-02-04 12:30:34,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-02-04 12:30:34,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2018-02-04 12:30:34,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2018-02-04 12:30:34,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 230 transitions. [2018-02-04 12:30:34,270 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 230 transitions. Word has length 142 [2018-02-04 12:30:34,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:30:34,271 INFO L432 AbstractCegarLoop]: Abstraction has 215 states and 230 transitions. [2018-02-04 12:30:34,271 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 12:30:34,271 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 230 transitions. [2018-02-04 12:30:34,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-02-04 12:30:34,273 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:30:34,273 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:30:34,273 INFO L371 AbstractCegarLoop]: === Iteration 7 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr0RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-04 12:30:34,273 INFO L82 PathProgramCache]: Analyzing trace with hash 152413325, now seen corresponding path program 1 times [2018-02-04 12:30:34,273 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:30:34,273 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:30:34,274 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:30:34,274 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:30:34,274 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:30:34,293 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-04 12:30:34,293 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-04 12:30:34,294 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:30:34,304 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:30:34,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:30:34,511 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:30:34,594 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 85 proven. 1 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2018-02-04 12:30:34,615 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 12:30:34,615 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-04 12:30:34,616 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 12:30:34,616 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 12:30:34,616 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-02-04 12:30:34,616 INFO L87 Difference]: Start difference. First operand 215 states and 230 transitions. Second operand 9 states. [2018-02-04 12:30:34,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:30:34,774 INFO L93 Difference]: Finished difference Result 225 states and 240 transitions. [2018-02-04 12:30:34,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 12:30:34,775 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 148 [2018-02-04 12:30:34,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:30:34,776 INFO L225 Difference]: With dead ends: 225 [2018-02-04 12:30:34,776 INFO L226 Difference]: Without dead ends: 216 [2018-02-04 12:30:34,776 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-02-04 12:30:34,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2018-02-04 12:30:34,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2018-02-04 12:30:34,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-02-04 12:30:34,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 231 transitions. [2018-02-04 12:30:34,780 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 231 transitions. Word has length 148 [2018-02-04 12:30:34,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:30:34,780 INFO L432 AbstractCegarLoop]: Abstraction has 216 states and 231 transitions. [2018-02-04 12:30:34,780 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 12:30:34,780 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 231 transitions. [2018-02-04 12:30:34,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-02-04 12:30:34,781 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:30:34,781 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:30:34,781 INFO L371 AbstractCegarLoop]: === Iteration 8 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr0RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-04 12:30:34,781 INFO L82 PathProgramCache]: Analyzing trace with hash -677500123, now seen corresponding path program 2 times [2018-02-04 12:30:34,781 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:30:34,781 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:30:34,782 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:30:34,782 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:30:34,782 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:30:34,790 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-04 12:30:34,790 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-04 12:30:34,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 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:30:34,809 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 12:30:36,249 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 12:30:36,249 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 12:30:36,256 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:30:36,365 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 99 proven. 56 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2018-02-04 12:30:36,383 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 12:30:36,384 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-04 12:30:36,384 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 12:30:36,384 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 12:30:36,384 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-02-04 12:30:36,384 INFO L87 Difference]: Start difference. First operand 216 states and 231 transitions. Second operand 10 states. [2018-02-04 12:30:36,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:30:36,525 INFO L93 Difference]: Finished difference Result 226 states and 241 transitions. [2018-02-04 12:30:36,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 12:30:36,529 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 154 [2018-02-04 12:30:36,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:30:36,530 INFO L225 Difference]: With dead ends: 226 [2018-02-04 12:30:36,530 INFO L226 Difference]: Without dead ends: 217 [2018-02-04 12:30:36,530 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 144 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-02-04 12:30:36,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-02-04 12:30:36,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2018-02-04 12:30:36,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-02-04 12:30:36,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 232 transitions. [2018-02-04 12:30:36,534 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 232 transitions. Word has length 154 [2018-02-04 12:30:36,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:30:36,534 INFO L432 AbstractCegarLoop]: Abstraction has 217 states and 232 transitions. [2018-02-04 12:30:36,534 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 12:30:36,534 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 232 transitions. [2018-02-04 12:30:36,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-02-04 12:30:36,535 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:30:36,535 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:30:36,535 INFO L371 AbstractCegarLoop]: === Iteration 9 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr0RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-04 12:30:36,535 INFO L82 PathProgramCache]: Analyzing trace with hash -626793843, now seen corresponding path program 3 times [2018-02-04 12:30:36,535 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:30:36,535 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:30:36,536 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:30:36,536 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 12:30:36,536 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:30:36,543 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-04 12:30:36,543 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-04 12:30:36,543 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:30:36,549 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 12:30:36,668 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-02-04 12:30:36,668 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 12:30:36,673 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:30:36,767 INFO L134 CoverageAnalysis]: Checked inductivity of 531 backedges. 145 proven. 6 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2018-02-04 12:30:36,795 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 12:30:36,795 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-04 12:30:36,796 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 12:30:36,796 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 12:30:36,796 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-02-04 12:30:36,796 INFO L87 Difference]: Start difference. First operand 217 states and 232 transitions. Second operand 11 states. [2018-02-04 12:30:36,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:30:36,913 INFO L93 Difference]: Finished difference Result 227 states and 242 transitions. [2018-02-04 12:30:36,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 12:30:36,913 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 160 [2018-02-04 12:30:36,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:30:36,914 INFO L225 Difference]: With dead ends: 227 [2018-02-04 12:30:36,914 INFO L226 Difference]: Without dead ends: 218 [2018-02-04 12:30:36,915 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2018-02-04 12:30:36,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-02-04 12:30:36,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2018-02-04 12:30:36,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-02-04 12:30:36,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 233 transitions. [2018-02-04 12:30:36,923 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 233 transitions. Word has length 160 [2018-02-04 12:30:36,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:30:36,924 INFO L432 AbstractCegarLoop]: Abstraction has 218 states and 233 transitions. [2018-02-04 12:30:36,924 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 12:30:36,924 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 233 transitions. [2018-02-04 12:30:36,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-02-04 12:30:36,926 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:30:36,926 INFO L351 BasicCegarLoop]: trace histogram [24, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:30:36,926 INFO L371 AbstractCegarLoop]: === Iteration 10 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr0RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-04 12:30:36,926 INFO L82 PathProgramCache]: Analyzing trace with hash 262360869, now seen corresponding path program 4 times [2018-02-04 12:30:36,926 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:30:36,926 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:30:36,927 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:30:36,927 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 12:30:36,927 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:30:36,950 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-04 12:30:36,951 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-04 12:30:36,951 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-02-04 12:30:36,956 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 12:30:39,995 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 12:30:39,995 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 12:30:40,002 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:30:40,093 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 447 proven. 23 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-02-04 12:30:40,112 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 12:30:40,112 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-04 12:30:40,112 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 12:30:40,112 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 12:30:40,113 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-02-04 12:30:40,113 INFO L87 Difference]: Start difference. First operand 218 states and 233 transitions. Second operand 12 states. [2018-02-04 12:30:40,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:30:40,241 INFO L93 Difference]: Finished difference Result 228 states and 243 transitions. [2018-02-04 12:30:40,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 12:30:40,242 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 166 [2018-02-04 12:30:40,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:30:40,243 INFO L225 Difference]: With dead ends: 228 [2018-02-04 12:30:40,243 INFO L226 Difference]: Without dead ends: 219 [2018-02-04 12:30:40,243 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2018-02-04 12:30:40,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-02-04 12:30:40,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2018-02-04 12:30:40,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-02-04 12:30:40,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 234 transitions. [2018-02-04 12:30:40,248 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 234 transitions. Word has length 166 [2018-02-04 12:30:40,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:30:40,248 INFO L432 AbstractCegarLoop]: Abstraction has 219 states and 234 transitions. [2018-02-04 12:30:40,248 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 12:30:40,248 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 234 transitions. [2018-02-04 12:30:40,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-02-04 12:30:40,250 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:30:40,251 INFO L351 BasicCegarLoop]: trace histogram [30, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:30:40,251 INFO L371 AbstractCegarLoop]: === Iteration 11 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr0RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-04 12:30:40,251 INFO L82 PathProgramCache]: Analyzing trace with hash -668999539, now seen corresponding path program 5 times [2018-02-04 12:30:40,251 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:30:40,251 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:30:40,252 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:30:40,252 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 12:30:40,252 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:30:40,263 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-04 12:30:40,263 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-04 12:30:40,264 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 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-02-04 12:30:40,274 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 12:30:48,704 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2018-02-04 12:30:48,704 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 12:30:48,710 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:30:48,803 INFO L134 CoverageAnalysis]: Checked inductivity of 885 backedges. 437 proven. 60 refuted. 0 times theorem prover too weak. 388 trivial. 0 not checked. [2018-02-04 12:30:48,823 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 12:30:48,823 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-04 12:30:48,823 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 12:30:48,823 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 12:30:48,823 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-02-04 12:30:48,824 INFO L87 Difference]: Start difference. First operand 219 states and 234 transitions. Second operand 13 states. [2018-02-04 12:30:48,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:30:48,951 INFO L93 Difference]: Finished difference Result 229 states and 244 transitions. [2018-02-04 12:30:48,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 12:30:48,951 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 172 [2018-02-04 12:30:48,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:30:48,952 INFO L225 Difference]: With dead ends: 229 [2018-02-04 12:30:48,952 INFO L226 Difference]: Without dead ends: 220 [2018-02-04 12:30:48,952 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2018-02-04 12:30:48,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-02-04 12:30:48,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2018-02-04 12:30:48,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-02-04 12:30:48,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 235 transitions. [2018-02-04 12:30:48,956 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 235 transitions. Word has length 172 [2018-02-04 12:30:48,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:30:48,957 INFO L432 AbstractCegarLoop]: Abstraction has 220 states and 235 transitions. [2018-02-04 12:30:48,957 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 12:30:48,957 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 235 transitions. [2018-02-04 12:30:48,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-02-04 12:30:48,958 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:30:48,958 INFO L351 BasicCegarLoop]: trace histogram [36, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:30:48,958 INFO L371 AbstractCegarLoop]: === Iteration 12 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr0RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-04 12:30:48,958 INFO L82 PathProgramCache]: Analyzing trace with hash -954944731, now seen corresponding path program 6 times [2018-02-04 12:30:48,958 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:30:48,958 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:30:48,959 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:30:48,959 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 12:30:48,959 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:30:48,968 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-04 12:30:48,968 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-04 12:30:48,968 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 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-02-04 12:30:48,978 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 12:30:51,074 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-02-04 12:30:51,074 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 12:30:51,080 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:30:51,102 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2018-02-04 12:30:51,103 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:30:51,120 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 29 [2018-02-04 12:30:51,120 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:30:51,135 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 12:30:51,136 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:58, output treesize:56 [2018-02-04 12:30:53,191 WARN L1033 $PredicateComparison]: unable to prove that (or (exists ((v_calloc_model_~nmemb_BEFORE_CALL_7 Int) (v_calloc_model_~ptr~0.base_BEFORE_CALL_2 Int) (v_calloc_model_~size_BEFORE_CALL_7 Int)) (let ((.cse0 (mod (* v_calloc_model_~nmemb_BEFORE_CALL_7 v_calloc_model_~size_BEFORE_CALL_7) 4294967296))) (and (= (select |c_#length| v_calloc_model_~ptr~0.base_BEFORE_CALL_2) .cse0) (<= .cse0 2147483647)))) (exists ((v_prenex_4 Int) (v_prenex_5 Int) (v_prenex_3 Int)) (let ((.cse1 (mod (* v_prenex_3 v_prenex_5) 4294967296))) (and (= (+ (select |c_#length| v_prenex_4) 4294967296) .cse1) (< 2147483647 .cse1))))) is different from true [2018-02-04 12:30:53,478 WARN L143 SmtUtils]: Spent 275ms on a formula simplification that was a NOOP. DAG size: 32 [2018-02-04 12:30:55,882 WARN L143 SmtUtils]: Spent 2350ms on a formula simplification that was a NOOP. DAG size: 34 [2018-02-04 12:30:56,797 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:30:56,797 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:30:56,814 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:30:56,815 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:30:56,831 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2018-02-04 12:30:56,832 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 12:30:56,848 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2018-02-04 12:30:56,849 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 12:30:56,864 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:30:56,864 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:49, output treesize:37 [2018-02-04 12:30:58,867 WARN L1033 $PredicateComparison]: unable to prove that (or (exists ((calloc_model_~size Int) (|v_calloc_model_#in~nmemb_BEFORE_CALL_8| Int) (v_calloc_model_~ptr~0.base_BEFORE_CALL_3 Int)) (let ((.cse0 (mod (* |v_calloc_model_#in~nmemb_BEFORE_CALL_8| calloc_model_~size) 4294967296))) (and (< 2147483647 .cse0) (= .cse0 (+ (select |c_#length| v_calloc_model_~ptr~0.base_BEFORE_CALL_3) 4294967296))))) (exists ((v_prenex_15 Int) (v_prenex_12 Int) (v_prenex_13 Int)) (let ((.cse1 (mod (* v_prenex_13 v_prenex_12) 4294967296))) (and (<= .cse1 2147483647) (= (select |c_#length| v_prenex_15) .cse1))))) is different from true [2018-02-04 12:31:00,894 WARN L1033 $PredicateComparison]: unable to prove that (let ((.cse1 (exists ((v_prenex_18 Int) (|v_calloc_model_#in~nmemb_BEFORE_CALL_8| Int) (v_calloc_model_~ptr~0.base_BEFORE_CALL_3 Int)) (let ((.cse7 (mod (* |v_calloc_model_#in~nmemb_BEFORE_CALL_8| v_prenex_18) 4294967296))) (and (= .cse7 (+ (select |c_#length| v_calloc_model_~ptr~0.base_BEFORE_CALL_3) 4294967296)) (< 2147483647 .cse7))))) (.cse0 (exists ((calloc_model_~size Int) (v_prenex_17 Int)) (let ((.cse6 (mod (* |c_calloc_model_#in~nmemb| calloc_model_~size) 4294967296))) (and (< 2147483647 .cse6) (= 0 (select |c_old(#valid)| v_prenex_17)) (= (store |c_old(#length)| v_prenex_17 (+ .cse6 (- 4294967296))) |c_#length|))))) (.cse2 (exists ((v_prenex_12 Int) (calloc_model_~ptr~0.base Int)) (let ((.cse5 (mod (* |c_calloc_model_#in~nmemb| v_prenex_12) 4294967296))) (and (= 0 (select |c_old(#valid)| calloc_model_~ptr~0.base)) (= |c_#length| (store |c_old(#length)| calloc_model_~ptr~0.base .cse5)) (<= .cse5 2147483647))))) (.cse3 (exists ((v_prenex_15 Int) (v_prenex_13 Int) (v_prenex_19 Int)) (let ((.cse4 (mod (* v_prenex_13 v_prenex_19) 4294967296))) (and (= (select |c_#length| v_prenex_15) .cse4) (<= .cse4 2147483647)))))) (or (and .cse0 .cse1) (and .cse2 .cse1) (and .cse0 .cse3) (and .cse2 .cse3))) is different from true [2018-02-04 12:31:00,917 WARN L1033 $PredicateComparison]: unable to prove that (or (and (exists ((calloc_model_~size Int) (v_prenex_17 Int)) (let ((.cse0 (mod (* |c_calloc_model_#in~nmemb| calloc_model_~size) 4294967296))) (and (< 2147483647 .cse0) (= 0 (select |c_old(#valid)| v_prenex_17)) (= (store |c_old(#length)| v_prenex_17 (+ .cse0 (- 4294967296))) |c_#length|)))) (exists ((v_prenex_18 Int) (|v_calloc_model_#in~nmemb_BEFORE_CALL_8| Int) (v_calloc_model_~ptr~0.base_BEFORE_CALL_3 Int)) (let ((.cse1 (mod (* |v_calloc_model_#in~nmemb_BEFORE_CALL_8| v_prenex_18) 4294967296))) (and (= .cse1 (+ (select |c_#length| v_calloc_model_~ptr~0.base_BEFORE_CALL_3) 4294967296)) (< 2147483647 .cse1))))) (and (exists ((v_prenex_27 Int) (v_prenex_29 Int) (v_prenex_25 Int)) (let ((.cse2 (mod (* v_prenex_27 v_prenex_29) 4294967296))) (and (= (select |c_#length| v_prenex_25) .cse2) (<= .cse2 2147483647)))) (exists ((v_prenex_26 Int) (v_prenex_28 Int)) (let ((.cse3 (mod (* |c_calloc_model_#in~nmemb| v_prenex_26) 4294967296))) (and (= |c_#length| (store |c_old(#length)| v_prenex_28 .cse3)) (<= .cse3 2147483647) (= 0 (select |c_old(#valid)| v_prenex_28)))))) (and (exists ((v_prenex_23 Int) (v_prenex_24 Int)) (let ((.cse4 (mod (* |c_calloc_model_#in~nmemb| v_prenex_23) 4294967296))) (and (= 0 (select |c_old(#valid)| v_prenex_24)) (= (store |c_old(#length)| v_prenex_24 (+ .cse4 (- 4294967296))) |c_#length|) (< 2147483647 .cse4)))) (exists ((v_prenex_15 Int) (v_prenex_13 Int) (v_prenex_19 Int)) (let ((.cse5 (mod (* v_prenex_13 v_prenex_19) 4294967296))) (and (= (select |c_#length| v_prenex_15) .cse5) (<= .cse5 2147483647))))) (and (exists ((v_prenex_22 Int) (v_prenex_21 Int) (v_prenex_20 Int)) (let ((.cse6 (mod (* v_prenex_21 v_prenex_20) 4294967296))) (and (= .cse6 (+ (select |c_#length| v_prenex_22) 4294967296)) (< 2147483647 .cse6)))) (exists ((v_prenex_12 Int) (calloc_model_~ptr~0.base Int)) (let ((.cse7 (mod (* |c_calloc_model_#in~nmemb| v_prenex_12) 4294967296))) (and (= 0 (select |c_old(#valid)| calloc_model_~ptr~0.base)) (= |c_#length| (store |c_old(#length)| calloc_model_~ptr~0.base .cse7)) (<= .cse7 2147483647)))))) is different from true [2018-02-04 12:31:23,408 WARN L146 SmtUtils]: Spent 20545ms on a formula simplification. DAG size of input: 96 DAG size of output 29 [2018-02-04 12:31:23,427 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:31:23,427 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:31:23,428 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 47 [2018-02-04 12:31:23,428 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:31:23,448 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:31:23,448 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:31:23,449 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 26 [2018-02-04 12:31:23,449 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:31:23,466 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:31:23,467 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:31:23,467 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 27 [2018-02-04 12:31:23,467 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 12:31:23,483 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-02-04 12:31:23,483 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 12:31:23,498 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-02-04 12:31:23,499 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:67, output treesize:49 [2018-02-04 12:31:23,607 INFO L134 CoverageAnalysis]: Checked inductivity of 1116 backedges. 522 proven. 14 refuted. 0 times theorem prover too weak. 524 trivial. 56 not checked. [2018-02-04 12:31:23,626 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 12:31:23,626 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-04 12:31:23,626 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-04 12:31:23,626 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-04 12:31:23,627 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=416, Unknown=6, NotChecked=172, Total=650 [2018-02-04 12:31:23,627 INFO L87 Difference]: Start difference. First operand 220 states and 235 transitions. Second operand 26 states. [2018-02-04 12:31:28,497 WARN L146 SmtUtils]: Spent 172ms on a formula simplification. DAG size of input: 49 DAG size of output 47 [2018-02-04 12:31:29,728 WARN L146 SmtUtils]: Spent 1012ms on a formula simplification. DAG size of input: 72 DAG size of output 70 [2018-02-04 12:31:34,015 WARN L146 SmtUtils]: Spent 2079ms on a formula simplification. DAG size of input: 53 DAG size of output 31 [2018-02-04 12:31:38,297 WARN L146 SmtUtils]: Spent 4231ms on a formula simplification. DAG size of input: 59 DAG size of output 35 [2018-02-04 12:31:42,404 WARN L146 SmtUtils]: Spent 4051ms on a formula simplification. DAG size of input: 62 DAG size of output 40 [2018-02-04 12:31:42,892 WARN L146 SmtUtils]: Spent 410ms on a formula simplification. DAG size of input: 67 DAG size of output 42 [2018-02-04 12:32:26,049 WARN L146 SmtUtils]: Spent 33511ms on a formula simplification. DAG size of input: 116 DAG size of output 51 [2018-02-04 12:32:42,770 WARN L146 SmtUtils]: Spent 11869ms on a formula simplification. DAG size of input: 167 DAG size of output 59 [2018-02-04 12:32:51,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:32:51,337 INFO L93 Difference]: Finished difference Result 256 states and 280 transitions. [2018-02-04 12:32:51,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-04 12:32:51,338 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 178 [2018-02-04 12:32:51,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:32:51,339 INFO L225 Difference]: With dead ends: 256 [2018-02-04 12:32:51,339 INFO L226 Difference]: Without dead ends: 256 [2018-02-04 12:32:51,339 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 110.0s TimeCoverageRelationStatistics Valid=157, Invalid=1249, Unknown=16, NotChecked=300, Total=1722 [2018-02-04 12:32:51,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2018-02-04 12:32:51,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 218. [2018-02-04 12:32:51,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-02-04 12:32:51,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 233 transitions. [2018-02-04 12:32:51,343 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 233 transitions. Word has length 178 [2018-02-04 12:32:51,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:32:51,343 INFO L432 AbstractCegarLoop]: Abstraction has 218 states and 233 transitions. [2018-02-04 12:32:51,343 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-04 12:32:51,343 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 233 transitions. [2018-02-04 12:32:51,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-02-04 12:32:51,344 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:32:51,344 INFO L351 BasicCegarLoop]: trace histogram [36, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:32:51,344 INFO L371 AbstractCegarLoop]: === Iteration 13 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr0RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-04 12:32:51,344 INFO L82 PathProgramCache]: Analyzing trace with hash 1421120613, now seen corresponding path program 1 times [2018-02-04 12:32:51,344 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:32:51,344 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:32:51,345 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:32:51,345 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 12:32:51,345 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:32:51,352 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-04 12:32:51,352 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-04 12:32:51,352 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 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-02-04 12:32:51,357 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:32:51,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:32:51,430 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:32:51,437 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2018-02-04 12:32:51,437 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:32:51,452 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 29 [2018-02-04 12:32:51,453 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:32:51,460 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-02-04 12:32:51,460 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 12:32:51,478 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 29 treesize of output 28 [2018-02-04 12:32:51,478 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 12:32:51,493 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 12:32:51,493 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:58, output treesize:54 [2018-02-04 12:32:53,933 WARN L146 SmtUtils]: Spent 2064ms on a formula simplification. DAG size of input: 94 DAG size of output 36 [2018-02-04 12:32:54,239 WARN L1033 $PredicateComparison]: unable to prove that (or (exists ((calloc_model_~size Int) (|calloc_model_#t~malloc0.base| Int) (calloc_model_~nmemb Int)) (and (= 0 (select |c_old(#valid)| |calloc_model_#t~malloc0.base|)) (= (store |c_old(#length)| |calloc_model_#t~malloc0.base| (+ (mod (* calloc_model_~size calloc_model_~nmemb) 4294967296) (- 4294967296))) |c_#length|) (< 2147483647 (mod (* calloc_model_~nmemb calloc_model_~size) 4294967296)))) (exists ((v_prenex_45 Int) (v_prenex_44 Int) (v_prenex_46 Int)) (let ((.cse0 (mod (* v_prenex_46 v_prenex_44) 4294967296))) (and (<= .cse0 2147483647) (= (store |c_old(#length)| v_prenex_45 .cse0) |c_#length|) (= 0 (select |c_old(#valid)| v_prenex_45)))))) is different from true [2018-02-04 12:32:54,243 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:32:54,244 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:32:54,262 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:32:54,262 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:32:54,279 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-02-04 12:32:54,280 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 12:32:54,295 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-02-04 12:32:54,295 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 12:32:54,309 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:32:54,309 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:49, output treesize:37 [2018-02-04 12:32:56,312 WARN L1033 $PredicateComparison]: unable to prove that (or (exists ((calloc_model_~size Int) (|calloc_model_#t~malloc0.base| Int) (calloc_model_~nmemb Int)) (and (= (+ (select |c_#length| |calloc_model_#t~malloc0.base|) 4294967296) (mod (* calloc_model_~size calloc_model_~nmemb) 4294967296)) (< 2147483647 (mod (* calloc_model_~nmemb calloc_model_~size) 4294967296)))) (exists ((v_prenex_45 Int) (v_prenex_44 Int) (v_prenex_46 Int)) (let ((.cse0 (mod (* v_prenex_46 v_prenex_44) 4294967296))) (and (<= .cse0 2147483647) (= (select |c_#length| v_prenex_45) .cse0))))) is different from true [2018-02-04 12:32:56,349 WARN L1033 $PredicateComparison]: unable to prove that (let ((.cse0 (exists ((calloc_model_~size Int) (|calloc_model_#t~malloc0.base| Int) (calloc_model_~nmemb Int)) (and (= (+ (select |c_#length| |calloc_model_#t~malloc0.base|) 4294967296) (mod (* calloc_model_~size calloc_model_~nmemb) 4294967296)) (< 2147483647 (mod (* calloc_model_~nmemb calloc_model_~size) 4294967296))))) (.cse2 (exists ((v_prenex_49 Int) (v_prenex_52 Int) (v_prenex_54 Int)) (let ((.cse6 (mod (* v_prenex_54 v_prenex_49) 4294967296))) (and (= 0 (select |c_old(#valid)| v_prenex_52)) (< 2147483647 .cse6) (= (store |c_old(#length)| v_prenex_52 (+ .cse6 (- 4294967296))) |c_#length|))))) (.cse3 (exists ((v_prenex_45 Int) (v_prenex_44 Int) (v_prenex_46 Int)) (let ((.cse5 (mod (* v_prenex_46 v_prenex_44) 4294967296))) (and (<= .cse5 2147483647) (= (select |c_#length| v_prenex_45) .cse5))))) (.cse1 (exists ((v_prenex_51 Int) (v_prenex_53 Int) (v_prenex_50 Int)) (let ((.cse4 (mod (* v_prenex_53 v_prenex_51) 4294967296))) (and (= (store |c_old(#length)| v_prenex_50 .cse4) |c_#length|) (<= .cse4 2147483647) (= 0 (select |c_old(#valid)| v_prenex_50))))))) (or (and .cse0 .cse1) (and .cse0 .cse2) (and .cse2 .cse3) (and .cse3 .cse1))) is different from true [2018-02-04 12:32:58,363 WARN L1033 $PredicateComparison]: unable to prove that (or (and (exists ((calloc_model_~size Int) (|calloc_model_#t~malloc0.base| Int) (calloc_model_~nmemb Int)) (and (= (+ (select |c_#length| |calloc_model_#t~malloc0.base|) 4294967296) (mod (* calloc_model_~size calloc_model_~nmemb) 4294967296)) (< 2147483647 (mod (* calloc_model_~nmemb calloc_model_~size) 4294967296)))) (exists ((v_prenex_51 Int) (v_prenex_53 Int) (v_prenex_50 Int)) (let ((.cse0 (mod (* v_prenex_53 v_prenex_51) 4294967296))) (and (= (store |c_old(#length)| v_prenex_50 .cse0) |c_#length|) (<= .cse0 2147483647) (= 0 (select |c_old(#valid)| v_prenex_50)))))) (and (exists ((v_prenex_49 Int) (v_prenex_52 Int) (v_prenex_54 Int)) (let ((.cse1 (mod (* v_prenex_54 v_prenex_49) 4294967296))) (and (= 0 (select |c_old(#valid)| v_prenex_52)) (< 2147483647 .cse1) (= (store |c_old(#length)| v_prenex_52 (+ .cse1 (- 4294967296))) |c_#length|)))) (exists ((v_prenex_56 Int) (v_prenex_55 Int) (v_prenex_57 Int)) (and (< 2147483647 (mod (* v_prenex_57 v_prenex_55) 4294967296)) (= (+ (select |c_#length| v_prenex_56) 4294967296) (mod (* v_prenex_55 v_prenex_57) 4294967296))))) (and (exists ((v_prenex_59 Int) (v_prenex_58 Int) (v_prenex_60 Int)) (and (= |c_#length| (store |c_old(#length)| v_prenex_59 (+ (mod (* v_prenex_58 v_prenex_60) 4294967296) (- 4294967296)))) (< 2147483647 (mod (* v_prenex_60 v_prenex_58) 4294967296)) (= 0 (select |c_old(#valid)| v_prenex_59)))) (exists ((v_prenex_45 Int) (v_prenex_44 Int) (v_prenex_46 Int)) (let ((.cse2 (mod (* v_prenex_46 v_prenex_44) 4294967296))) (and (<= .cse2 2147483647) (= (select |c_#length| v_prenex_45) .cse2))))) (and (exists ((v_prenex_63 Int) (v_prenex_62 Int) (v_prenex_61 Int)) (let ((.cse3 (mod (* v_prenex_63 v_prenex_62) 4294967296))) (and (= (select |c_#length| v_prenex_61) .cse3) (<= .cse3 2147483647)))) (exists ((v_prenex_66 Int) (v_prenex_65 Int) (v_prenex_64 Int)) (let ((.cse4 (mod (* v_prenex_65 v_prenex_64) 4294967296))) (and (= 0 (select |c_old(#valid)| v_prenex_66)) (= (store |c_old(#length)| v_prenex_66 .cse4) |c_#length|) (<= .cse4 2147483647)))))) is different from true [2018-02-04 12:32:58,412 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:32:58,416 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 72 treesize of output 75 [2018-02-04 12:32:58,416 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:33:09,582 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:33:09,583 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:33:09,584 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 63 treesize of output 57 [2018-02-04 12:33:09,584 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:33:19,984 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:33:19,990 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 67 treesize of output 70 [2018-02-04 12:33:19,991 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 12:33:31,075 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:33:31,085 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 69 treesize of output 72 [2018-02-04 12:33:31,085 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 12:33:45,056 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:33:45,059 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:33:45,060 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 68 treesize of output 62 [2018-02-04 12:33:45,060 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 12:33:55,108 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:33:55,111 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:33:55,112 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 58 [2018-02-04 12:33:55,112 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 12:34:05,891 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:34:05,896 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:34:05,897 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 67 treesize of output 82 [2018-02-04 12:34:05,897 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-04 12:34:14,910 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:34:14,911 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:34:14,912 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 65 treesize of output 59 [2018-02-04 12:34:14,912 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. Received shutdown request... [2018-02-04 12:34:16,703 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-02-04 12:34:16,703 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-04 12:34:16,708 WARN L185 ceAbstractionStarter]: Timeout [2018-02-04 12:34:16,708 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 12:34:16 BoogieIcfgContainer [2018-02-04 12:34:16,708 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 12:34:16,709 INFO L168 Benchmark]: Toolchain (without parser) took 225775.75 ms. Allocated memory was 400.0 MB in the beginning and 695.7 MB in the end (delta: 295.7 MB). Free memory was 356.7 MB in the beginning and 413.8 MB in the end (delta: -57.1 MB). Peak memory consumption was 238.6 MB. Max. memory is 5.3 GB. [2018-02-04 12:34:16,710 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 400.0 MB. Free memory is still 363.3 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 12:34:16,710 INFO L168 Benchmark]: CACSL2BoogieTranslator took 173.95 ms. Allocated memory is still 400.0 MB. Free memory was 356.7 MB in the beginning and 344.8 MB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 5.3 GB. [2018-02-04 12:34:16,710 INFO L168 Benchmark]: Boogie Preprocessor took 31.29 ms. Allocated memory is still 400.0 MB. Free memory was 344.8 MB in the beginning and 342.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-04 12:34:16,710 INFO L168 Benchmark]: RCFGBuilder took 486.06 ms. Allocated memory is still 400.0 MB. Free memory was 342.2 MB in the beginning and 290.3 MB in the end (delta: 51.9 MB). Peak memory consumption was 51.9 MB. Max. memory is 5.3 GB. [2018-02-04 12:34:16,711 INFO L168 Benchmark]: TraceAbstraction took 225081.40 ms. Allocated memory was 400.0 MB in the beginning and 695.7 MB in the end (delta: 295.7 MB). Free memory was 290.3 MB in the beginning and 413.8 MB in the end (delta: -123.5 MB). Peak memory consumption was 172.2 MB. Max. memory is 5.3 GB. [2018-02-04 12:34:16,712 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.17 ms. Allocated memory is still 400.0 MB. Free memory is still 363.3 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 173.95 ms. Allocated memory is still 400.0 MB. Free memory was 356.7 MB in the beginning and 344.8 MB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 31.29 ms. Allocated memory is still 400.0 MB. Free memory was 344.8 MB in the beginning and 342.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 486.06 ms. Allocated memory is still 400.0 MB. Free memory was 342.2 MB in the beginning and 290.3 MB in the end (delta: 51.9 MB). Peak memory consumption was 51.9 MB. Max. memory is 5.3 GB. * TraceAbstraction took 225081.40 ms. Allocated memory was 400.0 MB in the beginning and 695.7 MB in the end (delta: 295.7 MB). Free memory was 290.3 MB in the beginning and 413.8 MB in the end (delta: -123.5 MB). Peak memory consumption was 172.2 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 827). Cancelled while BasicCegarLoop was analyzing trace of length 181 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 217. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 828). Cancelled while BasicCegarLoop was analyzing trace of length 181 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 217. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 827). Cancelled while BasicCegarLoop was analyzing trace of length 181 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 217. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 828). Cancelled while BasicCegarLoop was analyzing trace of length 181 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 217. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 829). Cancelled while BasicCegarLoop was analyzing trace of length 181 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 217. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 829). Cancelled while BasicCegarLoop was analyzing trace of length 181 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 217. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 812). Cancelled while BasicCegarLoop was analyzing trace of length 181 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 217. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 812). Cancelled while BasicCegarLoop was analyzing trace of length 181 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 217. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 813). Cancelled while BasicCegarLoop was analyzing trace of length 181 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 217. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 812). Cancelled while BasicCegarLoop was analyzing trace of length 181 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 217. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 813). Cancelled while BasicCegarLoop was analyzing trace of length 181 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 217. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 812). Cancelled while BasicCegarLoop was analyzing trace of length 181 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 217. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 819). Cancelled while BasicCegarLoop was analyzing trace of length 181 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 217. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 819). Cancelled while BasicCegarLoop was analyzing trace of length 181 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 217. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 818). Cancelled while BasicCegarLoop was analyzing trace of length 181 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 217. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 818). Cancelled while BasicCegarLoop was analyzing trace of length 181 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 217. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 794). Cancelled while BasicCegarLoop was analyzing trace of length 181 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 217. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 795). Cancelled while BasicCegarLoop was analyzing trace of length 181 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 217. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 794). Cancelled while BasicCegarLoop was analyzing trace of length 181 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 217. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 794). Cancelled while BasicCegarLoop was analyzing trace of length 181 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 217. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 795). Cancelled while BasicCegarLoop was analyzing trace of length 181 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 217. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 794). Cancelled while BasicCegarLoop was analyzing trace of length 181 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 217. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 870). Cancelled while BasicCegarLoop was analyzing trace of length 181 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 217. - TimeoutResultAtElement [Line: 864]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 864). Cancelled while BasicCegarLoop was analyzing trace of length 181 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 217. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 870). Cancelled while BasicCegarLoop was analyzing trace of length 181 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 217. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 786). Cancelled while BasicCegarLoop was analyzing trace of length 181 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 217. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 785). Cancelled while BasicCegarLoop was analyzing trace of length 181 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 217. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 786). Cancelled while BasicCegarLoop was analyzing trace of length 181 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 217. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 785). Cancelled while BasicCegarLoop was analyzing trace of length 181 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 217. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 785). Cancelled while BasicCegarLoop was analyzing trace of length 181 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 217. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 785). Cancelled while BasicCegarLoop was analyzing trace of length 181 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 217. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 804). Cancelled while BasicCegarLoop was analyzing trace of length 181 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 217. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 803). Cancelled while BasicCegarLoop was analyzing trace of length 181 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 217. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 803). Cancelled while BasicCegarLoop was analyzing trace of length 181 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 217. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 803). Cancelled while BasicCegarLoop was analyzing trace of length 181 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 217. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 803). Cancelled while BasicCegarLoop was analyzing trace of length 181 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 217. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 804). Cancelled while BasicCegarLoop was analyzing trace of length 181 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 217. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 859). Cancelled while BasicCegarLoop was analyzing trace of length 181 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 217. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 858). Cancelled while BasicCegarLoop was analyzing trace of length 181 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 217. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 857). Cancelled while BasicCegarLoop was analyzing trace of length 181 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 217. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 857). Cancelled while BasicCegarLoop was analyzing trace of length 181 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 217. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 859). Cancelled while BasicCegarLoop was analyzing trace of length 181 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 217. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 858). Cancelled while BasicCegarLoop was analyzing trace of length 181 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 217. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 742). Cancelled while BasicCegarLoop was analyzing trace of length 181 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 217. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 742). Cancelled while BasicCegarLoop was analyzing trace of length 181 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 217. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 776). Cancelled while BasicCegarLoop was analyzing trace of length 181 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 217. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 776). Cancelled while BasicCegarLoop was analyzing trace of length 181 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 217. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 776). Cancelled while BasicCegarLoop was analyzing trace of length 181 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 217. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 777). Cancelled while BasicCegarLoop was analyzing trace of length 181 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 217. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 776). Cancelled while BasicCegarLoop was analyzing trace of length 181 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 217. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 775). Cancelled while BasicCegarLoop was analyzing trace of length 181 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 217. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 775). Cancelled while BasicCegarLoop was analyzing trace of length 181 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 217. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 777). Cancelled while BasicCegarLoop was analyzing trace of length 181 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 217. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 866). Cancelled while BasicCegarLoop was analyzing trace of length 181 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 217. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 866). Cancelled while BasicCegarLoop was analyzing trace of length 181 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 217. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 848). Cancelled while BasicCegarLoop was analyzing trace of length 181 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 217. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 849). Cancelled while BasicCegarLoop was analyzing trace of length 181 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 217. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 847). Cancelled while BasicCegarLoop was analyzing trace of length 181 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 217. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 847). Cancelled while BasicCegarLoop was analyzing trace of length 181 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 217. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 849). Cancelled while BasicCegarLoop was analyzing trace of length 181 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 217. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 848). Cancelled while BasicCegarLoop was analyzing trace of length 181 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 217. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 837). Cancelled while BasicCegarLoop was analyzing trace of length 181 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 217. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 837). Cancelled while BasicCegarLoop was analyzing trace of length 181 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 217. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 838). Cancelled while BasicCegarLoop was analyzing trace of length 181 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 217. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 839). Cancelled while BasicCegarLoop was analyzing trace of length 181 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 217. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 839). Cancelled while BasicCegarLoop was analyzing trace of length 181 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 217. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 838). Cancelled while BasicCegarLoop was analyzing trace of length 181 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 217. - StatisticsResult: Ultimate Automizer benchmark data CFG has 16 procedures, 224 locations, 67 error locations. TIMEOUT Result, 225.0s OverallTime, 13 OverallIterations, 36 TraceHistogramMax, 89.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2546 SDtfs, 557 SDslu, 14417 SDs, 0 SdLazy, 4667 SolverSat, 141 SolverUnsat, 92 SolverUnknown, 0 SolverNotchecked, 10.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1335 GetRequests, 1194 SyntacticMatches, 4 SemanticMatches, 137 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 110.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=224occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 12 MinimizatonAttempts, 108 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 15.3s SatisfiabilityAnalysisTime, 33.5s InterpolantComputationTime, 1304 NumberOfCodeBlocks, 1022 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 1292 ConstructedInterpolants, 52 QuantifiedInterpolants, 759547 SizeOfPredicates, 63 NumberOfNonLiveVariables, 5050 ConjunctsInSsa, 308 ConjunctsInUnsatCore, 12 InterpolantComputations, 5 PerfectInterpolantSequences, 4266/4491 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0234_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_12-34-16-719.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0234_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_12-34-16-719.csv Completed graceful shutdown