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_z3.epf -i ../../../trunk/examples/svcomp/memsafety/test-0235_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c17473d-m [2018-02-04 20:29:28,182 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 20:29:28,184 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 20:29:28,196 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 20:29:28,197 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 20:29:28,198 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 20:29:28,198 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 20:29:28,199 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 20:29:28,201 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 20:29:28,202 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 20:29:28,202 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 20:29:28,203 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 20:29:28,204 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 20:29:28,205 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 20:29:28,205 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 20:29:28,207 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 20:29:28,209 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 20:29:28,210 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 20:29:28,211 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 20:29:28,212 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 20:29:28,214 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 20:29:28,214 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 20:29:28,214 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 20:29:28,215 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 20:29:28,216 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 20:29:28,217 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 20:29:28,217 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 20:29:28,217 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 20:29:28,217 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 20:29:28,218 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 20:29:28,218 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 20:29:28,218 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_z3.epf [2018-02-04 20:29:28,228 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 20:29:28,229 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 20:29:28,230 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 20:29:28,230 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 20:29:28,230 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 20:29:28,230 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 20:29:28,230 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 20:29:28,231 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 20:29:28,231 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 20:29:28,231 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 20:29:28,231 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 20:29:28,231 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 20:29:28,231 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 20:29:28,231 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 20:29:28,232 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 20:29:28,232 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 20:29:28,232 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 20:29:28,232 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 20:29:28,232 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 20:29:28,232 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 20:29:28,232 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 20:29:28,233 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-02-04 20:29:28,233 INFO L133 SettingsManager]: * SMT solver=External_Z3InterpolationMode [2018-02-04 20:29:28,233 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:29:28,261 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 20:29:28,269 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 20:29:28,271 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 20:29:28,272 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 20:29:28,273 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 20:29:28,273 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/test-0235_false-valid-memtrack.i [2018-02-04 20:29:28,429 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 20:29:28,430 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 20:29:28,431 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 20:29:28,431 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 20:29:28,438 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 20:29:28,439 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 08:29:28" (1/1) ... [2018-02-04 20:29:28,442 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75ec44b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 08:29:28, skipping insertion in model container [2018-02-04 20:29:28,442 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 08:29:28" (1/1) ... [2018-02-04 20:29:28,459 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 20:29:28,506 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 20:29:28,598 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 20:29:28,618 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 20:29:28,630 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 08:29:28 WrapperNode [2018-02-04 20:29:28,630 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 20:29:28,631 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 20:29:28,631 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 20:29:28,631 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 20:29:28,639 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 08:29:28" (1/1) ... [2018-02-04 20:29:28,640 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 08:29:28" (1/1) ... [2018-02-04 20:29:28,647 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 08:29:28" (1/1) ... [2018-02-04 20:29:28,648 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 08:29:28" (1/1) ... [2018-02-04 20:29:28,652 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 08:29:28" (1/1) ... [2018-02-04 20:29:28,655 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 08:29:28" (1/1) ... [2018-02-04 20:29:28,657 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 08:29:28" (1/1) ... [2018-02-04 20:29:28,660 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 20:29:28,660 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 20:29:28,661 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 20:29:28,661 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 20:29:28,662 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 08:29:28" (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 20:29:28,702 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 20:29:28,702 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 20:29:28,702 INFO L136 BoogieDeclarations]: Found implementation of procedure calloc_model [2018-02-04 20:29:28,702 INFO L136 BoogieDeclarations]: Found implementation of procedure zalloc_or_die [2018-02-04 20:29:28,702 INFO L136 BoogieDeclarations]: Found implementation of procedure l4_insert [2018-02-04 20:29:28,703 INFO L136 BoogieDeclarations]: Found implementation of procedure l3_insert [2018-02-04 20:29:28,703 INFO L136 BoogieDeclarations]: Found implementation of procedure l2_insert [2018-02-04 20:29:28,703 INFO L136 BoogieDeclarations]: Found implementation of procedure l1_insert [2018-02-04 20:29:28,703 INFO L136 BoogieDeclarations]: Found implementation of procedure l0_insert [2018-02-04 20:29:28,703 INFO L136 BoogieDeclarations]: Found implementation of procedure l4_destroy [2018-02-04 20:29:28,703 INFO L136 BoogieDeclarations]: Found implementation of procedure l3_destroy [2018-02-04 20:29:28,703 INFO L136 BoogieDeclarations]: Found implementation of procedure l2_destroy [2018-02-04 20:29:28,704 INFO L136 BoogieDeclarations]: Found implementation of procedure l1_destroy [2018-02-04 20:29:28,704 INFO L136 BoogieDeclarations]: Found implementation of procedure l0_destroy [2018-02-04 20:29:28,704 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 20:29:28,704 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-04 20:29:28,704 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-04 20:29:28,704 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 20:29:28,704 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 20:29:28,704 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 20:29:28,704 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2018-02-04 20:29:28,705 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2018-02-04 20:29:28,705 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-04 20:29:28,705 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-04 20:29:28,705 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-02-04 20:29:28,705 INFO L128 BoogieDeclarations]: Found specification of procedure memset [2018-02-04 20:29:28,705 INFO L128 BoogieDeclarations]: Found specification of procedure calloc_model [2018-02-04 20:29:28,705 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 20:29:28,705 INFO L128 BoogieDeclarations]: Found specification of procedure zalloc_or_die [2018-02-04 20:29:28,705 INFO L128 BoogieDeclarations]: Found specification of procedure l4_insert [2018-02-04 20:29:28,706 INFO L128 BoogieDeclarations]: Found specification of procedure l3_insert [2018-02-04 20:29:28,706 INFO L128 BoogieDeclarations]: Found specification of procedure l2_insert [2018-02-04 20:29:28,706 INFO L128 BoogieDeclarations]: Found specification of procedure l1_insert [2018-02-04 20:29:28,706 INFO L128 BoogieDeclarations]: Found specification of procedure l0_insert [2018-02-04 20:29:28,706 INFO L128 BoogieDeclarations]: Found specification of procedure l4_destroy [2018-02-04 20:29:28,706 INFO L128 BoogieDeclarations]: Found specification of procedure l3_destroy [2018-02-04 20:29:28,706 INFO L128 BoogieDeclarations]: Found specification of procedure l2_destroy [2018-02-04 20:29:28,707 INFO L128 BoogieDeclarations]: Found specification of procedure l1_destroy [2018-02-04 20:29:28,707 INFO L128 BoogieDeclarations]: Found specification of procedure l0_destroy [2018-02-04 20:29:28,707 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 20:29:28,707 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 20:29:28,707 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 20:29:29,034 WARN L455 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-02-04 20:29:29,209 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 20:29:29,210 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 08:29:29 BoogieIcfgContainer [2018-02-04 20:29:29,210 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 20:29:29,210 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 20:29:29,210 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 20:29:29,212 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 20:29:29,212 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 08:29:28" (1/3) ... [2018-02-04 20:29:29,213 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71552ecd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 08:29:29, skipping insertion in model container [2018-02-04 20:29:29,213 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 08:29:28" (2/3) ... [2018-02-04 20:29:29,213 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71552ecd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 08:29:29, skipping insertion in model container [2018-02-04 20:29:29,213 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 08:29:29" (3/3) ... [2018-02-04 20:29:29,214 INFO L107 eAbstractionObserver]: Analyzing ICFG test-0235_false-valid-memtrack.i [2018-02-04 20:29:29,220 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-04 20:29:29,226 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 81 error locations. [2018-02-04 20:29:29,248 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 20:29:29,248 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 20:29:29,248 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-02-04 20:29:29,248 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-04 20:29:29,248 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 20:29:29,249 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 20:29:29,249 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 20:29:29,249 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 20:29:29,249 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 20:29:29,262 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states. [2018-02-04 20:29:29,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-02-04 20:29:29,268 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:29:29,268 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-02-04 20:29:29,269 INFO L371 AbstractCegarLoop]: === Iteration 1 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation, 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 20:29:29,272 INFO L82 PathProgramCache]: Analyzing trace with hash 14892544, now seen corresponding path program 1 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:29:29,282 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:29:29,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:29,313 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 20:29:29,332 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 20:29:29,332 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 20:29:29,333 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:29:29,333 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 20:29:29,334 INFO L182 omatonBuilderFactory]: Interpolants [268#true, 269#false, 270#(= 1 (select |#valid| |~#list~0.base|))] [2018-02-04 20:29:29,334 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 20:29:29,335 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 20:29:29,343 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 20:29:29,343 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 20:29:29,344 INFO L87 Difference]: Start difference. First operand 265 states. Second operand 3 states. [2018-02-04 20:29:29,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:29:29,616 INFO L93 Difference]: Finished difference Result 378 states and 430 transitions. [2018-02-04 20:29:29,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 20:29:29,618 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-02-04 20:29:29,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:29:29,632 INFO L225 Difference]: With dead ends: 378 [2018-02-04 20:29:29,632 INFO L226 Difference]: Without dead ends: 375 [2018-02-04 20:29:29,634 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 20:29:29,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2018-02-04 20:29:29,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 331. [2018-02-04 20:29:29,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states. [2018-02-04 20:29:29,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 406 transitions. [2018-02-04 20:29:29,765 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 406 transitions. Word has length 4 [2018-02-04 20:29:29,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:29:29,766 INFO L432 AbstractCegarLoop]: Abstraction has 331 states and 406 transitions. [2018-02-04 20:29:29,766 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 20:29:29,766 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 406 transitions. [2018-02-04 20:29:29,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-02-04 20:29:29,766 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:29:29,767 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-02-04 20:29:29,767 INFO L371 AbstractCegarLoop]: === Iteration 2 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation, 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 20:29:29,767 INFO L82 PathProgramCache]: Analyzing trace with hash 14892545, now seen corresponding path program 1 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:29:29,771 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:29:29,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:29,779 WARN L195 Executor]: ExternalInterpolator (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in) stderr output: WARNING: array quantifier [2018-02-04 20:29:29,783 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 20:29:29,783 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 20:29:29,784 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 20:29:29,784 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 20:29:29,830 WARN L1033 $PredicateComparison]: unable to prove that (exists ((%0 (Array Int Int))) (! (forall ((%1 Int)) (! (= (store %0 %1 4) (store |c_#length| %1 4)) :qid itp)) :qid itp)) is different from true [2018-02-04 20:29:29,927 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 20:29:29,957 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 20:29:29,957 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 20:29:29,957 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:29:29,958 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 20:29:29,958 INFO L182 omatonBuilderFactory]: Interpolants [980#true, 981#false, 982#(exists ((%0 (Array Int Int))) (! (forall ((%1 Int)) (! (= (store %0 %1 4) (store |#length| %1 4)) :qid itp)) :qid itp)), 983#(and (<= (+ |~#list~0.offset| 4) (select |#length| |~#list~0.base|)) (= 4 (select |#length| |~#list~0.base|)) (<= 0 |~#list~0.offset|))] [2018-02-04 20:29:29,958 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 20:29:29,960 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 20:29:29,960 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 20:29:29,960 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2018-02-04 20:29:29,960 INFO L87 Difference]: Start difference. First operand 331 states and 406 transitions. Second operand 4 states. [2018-02-04 20:29:30,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:29:30,069 INFO L93 Difference]: Finished difference Result 338 states and 416 transitions. [2018-02-04 20:29:30,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 20:29:30,069 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2018-02-04 20:29:30,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:29:30,070 INFO L225 Difference]: With dead ends: 338 [2018-02-04 20:29:30,070 INFO L226 Difference]: Without dead ends: 338 [2018-02-04 20:29:30,071 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2018-02-04 20:29:30,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2018-02-04 20:29:30,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 330. [2018-02-04 20:29:30,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2018-02-04 20:29:30,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 405 transitions. [2018-02-04 20:29:30,086 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 405 transitions. Word has length 4 [2018-02-04 20:29:30,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:29:30,086 INFO L432 AbstractCegarLoop]: Abstraction has 330 states and 405 transitions. [2018-02-04 20:29:30,086 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 20:29:30,086 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 405 transitions. [2018-02-04 20:29:30,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 20:29:30,087 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:29:30,087 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 20:29:30,087 INFO L371 AbstractCegarLoop]: === Iteration 3 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation, 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 20:29:30,087 INFO L82 PathProgramCache]: Analyzing trace with hash -948681041, now seen corresponding path program 1 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:29:30,090 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:29:30,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:30,107 WARN L195 Executor]: ExternalInterpolator (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in) stderr output: WARNING: array quantifier [2018-02-04 20:29:30,109 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 20:29:30,110 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 20:29:30,110 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 20:29:30,110 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 20:29:30,126 WARN L1033 $PredicateComparison]: unable to prove that (exists ((%0 (Array Int Int))) (! (forall ((%1 Int)) (! (= (store |c_#valid| %1 1) (store %0 %1 1)) :qid itp)) :qid itp)) is different from true [2018-02-04 20:29:30,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:30,162 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 20:29:30,192 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 20:29:30,192 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 20:29:30,193 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:29:30,193 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 20:29:30,193 INFO L182 omatonBuilderFactory]: Interpolants [1652#true, 1653#false, 1659#(exists ((%0 (Array Int Int))) (! (forall ((%1 Int)) (! (= (store |#valid| %1 1) (store %0 %1 1)) :qid itp)) :qid itp)), 1660#(= 1 (select |#valid| |calloc_model_#t~malloc0.base|)), 1661#(= 1 (select |#valid| calloc_model_~ptr~0.base)), 1662#(and (= |~#list~0.base| |old(~#list~0.base)|) (= |#valid| |old(#valid)|) (= |~#list~0.offset| |old(~#list~0.offset)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))] [2018-02-04 20:29:30,194 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 20:29:30,194 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 20:29:30,194 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 20:29:30,194 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=14, Unknown=1, NotChecked=6, Total=30 [2018-02-04 20:29:30,194 INFO L87 Difference]: Start difference. First operand 330 states and 405 transitions. Second operand 6 states. [2018-02-04 20:29:30,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:29:30,980 INFO L93 Difference]: Finished difference Result 418 states and 509 transitions. [2018-02-04 20:29:30,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 20:29:30,982 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-02-04 20:29:30,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:29:30,984 INFO L225 Difference]: With dead ends: 418 [2018-02-04 20:29:30,984 INFO L226 Difference]: Without dead ends: 418 [2018-02-04 20:29:30,985 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=4, NotChecked=10, Total=56 [2018-02-04 20:29:30,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2018-02-04 20:29:31,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 374. [2018-02-04 20:29:31,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2018-02-04 20:29:31,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 481 transitions. [2018-02-04 20:29:31,012 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 481 transitions. Word has length 17 [2018-02-04 20:29:31,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:29:31,012 INFO L432 AbstractCegarLoop]: Abstraction has 374 states and 481 transitions. [2018-02-04 20:29:31,012 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 20:29:31,013 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 481 transitions. [2018-02-04 20:29:31,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 20:29:31,013 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:29:31,013 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 20:29:31,013 INFO L371 AbstractCegarLoop]: === Iteration 4 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation, 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 20:29:31,014 INFO L82 PathProgramCache]: Analyzing trace with hash -948681040, now seen corresponding path program 1 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) [2018-02-04 20:29:31,024 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:29:31,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:31,043 WARN L195 Executor]: ExternalInterpolator (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in) stderr output: WARNING: array quantifier WARNING: array quantifier [2018-02-04 20:29:31,070 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 20:29:31,071 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 20:29:31,071 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 20:29:31,071 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 20:29:31,082 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 20:29:31,082 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 20:29:31,083 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 20:29:31,083 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 20:29:31,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:31,187 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 20:29:31,204 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 20:29:31,204 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 20:29:31,204 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:29:31,205 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 20:29:31,205 INFO L182 omatonBuilderFactory]: Interpolants [2466#(= |zalloc_or_die_#in~size| 8), 2467#(= 8 zalloc_or_die_~size), 2468#(exists ((%0 (Array Int Int))) (! (and (= |calloc_model_#in~size| 8) (= |calloc_model_#in~nmemb| 1) (forall ((%1 Int)) (! (= (store %0 %1 8) (store |#length| %1 8)) :qid itp))) :qid itp)), 2469#(exists ((%0 (Array Int Int))) (! (and (= (ite (<= (mod (* (mod calloc_model_~nmemb 4294967296) (mod calloc_model_~size 4294967296)) 4294967296) 2147483647) (mod (* (mod calloc_model_~nmemb 4294967296) (mod calloc_model_~size 4294967296)) 4294967296) (+ (- 4294967296) (mod (* (mod calloc_model_~nmemb 4294967296) (mod calloc_model_~size 4294967296)) 4294967296))) 8) (forall ((%1 Int)) (! (= (store %0 %1 8) (store |#length| %1 8)) :qid itp))) :qid itp)), 2470#(and (= 8 (mod (* (mod calloc_model_~nmemb 4294967296) (mod calloc_model_~size 4294967296)) 4294967296)) (= 8 (select |#length| |calloc_model_#t~malloc0.base|)) (= 0 |calloc_model_#t~malloc0.offset|)), 2471#(and (<= 0 calloc_model_~ptr~0.offset) (or (and (< 2147483647 (mod (* (mod calloc_model_~nmemb 4294967296) (mod calloc_model_~size 4294967296)) 4294967296)) (<= (+ (mod (* (mod calloc_model_~nmemb 4294967296) (mod calloc_model_~size 4294967296)) 4294967296) calloc_model_~ptr~0.offset) (+ (select |#length| calloc_model_~ptr~0.base) 4294967296))) (<= (+ (mod (* (mod calloc_model_~nmemb 4294967296) (mod calloc_model_~size 4294967296)) 4294967296) calloc_model_~ptr~0.offset) (select |#length| calloc_model_~ptr~0.base)))), 2472#(and (= |~#list~0.base| |old(~#list~0.base)|) (= |#valid| |old(#valid)|) (= |~#list~0.offset| |old(~#list~0.offset)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 2459#true, 2460#false] [2018-02-04 20:29:31,205 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 20:29:31,205 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 20:29:31,205 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 20:29:31,206 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=55, Unknown=2, NotChecked=0, Total=72 [2018-02-04 20:29:31,206 INFO L87 Difference]: Start difference. First operand 374 states and 481 transitions. Second operand 9 states. [2018-02-04 20:29:32,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:29:32,294 INFO L93 Difference]: Finished difference Result 431 states and 523 transitions. [2018-02-04 20:29:32,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 20:29:32,294 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 17 [2018-02-04 20:29:32,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:29:32,296 INFO L225 Difference]: With dead ends: 431 [2018-02-04 20:29:32,296 INFO L226 Difference]: Without dead ends: 431 [2018-02-04 20:29:32,297 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=139, Unknown=5, NotChecked=0, Total=182 [2018-02-04 20:29:32,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2018-02-04 20:29:32,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 387. [2018-02-04 20:29:32,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2018-02-04 20:29:32,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 494 transitions. [2018-02-04 20:29:32,309 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 494 transitions. Word has length 17 [2018-02-04 20:29:32,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:29:32,309 INFO L432 AbstractCegarLoop]: Abstraction has 387 states and 494 transitions. [2018-02-04 20:29:32,309 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 20:29:32,309 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 494 transitions. [2018-02-04 20:29:32,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-02-04 20:29:32,312 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:29:32,312 INFO L351 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:29:32,315 INFO L371 AbstractCegarLoop]: === Iteration 5 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation, 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 20:29:32,315 INFO L82 PathProgramCache]: Analyzing trace with hash -1521498551, now seen corresponding path program 1 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:29:32,320 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:29:32,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:32,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:32,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:32,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:32,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:32,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:32,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:32,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:32,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:32,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:32,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:32,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:32,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:32,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:32,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:32,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:32,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:32,629 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2018-02-04 20:29:32,661 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 20:29:32,661 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-04 20:29:32,661 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:29:32,663 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2018-02-04 20:29:32,663 INFO L182 omatonBuilderFactory]: Interpolants [3489#(or (not (= |calloc_model_#in~nmemb| 1)) (not (= (mod |calloc_model_#in~size| 4294967296) 8))), 3490#(= 0 |#Ultimate.C_memset_#t~loopctr47|), 3491#(<= |#Ultimate.C_memset_#amount| 0), 3301#true, 3302#false, 3398#(and (= |~#list~0.base| |old(~#list~0.base)|) (= |#valid| |old(#valid)|) (= |~#list~0.offset| |old(~#list~0.offset)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 3399#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 3417#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 3482#(not (= 8 |zalloc_or_die_#in~size|)), 3483#(and (= (mod (* (mod |calloc_model_#in~size| 4294967296) (mod calloc_model_~nmemb 4294967296)) 4294967296) (mod (* (mod calloc_model_~nmemb 4294967296) (mod calloc_model_~size 4294967296)) 4294967296)) (or (and (not (= calloc_model_~nmemb 1)) (not (= |calloc_model_#in~nmemb| 1))) (and (= |calloc_model_#in~nmemb| 1) (= calloc_model_~nmemb 1)))), 3469#(= zalloc_or_die_~size |zalloc_or_die_#in~size|)] [2018-02-04 20:29:32,664 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2018-02-04 20:29:32,664 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 20:29:32,664 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 20:29:32,664 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-02-04 20:29:32,664 INFO L87 Difference]: Start difference. First operand 387 states and 494 transitions. Second operand 11 states. [2018-02-04 20:29:33,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:29:33,720 INFO L93 Difference]: Finished difference Result 445 states and 536 transitions. [2018-02-04 20:29:33,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 20:29:33,721 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 129 [2018-02-04 20:29:33,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:29:33,723 INFO L225 Difference]: With dead ends: 445 [2018-02-04 20:29:33,723 INFO L226 Difference]: Without dead ends: 438 [2018-02-04 20:29:33,723 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=334, Unknown=0, NotChecked=0, Total=420 [2018-02-04 20:29:33,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2018-02-04 20:29:33,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 390. [2018-02-04 20:29:33,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2018-02-04 20:29:33,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 498 transitions. [2018-02-04 20:29:33,733 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 498 transitions. Word has length 129 [2018-02-04 20:29:33,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:29:33,733 INFO L432 AbstractCegarLoop]: Abstraction has 390 states and 498 transitions. [2018-02-04 20:29:33,733 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 20:29:33,734 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 498 transitions. [2018-02-04 20:29:33,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-02-04 20:29:33,735 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:29:33,735 INFO L351 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:29:33,735 INFO L371 AbstractCegarLoop]: === Iteration 6 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation, 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 20:29:33,736 INFO L82 PathProgramCache]: Analyzing trace with hash -331650024, now seen corresponding path program 1 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:29:33,738 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:29:33,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:33,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:33,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:33,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:33,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:33,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:33,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:34,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:34,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:34,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:34,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:34,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:34,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:34,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:34,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:34,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:34,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:34,055 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 30 proven. 69 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2018-02-04 20:29:34,073 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:29:34,073 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-04 20:29:34,073 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:29:34,074 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2018-02-04 20:29:34,074 INFO L182 omatonBuilderFactory]: Interpolants [4450#(and (= |~#list~0.base| |old(~#list~0.base)|) (= |#valid| |old(#valid)|) (= |~#list~0.offset| |old(~#list~0.offset)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 4466#(not (= 8 |zalloc_or_die_#in~size|)), 4451#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 4467#(= (mod (* (mod |calloc_model_#in~nmemb| 4294967296) (mod |calloc_model_#in~size| 4294967296)) 4294967296) (mod (* (mod calloc_model_~nmemb 4294967296) (mod calloc_model_~size 4294967296)) 4294967296)), 4452#(or (and (not (= zalloc_or_die_~size 8)) (not (= |zalloc_or_die_#in~size| 8))) (and (= zalloc_or_die_~size 8) (= |zalloc_or_die_#in~size| 8))), 4474#(not (= (mod (* (mod |calloc_model_#in~nmemb| 4294967296) (mod |calloc_model_#in~size| 4294967296)) 4294967296) 8)), 4475#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 4348#true, 4476#(= 0 |#Ultimate.C_memset_#t~loopctr47|), 4349#false, 4477#(or (and (<= |#Ultimate.C_memset_#amount| |#Ultimate.C_memset_#t~loopctr47|) (<= |#Ultimate.C_memset_#amount| 1)) (and (< |#Ultimate.C_memset_#t~loopctr47| |#Ultimate.C_memset_#amount|) (< 1 |#Ultimate.C_memset_#amount|))), 4478#(<= |#Ultimate.C_memset_#amount| 1)] [2018-02-04 20:29:34,074 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 30 proven. 69 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2018-02-04 20:29:34,075 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 20:29:34,075 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 20:29:34,075 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-02-04 20:29:34,075 INFO L87 Difference]: Start difference. First operand 390 states and 498 transitions. Second operand 12 states. [2018-02-04 20:29:35,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:29:35,210 INFO L93 Difference]: Finished difference Result 451 states and 543 transitions. [2018-02-04 20:29:35,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 20:29:35,211 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 134 [2018-02-04 20:29:35,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:29:35,212 INFO L225 Difference]: With dead ends: 451 [2018-02-04 20:29:35,212 INFO L226 Difference]: Without dead ends: 444 [2018-02-04 20:29:35,213 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=453, Unknown=0, NotChecked=0, Total=552 [2018-02-04 20:29:35,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2018-02-04 20:29:35,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 391. [2018-02-04 20:29:35,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2018-02-04 20:29:35,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 500 transitions. [2018-02-04 20:29:35,220 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 500 transitions. Word has length 134 [2018-02-04 20:29:35,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:29:35,220 INFO L432 AbstractCegarLoop]: Abstraction has 391 states and 500 transitions. [2018-02-04 20:29:35,220 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 20:29:35,220 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 500 transitions. [2018-02-04 20:29:35,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-02-04 20:29:35,222 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:29:35,222 INFO L351 BasicCegarLoop]: trace histogram [10, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:29:35,222 INFO L371 AbstractCegarLoop]: === Iteration 7 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation, 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 20:29:35,222 INFO L82 PathProgramCache]: Analyzing trace with hash 1925558569, now seen corresponding path program 2 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:29:35,226 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:29:35,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:35,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:35,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:35,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:35,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:35,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:35,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:35,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:35,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:35,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:35,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:35,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:35,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:35,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:35,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:35,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:35,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:35,515 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 30 proven. 91 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2018-02-04 20:29:35,532 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:29:35,532 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-04 20:29:35,532 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:29:35,533 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-02-04 20:29:35,533 INFO L182 omatonBuilderFactory]: Interpolants [5546#(not (= 8 |zalloc_or_die_#in~size|)), 5547#(= (mod (* (mod |calloc_model_#in~nmemb| 4294967296) (mod |calloc_model_#in~size| 4294967296)) 4294967296) (mod (* (mod calloc_model_~nmemb 4294967296) (mod calloc_model_~size 4294967296)) 4294967296)), 5422#true, 5423#false, 5555#(not (= (mod (* (mod |calloc_model_#in~nmemb| 4294967296) (mod |calloc_model_#in~size| 4294967296)) 4294967296) 8)), 5556#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 5557#(= 0 |#Ultimate.C_memset_#t~loopctr47|), 5558#(= 1 |#Ultimate.C_memset_#t~loopctr47|), 5559#(= |#Ultimate.C_memset_#t~loopctr47| 2), 5560#(not (= 8 |#Ultimate.C_memset_#amount|)), 5529#(and (= |~#list~0.base| |old(~#list~0.base)|) (= |#valid| |old(#valid)|) (= |~#list~0.offset| |old(~#list~0.offset)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 5530#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 5531#(or (and (not (= zalloc_or_die_~size 8)) (not (= |zalloc_or_die_#in~size| 8))) (and (= zalloc_or_die_~size 8) (= |zalloc_or_die_#in~size| 8)))] [2018-02-04 20:29:35,533 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 30 proven. 91 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2018-02-04 20:29:35,533 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 20:29:35,533 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 20:29:35,534 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2018-02-04 20:29:35,534 INFO L87 Difference]: Start difference. First operand 391 states and 500 transitions. Second operand 13 states. [2018-02-04 20:29:36,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:29:36,546 INFO L93 Difference]: Finished difference Result 454 states and 547 transitions. [2018-02-04 20:29:36,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-04 20:29:36,546 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 139 [2018-02-04 20:29:36,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:29:36,548 INFO L225 Difference]: With dead ends: 454 [2018-02-04 20:29:36,548 INFO L226 Difference]: Without dead ends: 447 [2018-02-04 20:29:36,549 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=103, Invalid=547, Unknown=0, NotChecked=0, Total=650 [2018-02-04 20:29:36,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2018-02-04 20:29:36,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 392. [2018-02-04 20:29:36,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2018-02-04 20:29:36,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 502 transitions. [2018-02-04 20:29:36,559 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 502 transitions. Word has length 139 [2018-02-04 20:29:36,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:29:36,559 INFO L432 AbstractCegarLoop]: Abstraction has 392 states and 502 transitions. [2018-02-04 20:29:36,559 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 20:29:36,559 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 502 transitions. [2018-02-04 20:29:36,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-02-04 20:29:36,561 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:29:36,561 INFO L351 BasicCegarLoop]: trace histogram [15, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:29:36,561 INFO L371 AbstractCegarLoop]: === Iteration 8 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation, 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 20:29:36,561 INFO L82 PathProgramCache]: Analyzing trace with hash -1509183176, now seen corresponding path program 3 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:29:36,565 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:29:36,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:36,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:36,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:36,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:36,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:36,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:36,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:36,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:36,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:36,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:36,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:36,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:36,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:36,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:36,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:36,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:36,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:36,813 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 30 proven. 122 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2018-02-04 20:29:36,830 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:29:36,830 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-04 20:29:36,830 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:29:36,831 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 68 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2018-02-04 20:29:36,831 INFO L182 omatonBuilderFactory]: Interpolants [6658#(not (= (mod (* (mod |calloc_model_#in~nmemb| 4294967296) (mod |calloc_model_#in~size| 4294967296)) 4294967296) 8)), 6659#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 6660#(= 0 |#Ultimate.C_memset_#t~loopctr47|), 6661#(= 1 |#Ultimate.C_memset_#t~loopctr47|), 6630#(and (= |~#list~0.base| |old(~#list~0.base)|) (= |#valid| |old(#valid)|) (= |~#list~0.offset| |old(~#list~0.offset)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 6662#(<= |#Ultimate.C_memset_#t~loopctr47| 2), 6631#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 6663#(<= |#Ultimate.C_memset_#t~loopctr47| 3), 6632#(or (and (not (= zalloc_or_die_~size 8)) (not (= |zalloc_or_die_#in~size| 8))) (and (= zalloc_or_die_~size 8) (= |zalloc_or_die_#in~size| 8))), 6664#(not (= |#Ultimate.C_memset_#amount| 8)), 6518#true, 6519#false, 6648#(not (= 8 |zalloc_or_die_#in~size|)), 6649#(= (mod (* (mod |calloc_model_#in~nmemb| 4294967296) (mod |calloc_model_#in~size| 4294967296)) 4294967296) (mod (* (mod calloc_model_~nmemb 4294967296) (mod calloc_model_~size 4294967296)) 4294967296))] [2018-02-04 20:29:36,831 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 30 proven. 122 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2018-02-04 20:29:36,831 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 20:29:36,831 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 20:29:36,832 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2018-02-04 20:29:36,832 INFO L87 Difference]: Start difference. First operand 392 states and 502 transitions. Second operand 14 states. [2018-02-04 20:29:38,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:29:38,050 INFO L93 Difference]: Finished difference Result 457 states and 551 transitions. [2018-02-04 20:29:38,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-04 20:29:38,051 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 144 [2018-02-04 20:29:38,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:29:38,052 INFO L225 Difference]: With dead ends: 457 [2018-02-04 20:29:38,052 INFO L226 Difference]: Without dead ends: 450 [2018-02-04 20:29:38,052 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=126, Invalid=630, Unknown=0, NotChecked=0, Total=756 [2018-02-04 20:29:38,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2018-02-04 20:29:38,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 393. [2018-02-04 20:29:38,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2018-02-04 20:29:38,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 504 transitions. [2018-02-04 20:29:38,062 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 504 transitions. Word has length 144 [2018-02-04 20:29:38,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:29:38,063 INFO L432 AbstractCegarLoop]: Abstraction has 393 states and 504 transitions. [2018-02-04 20:29:38,063 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 20:29:38,063 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 504 transitions. [2018-02-04 20:29:38,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-02-04 20:29:38,065 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:29:38,065 INFO L351 BasicCegarLoop]: trace histogram [20, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:29:38,065 INFO L371 AbstractCegarLoop]: === Iteration 9 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation, 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 20:29:38,065 INFO L82 PathProgramCache]: Analyzing trace with hash 345367561, now seen corresponding path program 4 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:29:38,070 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:29:38,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:38,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:38,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:38,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:38,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:38,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:38,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:38,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:38,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:38,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:38,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:38,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:38,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:38,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:38,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:38,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:38,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:38,435 INFO L134 CoverageAnalysis]: Checked inductivity of 500 backedges. 30 proven. 162 refuted. 0 times theorem prover too weak. 308 trivial. 0 not checked. [2018-02-04 20:29:38,453 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:29:38,453 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-04 20:29:38,453 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:29:38,453 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2018-02-04 20:29:38,453 INFO L182 omatonBuilderFactory]: Interpolants [7783#(not (= (mod (* (mod |calloc_model_#in~nmemb| 4294967296) (mod |calloc_model_#in~size| 4294967296)) 4294967296) 8)), 7784#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 7753#(and (= |~#list~0.base| |old(~#list~0.base)|) (= |#valid| |old(#valid)|) (= |~#list~0.offset| |old(~#list~0.offset)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 7785#(= 0 |#Ultimate.C_memset_#t~loopctr47|), 7754#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 7786#(= 1 |#Ultimate.C_memset_#t~loopctr47|), 7755#(or (and (not (= zalloc_or_die_~size 8)) (not (= |zalloc_or_die_#in~size| 8))) (and (= zalloc_or_die_~size 8) (= |zalloc_or_die_#in~size| 8))), 7787#(= |#Ultimate.C_memset_#t~loopctr47| 2), 7788#(<= |#Ultimate.C_memset_#t~loopctr47| 3), 7789#(<= |#Ultimate.C_memset_#t~loopctr47| 4), 7790#(not (= 8 |#Ultimate.C_memset_#amount|)), 7636#true, 7637#false, 7772#(not (= 8 |zalloc_or_die_#in~size|)), 7773#(= (mod (* (mod |calloc_model_#in~nmemb| 4294967296) (mod |calloc_model_#in~size| 4294967296)) 4294967296) (mod (* (mod calloc_model_~nmemb 4294967296) (mod calloc_model_~size 4294967296)) 4294967296))] [2018-02-04 20:29:38,454 INFO L134 CoverageAnalysis]: Checked inductivity of 500 backedges. 30 proven. 162 refuted. 0 times theorem prover too weak. 308 trivial. 0 not checked. [2018-02-04 20:29:38,454 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 20:29:38,454 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 20:29:38,454 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2018-02-04 20:29:38,454 INFO L87 Difference]: Start difference. First operand 393 states and 504 transitions. Second operand 15 states. [2018-02-04 20:29:39,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:29:39,516 INFO L93 Difference]: Finished difference Result 460 states and 555 transitions. [2018-02-04 20:29:39,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-04 20:29:39,516 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 149 [2018-02-04 20:29:39,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:29:39,518 INFO L225 Difference]: With dead ends: 460 [2018-02-04 20:29:39,518 INFO L226 Difference]: Without dead ends: 453 [2018-02-04 20:29:39,518 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=138, Invalid=732, Unknown=0, NotChecked=0, Total=870 [2018-02-04 20:29:39,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2018-02-04 20:29:39,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 394. [2018-02-04 20:29:39,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2018-02-04 20:29:39,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 506 transitions. [2018-02-04 20:29:39,525 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 506 transitions. Word has length 149 [2018-02-04 20:29:39,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:29:39,526 INFO L432 AbstractCegarLoop]: Abstraction has 394 states and 506 transitions. [2018-02-04 20:29:39,526 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 20:29:39,526 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 506 transitions. [2018-02-04 20:29:39,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-02-04 20:29:39,528 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:29:39,528 INFO L351 BasicCegarLoop]: trace histogram [25, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:29:39,528 INFO L371 AbstractCegarLoop]: === Iteration 10 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation, 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 20:29:39,528 INFO L82 PathProgramCache]: Analyzing trace with hash 2142219864, now seen corresponding path program 5 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:29:39,532 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:29:39,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:39,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:39,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:39,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:39,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:39,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:39,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:39,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:39,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:39,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:39,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:39,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:39,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:39,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:39,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:39,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:39,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:39,805 INFO L134 CoverageAnalysis]: Checked inductivity of 635 backedges. 30 proven. 211 refuted. 0 times theorem prover too weak. 394 trivial. 0 not checked. [2018-02-04 20:29:39,822 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:29:39,822 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-04 20:29:39,822 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:29:39,823 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2018-02-04 20:29:39,823 INFO L182 omatonBuilderFactory]: Interpolants [8898#(and (= |~#list~0.base| |old(~#list~0.base)|) (= |#valid| |old(#valid)|) (= |~#list~0.offset| |old(~#list~0.offset)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 8930#(not (= (mod (* (mod |calloc_model_#in~nmemb| 4294967296) (mod |calloc_model_#in~size| 4294967296)) 4294967296) 8)), 8899#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 8931#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 8900#(or (and (not (= zalloc_or_die_~size 8)) (not (= |zalloc_or_die_#in~size| 8))) (and (= zalloc_or_die_~size 8) (= |zalloc_or_die_#in~size| 8))), 8932#(= 0 |#Ultimate.C_memset_#t~loopctr47|), 8933#(<= |#Ultimate.C_memset_#t~loopctr47| 1), 8934#(<= |#Ultimate.C_memset_#t~loopctr47| 2), 8935#(<= |#Ultimate.C_memset_#t~loopctr47| 3), 8776#true, 8936#(<= |#Ultimate.C_memset_#t~loopctr47| 4), 8777#false, 8937#(<= |#Ultimate.C_memset_#t~loopctr47| 5), 8938#(not (= 8 |#Ultimate.C_memset_#amount|)), 8918#(not (= 8 |zalloc_or_die_#in~size|)), 8919#(= (mod (* (mod |calloc_model_#in~nmemb| 4294967296) (mod |calloc_model_#in~size| 4294967296)) 4294967296) (mod (* (mod calloc_model_~nmemb 4294967296) (mod calloc_model_~size 4294967296)) 4294967296))] [2018-02-04 20:29:39,823 INFO L134 CoverageAnalysis]: Checked inductivity of 635 backedges. 30 proven. 211 refuted. 0 times theorem prover too weak. 394 trivial. 0 not checked. [2018-02-04 20:29:39,823 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 20:29:39,823 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 20:29:39,823 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2018-02-04 20:29:39,824 INFO L87 Difference]: Start difference. First operand 394 states and 506 transitions. Second operand 16 states. [2018-02-04 20:29:41,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:29:41,028 INFO L93 Difference]: Finished difference Result 463 states and 559 transitions. [2018-02-04 20:29:41,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-04 20:29:41,029 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 154 [2018-02-04 20:29:41,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:29:41,030 INFO L225 Difference]: With dead ends: 463 [2018-02-04 20:29:41,030 INFO L226 Difference]: Without dead ends: 456 [2018-02-04 20:29:41,030 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=171, Invalid=821, Unknown=0, NotChecked=0, Total=992 [2018-02-04 20:29:41,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2018-02-04 20:29:41,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 395. [2018-02-04 20:29:41,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2018-02-04 20:29:41,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 508 transitions. [2018-02-04 20:29:41,035 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 508 transitions. Word has length 154 [2018-02-04 20:29:41,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:29:41,036 INFO L432 AbstractCegarLoop]: Abstraction has 395 states and 508 transitions. [2018-02-04 20:29:41,036 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 20:29:41,036 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 508 transitions. [2018-02-04 20:29:41,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-02-04 20:29:41,037 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:29:41,037 INFO L351 BasicCegarLoop]: trace histogram [30, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:29:41,037 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_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation, 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 20:29:41,038 INFO L82 PathProgramCache]: Analyzing trace with hash -1382129943, now seen corresponding path program 6 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:29:41,044 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:29:41,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:41,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:41,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:41,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:41,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:41,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:41,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:41,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:41,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:41,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:41,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:41,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:41,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:41,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:41,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:41,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:41,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:41,356 INFO L134 CoverageAnalysis]: Checked inductivity of 795 backedges. 30 proven. 269 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2018-02-04 20:29:41,372 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:29:41,372 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-04 20:29:41,373 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:29:41,373 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2018-02-04 20:29:41,373 INFO L182 omatonBuilderFactory]: Interpolants [10086#(not (= 8 |zalloc_or_die_#in~size|)), 10087#(= (mod (* (mod |calloc_model_#in~nmemb| 4294967296) (mod |calloc_model_#in~size| 4294967296)) 4294967296) (mod (* (mod calloc_model_~nmemb 4294967296) (mod calloc_model_~size 4294967296)) 4294967296)), 10065#(and (= |~#list~0.base| |old(~#list~0.base)|) (= |#valid| |old(#valid)|) (= |~#list~0.offset| |old(~#list~0.offset)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 9938#true, 10066#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 9939#false, 10067#(or (and (not (= zalloc_or_die_~size 8)) (not (= |zalloc_or_die_#in~size| 8))) (and (= zalloc_or_die_~size 8) (= |zalloc_or_die_#in~size| 8))), 10099#(not (= (mod (* (mod |calloc_model_#in~nmemb| 4294967296) (mod |calloc_model_#in~size| 4294967296)) 4294967296) 8)), 10100#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 10101#(= 0 |#Ultimate.C_memset_#t~loopctr47|), 10102#(<= |#Ultimate.C_memset_#t~loopctr47| 1), 10103#(<= |#Ultimate.C_memset_#t~loopctr47| 2), 10104#(<= |#Ultimate.C_memset_#t~loopctr47| 3), 10105#(<= |#Ultimate.C_memset_#t~loopctr47| 4), 10106#(<= |#Ultimate.C_memset_#t~loopctr47| 5), 10107#(<= |#Ultimate.C_memset_#t~loopctr47| 6), 10108#(not (= |#Ultimate.C_memset_#amount| 8))] [2018-02-04 20:29:41,373 INFO L134 CoverageAnalysis]: Checked inductivity of 795 backedges. 30 proven. 269 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2018-02-04 20:29:41,373 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 20:29:41,374 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 20:29:41,374 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2018-02-04 20:29:41,374 INFO L87 Difference]: Start difference. First operand 395 states and 508 transitions. Second operand 17 states. [2018-02-04 20:29:42,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:29:42,609 INFO L93 Difference]: Finished difference Result 466 states and 563 transitions. [2018-02-04 20:29:42,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-04 20:29:42,609 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 159 [2018-02-04 20:29:42,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:29:42,610 INFO L225 Difference]: With dead ends: 466 [2018-02-04 20:29:42,610 INFO L226 Difference]: Without dead ends: 459 [2018-02-04 20:29:42,610 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=196, Invalid=926, Unknown=0, NotChecked=0, Total=1122 [2018-02-04 20:29:42,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2018-02-04 20:29:42,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 396. [2018-02-04 20:29:42,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2018-02-04 20:29:42,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 510 transitions. [2018-02-04 20:29:42,616 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 510 transitions. Word has length 159 [2018-02-04 20:29:42,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:29:42,616 INFO L432 AbstractCegarLoop]: Abstraction has 396 states and 510 transitions. [2018-02-04 20:29:42,616 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 20:29:42,616 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 510 transitions. [2018-02-04 20:29:42,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-02-04 20:29:42,617 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:29:42,617 INFO L351 BasicCegarLoop]: trace histogram [35, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:29:42,617 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_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation, 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 20:29:42,617 INFO L82 PathProgramCache]: Analyzing trace with hash 814310264, now seen corresponding path program 7 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:29:42,620 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:29:42,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:42,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:42,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:42,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:42,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:42,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:42,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:42,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:42,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:42,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:42,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:42,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:42,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:42,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:42,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:42,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:42,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:42,913 INFO L134 CoverageAnalysis]: Checked inductivity of 980 backedges. 30 proven. 336 refuted. 0 times theorem prover too weak. 614 trivial. 0 not checked. [2018-02-04 20:29:42,943 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:29:42,943 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-04 20:29:42,943 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:29:42,943 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2018-02-04 20:29:42,943 INFO L182 omatonBuilderFactory]: Interpolants [11296#(= 4 |#Ultimate.C_memset_#t~loopctr47|), 11297#(<= |#Ultimate.C_memset_#t~loopctr47| 5), 11298#(<= |#Ultimate.C_memset_#t~loopctr47| 6), 11299#(<= |#Ultimate.C_memset_#t~loopctr47| 7), 11300#(not (= 8 |#Ultimate.C_memset_#amount|)), 11276#(not (= 8 |zalloc_or_die_#in~size|)), 11277#(= (mod (* (mod |calloc_model_#in~nmemb| 4294967296) (mod |calloc_model_#in~size| 4294967296)) 4294967296) (mod (* (mod calloc_model_~nmemb 4294967296) (mod calloc_model_~size 4294967296)) 4294967296)), 11122#true, 11123#false, 11254#(and (= |~#list~0.base| |old(~#list~0.base)|) (= |#valid| |old(#valid)|) (= |~#list~0.offset| |old(~#list~0.offset)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 11255#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 11256#(or (and (not (= zalloc_or_die_~size 8)) (not (= |zalloc_or_die_#in~size| 8))) (and (= zalloc_or_die_~size 8) (= |zalloc_or_die_#in~size| 8))), 11290#(not (= (mod (* (mod |calloc_model_#in~nmemb| 4294967296) (mod |calloc_model_#in~size| 4294967296)) 4294967296) 8)), 11291#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 11292#(= 0 |#Ultimate.C_memset_#t~loopctr47|), 11293#(= 1 |#Ultimate.C_memset_#t~loopctr47|), 11294#(= |#Ultimate.C_memset_#t~loopctr47| 2), 11295#(= |#Ultimate.C_memset_#t~loopctr47| 3)] [2018-02-04 20:29:42,944 INFO L134 CoverageAnalysis]: Checked inductivity of 980 backedges. 30 proven. 336 refuted. 0 times theorem prover too weak. 614 trivial. 0 not checked. [2018-02-04 20:29:42,944 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 20:29:42,944 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 20:29:42,944 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2018-02-04 20:29:42,944 INFO L87 Difference]: Start difference. First operand 396 states and 510 transitions. Second operand 18 states. [2018-02-04 20:29:44,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:29:44,140 INFO L93 Difference]: Finished difference Result 469 states and 567 transitions. [2018-02-04 20:29:44,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-04 20:29:44,140 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 164 [2018-02-04 20:29:44,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:29:44,141 INFO L225 Difference]: With dead ends: 469 [2018-02-04 20:29:44,142 INFO L226 Difference]: Without dead ends: 462 [2018-02-04 20:29:44,142 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=1070, Unknown=0, NotChecked=0, Total=1260 [2018-02-04 20:29:44,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2018-02-04 20:29:44,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 397. [2018-02-04 20:29:44,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2018-02-04 20:29:44,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 512 transitions. [2018-02-04 20:29:44,149 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 512 transitions. Word has length 164 [2018-02-04 20:29:44,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:29:44,149 INFO L432 AbstractCegarLoop]: Abstraction has 397 states and 512 transitions. [2018-02-04 20:29:44,150 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 20:29:44,150 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 512 transitions. [2018-02-04 20:29:44,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-02-04 20:29:44,150 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:29:44,151 INFO L351 BasicCegarLoop]: trace histogram [40, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:29:44,151 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_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation, 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 20:29:44,151 INFO L82 PathProgramCache]: Analyzing trace with hash 2034049481, now seen corresponding path program 8 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:29:44,154 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:29:44,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:44,200 WARN L195 Executor]: ExternalInterpolator (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in) stderr output: WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier [2018-02-04 20:29:44,205 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 20:29:44,205 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 20:29:44,206 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 20:29:44,206 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 20:29:44,212 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 20:29:44,212 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 20:29:44,212 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 20:29:44,212 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 20:29:44,215 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-02-04 20:29:44,215 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 20:29:44,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:44,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:44,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:44,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:44,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:44,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:44,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:44,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:44,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:44,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:44,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:44,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:44,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:44,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:44,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:44,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:44,427 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 20 proven. 10 refuted. 0 times theorem prover too weak. 1160 trivial. 0 not checked. [2018-02-04 20:29:44,444 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:29:44,444 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-04 20:29:44,444 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:29:44,445 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2018-02-04 20:29:44,445 INFO L182 omatonBuilderFactory]: Interpolants [12465#(= |zalloc_or_die_#in~size| 119), 12466#(= 119 zalloc_or_die_~size), 12467#(exists ((%0 (Array Int Int))) (! (and (= |calloc_model_#in~nmemb| 1) (forall ((%1 Int)) (! (= (store %0 %1 119) (store |#length| %1 119)) :qid itp)) (= |calloc_model_#in~size| 119)) :qid itp)), 12468#(exists ((%0 (Array Int Int))) (! (and (= (ite (<= (mod (* (mod calloc_model_~nmemb 4294967296) (mod calloc_model_~size 4294967296)) 4294967296) 2147483647) (mod (* (mod calloc_model_~nmemb 4294967296) (mod calloc_model_~size 4294967296)) 4294967296) (+ (- 4294967296) (mod (* (mod calloc_model_~nmemb 4294967296) (mod calloc_model_~size 4294967296)) 4294967296))) 119) (forall ((%1 Int)) (! (= (store %0 %1 119) (store |#length| %1 119)) :qid itp))) :qid itp)), 12469#(and (= 119 (mod (* (mod calloc_model_~nmemb 4294967296) (mod calloc_model_~size 4294967296)) 4294967296)) (= 119 (select |#length| |calloc_model_#t~malloc0.base|)) (= 0 |calloc_model_#t~malloc0.offset|)), 12470#(and (<= 0 calloc_model_~ptr~0.offset) (or (and (< 2147483647 (mod (* (mod calloc_model_~nmemb 4294967296) (mod calloc_model_~size 4294967296)) 4294967296)) (<= (+ (mod (* (mod calloc_model_~nmemb 4294967296) (mod calloc_model_~size 4294967296)) 4294967296) calloc_model_~ptr~0.offset) (+ (select |#length| calloc_model_~ptr~0.base) 4294967296))) (<= (+ (mod (* (mod calloc_model_~nmemb 4294967296) (mod calloc_model_~size 4294967296)) 4294967296) calloc_model_~ptr~0.offset) (select |#length| calloc_model_~ptr~0.base)))), 12471#(and (= |~#list~0.base| |old(~#list~0.base)|) (= |#valid| |old(#valid)|) (= |~#list~0.offset| |old(~#list~0.offset)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 12328#true, 12472#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 12329#false, 12506#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))] [2018-02-04 20:29:44,445 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 20 proven. 10 refuted. 0 times theorem prover too weak. 1160 trivial. 0 not checked. [2018-02-04 20:29:44,445 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 20:29:44,445 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 20:29:44,445 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=87, Unknown=1, NotChecked=0, Total=110 [2018-02-04 20:29:44,445 INFO L87 Difference]: Start difference. First operand 397 states and 512 transitions. Second operand 11 states. [2018-02-04 20:29:44,571 WARN L1011 $PredicateComparison]: unable to prove that (and (= |c_~#list~0.base| |c_old(~#list~0.base)|) (= |c_#valid| |c_old(#valid)|) (= |c_~#list~0.offset| |c_old(~#list~0.offset)|) (= |c_#NULL.base| |c_old(#NULL.base)|) (exists ((%0 (Array Int Int))) (! (and (= |c_calloc_model_#in~nmemb| 1) (forall ((%1 Int)) (! (= (store %0 %1 119) (store |c_#length| %1 119)) :qid itp)) (= |c_calloc_model_#in~size| 119)) :qid itp)) (= |c_#NULL.offset| |c_old(#NULL.offset)|) (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= |c_old(#length)| |c_#length|) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|)) is different from false [2018-02-04 20:29:45,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:29:45,461 INFO L93 Difference]: Finished difference Result 439 states and 537 transitions. [2018-02-04 20:29:45,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 20:29:45,462 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 169 [2018-02-04 20:29:45,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:29:45,464 INFO L225 Difference]: With dead ends: 439 [2018-02-04 20:29:45,464 INFO L226 Difference]: Without dead ends: 439 [2018-02-04 20:29:45,464 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=164, Unknown=3, NotChecked=26, Total=240 [2018-02-04 20:29:45,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2018-02-04 20:29:45,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 396. [2018-02-04 20:29:45,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2018-02-04 20:29:45,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 511 transitions. [2018-02-04 20:29:45,469 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 511 transitions. Word has length 169 [2018-02-04 20:29:45,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:29:45,469 INFO L432 AbstractCegarLoop]: Abstraction has 396 states and 511 transitions. [2018-02-04 20:29:45,469 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 20:29:45,469 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 511 transitions. [2018-02-04 20:29:45,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-02-04 20:29:45,470 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:29:45,470 INFO L351 BasicCegarLoop]: trace histogram [40, 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 20:29:45,470 INFO L371 AbstractCegarLoop]: === Iteration 14 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation, 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 20:29:45,470 INFO L82 PathProgramCache]: Analyzing trace with hash 2037890792, now seen corresponding path program 1 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:29:45,482 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:29:45,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:45,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:45,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:45,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:45,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:45,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:45,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:45,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:45,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:45,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:45,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:45,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:45,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:45,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:45,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:45,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:45,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:45,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:45,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:45,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:45,648 INFO L134 CoverageAnalysis]: Checked inductivity of 1290 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2018-02-04 20:29:45,664 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 20:29:45,664 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-04 20:29:45,664 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:29:45,665 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2018-02-04 20:29:45,665 INFO L182 omatonBuilderFactory]: Interpolants [13827#(or (not (= |calloc_model_#in~nmemb| 1)) (not (= |calloc_model_#in~size| 119))), 13828#(= 0 |#Ultimate.C_memset_#t~loopctr47|), 13829#(<= |#Ultimate.C_memset_#amount| 0), 13639#(and (= |~#list~0.base| |old(~#list~0.base)|) (= |#valid| |old(#valid)|) (= |~#list~0.offset| |old(~#list~0.offset)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 13640#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 13674#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 13484#true, 13820#(not (= 119 |zalloc_or_die_#in~size|)), 13485#false, 13821#(and (= |calloc_model_#in~size| calloc_model_~size) (or (and (not (= calloc_model_~nmemb 1)) (not (= |calloc_model_#in~nmemb| 1))) (and (= |calloc_model_#in~nmemb| 1) (= calloc_model_~nmemb 1)))), 13807#(= zalloc_or_die_~size |zalloc_or_die_#in~size|)] [2018-02-04 20:29:45,665 INFO L134 CoverageAnalysis]: Checked inductivity of 1290 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2018-02-04 20:29:45,665 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 20:29:45,666 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 20:29:45,666 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-02-04 20:29:45,666 INFO L87 Difference]: Start difference. First operand 396 states and 511 transitions. Second operand 11 states. [2018-02-04 20:29:46,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:29:46,354 INFO L93 Difference]: Finished difference Result 446 states and 543 transitions. [2018-02-04 20:29:46,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 20:29:46,354 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 182 [2018-02-04 20:29:46,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:29:46,356 INFO L225 Difference]: With dead ends: 446 [2018-02-04 20:29:46,356 INFO L226 Difference]: Without dead ends: 437 [2018-02-04 20:29:46,357 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=109, Invalid=443, Unknown=0, NotChecked=0, Total=552 [2018-02-04 20:29:46,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2018-02-04 20:29:46,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 396. [2018-02-04 20:29:46,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2018-02-04 20:29:46,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 510 transitions. [2018-02-04 20:29:46,364 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 510 transitions. Word has length 182 [2018-02-04 20:29:46,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:29:46,365 INFO L432 AbstractCegarLoop]: Abstraction has 396 states and 510 transitions. [2018-02-04 20:29:46,365 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 20:29:46,365 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 510 transitions. [2018-02-04 20:29:46,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-02-04 20:29:46,366 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:29:46,366 INFO L351 BasicCegarLoop]: trace histogram [41, 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 20:29:46,366 INFO L371 AbstractCegarLoop]: === Iteration 15 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation, 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 20:29:46,366 INFO L82 PathProgramCache]: Analyzing trace with hash -73696927, now seen corresponding path program 2 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:29:46,370 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:29:46,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:46,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:46,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:46,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:46,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:46,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:46,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:46,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:46,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:46,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:46,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:46,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:46,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:46,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:46,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:46,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:46,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:46,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:46,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:46,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:46,658 INFO L134 CoverageAnalysis]: Checked inductivity of 1336 backedges. 155 proven. 1 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2018-02-04 20:29:46,674 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:29:46,674 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-04 20:29:46,674 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:29:46,674 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2018-02-04 20:29:46,674 INFO L182 omatonBuilderFactory]: Interpolants [15044#(or (not (= (mod |calloc_model_#in~nmemb| 4294967296) 1)) (not (= |calloc_model_#in~size| 119))), 15045#(= 0 |#Ultimate.C_memset_#t~loopctr47|), 14854#(and (= |~#list~0.base| |old(~#list~0.base)|) (= |#valid| |old(#valid)|) (= |~#list~0.offset| |old(~#list~0.offset)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 15046#(and (or (and (<= |#Ultimate.C_memset_#amount| |#Ultimate.C_memset_#t~loopctr47|) (<= |#Ultimate.C_memset_#amount| 1)) (and (< |#Ultimate.C_memset_#t~loopctr47| |#Ultimate.C_memset_#amount|) (< 1 |#Ultimate.C_memset_#amount|))) (< 0 |#Ultimate.C_memset_#amount|)), 14855#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 15047#(= 1 |#Ultimate.C_memset_#amount|), 14889#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 14698#true, 14699#false, 15036#(not (= 119 |zalloc_or_die_#in~size|)), 15037#(and (= calloc_model_~size |calloc_model_#in~size|) (= (mod (* (mod |calloc_model_#in~nmemb| 4294967296) (mod calloc_model_~size 4294967296)) 4294967296) (mod (* (mod calloc_model_~nmemb 4294967296) (mod calloc_model_~size 4294967296)) 4294967296))), 15022#(or (and (not (= zalloc_or_die_~size 119)) (not (= |zalloc_or_die_#in~size| 119))) (and (= zalloc_or_die_~size 119) (= |zalloc_or_die_#in~size| 119)))] [2018-02-04 20:29:46,675 INFO L134 CoverageAnalysis]: Checked inductivity of 1336 backedges. 155 proven. 1 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2018-02-04 20:29:46,675 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 20:29:46,675 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 20:29:46,675 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-02-04 20:29:46,675 INFO L87 Difference]: Start difference. First operand 396 states and 510 transitions. Second operand 12 states. [2018-02-04 20:29:47,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:29:47,757 INFO L93 Difference]: Finished difference Result 446 states and 542 transitions. [2018-02-04 20:29:47,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 20:29:47,757 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 183 [2018-02-04 20:29:47,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:29:47,758 INFO L225 Difference]: With dead ends: 446 [2018-02-04 20:29:47,758 INFO L226 Difference]: Without dead ends: 437 [2018-02-04 20:29:47,759 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=452, Unknown=0, NotChecked=0, Total=552 [2018-02-04 20:29:47,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2018-02-04 20:29:47,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 396. [2018-02-04 20:29:47,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2018-02-04 20:29:47,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 509 transitions. [2018-02-04 20:29:47,764 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 509 transitions. Word has length 183 [2018-02-04 20:29:47,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:29:47,764 INFO L432 AbstractCegarLoop]: Abstraction has 396 states and 509 transitions. [2018-02-04 20:29:47,764 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 20:29:47,764 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 509 transitions. [2018-02-04 20:29:47,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-02-04 20:29:47,765 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:29:47,765 INFO L351 BasicCegarLoop]: trace histogram [42, 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 20:29:47,765 INFO L371 AbstractCegarLoop]: === Iteration 16 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation, 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 20:29:47,765 INFO L82 PathProgramCache]: Analyzing trace with hash -1108406776, now seen corresponding path program 3 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:29:47,772 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:29:47,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:47,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:47,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:47,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:47,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:47,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:47,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:47,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:47,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:47,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:47,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:47,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:47,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:47,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:47,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:47,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:47,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:47,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:47,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:47,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:29:48,019 INFO L134 CoverageAnalysis]: Checked inductivity of 1383 backedges. 200 proven. 3 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2018-02-04 20:29:48,036 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:29:48,036 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-04 20:29:48,036 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:29:48,037 INFO L134 CoverageAnalysis]: Checked inductivity of 285 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2018-02-04 20:29:48,037 INFO L182 omatonBuilderFactory]: Interpolants [16071#(and (= |~#list~0.base| |old(~#list~0.base)|) (= |#valid| |old(#valid)|) (= |~#list~0.offset| |old(~#list~0.offset)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 16263#(or (not (= |calloc_model_#in~nmemb| 1)) (not (= (mod |calloc_model_#in~size| 4294967296) 119))), 16072#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 16264#(= 0 |#Ultimate.C_memset_#t~loopctr47|), 16265#(and (= 1 |#Ultimate.C_memset_#t~loopctr47|) (< 0 |#Ultimate.C_memset_#amount|)), 15914#true, 16106#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 16266#(and (< 0 |#Ultimate.C_memset_#amount|) (<= 2 |#Ultimate.C_memset_#t~loopctr47|)), 15915#false, 16267#(< 0 |#Ultimate.C_memset_#amount|), 16239#(or (and (not (= zalloc_or_die_~size 119)) (not (= |zalloc_or_die_#in~size| 119))) (and (= zalloc_or_die_~size 119) (= |zalloc_or_die_#in~size| 119))), 16254#(not (= 119 |zalloc_or_die_#in~size|)), 16255#(and (= (mod (* (mod |calloc_model_#in~size| 4294967296) (mod calloc_model_~nmemb 4294967296)) 4294967296) (mod (* (mod calloc_model_~nmemb 4294967296) (mod calloc_model_~size 4294967296)) 4294967296)) (or (and (not (= calloc_model_~nmemb 1)) (not (= |calloc_model_#in~nmemb| 1))) (and (= |calloc_model_#in~nmemb| 1) (= calloc_model_~nmemb 1))))] [2018-02-04 20:29:48,037 INFO L134 CoverageAnalysis]: Checked inductivity of 1383 backedges. 200 proven. 3 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2018-02-04 20:29:48,038 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 20:29:48,038 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 20:29:48,038 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-02-04 20:29:48,038 INFO L87 Difference]: Start difference. First operand 396 states and 509 transitions. Second operand 13 states. [2018-02-04 20:29:48,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:29:48,330 INFO L93 Difference]: Finished difference Result 74 states and 85 transitions. [2018-02-04 20:29:48,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 20:29:48,330 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 184 [2018-02-04 20:29:48,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:29:48,331 INFO L225 Difference]: With dead ends: 74 [2018-02-04 20:29:48,331 INFO L226 Difference]: Without dead ends: 0 [2018-02-04 20:29:48,331 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=345, Unknown=0, NotChecked=0, Total=420 [2018-02-04 20:29:48,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-02-04 20:29:48,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-02-04 20:29:48,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-02-04 20:29:48,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-02-04 20:29:48,332 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 184 [2018-02-04 20:29:48,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:29:48,332 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-02-04 20:29:48,332 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 20:29:48,332 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-02-04 20:29:48,332 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-02-04 20:29:48,337 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 08:29:48 BoogieIcfgContainer [2018-02-04 20:29:48,337 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 20:29:48,338 INFO L168 Benchmark]: Toolchain (without parser) took 19908.53 ms. Allocated memory was 405.8 MB in the beginning and 914.9 MB in the end (delta: 509.1 MB). Free memory was 362.7 MB in the beginning and 375.3 MB in the end (delta: -12.6 MB). Peak memory consumption was 496.5 MB. Max. memory is 5.3 GB. [2018-02-04 20:29:48,339 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 405.8 MB. Free memory is still 369.3 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 20:29:48,339 INFO L168 Benchmark]: CACSL2BoogieTranslator took 199.13 ms. Allocated memory is still 405.8 MB. Free memory was 362.7 MB in the beginning and 349.5 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. [2018-02-04 20:29:48,339 INFO L168 Benchmark]: Boogie Preprocessor took 29.51 ms. Allocated memory is still 405.8 MB. Free memory was 349.5 MB in the beginning and 348.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-04 20:29:48,340 INFO L168 Benchmark]: RCFGBuilder took 549.33 ms. Allocated memory is still 405.8 MB. Free memory was 348.1 MB in the beginning and 288.4 MB in the end (delta: 59.7 MB). Peak memory consumption was 59.7 MB. Max. memory is 5.3 GB. [2018-02-04 20:29:48,340 INFO L168 Benchmark]: TraceAbstraction took 19127.17 ms. Allocated memory was 405.8 MB in the beginning and 914.9 MB in the end (delta: 509.1 MB). Free memory was 288.4 MB in the beginning and 375.3 MB in the end (delta: -86.8 MB). Peak memory consumption was 422.2 MB. Max. memory is 5.3 GB. [2018-02-04 20:29:48,342 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.18 ms. Allocated memory is still 405.8 MB. Free memory is still 369.3 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 199.13 ms. Allocated memory is still 405.8 MB. Free memory was 362.7 MB in the beginning and 349.5 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 29.51 ms. Allocated memory is still 405.8 MB. Free memory was 349.5 MB in the beginning and 348.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 549.33 ms. Allocated memory is still 405.8 MB. Free memory was 348.1 MB in the beginning and 288.4 MB in the end (delta: 59.7 MB). Peak memory consumption was 59.7 MB. Max. memory is 5.3 GB. * TraceAbstraction took 19127.17 ms. Allocated memory was 405.8 MB in the beginning and 914.9 MB in the end (delta: 509.1 MB). Free memory was 288.4 MB in the beginning and 375.3 MB in the end (delta: -86.8 MB). Peak memory consumption was 422.2 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 875]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 81 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 16 procedures, 265 locations, 81 error locations. SAFE Result, 19.0s OverallTime, 16 OverallIterations, 42 TraceHistogramMax, 14.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3582 SDtfs, 3566 SDslu, 16884 SDs, 0 SdLazy, 21606 SolverSat, 891 SolverUnsat, 15 SolverUnknown, 0 SolverNotchecked, 10.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 727 GetRequests, 414 SyntacticMatches, 0 SemanticMatches, 313 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1105 ImplicationChecksByTransitivity, 3.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=397occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 7985/9259 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 726 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 1932 NumberOfCodeBlocks, 1932 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 1916 ConstructedInterpolants, 8 QuantifiedInterpolants, 905475 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 6 PerfectInterpolantSequences, 7985/9259 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0235_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_z3.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_20-29-48-352.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0235_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_z3.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_20-29-48-352.csv Received shutdown request...