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_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c17473d-m [2018-02-04 20:30:48,743 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 20:30:48,745 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 20:30:48,757 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 20:30:48,758 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 20:30:48,759 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 20:30:48,760 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 20:30:48,761 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 20:30:48,763 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 20:30:48,764 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 20:30:48,764 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 20:30:48,765 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 20:30:48,765 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 20:30:48,766 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 20:30:48,767 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 20:30:48,769 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 20:30:48,771 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 20:30:48,772 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 20:30:48,773 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 20:30:48,774 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 20:30:48,776 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 20:30:48,776 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 20:30:48,777 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 20:30:48,777 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 20:30:48,778 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 20:30:48,779 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 20:30:48,779 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 20:30:48,780 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 20:30:48,780 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 20:30:48,780 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 20:30:48,781 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 20:30:48,781 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:30:48,791 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 20:30:48,791 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 20:30:48,792 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 20:30:48,792 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 20:30:48,793 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 20:30:48,793 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 20:30:48,793 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 20:30:48,793 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 20:30:48,793 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 20:30:48,793 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 20:30:48,794 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 20:30:48,794 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 20:30:48,794 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 20:30:48,794 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 20:30:48,794 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 20:30:48,794 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 20:30:48,794 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 20:30:48,795 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 20:30:48,795 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 20:30:48,795 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 20:30:48,795 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 20:30:48,795 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-02-04 20:30:48,795 INFO L133 SettingsManager]: * SMT solver=External_Z3InterpolationMode [2018-02-04 20:30:48,795 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:30:48,825 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 20:30:48,835 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 20:30:48,838 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 20:30:48,840 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 20:30:48,840 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 20:30:48,841 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/test-0235_true-valid-memsafety.i [2018-02-04 20:30:48,996 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 20:30:48,997 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 20:30:48,998 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 20:30:48,998 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 20:30:49,004 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 20:30:49,005 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 08:30:48" (1/1) ... [2018-02-04 20:30:49,008 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5822695f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 08:30:49, skipping insertion in model container [2018-02-04 20:30:49,008 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 08:30:48" (1/1) ... [2018-02-04 20:30:49,024 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 20:30:49,059 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 20:30:49,165 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 20:30:49,181 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 20:30:49,189 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 08:30:49 WrapperNode [2018-02-04 20:30:49,189 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 20:30:49,190 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 20:30:49,190 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 20:30:49,190 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 20:30:49,199 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 08:30:49" (1/1) ... [2018-02-04 20:30:49,199 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 08:30:49" (1/1) ... [2018-02-04 20:30:49,209 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 08:30:49" (1/1) ... [2018-02-04 20:30:49,209 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 08:30:49" (1/1) ... [2018-02-04 20:30:49,215 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 08:30:49" (1/1) ... [2018-02-04 20:30:49,219 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 08:30:49" (1/1) ... [2018-02-04 20:30:49,221 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 08:30:49" (1/1) ... [2018-02-04 20:30:49,225 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 20:30:49,225 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 20:30:49,225 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 20:30:49,225 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 20:30:49,226 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 08:30:49" (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:30:49,264 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 20:30:49,264 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 20:30:49,265 INFO L136 BoogieDeclarations]: Found implementation of procedure calloc_model [2018-02-04 20:30:49,265 INFO L136 BoogieDeclarations]: Found implementation of procedure zalloc_or_die [2018-02-04 20:30:49,265 INFO L136 BoogieDeclarations]: Found implementation of procedure l4_insert [2018-02-04 20:30:49,265 INFO L136 BoogieDeclarations]: Found implementation of procedure l3_insert [2018-02-04 20:30:49,265 INFO L136 BoogieDeclarations]: Found implementation of procedure l2_insert [2018-02-04 20:30:49,265 INFO L136 BoogieDeclarations]: Found implementation of procedure l1_insert [2018-02-04 20:30:49,265 INFO L136 BoogieDeclarations]: Found implementation of procedure l0_insert [2018-02-04 20:30:49,265 INFO L136 BoogieDeclarations]: Found implementation of procedure l4_destroy [2018-02-04 20:30:49,265 INFO L136 BoogieDeclarations]: Found implementation of procedure l3_destroy [2018-02-04 20:30:49,265 INFO L136 BoogieDeclarations]: Found implementation of procedure l2_destroy [2018-02-04 20:30:49,265 INFO L136 BoogieDeclarations]: Found implementation of procedure l1_destroy [2018-02-04 20:30:49,265 INFO L136 BoogieDeclarations]: Found implementation of procedure l0_destroy [2018-02-04 20:30:49,265 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 20:30:49,265 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-04 20:30:49,266 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-04 20:30:49,266 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 20:30:49,266 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 20:30:49,266 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 20:30:49,266 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2018-02-04 20:30:49,266 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2018-02-04 20:30:49,266 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-04 20:30:49,266 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-04 20:30:49,266 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-02-04 20:30:49,266 INFO L128 BoogieDeclarations]: Found specification of procedure memset [2018-02-04 20:30:49,266 INFO L128 BoogieDeclarations]: Found specification of procedure calloc_model [2018-02-04 20:30:49,266 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 20:30:49,266 INFO L128 BoogieDeclarations]: Found specification of procedure zalloc_or_die [2018-02-04 20:30:49,266 INFO L128 BoogieDeclarations]: Found specification of procedure l4_insert [2018-02-04 20:30:49,267 INFO L128 BoogieDeclarations]: Found specification of procedure l3_insert [2018-02-04 20:30:49,267 INFO L128 BoogieDeclarations]: Found specification of procedure l2_insert [2018-02-04 20:30:49,267 INFO L128 BoogieDeclarations]: Found specification of procedure l1_insert [2018-02-04 20:30:49,267 INFO L128 BoogieDeclarations]: Found specification of procedure l0_insert [2018-02-04 20:30:49,267 INFO L128 BoogieDeclarations]: Found specification of procedure l4_destroy [2018-02-04 20:30:49,267 INFO L128 BoogieDeclarations]: Found specification of procedure l3_destroy [2018-02-04 20:30:49,267 INFO L128 BoogieDeclarations]: Found specification of procedure l2_destroy [2018-02-04 20:30:49,267 INFO L128 BoogieDeclarations]: Found specification of procedure l1_destroy [2018-02-04 20:30:49,267 INFO L128 BoogieDeclarations]: Found specification of procedure l0_destroy [2018-02-04 20:30:49,268 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 20:30:49,268 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 20:30:49,268 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 20:30:49,604 WARN L455 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-02-04 20:30:49,788 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 20:30:49,789 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 08:30:49 BoogieIcfgContainer [2018-02-04 20:30:49,789 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 20:30:49,789 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 20:30:49,789 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 20:30:49,791 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 20:30:49,792 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 08:30:48" (1/3) ... [2018-02-04 20:30:49,792 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a8443c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 08:30:49, skipping insertion in model container [2018-02-04 20:30:49,792 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 08:30:49" (2/3) ... [2018-02-04 20:30:49,792 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a8443c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 08:30:49, skipping insertion in model container [2018-02-04 20:30:49,792 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 08:30:49" (3/3) ... [2018-02-04 20:30:49,794 INFO L107 eAbstractionObserver]: Analyzing ICFG test-0235_true-valid-memsafety.i [2018-02-04 20:30:49,800 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-04 20:30:49,806 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 83 error locations. [2018-02-04 20:30:49,828 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 20:30:49,829 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 20:30:49,829 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-02-04 20:30:49,829 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-04 20:30:49,829 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 20:30:49,829 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 20:30:49,829 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 20:30:49,829 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 20:30:49,830 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 20:30:49,845 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states. [2018-02-04 20:30:49,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-02-04 20:30:49,851 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:30:49,852 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-02-04 20:30:49,852 INFO L371 AbstractCegarLoop]: === Iteration 1 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-04 20:30:49,856 INFO L82 PathProgramCache]: Analyzing trace with hash 15106047, 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:30:49,866 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:30:49,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:30:49,889 WARN L195 Executor]: ExternalInterpolator (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in) stderr output: WARNING: array quantifier [2018-02-04 20:30:49,895 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 20:30:49,896 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 20:30:49,901 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 20:30:49,901 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 20:30:49,936 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:30:49,968 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:30:49,988 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 20:30:49,988 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 20:30:49,989 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:30:49,990 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:30:49,990 INFO L182 omatonBuilderFactory]: Interpolants [273#true, 274#false, 275#(exists ((%0 (Array Int Int))) (! (forall ((%1 Int)) (! (= (store %0 %1 4) (store |#length| %1 4)) :qid itp)) :qid itp)), 276#(and (<= (+ |~#list~0.offset| 4) (select |#length| |~#list~0.base|)) (= 4 (select |#length| |~#list~0.base|)) (<= 0 |~#list~0.offset|))] [2018-02-04 20:30:49,990 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:30:49,991 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 20:30:50,000 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 20:30:50,000 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2018-02-04 20:30:50,001 INFO L87 Difference]: Start difference. First operand 270 states. Second operand 4 states. [2018-02-04 20:30:50,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:30:50,191 INFO L93 Difference]: Finished difference Result 277 states and 310 transitions. [2018-02-04 20:30:50,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 20:30:50,193 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2018-02-04 20:30:50,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:30:50,205 INFO L225 Difference]: With dead ends: 277 [2018-02-04 20:30:50,206 INFO L226 Difference]: Without dead ends: 274 [2018-02-04 20:30:50,208 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:30:50,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2018-02-04 20:30:50,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 266. [2018-02-04 20:30:50,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2018-02-04 20:30:50,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 296 transitions. [2018-02-04 20:30:50,298 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 296 transitions. Word has length 4 [2018-02-04 20:30:50,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:30:50,298 INFO L432 AbstractCegarLoop]: Abstraction has 266 states and 296 transitions. [2018-02-04 20:30:50,298 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 20:30:50,299 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 296 transitions. [2018-02-04 20:30:50,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-02-04 20:30:50,299 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:30:50,299 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-02-04 20:30:50,299 INFO L371 AbstractCegarLoop]: === Iteration 2 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-04 20:30:50,299 INFO L82 PathProgramCache]: Analyzing trace with hash 15106046, 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:30:50,302 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:30:50,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:30:50,316 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:30:50,333 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 20:30:50,333 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 20:30:50,334 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:30:50,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:30:50,334 INFO L182 omatonBuilderFactory]: Interpolants [820#true, 821#false, 822#(= 1 (select |#valid| |~#list~0.base|))] [2018-02-04 20:30:50,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:30:50,335 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 20:30:50,335 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 20:30:50,335 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 20:30:50,336 INFO L87 Difference]: Start difference. First operand 266 states and 296 transitions. Second operand 3 states. [2018-02-04 20:30:50,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:30:50,512 INFO L93 Difference]: Finished difference Result 382 states and 436 transitions. [2018-02-04 20:30:50,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 20:30:50,512 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-02-04 20:30:50,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:30:50,514 INFO L225 Difference]: With dead ends: 382 [2018-02-04 20:30:50,514 INFO L226 Difference]: Without dead ends: 382 [2018-02-04 20:30:50,515 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:30:50,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2018-02-04 20:30:50,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 337. [2018-02-04 20:30:50,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2018-02-04 20:30:50,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 415 transitions. [2018-02-04 20:30:50,535 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 415 transitions. Word has length 4 [2018-02-04 20:30:50,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:30:50,535 INFO L432 AbstractCegarLoop]: Abstraction has 337 states and 415 transitions. [2018-02-04 20:30:50,535 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 20:30:50,535 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 415 transitions. [2018-02-04 20:30:50,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 20:30:50,536 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:30:50,536 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:30:50,536 INFO L371 AbstractCegarLoop]: === Iteration 3 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-04 20:30:50,536 INFO L82 PathProgramCache]: Analyzing trace with hash -416211489, 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:30:50,539 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:30:50,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:30:50,551 WARN L195 Executor]: ExternalInterpolator (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in) stderr output: WARNING: array quantifier [2018-02-04 20:30:50,552 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 20:30:50,552 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 20:30:50,552 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 20:30:50,552 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 20:30:50,557 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:30:50,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:30:50,581 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:30:50,598 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 20:30:50,598 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 20:30:50,598 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:30:50,599 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:30:50,599 INFO L182 omatonBuilderFactory]: Interpolants [1552#(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)|)), 1542#true, 1543#false, 1549#(exists ((%0 (Array Int Int))) (! (forall ((%1 Int)) (! (= (store |#valid| %1 1) (store %0 %1 1)) :qid itp)) :qid itp)), 1550#(= 1 (select |#valid| |calloc_model_#t~malloc0.base|)), 1551#(= 1 (select |#valid| calloc_model_~ptr~0.base))] [2018-02-04 20:30:50,599 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:30:50,599 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 20:30:50,600 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 20:30:50,600 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=14, Unknown=1, NotChecked=6, Total=30 [2018-02-04 20:30:50,600 INFO L87 Difference]: Start difference. First operand 337 states and 415 transitions. Second operand 6 states. [2018-02-04 20:30:50,634 WARN L1011 $PredicateComparison]: unable to prove that (and (= |c_~#list~0.base| |c_old(~#list~0.base)|) (exists ((%0 (Array Int Int))) (! (forall ((%1 Int)) (! (= (store |c_#valid| %1 1) (store %0 %1 1)) :qid itp)) :qid itp)) (= |c_#valid| |c_old(#valid)|) (= |c_~#list~0.offset| |c_old(~#list~0.offset)|) (= |c_#NULL.base| |c_old(#NULL.base)|) (= |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:30:51,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:30:51,188 INFO L93 Difference]: Finished difference Result 425 states and 519 transitions. [2018-02-04 20:30:51,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 20:30:51,188 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-02-04 20:30:51,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:30:51,191 INFO L225 Difference]: With dead ends: 425 [2018-02-04 20:30:51,191 INFO L226 Difference]: Without dead ends: 425 [2018-02-04 20:30:51,191 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=21, Unknown=2, NotChecked=18, Total=56 [2018-02-04 20:30:51,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2018-02-04 20:30:51,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 381. [2018-02-04 20:30:51,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2018-02-04 20:30:51,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 491 transitions. [2018-02-04 20:30:51,206 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 491 transitions. Word has length 17 [2018-02-04 20:30:51,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:30:51,206 INFO L432 AbstractCegarLoop]: Abstraction has 381 states and 491 transitions. [2018-02-04 20:30:51,207 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 20:30:51,207 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 491 transitions. [2018-02-04 20:30:51,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 20:30:51,207 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:30:51,207 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:30:51,207 INFO L371 AbstractCegarLoop]: === Iteration 4 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-04 20:30:51,208 INFO L82 PathProgramCache]: Analyzing trace with hash -416211488, 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) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:30:51,211 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:30:51,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:30:51,230 WARN L195 Executor]: ExternalInterpolator (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in) stderr output: WARNING: array quantifier WARNING: array quantifier [2018-02-04 20:30:51,327 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 20:30:51,327 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 20:30:51,327 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 20:30:51,327 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 20:30:51,342 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 20:30:51,342 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 20:30:51,342 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 20:30:51,343 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 20:30:51,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:30:51,443 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:30:51,471 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 20:30:51,471 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 20:30:51,471 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:30:51,472 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:30:51,472 INFO L182 omatonBuilderFactory]: Interpolants [2370#(= |zalloc_or_die_#in~size| 8), 2371#(= 8 zalloc_or_die_~size), 2372#(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)), 2373#(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)), 2374#(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|)), 2375#(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)))), 2376#(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)|)), 2363#true, 2364#false] [2018-02-04 20:30:51,472 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:30:51,472 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 20:30:51,472 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 20:30:51,472 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=55, Unknown=2, NotChecked=0, Total=72 [2018-02-04 20:30:51,473 INFO L87 Difference]: Start difference. First operand 381 states and 491 transitions. Second operand 9 states. [2018-02-04 20:30:51,544 WARN L1011 $PredicateComparison]: unable to prove that (and (= |c_~#list~0.base| |c_old(~#list~0.base)|) (= |c_#valid| |c_old(#valid)|) (exists ((%0 (Array Int Int))) (! (and (= |c_calloc_model_#in~size| 8) (= |c_calloc_model_#in~nmemb| 1) (forall ((%1 Int)) (! (= (store %0 %1 8) (store |c_#length| %1 8)) :qid itp))) :qid itp)) (= |c_~#list~0.offset| |c_old(~#list~0.offset)|) (= |c_#NULL.base| |c_old(#NULL.base)|) (= |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:30:52,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:30:52,954 INFO L93 Difference]: Finished difference Result 438 states and 533 transitions. [2018-02-04 20:30:52,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 20:30:52,954 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 17 [2018-02-04 20:30:52,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:30:52,957 INFO L225 Difference]: With dead ends: 438 [2018-02-04 20:30:52,957 INFO L226 Difference]: Without dead ends: 438 [2018-02-04 20:30:52,957 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=4, NotChecked=22, Total=182 [2018-02-04 20:30:52,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2018-02-04 20:30:52,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 394. [2018-02-04 20:30:52,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2018-02-04 20:30:52,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 504 transitions. [2018-02-04 20:30:52,968 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 504 transitions. Word has length 17 [2018-02-04 20:30:52,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:30:52,968 INFO L432 AbstractCegarLoop]: Abstraction has 394 states and 504 transitions. [2018-02-04 20:30:52,969 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 20:30:52,969 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 504 transitions. [2018-02-04 20:30:52,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-02-04 20:30:52,971 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:30:52,972 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:30:52,975 INFO L371 AbstractCegarLoop]: === Iteration 5 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-04 20:30:52,975 INFO L82 PathProgramCache]: Analyzing trace with hash 1692980033, 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:30:52,980 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:30:53,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:30:53,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:30:53,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:30:53,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:30:53,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:30:53,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:30:53,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:30:53,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:30:53,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:30:53,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:30:53,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:30:53,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:30:53,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:30:53,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:30:53,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:30:53,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:30:53,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:30:53,266 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:30:53,283 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 20:30:53,284 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-04 20:30:53,284 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:30:53,285 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:30:53,285 INFO L182 omatonBuilderFactory]: Interpolants [3408#(= 0 |#Ultimate.C_memset_#t~loopctr48|), 3409#(<= |#Ultimate.C_memset_#amount| 0), 3219#true, 3220#false, 3316#(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)|)), 3317#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 3335#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 3400#(not (= 8 |zalloc_or_die_#in~size|)), 3401#(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)))), 3387#(= zalloc_or_die_~size |zalloc_or_die_#in~size|), 3407#(or (not (= |calloc_model_#in~nmemb| 1)) (not (= (mod |calloc_model_#in~size| 4294967296) 8)))] [2018-02-04 20:30:53,285 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:30:53,285 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 20:30:53,286 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 20:30:53,286 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-02-04 20:30:53,286 INFO L87 Difference]: Start difference. First operand 394 states and 504 transitions. Second operand 11 states. [2018-02-04 20:30:54,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:30:54,472 INFO L93 Difference]: Finished difference Result 452 states and 546 transitions. [2018-02-04 20:30:54,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 20:30:54,473 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 129 [2018-02-04 20:30:54,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:30:54,474 INFO L225 Difference]: With dead ends: 452 [2018-02-04 20:30:54,474 INFO L226 Difference]: Without dead ends: 445 [2018-02-04 20:30:54,474 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:30:54,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2018-02-04 20:30:54,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 397. [2018-02-04 20:30:54,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2018-02-04 20:30:54,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 508 transitions. [2018-02-04 20:30:54,490 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 508 transitions. Word has length 129 [2018-02-04 20:30:54,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:30:54,490 INFO L432 AbstractCegarLoop]: Abstraction has 397 states and 508 transitions. [2018-02-04 20:30:54,490 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 20:30:54,490 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 508 transitions. [2018-02-04 20:30:54,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-02-04 20:30:54,493 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:30:54,494 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:30:54,494 INFO L371 AbstractCegarLoop]: === Iteration 6 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-04 20:30:54,494 INFO L82 PathProgramCache]: Analyzing trace with hash 1606511897, 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) [2018-02-04 20:30:54,499 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:30:54,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:30:54,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:30:54,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:30:54,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:30:54,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:30:54,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:30:54,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:30:54,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:30:54,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:30:54,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:30:54,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:30:54,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:30:54,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:30:54,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:30:54,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:30:54,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:30:54,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:30:54,777 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:30:54,794 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:30:54,794 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-04 20:30:54,794 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:30:54,795 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:30:54,795 INFO L182 omatonBuilderFactory]: Interpolants [4384#(= |zalloc_or_die_#in~size| zalloc_or_die_~size), 4406#(not (= (mod (* (mod |calloc_model_#in~nmemb| 4294967296) (mod |calloc_model_#in~size| 4294967296)) 4294967296) 8)), 4407#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 4280#true, 4408#(= 0 |#Ultimate.C_memset_#t~loopctr48|), 4281#false, 4409#(= 1 |#Ultimate.C_memset_#t~loopctr48|), 4410#(not (= 8 |#Ultimate.C_memset_#amount|)), 4382#(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)|)), 4398#(not (= 8 |zalloc_or_die_#in~size|)), 4383#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 4399#(= (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:30:54,795 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:30:54,795 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 20:30:54,795 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 20:30:54,796 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-02-04 20:30:54,796 INFO L87 Difference]: Start difference. First operand 397 states and 508 transitions. Second operand 12 states. [2018-02-04 20:30:55,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:30:55,968 INFO L93 Difference]: Finished difference Result 458 states and 553 transitions. [2018-02-04 20:30:55,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 20:30:55,968 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 134 [2018-02-04 20:30:55,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:30:55,969 INFO L225 Difference]: With dead ends: 458 [2018-02-04 20:30:55,969 INFO L226 Difference]: Without dead ends: 451 [2018-02-04 20:30:55,970 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=97, Invalid=455, Unknown=0, NotChecked=0, Total=552 [2018-02-04 20:30:55,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2018-02-04 20:30:55,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 398. [2018-02-04 20:30:55,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2018-02-04 20:30:55,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 510 transitions. [2018-02-04 20:30:55,980 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 510 transitions. Word has length 134 [2018-02-04 20:30:55,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:30:55,980 INFO L432 AbstractCegarLoop]: Abstraction has 398 states and 510 transitions. [2018-02-04 20:30:55,980 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 20:30:55,980 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 510 transitions. [2018-02-04 20:30:55,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-02-04 20:30:55,982 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:30:55,982 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:30:55,982 INFO L371 AbstractCegarLoop]: === Iteration 7 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-04 20:30:55,982 INFO L82 PathProgramCache]: Analyzing trace with hash 1897967041, 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:30:55,988 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:30:56,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:30:56,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:30:56,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:30:56,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:30:56,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:30:56,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:30:56,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:30:56,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:30:56,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:30:56,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:30:56,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:30:56,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:30:56,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:30:56,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:30:56,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:30:56,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:30:56,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:30:56,250 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:30:56,267 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:30:56,267 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-04 20:30:56,267 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:30:56,267 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:30:56,268 INFO L182 omatonBuilderFactory]: Interpolants [5504#(<= |#Ultimate.C_memset_#t~loopctr48| 1), 5505#(<= |#Ultimate.C_memset_#t~loopctr48| 2), 5506#(not (= 8 |#Ultimate.C_memset_#amount|)), 5475#(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)|)), 5476#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 5477#(= |zalloc_or_die_#in~size| zalloc_or_die_~size), 5492#(not (= 8 |zalloc_or_die_#in~size|)), 5493#(= (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)), 5368#true, 5369#false, 5501#(not (= (mod (* (mod |calloc_model_#in~nmemb| 4294967296) (mod |calloc_model_#in~size| 4294967296)) 4294967296) 8)), 5502#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 5503#(= 0 |#Ultimate.C_memset_#t~loopctr48|)] [2018-02-04 20:30:56,268 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:30:56,268 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 20:30:56,268 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 20:30:56,268 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-02-04 20:30:56,268 INFO L87 Difference]: Start difference. First operand 398 states and 510 transitions. Second operand 13 states. [2018-02-04 20:30:57,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:30:57,498 INFO L93 Difference]: Finished difference Result 461 states and 557 transitions. [2018-02-04 20:30:57,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-04 20:30:57,499 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 139 [2018-02-04 20:30:57,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:30:57,500 INFO L225 Difference]: With dead ends: 461 [2018-02-04 20:30:57,500 INFO L226 Difference]: Without dead ends: 454 [2018-02-04 20:30:57,501 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=114, Invalid=536, Unknown=0, NotChecked=0, Total=650 [2018-02-04 20:30:57,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2018-02-04 20:30:57,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 399. [2018-02-04 20:30:57,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2018-02-04 20:30:57,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 512 transitions. [2018-02-04 20:30:57,510 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 512 transitions. Word has length 139 [2018-02-04 20:30:57,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:30:57,510 INFO L432 AbstractCegarLoop]: Abstraction has 399 states and 512 transitions. [2018-02-04 20:30:57,510 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 20:30:57,510 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 512 transitions. [2018-02-04 20:30:57,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-02-04 20:30:57,512 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:30:57,512 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:30:57,512 INFO L371 AbstractCegarLoop]: === Iteration 8 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-04 20:30:57,512 INFO L82 PathProgramCache]: Analyzing trace with hash -33064807, 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:30:57,516 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:30:57,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:30:57,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:30:57,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:30:57,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:30:57,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:30:57,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:30:57,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:30:57,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:30:57,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:30:57,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:30:57,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:30:57,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:30:57,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:30:57,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:30:57,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:30:57,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:30:57,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:30:57,786 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:30:57,803 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:30:57,803 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-04 20:30:57,804 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:30:57,804 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:30:57,804 INFO L182 omatonBuilderFactory]: Interpolants [6592#(= |zalloc_or_die_#in~size| zalloc_or_die_~size), 6624#(<= |#Ultimate.C_memset_#amount| 3), 6478#true, 6479#false, 6608#(not (= 8 |zalloc_or_die_#in~size|)), 6609#(= (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)), 6618#(not (= (mod (* (mod |calloc_model_#in~nmemb| 4294967296) (mod |calloc_model_#in~size| 4294967296)) 4294967296) 8)), 6619#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 6620#(= 0 |#Ultimate.C_memset_#t~loopctr48|), 6621#(= 1 |#Ultimate.C_memset_#t~loopctr48|), 6590#(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)|)), 6622#(= |#Ultimate.C_memset_#t~loopctr48| 2), 6591#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 6623#(or (and (<= |#Ultimate.C_memset_#amount| 3) (<= |#Ultimate.C_memset_#amount| |#Ultimate.C_memset_#t~loopctr48|)) (and (< 3 |#Ultimate.C_memset_#amount|) (< |#Ultimate.C_memset_#t~loopctr48| |#Ultimate.C_memset_#amount|)))] [2018-02-04 20:30:57,804 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:30:57,804 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 20:30:57,804 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 20:30:57,805 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2018-02-04 20:30:57,805 INFO L87 Difference]: Start difference. First operand 399 states and 512 transitions. Second operand 14 states. [2018-02-04 20:30:59,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:30:59,218 INFO L93 Difference]: Finished difference Result 464 states and 561 transitions. [2018-02-04 20:30:59,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-04 20:30:59,219 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 144 [2018-02-04 20:30:59,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:30:59,221 INFO L225 Difference]: With dead ends: 464 [2018-02-04 20:30:59,221 INFO L226 Difference]: Without dead ends: 457 [2018-02-04 20:30:59,221 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=115, Invalid=641, Unknown=0, NotChecked=0, Total=756 [2018-02-04 20:30:59,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2018-02-04 20:30:59,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 400. [2018-02-04 20:30:59,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2018-02-04 20:30:59,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 514 transitions. [2018-02-04 20:30:59,228 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 514 transitions. Word has length 144 [2018-02-04 20:30:59,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:30:59,228 INFO L432 AbstractCegarLoop]: Abstraction has 400 states and 514 transitions. [2018-02-04 20:30:59,229 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 20:30:59,229 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 514 transitions. [2018-02-04 20:30:59,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-02-04 20:30:59,229 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:30:59,230 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:30:59,230 INFO L371 AbstractCegarLoop]: === Iteration 9 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-04 20:30:59,230 INFO L82 PathProgramCache]: Analyzing trace with hash 876333121, 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) [2018-02-04 20:30:59,237 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:30:59,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:30:59,479 WARN L143 SmtUtils]: Spent 167ms on a formula simplification that was a NOOP. DAG size: 25 [2018-02-04 20:30:59,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:30:59,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:30:59,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:30:59,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:30:59,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:30:59,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:30:59,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:30:59,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:30:59,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:30:59,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:30:59,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:30:59,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:30:59,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:30:59,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:30:59,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:30:59,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:30:59,733 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:30:59,764 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:30:59,765 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-04 20:30:59,765 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:30:59,765 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:30:59,765 INFO L182 omatonBuilderFactory]: Interpolants [7746#(not (= 8 |zalloc_or_die_#in~size|)), 7747#(= (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)), 7757#(not (= (mod (* (mod |calloc_model_#in~nmemb| 4294967296) (mod |calloc_model_#in~size| 4294967296)) 4294967296) 8)), 7758#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 7727#(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)|)), 7759#(= 0 |#Ultimate.C_memset_#t~loopctr48|), 7728#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 7760#(= 1 |#Ultimate.C_memset_#t~loopctr48|), 7729#(= |zalloc_or_die_#in~size| zalloc_or_die_~size), 7761#(= |#Ultimate.C_memset_#t~loopctr48| 2), 7762#(<= |#Ultimate.C_memset_#t~loopctr48| 3), 7763#(<= |#Ultimate.C_memset_#t~loopctr48| 4), 7764#(not (= 8 |#Ultimate.C_memset_#amount|)), 7610#true, 7611#false] [2018-02-04 20:30:59,766 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:30:59,766 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 20:30:59,766 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 20:30:59,766 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2018-02-04 20:30:59,766 INFO L87 Difference]: Start difference. First operand 400 states and 514 transitions. Second operand 15 states. [2018-02-04 20:31:00,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:31:00,823 INFO L93 Difference]: Finished difference Result 467 states and 565 transitions. [2018-02-04 20:31:00,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-04 20:31:00,823 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 149 [2018-02-04 20:31:00,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:31:00,824 INFO L225 Difference]: With dead ends: 467 [2018-02-04 20:31:00,824 INFO L226 Difference]: Without dead ends: 460 [2018-02-04 20:31:00,824 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:31:00,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2018-02-04 20:31:00,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 401. [2018-02-04 20:31:00,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 401 states. [2018-02-04 20:31:00,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 516 transitions. [2018-02-04 20:31:00,830 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 516 transitions. Word has length 149 [2018-02-04 20:31:00,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:31:00,831 INFO L432 AbstractCegarLoop]: Abstraction has 401 states and 516 transitions. [2018-02-04 20:31:00,831 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 20:31:00,831 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 516 transitions. [2018-02-04 20:31:00,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-02-04 20:31:00,832 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:31:00,833 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:31:00,833 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, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-04 20:31:00,833 INFO L82 PathProgramCache]: Analyzing trace with hash -1133755367, 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:31:00,836 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:31:00,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:00,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:00,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:00,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:00,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:01,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:01,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:01,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:01,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:01,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:01,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:01,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:01,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:01,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:01,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:01,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:01,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:01,105 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:31:01,124 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:31:01,125 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-04 20:31:01,125 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:31:01,125 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:31:01,125 INFO L182 omatonBuilderFactory]: Interpolants [8906#(not (= 8 |zalloc_or_die_#in~size|)), 8907#(= (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)), 8886#(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)|)), 8918#(not (= (mod (* (mod |calloc_model_#in~nmemb| 4294967296) (mod |calloc_model_#in~size| 4294967296)) 4294967296) 8)), 8887#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 8919#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 8888#(= |zalloc_or_die_#in~size| zalloc_or_die_~size), 8920#(= 0 |#Ultimate.C_memset_#t~loopctr48|), 8921#(= 1 |#Ultimate.C_memset_#t~loopctr48|), 8922#(<= |#Ultimate.C_memset_#t~loopctr48| 2), 8923#(<= |#Ultimate.C_memset_#t~loopctr48| 3), 8764#true, 8924#(<= |#Ultimate.C_memset_#t~loopctr48| 4), 8765#false, 8925#(<= |#Ultimate.C_memset_#t~loopctr48| 5), 8926#(not (= 8 |#Ultimate.C_memset_#amount|))] [2018-02-04 20:31:01,125 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:31:01,126 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 20:31:01,126 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 20:31:01,126 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2018-02-04 20:31:01,126 INFO L87 Difference]: Start difference. First operand 401 states and 516 transitions. Second operand 16 states. [2018-02-04 20:31:02,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:31:02,581 INFO L93 Difference]: Finished difference Result 470 states and 569 transitions. [2018-02-04 20:31:02,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-04 20:31:02,581 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 154 [2018-02-04 20:31:02,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:31:02,583 INFO L225 Difference]: With dead ends: 470 [2018-02-04 20:31:02,583 INFO L226 Difference]: Without dead ends: 463 [2018-02-04 20:31:02,584 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=167, Invalid=825, Unknown=0, NotChecked=0, Total=992 [2018-02-04 20:31:02,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2018-02-04 20:31:02,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 402. [2018-02-04 20:31:02,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 402 states. [2018-02-04 20:31:02,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 518 transitions. [2018-02-04 20:31:02,592 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 518 transitions. Word has length 154 [2018-02-04 20:31:02,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:31:02,592 INFO L432 AbstractCegarLoop]: Abstraction has 402 states and 518 transitions. [2018-02-04 20:31:02,592 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 20:31:02,592 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 518 transitions. [2018-02-04 20:31:02,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-02-04 20:31:02,594 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:31:02,594 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:31:02,594 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, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-04 20:31:02,594 INFO L82 PathProgramCache]: Analyzing trace with hash -1934482751, 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:31:02,604 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:31:02,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:02,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:02,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:02,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:02,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:02,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:02,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:02,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:02,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:02,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:02,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:02,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:02,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:02,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:02,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:02,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:02,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:02,907 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:31:02,923 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:31:02,923 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-04 20:31:02,923 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:31:02,924 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:31:02,924 INFO L182 omatonBuilderFactory]: Interpolants [10088#(not (= 8 |zalloc_or_die_#in~size|)), 10089#(= (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)), 10067#(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)|)), 9940#true, 10068#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 9941#false, 10069#(= |zalloc_or_die_#in~size| zalloc_or_die_~size), 10101#(not (= (mod (* (mod |calloc_model_#in~nmemb| 4294967296) (mod |calloc_model_#in~size| 4294967296)) 4294967296) 8)), 10102#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 10103#(= 0 |#Ultimate.C_memset_#t~loopctr48|), 10104#(= 1 |#Ultimate.C_memset_#t~loopctr48|), 10105#(= |#Ultimate.C_memset_#t~loopctr48| 2), 10106#(= |#Ultimate.C_memset_#t~loopctr48| 3), 10107#(<= |#Ultimate.C_memset_#t~loopctr48| 4), 10108#(<= |#Ultimate.C_memset_#t~loopctr48| 5), 10109#(<= |#Ultimate.C_memset_#t~loopctr48| 6), 10110#(not (= 8 |#Ultimate.C_memset_#amount|))] [2018-02-04 20:31:02,924 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:31:02,924 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 20:31:02,924 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 20:31:02,924 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2018-02-04 20:31:02,925 INFO L87 Difference]: Start difference. First operand 402 states and 518 transitions. Second operand 17 states. [2018-02-04 20:31:04,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:31:04,109 INFO L93 Difference]: Finished difference Result 473 states and 573 transitions. [2018-02-04 20:31:04,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-04 20:31:04,109 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 159 [2018-02-04 20:31:04,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:31:04,110 INFO L225 Difference]: With dead ends: 473 [2018-02-04 20:31:04,111 INFO L226 Difference]: Without dead ends: 466 [2018-02-04 20:31:04,111 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=175, Invalid=947, Unknown=0, NotChecked=0, Total=1122 [2018-02-04 20:31:04,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2018-02-04 20:31:04,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 403. [2018-02-04 20:31:04,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2018-02-04 20:31:04,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 520 transitions. [2018-02-04 20:31:04,119 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 520 transitions. Word has length 159 [2018-02-04 20:31:04,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:31:04,119 INFO L432 AbstractCegarLoop]: Abstraction has 403 states and 520 transitions. [2018-02-04 20:31:04,119 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 20:31:04,120 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 520 transitions. [2018-02-04 20:31:04,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-02-04 20:31:04,121 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:31:04,122 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:31:04,122 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, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-04 20:31:04,122 INFO L82 PathProgramCache]: Analyzing trace with hash -1837641831, 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:31:04,125 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:31:04,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:04,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:04,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:04,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:04,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:04,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:04,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:04,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:04,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:04,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:04,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:04,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:04,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:04,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:04,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:04,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:04,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:04,407 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:31:04,423 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:31:04,424 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-04 20:31:04,424 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:31:04,424 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:31:04,424 INFO L182 omatonBuilderFactory]: Interpolants [11138#true, 11139#false, 11270#(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)|)), 11271#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 11272#(= |zalloc_or_die_#in~size| zalloc_or_die_~size), 11306#(not (= (mod (* (mod |calloc_model_#in~nmemb| 4294967296) (mod |calloc_model_#in~size| 4294967296)) 4294967296) 8)), 11307#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 11308#(= 0 |#Ultimate.C_memset_#t~loopctr48|), 11309#(= 1 |#Ultimate.C_memset_#t~loopctr48|), 11310#(= |#Ultimate.C_memset_#t~loopctr48| 2), 11311#(= |#Ultimate.C_memset_#t~loopctr48| 3), 11312#(= 4 |#Ultimate.C_memset_#t~loopctr48|), 11313#(<= |#Ultimate.C_memset_#t~loopctr48| 5), 11314#(<= |#Ultimate.C_memset_#t~loopctr48| 6), 11315#(<= |#Ultimate.C_memset_#t~loopctr48| 7), 11316#(not (= 8 |#Ultimate.C_memset_#amount|)), 11292#(not (= 8 |zalloc_or_die_#in~size|)), 11293#(= (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:31:04,424 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:31:04,425 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 20:31:04,425 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 20:31:04,425 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2018-02-04 20:31:04,425 INFO L87 Difference]: Start difference. First operand 403 states and 520 transitions. Second operand 18 states. [2018-02-04 20:31:05,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:31:05,740 INFO L93 Difference]: Finished difference Result 476 states and 577 transitions. [2018-02-04 20:31:05,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-04 20:31:05,740 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 164 [2018-02-04 20:31:05,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:31:05,742 INFO L225 Difference]: With dead ends: 476 [2018-02-04 20:31:05,742 INFO L226 Difference]: Without dead ends: 469 [2018-02-04 20:31:05,742 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:31:05,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2018-02-04 20:31:05,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 404. [2018-02-04 20:31:05,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 404 states. [2018-02-04 20:31:05,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 522 transitions. [2018-02-04 20:31:05,750 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 522 transitions. Word has length 164 [2018-02-04 20:31:05,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:31:05,751 INFO L432 AbstractCegarLoop]: Abstraction has 404 states and 522 transitions. [2018-02-04 20:31:05,751 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 20:31:05,751 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 522 transitions. [2018-02-04 20:31:05,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-02-04 20:31:05,752 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:31:05,752 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:31:05,752 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, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-04 20:31:05,752 INFO L82 PathProgramCache]: Analyzing trace with hash 1828437313, 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:31:05,757 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:31:05,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:05,812 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:31:05,817 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 20:31:05,817 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 20:31:05,817 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 20:31:05,817 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 20:31:05,824 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 20:31:05,824 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 20:31:05,825 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 20:31:05,825 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 20:31:05,827 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-02-04 20:31:05,827 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 20:31:05,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:05,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:05,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:05,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:05,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:05,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:05,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:05,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:05,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:05,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:05,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:05,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:05,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:05,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:05,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:05,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:05,999 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:31:06,014 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:31:06,015 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-04 20:31:06,015 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:31:06,015 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:31:06,015 INFO L182 omatonBuilderFactory]: Interpolants [12496#(= 119 zalloc_or_die_~size), 12497#(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)), 12498#(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)), 12499#(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|)), 12500#(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)))), 12501#(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)|)), 12358#true, 12502#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 12359#false, 12536#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 12495#(= |zalloc_or_die_#in~size| 119)] [2018-02-04 20:31:06,015 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:31:06,015 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 20:31:06,016 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 20:31:06,016 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=85, Unknown=3, NotChecked=0, Total=110 [2018-02-04 20:31:06,016 INFO L87 Difference]: Start difference. First operand 404 states and 522 transitions. Second operand 11 states. [2018-02-04 20:31:06,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:31:06,940 INFO L93 Difference]: Finished difference Result 453 states and 554 transitions. [2018-02-04 20:31:06,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 20:31:06,940 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 169 [2018-02-04 20:31:06,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:31:06,942 INFO L225 Difference]: With dead ends: 453 [2018-02-04 20:31:06,942 INFO L226 Difference]: Without dead ends: 453 [2018-02-04 20:31:06,942 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=287, Unknown=16, NotChecked=0, Total=380 [2018-02-04 20:31:06,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2018-02-04 20:31:06,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 403. [2018-02-04 20:31:06,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2018-02-04 20:31:06,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 521 transitions. [2018-02-04 20:31:06,950 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 521 transitions. Word has length 169 [2018-02-04 20:31:06,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:31:06,951 INFO L432 AbstractCegarLoop]: Abstraction has 403 states and 521 transitions. [2018-02-04 20:31:06,951 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 20:31:06,951 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 521 transitions. [2018-02-04 20:31:06,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-02-04 20:31:06,952 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:31:06,952 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:31:06,952 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, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-04 20:31:06,952 INFO L82 PathProgramCache]: Analyzing trace with hash -1641286287, 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:31:06,955 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:31:06,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:07,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:07,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:07,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:07,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:07,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:07,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:07,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:07,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:07,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:07,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:07,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:07,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:07,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:07,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:07,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:07,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:07,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:07,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:07,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:07,190 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:31:07,207 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 20:31:07,207 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-04 20:31:07,207 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:31:07,207 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:31:07,207 INFO L182 omatonBuilderFactory]: Interpolants [13888#(<= |#Ultimate.C_memset_#amount| 0), 13698#(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)|)), 13699#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 13733#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 13543#true, 13879#(not (= 119 |zalloc_or_die_#in~size|)), 13544#false, 13880#(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))), 13866#(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))), 13886#(or (not (= (mod |calloc_model_#in~nmemb| 4294967296) 1)) (not (= |calloc_model_#in~size| 119))), 13887#(= 0 |#Ultimate.C_memset_#t~loopctr48|)] [2018-02-04 20:31:07,208 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:31:07,208 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 20:31:07,208 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 20:31:07,208 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-02-04 20:31:07,208 INFO L87 Difference]: Start difference. First operand 403 states and 521 transitions. Second operand 11 states. [2018-02-04 20:31:09,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:31:09,968 INFO L93 Difference]: Finished difference Result 453 states and 553 transitions. [2018-02-04 20:31:09,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 20:31:09,969 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 182 [2018-02-04 20:31:09,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:31:09,970 INFO L225 Difference]: With dead ends: 453 [2018-02-04 20:31:09,971 INFO L226 Difference]: Without dead ends: 444 [2018-02-04 20:31:09,971 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=332, Unknown=0, NotChecked=0, Total=420 [2018-02-04 20:31:09,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2018-02-04 20:31:09,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 403. [2018-02-04 20:31:09,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2018-02-04 20:31:09,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 520 transitions. [2018-02-04 20:31:09,985 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 520 transitions. Word has length 182 [2018-02-04 20:31:09,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:31:09,986 INFO L432 AbstractCegarLoop]: Abstraction has 403 states and 520 transitions. [2018-02-04 20:31:09,986 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 20:31:09,986 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 520 transitions. [2018-02-04 20:31:09,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-02-04 20:31:09,987 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:31:09,987 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:31:09,988 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, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-04 20:31:09,988 INFO L82 PathProgramCache]: Analyzing trace with hash 1191265081, 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) [2018-02-04 20:31:09,998 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:31:10,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:10,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:10,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:10,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:10,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:10,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:10,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:10,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:10,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:10,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:10,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:10,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:10,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:10,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:10,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:10,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:10,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:10,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:10,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:10,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:10,343 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:31:10,358 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:31:10,358 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-04 20:31:10,358 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:31:10,359 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:31:10,359 INFO L182 omatonBuilderFactory]: Interpolants [15104#(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))), 15089#(= zalloc_or_die_~size |zalloc_or_die_#in~size|), 15111#(or (not (= (mod |calloc_model_#in~nmemb| 4294967296) 1)) (not (= |calloc_model_#in~size| 119))), 15112#(= 0 |#Ultimate.C_memset_#t~loopctr48|), 14921#(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)|)), 15113#(and (or (and (< |#Ultimate.C_memset_#t~loopctr48| |#Ultimate.C_memset_#amount|) (< 1 |#Ultimate.C_memset_#amount|)) (and (<= |#Ultimate.C_memset_#amount| 1) (<= |#Ultimate.C_memset_#amount| |#Ultimate.C_memset_#t~loopctr48|))) (< 0 |#Ultimate.C_memset_#amount|)), 14922#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 15114#(= 1 |#Ultimate.C_memset_#amount|), 14956#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 14765#true, 14766#false, 15103#(not (= |zalloc_or_die_#in~size| 119))] [2018-02-04 20:31:10,359 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:31:10,359 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 20:31:10,359 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 20:31:10,359 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-02-04 20:31:10,360 INFO L87 Difference]: Start difference. First operand 403 states and 520 transitions. Second operand 12 states. [2018-02-04 20:31:13,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:31:13,241 INFO L93 Difference]: Finished difference Result 453 states and 552 transitions. [2018-02-04 20:31:13,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-04 20:31:13,241 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 183 [2018-02-04 20:31:13,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:31:13,242 INFO L225 Difference]: With dead ends: 453 [2018-02-04 20:31:13,242 INFO L226 Difference]: Without dead ends: 444 [2018-02-04 20:31:13,243 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2018-02-04 20:31:13,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2018-02-04 20:31:13,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 403. [2018-02-04 20:31:13,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2018-02-04 20:31:13,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 519 transitions. [2018-02-04 20:31:13,247 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 519 transitions. Word has length 183 [2018-02-04 20:31:13,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:31:13,247 INFO L432 AbstractCegarLoop]: Abstraction has 403 states and 519 transitions. [2018-02-04 20:31:13,248 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 20:31:13,248 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 519 transitions. [2018-02-04 20:31:13,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-02-04 20:31:13,248 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:31:13,248 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:31:13,248 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, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-04 20:31:13,248 INFO L82 PathProgramCache]: Analyzing trace with hash -1193955727, 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:31:13,251 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:31:13,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:13,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:13,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:13,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:13,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:13,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:13,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:13,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:13,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:13,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:13,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:13,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:13,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:13,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:13,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:13,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:13,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:13,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:13,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:13,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:13,505 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:31:13,520 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:31:13,521 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-04 20:31:13,521 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:31:13,521 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:31:13,521 INFO L182 omatonBuilderFactory]: Interpolants [16331#(not (= |zalloc_or_die_#in~size| 119)), 16332#(= (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)), 16148#(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)|)), 16340#(not (= (mod (* (mod |calloc_model_#in~nmemb| 4294967296) (mod |calloc_model_#in~size| 4294967296)) 4294967296) 119)), 16149#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 16341#(= 0 |#Ultimate.C_memset_#t~loopctr48|), 16342#(<= |#Ultimate.C_memset_#t~loopctr48| 1), 15991#true, 16183#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 16343#(<= |#Ultimate.C_memset_#t~loopctr48| 2), 15992#false, 16344#(not (= |#Ultimate.C_memset_#amount| 119)), 16316#(= zalloc_or_die_~size |zalloc_or_die_#in~size|)] [2018-02-04 20:31:13,522 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:31:13,522 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 20:31:13,522 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 20:31:13,522 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-02-04 20:31:13,522 INFO L87 Difference]: Start difference. First operand 403 states and 519 transitions. Second operand 13 states. [2018-02-04 20:31:14,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:31:14,561 INFO L93 Difference]: Finished difference Result 453 states and 551 transitions. [2018-02-04 20:31:14,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-04 20:31:14,562 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 184 [2018-02-04 20:31:14,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:31:14,564 INFO L225 Difference]: With dead ends: 453 [2018-02-04 20:31:14,564 INFO L226 Difference]: Without dead ends: 444 [2018-02-04 20:31:14,564 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2018-02-04 20:31:14,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2018-02-04 20:31:14,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 403. [2018-02-04 20:31:14,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2018-02-04 20:31:14,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 518 transitions. [2018-02-04 20:31:14,572 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 518 transitions. Word has length 184 [2018-02-04 20:31:14,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:31:14,572 INFO L432 AbstractCegarLoop]: Abstraction has 403 states and 518 transitions. [2018-02-04 20:31:14,572 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 20:31:14,572 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 518 transitions. [2018-02-04 20:31:14,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-02-04 20:31:14,573 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:31:14,573 INFO L351 BasicCegarLoop]: trace histogram [43, 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:31:14,574 INFO L371 AbstractCegarLoop]: === Iteration 17 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-04 20:31:14,574 INFO L82 PathProgramCache]: Analyzing trace with hash -2121356743, now seen corresponding path program 4 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:31:14,577 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:31:14,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:14,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:14,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:14,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:14,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:14,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:14,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:14,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:14,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:14,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:14,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:14,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:14,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:14,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:14,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:14,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:14,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:14,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:14,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:14,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:14,953 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 245 proven. 6 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2018-02-04 20:31:14,969 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:31:14,969 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-04 20:31:14,969 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:31:14,970 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2018-02-04 20:31:14,970 INFO L182 omatonBuilderFactory]: Interpolants [17377#(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)|)), 17378#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 17219#true, 17571#(or (not (= |calloc_model_#in~nmemb| 1)) (not (= (mod |calloc_model_#in~size| 4294967296) 119))), 17220#false, 17412#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 17572#(= 0 |#Ultimate.C_memset_#t~loopctr48|), 17573#(= 1 |#Ultimate.C_memset_#t~loopctr48|), 17574#(and (<= |#Ultimate.C_memset_#t~loopctr48| 2) (<= 2 |#Ultimate.C_memset_#t~loopctr48|)), 17575#(and (< 2 |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#t~loopctr48| 3)), 17576#(and (< 2 |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#amount| 3)), 17545#(= zalloc_or_die_~size |zalloc_or_die_#in~size|), 17561#(not (= |zalloc_or_die_#in~size| 119)), 17562#(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:31:14,971 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 245 proven. 6 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2018-02-04 20:31:14,971 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 20:31:14,971 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 20:31:14,971 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2018-02-04 20:31:14,971 INFO L87 Difference]: Start difference. First operand 403 states and 518 transitions. Second operand 14 states. [2018-02-04 20:31:16,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:31:16,067 INFO L93 Difference]: Finished difference Result 453 states and 550 transitions. [2018-02-04 20:31:16,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-04 20:31:16,067 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 185 [2018-02-04 20:31:16,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:31:16,069 INFO L225 Difference]: With dead ends: 453 [2018-02-04 20:31:16,069 INFO L226 Difference]: Without dead ends: 444 [2018-02-04 20:31:16,069 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=79, Invalid=427, Unknown=0, NotChecked=0, Total=506 [2018-02-04 20:31:16,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2018-02-04 20:31:16,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 403. [2018-02-04 20:31:16,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2018-02-04 20:31:16,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 517 transitions. [2018-02-04 20:31:16,073 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 517 transitions. Word has length 185 [2018-02-04 20:31:16,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:31:16,073 INFO L432 AbstractCegarLoop]: Abstraction has 403 states and 517 transitions. [2018-02-04 20:31:16,073 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 20:31:16,073 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 517 transitions. [2018-02-04 20:31:16,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-02-04 20:31:16,074 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:31:16,074 INFO L351 BasicCegarLoop]: trace histogram [44, 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:31:16,074 INFO L371 AbstractCegarLoop]: === Iteration 18 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-04 20:31:16,074 INFO L82 PathProgramCache]: Analyzing trace with hash -806017167, now seen corresponding path program 5 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:31:16,077 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:31:16,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:16,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:16,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:16,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:16,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:16,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:16,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:16,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:16,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:16,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:16,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:16,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:16,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:16,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:16,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:16,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:16,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:16,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:16,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:16,374 WARN L146 SmtUtils]: Spent 116ms on a formula simplification. DAG size of input: 33 DAG size of output 15 [2018-02-04 20:31:16,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:16,437 INFO L134 CoverageAnalysis]: Checked inductivity of 1480 backedges. 290 proven. 10 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2018-02-04 20:31:16,453 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:31:16,453 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-04 20:31:16,453 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:31:16,454 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2018-02-04 20:31:16,454 INFO L182 omatonBuilderFactory]: Interpolants [18795#(not (= |zalloc_or_die_#in~size| 119)), 18796#(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))), 18610#(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)|)), 18451#true, 18611#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 18452#false, 18645#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 18806#(or (not (= (mod |calloc_model_#in~nmemb| 4294967296) 1)) (not (= |calloc_model_#in~size| 119))), 18807#(= 0 |#Ultimate.C_memset_#t~loopctr48|), 18808#(= 1 |#Ultimate.C_memset_#t~loopctr48|), 18809#(<= |#Ultimate.C_memset_#t~loopctr48| 2), 18778#(= zalloc_or_die_~size |zalloc_or_die_#in~size|), 18810#(<= |#Ultimate.C_memset_#t~loopctr48| 3), 18811#(<= |#Ultimate.C_memset_#t~loopctr48| 4), 18812#(<= |#Ultimate.C_memset_#amount| 4)] [2018-02-04 20:31:16,454 INFO L134 CoverageAnalysis]: Checked inductivity of 1480 backedges. 290 proven. 10 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2018-02-04 20:31:16,454 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 20:31:16,454 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 20:31:16,455 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2018-02-04 20:31:16,455 INFO L87 Difference]: Start difference. First operand 403 states and 517 transitions. Second operand 15 states. [2018-02-04 20:31:19,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:31:19,356 INFO L93 Difference]: Finished difference Result 453 states and 549 transitions. [2018-02-04 20:31:19,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-04 20:31:19,356 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 186 [2018-02-04 20:31:19,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:31:19,357 INFO L225 Difference]: With dead ends: 453 [2018-02-04 20:31:19,357 INFO L226 Difference]: Without dead ends: 444 [2018-02-04 20:31:19,358 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=104, Invalid=496, Unknown=0, NotChecked=0, Total=600 [2018-02-04 20:31:19,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2018-02-04 20:31:19,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 403. [2018-02-04 20:31:19,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2018-02-04 20:31:19,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 516 transitions. [2018-02-04 20:31:19,364 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 516 transitions. Word has length 186 [2018-02-04 20:31:19,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:31:19,365 INFO L432 AbstractCegarLoop]: Abstraction has 403 states and 516 transitions. [2018-02-04 20:31:19,365 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 20:31:19,365 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 516 transitions. [2018-02-04 20:31:19,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-02-04 20:31:19,366 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:31:19,366 INFO L351 BasicCegarLoop]: trace histogram [45, 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:31:19,366 INFO L371 AbstractCegarLoop]: === Iteration 19 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-04 20:31:19,366 INFO L82 PathProgramCache]: Analyzing trace with hash 1314804025, now seen corresponding path program 6 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:31:19,372 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:31:19,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:19,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:19,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:19,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:19,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:19,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:19,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:19,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:19,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:19,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:19,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:19,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:19,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:19,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:19,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:19,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:19,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:19,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:19,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:19,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:19,742 INFO L134 CoverageAnalysis]: Checked inductivity of 1530 backedges. 335 proven. 15 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2018-02-04 20:31:19,758 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:31:19,758 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-04 20:31:19,758 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:31:19,758 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2018-02-04 20:31:19,758 INFO L182 omatonBuilderFactory]: Interpolants [20035#(not (= |zalloc_or_die_#in~size| 119)), 20036#(= (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)), 19689#true, 19849#(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)|)), 19690#false, 19850#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 19884#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 20047#(not (= (mod (* (mod |calloc_model_#in~nmemb| 4294967296) (mod |calloc_model_#in~size| 4294967296)) 4294967296) 119)), 20048#(= 0 |#Ultimate.C_memset_#t~loopctr48|), 20017#(= zalloc_or_die_~size |zalloc_or_die_#in~size|), 20049#(= 1 |#Ultimate.C_memset_#t~loopctr48|), 20050#(<= |#Ultimate.C_memset_#t~loopctr48| 2), 20051#(<= |#Ultimate.C_memset_#t~loopctr48| 3), 20052#(<= |#Ultimate.C_memset_#t~loopctr48| 4), 20053#(<= |#Ultimate.C_memset_#t~loopctr48| 5), 20054#(not (= |#Ultimate.C_memset_#amount| 119))] [2018-02-04 20:31:19,759 INFO L134 CoverageAnalysis]: Checked inductivity of 1530 backedges. 335 proven. 15 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2018-02-04 20:31:19,759 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 20:31:19,759 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 20:31:19,759 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2018-02-04 20:31:19,759 INFO L87 Difference]: Start difference. First operand 403 states and 516 transitions. Second operand 16 states. [2018-02-04 20:31:20,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:31:20,712 INFO L93 Difference]: Finished difference Result 453 states and 548 transitions. [2018-02-04 20:31:20,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-04 20:31:20,712 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 187 [2018-02-04 20:31:20,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:31:20,713 INFO L225 Difference]: With dead ends: 453 [2018-02-04 20:31:20,713 INFO L226 Difference]: Without dead ends: 444 [2018-02-04 20:31:20,713 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=499, Unknown=0, NotChecked=0, Total=600 [2018-02-04 20:31:20,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2018-02-04 20:31:20,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 403. [2018-02-04 20:31:20,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2018-02-04 20:31:20,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 515 transitions. [2018-02-04 20:31:20,717 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 515 transitions. Word has length 187 [2018-02-04 20:31:20,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:31:20,718 INFO L432 AbstractCegarLoop]: Abstraction has 403 states and 515 transitions. [2018-02-04 20:31:20,718 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 20:31:20,718 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 515 transitions. [2018-02-04 20:31:20,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-02-04 20:31:20,718 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:31:20,718 INFO L351 BasicCegarLoop]: trace histogram [46, 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:31:20,718 INFO L371 AbstractCegarLoop]: === Iteration 20 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-04 20:31:20,719 INFO L82 PathProgramCache]: Analyzing trace with hash -1659215759, now seen corresponding path program 7 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:31:20,727 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:31:20,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:20,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:20,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:20,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:20,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:20,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:20,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:20,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:20,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:20,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:20,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:20,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:20,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:20,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:20,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:20,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:20,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:20,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:20,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:20,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:31:26,375 INFO L134 CoverageAnalysis]: Checked inductivity of 1581 backedges. 380 proven. 21 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2018-02-04 20:31:26,391 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:31:26,391 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-04 20:31:26,391 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:31:26,392 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2018-02-04 20:31:26,392 INFO L182 omatonBuilderFactory]: Interpolants [20929#true, 20930#false, 21090#(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)|)), 21091#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 21125#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 21258#(= zalloc_or_die_~size |zalloc_or_die_#in~size|), 21290#(or (not (= |calloc_model_#in~nmemb| 1)) (not (= (mod |calloc_model_#in~size| 4294967296) 119))), 21291#(= 0 |#Ultimate.C_memset_#t~loopctr48|), 21292#(= |#Ultimate.C_memset_#t~loopctr48| 1), 21293#(and (<= |#Ultimate.C_memset_#t~loopctr48| 2) (<= 2 |#Ultimate.C_memset_#t~loopctr48|)), 21294#(and (<= 3 |#Ultimate.C_memset_#t~loopctr48|) (<= |#Ultimate.C_memset_#t~loopctr48| 3)), 21295#(and (<= 4 |#Ultimate.C_memset_#t~loopctr48|) (<= |#Ultimate.C_memset_#t~loopctr48| 4)), 21296#(and (<= 5 |#Ultimate.C_memset_#t~loopctr48|) (<= |#Ultimate.C_memset_#t~loopctr48| 5)), 21297#(and (<= (* 113 |#Ultimate.C_memset_#t~loopctr48|) (+ (div (+ (- 21474835802) (* 4294967183 |#Ultimate.C_memset_#amount|)) 4294967296) 4294967861)) (< 5 |#Ultimate.C_memset_#amount|)), 21298#(and (<= (* 4294967296 |#Ultimate.C_memset_#amount|) (+ (div (+ (- 21474835802) (* 4294967183 |#Ultimate.C_memset_#amount|)) 4294967296) (* 4294967183 |#Ultimate.C_memset_#t~loopctr48|) 4294967861)) (< 5 |#Ultimate.C_memset_#amount|)), 21277#(not (= |zalloc_or_die_#in~size| 119)), 21278#(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:31:26,392 INFO L134 CoverageAnalysis]: Checked inductivity of 1581 backedges. 380 proven. 21 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2018-02-04 20:31:26,392 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 20:31:26,393 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 20:31:26,393 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=236, Unknown=2, NotChecked=0, Total=272 [2018-02-04 20:31:26,393 INFO L87 Difference]: Start difference. First operand 403 states and 515 transitions. Second operand 17 states. [2018-02-04 20:31:40,911 WARN L143 SmtUtils]: Spent 2737ms on a formula simplification that was a NOOP. DAG size: 21 [2018-02-04 20:32:31,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:32:31,896 INFO L93 Difference]: Finished difference Result 453 states and 547 transitions. [2018-02-04 20:32:31,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-04 20:32:31,896 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 188 [2018-02-04 20:32:31,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:32:31,898 INFO L225 Difference]: With dead ends: 453 [2018-02-04 20:32:31,898 INFO L226 Difference]: Without dead ends: 444 [2018-02-04 20:32:31,898 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=85, Invalid=562, Unknown=3, NotChecked=0, Total=650 [2018-02-04 20:32:31,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2018-02-04 20:32:31,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 403. [2018-02-04 20:32:31,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2018-02-04 20:32:31,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 514 transitions. [2018-02-04 20:32:31,903 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 514 transitions. Word has length 188 [2018-02-04 20:32:31,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:32:31,904 INFO L432 AbstractCegarLoop]: Abstraction has 403 states and 514 transitions. [2018-02-04 20:32:31,904 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 20:32:31,904 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 514 transitions. [2018-02-04 20:32:31,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-02-04 20:32:31,905 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:32:31,905 INFO L351 BasicCegarLoop]: trace histogram [47, 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:32:31,905 INFO L371 AbstractCegarLoop]: === Iteration 21 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-04 20:32:31,905 INFO L82 PathProgramCache]: Analyzing trace with hash 635451449, now seen corresponding path program 8 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:32:31,912 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:32:31,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:31,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:31,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:31,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:31,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:32,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:32,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:32,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:32,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:32,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:32,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:32,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:32,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:32,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:32,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:32,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:32,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:32,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:32,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:32,253 WARN L146 SmtUtils]: Spent 171ms on a formula simplification. DAG size of input: 33 DAG size of output 15 [2018-02-04 20:32:32,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:32,357 INFO L134 CoverageAnalysis]: Checked inductivity of 1633 backedges. 425 proven. 28 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2018-02-04 20:32:32,373 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:32:32,373 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-04 20:32:32,373 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:32:32,373 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2018-02-04 20:32:32,373 INFO L182 omatonBuilderFactory]: Interpolants [22336#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 22370#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 22503#(= zalloc_or_die_~size |zalloc_or_die_#in~size|), 22537#(or (not (= (mod |calloc_model_#in~nmemb| 4294967296) 1)) (not (= |calloc_model_#in~size| 119))), 22538#(= 0 |#Ultimate.C_memset_#t~loopctr48|), 22539#(= 1 |#Ultimate.C_memset_#t~loopctr48|), 22540#(= |#Ultimate.C_memset_#t~loopctr48| 2), 22541#(<= |#Ultimate.C_memset_#t~loopctr48| 3), 22542#(<= |#Ultimate.C_memset_#t~loopctr48| 4), 22543#(<= |#Ultimate.C_memset_#t~loopctr48| 5), 22544#(<= |#Ultimate.C_memset_#t~loopctr48| 6), 22545#(<= |#Ultimate.C_memset_#t~loopctr48| 7), 22546#(<= |#Ultimate.C_memset_#amount| 7), 22523#(not (= |zalloc_or_die_#in~size| 119)), 22524#(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))), 22173#true, 22174#false, 22335#(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:32:32,374 INFO L134 CoverageAnalysis]: Checked inductivity of 1633 backedges. 425 proven. 28 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2018-02-04 20:32:32,374 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 20:32:32,374 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 20:32:32,374 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2018-02-04 20:32:32,374 INFO L87 Difference]: Start difference. First operand 403 states and 514 transitions. Second operand 18 states. [2018-02-04 20:32:34,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:32:34,891 INFO L93 Difference]: Finished difference Result 451 states and 544 transitions. [2018-02-04 20:32:34,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-04 20:32:34,891 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 189 [2018-02-04 20:32:34,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:32:34,892 INFO L225 Difference]: With dead ends: 451 [2018-02-04 20:32:34,892 INFO L226 Difference]: Without dead ends: 442 [2018-02-04 20:32:34,893 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=142, Invalid=728, Unknown=0, NotChecked=0, Total=870 [2018-02-04 20:32:34,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2018-02-04 20:32:34,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 401. [2018-02-04 20:32:34,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 401 states. [2018-02-04 20:32:34,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 511 transitions. [2018-02-04 20:32:34,896 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 511 transitions. Word has length 189 [2018-02-04 20:32:34,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:32:34,897 INFO L432 AbstractCegarLoop]: Abstraction has 401 states and 511 transitions. [2018-02-04 20:32:34,897 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 20:32:34,897 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 511 transitions. [2018-02-04 20:32:34,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-02-04 20:32:34,897 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:32:34,897 INFO L351 BasicCegarLoop]: trace histogram [48, 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:32:34,897 INFO L371 AbstractCegarLoop]: === Iteration 22 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-04 20:32:34,897 INFO L82 PathProgramCache]: Analyzing trace with hash -1244309135, now seen corresponding path program 9 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:32:34,908 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:32:34,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:34,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:34,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:34,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:34,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:34,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:34,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:34,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:34,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:34,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:34,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:35,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:35,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:35,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:35,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:35,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:35,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:35,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:35,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:35,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:35,202 INFO L134 CoverageAnalysis]: Checked inductivity of 1686 backedges. 470 proven. 36 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2018-02-04 20:32:35,217 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:32:35,218 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-04 20:32:35,218 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:32:35,218 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2018-02-04 20:32:35,218 INFO L182 omatonBuilderFactory]: Interpolants [23424#false, 23776#(= (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)), 23586#(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)|)), 23587#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 23621#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 23754#(= zalloc_or_die_~size |zalloc_or_die_#in~size|), 23790#(not (= (mod (* (mod |calloc_model_#in~nmemb| 4294967296) (mod |calloc_model_#in~size| 4294967296)) 4294967296) 119)), 23791#(= 0 |#Ultimate.C_memset_#t~loopctr48|), 23792#(<= |#Ultimate.C_memset_#t~loopctr48| 1), 23793#(<= |#Ultimate.C_memset_#t~loopctr48| 2), 23794#(<= |#Ultimate.C_memset_#t~loopctr48| 3), 23795#(<= |#Ultimate.C_memset_#t~loopctr48| 4), 23796#(<= |#Ultimate.C_memset_#t~loopctr48| 5), 23797#(<= |#Ultimate.C_memset_#t~loopctr48| 6), 23798#(<= |#Ultimate.C_memset_#t~loopctr48| 7), 23799#(<= |#Ultimate.C_memset_#t~loopctr48| 8), 23800#(not (= |#Ultimate.C_memset_#amount| 119)), 23423#true, 23775#(not (= |zalloc_or_die_#in~size| 119))] [2018-02-04 20:32:35,219 INFO L134 CoverageAnalysis]: Checked inductivity of 1686 backedges. 470 proven. 36 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2018-02-04 20:32:35,219 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 20:32:35,219 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 20:32:35,219 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2018-02-04 20:32:35,219 INFO L87 Difference]: Start difference. First operand 401 states and 511 transitions. Second operand 19 states. [2018-02-04 20:32:36,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:32:36,272 INFO L93 Difference]: Finished difference Result 455 states and 549 transitions. [2018-02-04 20:32:36,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-04 20:32:36,275 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 190 [2018-02-04 20:32:36,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:32:36,276 INFO L225 Difference]: With dead ends: 455 [2018-02-04 20:32:36,276 INFO L226 Difference]: Without dead ends: 448 [2018-02-04 20:32:36,276 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=133, Invalid=623, Unknown=0, NotChecked=0, Total=756 [2018-02-04 20:32:36,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2018-02-04 20:32:36,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 404. [2018-02-04 20:32:36,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 404 states. [2018-02-04 20:32:36,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 515 transitions. [2018-02-04 20:32:36,282 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 515 transitions. Word has length 190 [2018-02-04 20:32:36,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:32:36,282 INFO L432 AbstractCegarLoop]: Abstraction has 404 states and 515 transitions. [2018-02-04 20:32:36,282 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 20:32:36,282 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 515 transitions. [2018-02-04 20:32:36,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-02-04 20:32:36,283 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:32:36,283 INFO L351 BasicCegarLoop]: trace histogram [49, 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:32:36,283 INFO L371 AbstractCegarLoop]: === Iteration 23 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-04 20:32:36,283 INFO L82 PathProgramCache]: Analyzing trace with hash 612654905, now seen corresponding path program 10 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:32:36,290 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:32:36,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:36,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:36,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:36,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:36,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:36,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:36,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:36,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:36,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:36,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:36,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:36,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:36,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:36,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:36,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:36,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:36,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:36,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:36,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:36,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:36,563 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 515 proven. 45 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2018-02-04 20:32:36,579 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:32:36,579 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-04 20:32:36,579 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:32:36,579 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2018-02-04 20:32:36,579 INFO L182 omatonBuilderFactory]: Interpolants [25056#(<= |#Ultimate.C_memset_#t~loopctr48| 7), 25057#(<= |#Ultimate.C_memset_#t~loopctr48| 8), 25058#(<= |#Ultimate.C_memset_#t~loopctr48| 9), 25059#(not (= |#Ultimate.C_memset_#amount| 119)), 24678#true, 24679#false, 25032#(not (= |zalloc_or_die_#in~size| 119)), 25033#(and (= calloc_model_~size |calloc_model_#in~size|) (or (and (not (= calloc_model_~nmemb 1)) (not (= |calloc_model_#in~nmemb| 1))) (and (= |calloc_model_#in~nmemb| 1) (= calloc_model_~nmemb 1)))), 24842#(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)|)), 24843#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 24877#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 25010#(= zalloc_or_die_~size |zalloc_or_die_#in~size|), 25048#(or (not (= |calloc_model_#in~nmemb| 1)) (not (= |calloc_model_#in~size| 119))), 25049#(= 0 |#Ultimate.C_memset_#t~loopctr48|), 25050#(= 1 |#Ultimate.C_memset_#t~loopctr48|), 25051#(<= |#Ultimate.C_memset_#t~loopctr48| 2), 25052#(<= |#Ultimate.C_memset_#t~loopctr48| 3), 25053#(<= |#Ultimate.C_memset_#t~loopctr48| 4), 25054#(<= |#Ultimate.C_memset_#t~loopctr48| 5), 25055#(<= |#Ultimate.C_memset_#t~loopctr48| 6)] [2018-02-04 20:32:36,580 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 515 proven. 45 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2018-02-04 20:32:36,580 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-04 20:32:36,580 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-04 20:32:36,580 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=296, Unknown=0, NotChecked=0, Total=380 [2018-02-04 20:32:36,580 INFO L87 Difference]: Start difference. First operand 404 states and 515 transitions. Second operand 20 states. [2018-02-04 20:32:37,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:32:37,559 INFO L93 Difference]: Finished difference Result 455 states and 550 transitions. [2018-02-04 20:32:37,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-04 20:32:37,559 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 191 [2018-02-04 20:32:37,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:32:37,560 INFO L225 Difference]: With dead ends: 455 [2018-02-04 20:32:37,560 INFO L226 Difference]: Without dead ends: 448 [2018-02-04 20:32:37,561 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=174, Invalid=882, Unknown=0, NotChecked=0, Total=1056 [2018-02-04 20:32:37,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2018-02-04 20:32:37,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 405. [2018-02-04 20:32:37,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2018-02-04 20:32:37,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 517 transitions. [2018-02-04 20:32:37,566 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 517 transitions. Word has length 191 [2018-02-04 20:32:37,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:32:37,566 INFO L432 AbstractCegarLoop]: Abstraction has 405 states and 517 transitions. [2018-02-04 20:32:37,566 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-04 20:32:37,566 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 517 transitions. [2018-02-04 20:32:37,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-02-04 20:32:37,567 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:32:37,567 INFO L351 BasicCegarLoop]: trace histogram [50, 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:32:37,567 INFO L371 AbstractCegarLoop]: === Iteration 24 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-04 20:32:37,568 INFO L82 PathProgramCache]: Analyzing trace with hash -1951001999, now seen corresponding path program 11 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:32:37,571 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:32:37,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:37,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:37,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:37,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:37,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:37,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:37,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:37,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:37,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:37,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:37,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:37,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:37,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:37,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:37,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:37,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:37,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:37,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:37,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:37,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:37,895 INFO L134 CoverageAnalysis]: Checked inductivity of 1795 backedges. 560 proven. 55 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2018-02-04 20:32:37,911 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:32:37,911 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-04 20:32:37,911 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:32:37,912 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2018-02-04 20:32:37,912 INFO L182 omatonBuilderFactory]: Interpolants [26112#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 26146#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 26279#(= zalloc_or_die_~size |zalloc_or_die_#in~size|), 26319#(or (not (= (mod |calloc_model_#in~nmemb| 4294967296) 1)) (not (= |calloc_model_#in~size| 119))), 26320#(= 0 |#Ultimate.C_memset_#t~loopctr48|), 26321#(= 1 |#Ultimate.C_memset_#t~loopctr48|), 26322#(= |#Ultimate.C_memset_#t~loopctr48| 2), 26323#(<= |#Ultimate.C_memset_#t~loopctr48| 3), 26324#(<= |#Ultimate.C_memset_#t~loopctr48| 4), 26325#(<= |#Ultimate.C_memset_#t~loopctr48| 5), 26326#(<= |#Ultimate.C_memset_#t~loopctr48| 6), 26327#(<= |#Ultimate.C_memset_#t~loopctr48| 7), 26328#(<= |#Ultimate.C_memset_#t~loopctr48| 8), 26329#(<= |#Ultimate.C_memset_#t~loopctr48| 9), 25946#true, 26330#(<= |#Ultimate.C_memset_#t~loopctr48| 10), 25947#false, 26331#(<= |#Ultimate.C_memset_#amount| 10), 26302#(not (= |zalloc_or_die_#in~size| 119)), 26111#(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)|)), 26303#(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)))] [2018-02-04 20:32:37,912 INFO L134 CoverageAnalysis]: Checked inductivity of 1795 backedges. 560 proven. 55 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2018-02-04 20:32:37,912 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-04 20:32:37,913 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-04 20:32:37,913 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2018-02-04 20:32:37,913 INFO L87 Difference]: Start difference. First operand 405 states and 517 transitions. Second operand 21 states. [2018-02-04 20:32:42,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:32:42,913 INFO L93 Difference]: Finished difference Result 461 states and 557 transitions. [2018-02-04 20:32:42,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-04 20:32:42,913 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 192 [2018-02-04 20:32:42,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:32:42,914 INFO L225 Difference]: With dead ends: 461 [2018-02-04 20:32:42,914 INFO L226 Difference]: Without dead ends: 454 [2018-02-04 20:32:42,914 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=178, Invalid=878, Unknown=0, NotChecked=0, Total=1056 [2018-02-04 20:32:42,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2018-02-04 20:32:42,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 406. [2018-02-04 20:32:42,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 406 states. [2018-02-04 20:32:42,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 519 transitions. [2018-02-04 20:32:42,918 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 519 transitions. Word has length 192 [2018-02-04 20:32:42,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:32:42,919 INFO L432 AbstractCegarLoop]: Abstraction has 406 states and 519 transitions. [2018-02-04 20:32:42,919 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-04 20:32:42,919 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 519 transitions. [2018-02-04 20:32:42,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-02-04 20:32:42,919 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:32:42,920 INFO L351 BasicCegarLoop]: trace histogram [51, 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:32:42,920 INFO L371 AbstractCegarLoop]: === Iteration 25 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-04 20:32:42,920 INFO L82 PathProgramCache]: Analyzing trace with hash 180012601, now seen corresponding path program 12 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:32:42,922 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:32:42,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:42,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:42,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:43,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:43,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:43,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:43,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:43,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:43,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:43,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:43,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:43,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:43,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:43,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:43,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:43,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:43,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:43,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:43,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:43,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:43,540 INFO L134 CoverageAnalysis]: Checked inductivity of 1851 backedges. 605 proven. 66 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2018-02-04 20:32:43,556 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:32:43,556 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-04 20:32:43,556 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:32:43,557 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2018-02-04 20:32:43,557 INFO L182 omatonBuilderFactory]: Interpolants [27424#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 27557#(= zalloc_or_die_~size |zalloc_or_die_#in~size|), 27599#(or (not (= |calloc_model_#in~nmemb| 1)) (not (= (mod |calloc_model_#in~size| 4294967296) 119))), 27600#(= 0 |#Ultimate.C_memset_#t~loopctr48|), 27601#(= 1 |#Ultimate.C_memset_#t~loopctr48|), 27602#(= |#Ultimate.C_memset_#t~loopctr48| 2), 27603#(and (<= 3 |#Ultimate.C_memset_#t~loopctr48|) (<= |#Ultimate.C_memset_#t~loopctr48| 3)), 27604#(and (<= 4 |#Ultimate.C_memset_#t~loopctr48|) (<= |#Ultimate.C_memset_#t~loopctr48| 4)), 27605#(and (<= 5 |#Ultimate.C_memset_#t~loopctr48|) (<= |#Ultimate.C_memset_#t~loopctr48| 5)), 27606#(and (<= |#Ultimate.C_memset_#t~loopctr48| 6) (<= 6 |#Ultimate.C_memset_#t~loopctr48|)), 27223#true, 27607#(and (<= 7 |#Ultimate.C_memset_#t~loopctr48|) (<= |#Ultimate.C_memset_#t~loopctr48| 7)), 27224#false, 27608#(and (<= |#Ultimate.C_memset_#t~loopctr48| 8) (<= 8 |#Ultimate.C_memset_#t~loopctr48|)), 27609#(and (<= 9 |#Ultimate.C_memset_#t~loopctr48|) (<= |#Ultimate.C_memset_#t~loopctr48| 9)), 27610#(and (<= 10 |#Ultimate.C_memset_#t~loopctr48|) (<= |#Ultimate.C_memset_#t~loopctr48| 10)), 27611#(and (< 10 |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#t~loopctr48| 11)), 27612#(and (< 10 |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#amount| 11)), 27389#(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)|)), 27581#(not (= |zalloc_or_die_#in~size| 119)), 27390#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 27582#(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:32:43,557 INFO L134 CoverageAnalysis]: Checked inductivity of 1851 backedges. 605 proven. 66 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2018-02-04 20:32:43,557 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 20:32:43,558 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 20:32:43,558 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=418, Unknown=0, NotChecked=0, Total=462 [2018-02-04 20:32:43,558 INFO L87 Difference]: Start difference. First operand 406 states and 519 transitions. Second operand 22 states. [2018-02-04 20:32:44,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:32:44,966 INFO L93 Difference]: Finished difference Result 464 states and 561 transitions. [2018-02-04 20:32:44,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-04 20:32:44,966 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 193 [2018-02-04 20:32:44,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:32:44,967 INFO L225 Difference]: With dead ends: 464 [2018-02-04 20:32:44,967 INFO L226 Difference]: Without dead ends: 457 [2018-02-04 20:32:44,968 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=95, Invalid=835, Unknown=0, NotChecked=0, Total=930 [2018-02-04 20:32:44,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2018-02-04 20:32:44,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 407. [2018-02-04 20:32:44,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2018-02-04 20:32:44,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 521 transitions. [2018-02-04 20:32:44,972 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 521 transitions. Word has length 193 [2018-02-04 20:32:44,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:32:44,972 INFO L432 AbstractCegarLoop]: Abstraction has 407 states and 521 transitions. [2018-02-04 20:32:44,973 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 20:32:44,973 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 521 transitions. [2018-02-04 20:32:44,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-02-04 20:32:44,973 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:32:44,974 INFO L351 BasicCegarLoop]: trace histogram [52, 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:32:44,974 INFO L371 AbstractCegarLoop]: === Iteration 26 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-04 20:32:44,974 INFO L82 PathProgramCache]: Analyzing trace with hash 1816955761, now seen corresponding path program 13 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:32:44,976 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:32:45,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:45,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:45,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:45,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:45,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:45,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:45,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:45,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:45,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:45,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:45,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:45,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:45,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:45,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:45,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:45,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:45,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:45,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:45,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:45,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:45,460 INFO L134 CoverageAnalysis]: Checked inductivity of 1908 backedges. 650 proven. 78 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2018-02-04 20:32:45,477 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:32:45,477 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-04 20:32:45,477 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:32:45,477 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2018-02-04 20:32:45,477 INFO L182 omatonBuilderFactory]: Interpolants [28704#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 28837#(= zalloc_or_die_~size |zalloc_or_die_#in~size|), 28881#(or (not (= |calloc_model_#in~nmemb| 1)) (not (= (mod |calloc_model_#in~size| 4294967296) 119))), 28882#(= 0 |#Ultimate.C_memset_#t~loopctr48|), 28883#(= 1 |#Ultimate.C_memset_#t~loopctr48|), 28884#(= |#Ultimate.C_memset_#t~loopctr48| 2), 28885#(and (<= 3 |#Ultimate.C_memset_#t~loopctr48|) (<= |#Ultimate.C_memset_#t~loopctr48| 3)), 28502#true, 28886#(and (<= 4 |#Ultimate.C_memset_#t~loopctr48|) (<= |#Ultimate.C_memset_#t~loopctr48| 4)), 28503#false, 28887#(and (<= 5 |#Ultimate.C_memset_#t~loopctr48|) (<= |#Ultimate.C_memset_#t~loopctr48| 5)), 28888#(and (<= |#Ultimate.C_memset_#t~loopctr48| 6) (<= 6 |#Ultimate.C_memset_#t~loopctr48|)), 28889#(and (<= 7 |#Ultimate.C_memset_#t~loopctr48|) (<= |#Ultimate.C_memset_#t~loopctr48| 7)), 28890#(and (<= |#Ultimate.C_memset_#t~loopctr48| 8) (<= 8 |#Ultimate.C_memset_#t~loopctr48|)), 28891#(and (<= 9 |#Ultimate.C_memset_#t~loopctr48|) (<= |#Ultimate.C_memset_#t~loopctr48| 9)), 28892#(and (<= 10 |#Ultimate.C_memset_#t~loopctr48|) (<= |#Ultimate.C_memset_#t~loopctr48| 10)), 28669#(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)|)), 28893#(and (<= 11 |#Ultimate.C_memset_#t~loopctr48|) (<= |#Ultimate.C_memset_#t~loopctr48| 11)), 28670#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 28894#(and (< 11 |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#t~loopctr48| 12)), 28862#(not (= |zalloc_or_die_#in~size| 119)), 28863#(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)))), 28895#(and (< 11 |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#amount| 12))] [2018-02-04 20:32:45,478 INFO L134 CoverageAnalysis]: Checked inductivity of 1908 backedges. 650 proven. 78 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2018-02-04 20:32:45,478 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-04 20:32:45,478 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-04 20:32:45,478 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=460, Unknown=0, NotChecked=0, Total=506 [2018-02-04 20:32:45,478 INFO L87 Difference]: Start difference. First operand 407 states and 521 transitions. Second operand 23 states. [2018-02-04 20:32:46,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:32:46,804 INFO L93 Difference]: Finished difference Result 467 states and 565 transitions. [2018-02-04 20:32:46,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-04 20:32:46,804 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 194 [2018-02-04 20:32:46,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:32:46,805 INFO L225 Difference]: With dead ends: 467 [2018-02-04 20:32:46,805 INFO L226 Difference]: Without dead ends: 460 [2018-02-04 20:32:46,806 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=97, Invalid=895, Unknown=0, NotChecked=0, Total=992 [2018-02-04 20:32:46,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2018-02-04 20:32:46,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 408. [2018-02-04 20:32:46,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2018-02-04 20:32:46,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 523 transitions. [2018-02-04 20:32:46,809 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 523 transitions. Word has length 194 [2018-02-04 20:32:46,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:32:46,810 INFO L432 AbstractCegarLoop]: Abstraction has 408 states and 523 transitions. [2018-02-04 20:32:46,810 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-04 20:32:46,810 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 523 transitions. [2018-02-04 20:32:46,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-02-04 20:32:46,811 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:32:46,811 INFO L351 BasicCegarLoop]: trace histogram [53, 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:32:46,811 INFO L371 AbstractCegarLoop]: === Iteration 27 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-04 20:32:46,811 INFO L82 PathProgramCache]: Analyzing trace with hash 1022586169, now seen corresponding path program 14 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:32:46,815 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:32:46,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:46,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:46,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:46,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:46,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:46,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:46,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:46,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:46,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:46,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:46,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:46,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:46,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:46,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:46,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:46,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:46,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:46,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:46,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:47,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:47,381 INFO L134 CoverageAnalysis]: Checked inductivity of 1966 backedges. 695 proven. 91 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2018-02-04 20:32:47,397 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:32:47,398 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-04 20:32:47,398 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:32:47,398 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2018-02-04 20:32:47,398 INFO L182 omatonBuilderFactory]: Interpolants [30176#(and (<= 4 |#Ultimate.C_memset_#t~loopctr48|) (<= |#Ultimate.C_memset_#t~loopctr48| 4)), 30177#(and (<= 5 |#Ultimate.C_memset_#t~loopctr48|) (<= |#Ultimate.C_memset_#t~loopctr48| 5)), 30178#(and (<= |#Ultimate.C_memset_#t~loopctr48| 6) (<= 6 |#Ultimate.C_memset_#t~loopctr48|)), 30179#(and (<= 7 |#Ultimate.C_memset_#t~loopctr48|) (<= |#Ultimate.C_memset_#t~loopctr48| 7)), 30180#(and (<= |#Ultimate.C_memset_#t~loopctr48| 8) (<= 8 |#Ultimate.C_memset_#t~loopctr48|)), 29957#(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)|)), 30181#(and (<= 9 |#Ultimate.C_memset_#t~loopctr48|) (<= |#Ultimate.C_memset_#t~loopctr48| 9)), 29958#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 30182#(and (<= 10 |#Ultimate.C_memset_#t~loopctr48|) (<= |#Ultimate.C_memset_#t~loopctr48| 10)), 30183#(and (<= 11 |#Ultimate.C_memset_#t~loopctr48|) (<= |#Ultimate.C_memset_#t~loopctr48| 11)), 30151#(not (= |zalloc_or_die_#in~size| 119)), 29992#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 30152#(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)))), 30184#(and (<= 12 |#Ultimate.C_memset_#t~loopctr48|) (<= |#Ultimate.C_memset_#t~loopctr48| 12)), 30185#(and (< 12 |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#t~loopctr48| 13)), 30186#(and (< 12 |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#amount| 13)), 30125#(= zalloc_or_die_~size |zalloc_or_die_#in~size|), 30171#(or (not (= |calloc_model_#in~nmemb| 1)) (not (= (mod |calloc_model_#in~size| 4294967296) 119))), 30172#(= 0 |#Ultimate.C_memset_#t~loopctr48|), 29789#true, 30173#(= 1 |#Ultimate.C_memset_#t~loopctr48|), 29790#false, 30174#(= |#Ultimate.C_memset_#t~loopctr48| 2), 30175#(and (<= 3 |#Ultimate.C_memset_#t~loopctr48|) (<= |#Ultimate.C_memset_#t~loopctr48| 3))] [2018-02-04 20:32:47,398 INFO L134 CoverageAnalysis]: Checked inductivity of 1966 backedges. 695 proven. 91 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2018-02-04 20:32:47,398 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-04 20:32:47,398 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-04 20:32:47,399 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=504, Unknown=0, NotChecked=0, Total=552 [2018-02-04 20:32:47,399 INFO L87 Difference]: Start difference. First operand 408 states and 523 transitions. Second operand 24 states. [2018-02-04 20:32:49,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:32:49,027 INFO L93 Difference]: Finished difference Result 470 states and 569 transitions. [2018-02-04 20:32:49,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-04 20:32:49,027 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 195 [2018-02-04 20:32:49,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:32:49,029 INFO L225 Difference]: With dead ends: 470 [2018-02-04 20:32:49,029 INFO L226 Difference]: Without dead ends: 463 [2018-02-04 20:32:49,029 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=957, Unknown=0, NotChecked=0, Total=1056 [2018-02-04 20:32:49,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2018-02-04 20:32:49,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 409. [2018-02-04 20:32:49,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 409 states. [2018-02-04 20:32:49,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 525 transitions. [2018-02-04 20:32:49,032 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 525 transitions. Word has length 195 [2018-02-04 20:32:49,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:32:49,032 INFO L432 AbstractCegarLoop]: Abstraction has 409 states and 525 transitions. [2018-02-04 20:32:49,033 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-04 20:32:49,033 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 525 transitions. [2018-02-04 20:32:49,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-02-04 20:32:49,033 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:32:49,033 INFO L351 BasicCegarLoop]: trace histogram [54, 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:32:49,033 INFO L371 AbstractCegarLoop]: === Iteration 28 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-04 20:32:49,033 INFO L82 PathProgramCache]: Analyzing trace with hash -2128034703, now seen corresponding path program 15 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:32:49,041 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:32:49,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:49,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:49,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:49,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:49,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:49,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:49,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:49,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:49,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:49,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:49,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:49,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:49,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:49,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:49,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:49,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:49,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:49,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:49,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:49,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:49,664 INFO L134 CoverageAnalysis]: Checked inductivity of 2025 backedges. 740 proven. 105 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2018-02-04 20:32:49,682 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:32:49,682 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-04 20:32:49,682 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:32:49,683 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2018-02-04 20:32:49,683 INFO L182 omatonBuilderFactory]: Interpolants [31253#(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)|)), 31254#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 31448#(not (= |zalloc_or_die_#in~size| 119)), 31449#(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)))), 31084#true, 31085#false, 31469#(or (not (= |calloc_model_#in~nmemb| 1)) (not (= (mod |calloc_model_#in~size| 4294967296) 119))), 31470#(= 0 |#Ultimate.C_memset_#t~loopctr48|), 31471#(= 1 |#Ultimate.C_memset_#t~loopctr48|), 31472#(and (<= |#Ultimate.C_memset_#t~loopctr48| 2) (<= 2 |#Ultimate.C_memset_#t~loopctr48|)), 31473#(and (<= 3 |#Ultimate.C_memset_#t~loopctr48|) (<= |#Ultimate.C_memset_#t~loopctr48| 3)), 31474#(and (<= 4 |#Ultimate.C_memset_#t~loopctr48|) (<= |#Ultimate.C_memset_#t~loopctr48| 4)), 31475#(and (<= 5 |#Ultimate.C_memset_#t~loopctr48|) (<= |#Ultimate.C_memset_#t~loopctr48| 5)), 31476#(and (<= |#Ultimate.C_memset_#t~loopctr48| 6) (<= 6 |#Ultimate.C_memset_#t~loopctr48|)), 31477#(and (<= 7 |#Ultimate.C_memset_#t~loopctr48|) (<= |#Ultimate.C_memset_#t~loopctr48| 7)), 31478#(and (<= |#Ultimate.C_memset_#t~loopctr48| 8) (<= 8 |#Ultimate.C_memset_#t~loopctr48|)), 31479#(and (<= 9 |#Ultimate.C_memset_#t~loopctr48|) (<= |#Ultimate.C_memset_#t~loopctr48| 9)), 31288#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 31480#(and (<= 10 |#Ultimate.C_memset_#t~loopctr48|) (<= |#Ultimate.C_memset_#t~loopctr48| 10)), 31481#(and (<= 11 |#Ultimate.C_memset_#t~loopctr48|) (<= |#Ultimate.C_memset_#t~loopctr48| 11)), 31482#(and (<= 12 |#Ultimate.C_memset_#t~loopctr48|) (<= |#Ultimate.C_memset_#t~loopctr48| 12)), 31483#(and (<= |#Ultimate.C_memset_#t~loopctr48| 13) (<= 13 |#Ultimate.C_memset_#t~loopctr48|)), 31484#(and (<= |#Ultimate.C_memset_#t~loopctr48| 14) (< 13 |#Ultimate.C_memset_#amount|)), 31421#(= zalloc_or_die_~size |zalloc_or_die_#in~size|), 31485#(and (< 13 |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#amount| 14))] [2018-02-04 20:32:49,683 INFO L134 CoverageAnalysis]: Checked inductivity of 2025 backedges. 740 proven. 105 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2018-02-04 20:32:49,683 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-04 20:32:49,683 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-04 20:32:49,684 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=550, Unknown=0, NotChecked=0, Total=600 [2018-02-04 20:32:49,684 INFO L87 Difference]: Start difference. First operand 409 states and 525 transitions. Second operand 25 states. [2018-02-04 20:32:51,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:32:51,305 INFO L93 Difference]: Finished difference Result 473 states and 573 transitions. [2018-02-04 20:32:51,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-04 20:32:51,305 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 196 [2018-02-04 20:32:51,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:32:51,306 INFO L225 Difference]: With dead ends: 473 [2018-02-04 20:32:51,306 INFO L226 Difference]: Without dead ends: 466 [2018-02-04 20:32:51,306 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=101, Invalid=1021, Unknown=0, NotChecked=0, Total=1122 [2018-02-04 20:32:51,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2018-02-04 20:32:51,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 410. [2018-02-04 20:32:51,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-02-04 20:32:51,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 527 transitions. [2018-02-04 20:32:51,309 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 527 transitions. Word has length 196 [2018-02-04 20:32:51,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:32:51,310 INFO L432 AbstractCegarLoop]: Abstraction has 410 states and 527 transitions. [2018-02-04 20:32:51,310 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-04 20:32:51,310 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 527 transitions. [2018-02-04 20:32:51,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-02-04 20:32:51,310 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:32:51,310 INFO L351 BasicCegarLoop]: trace histogram [55, 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:32:51,310 INFO L371 AbstractCegarLoop]: === Iteration 29 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-04 20:32:51,310 INFO L82 PathProgramCache]: Analyzing trace with hash -1013033927, now seen corresponding path program 16 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:32:51,313 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:32:51,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:51,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:51,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:51,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:51,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:51,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:51,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:51,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:51,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:51,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:51,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:51,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:51,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:51,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:51,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:51,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:51,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:51,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:51,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:51,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:51,885 INFO L134 CoverageAnalysis]: Checked inductivity of 2085 backedges. 785 proven. 120 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2018-02-04 20:32:51,901 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:32:51,902 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-02-04 20:32:51,902 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:32:51,902 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2018-02-04 20:32:51,902 INFO L182 omatonBuilderFactory]: Interpolants [32387#true, 32388#false, 32775#(or (not (= |calloc_model_#in~nmemb| 1)) (not (= (mod |calloc_model_#in~size| 4294967296) 119))), 32776#(= 0 |#Ultimate.C_memset_#t~loopctr48|), 32777#(and (<= |#Ultimate.C_memset_#t~loopctr48| 1) (<= 1 |#Ultimate.C_memset_#t~loopctr48|)), 32778#(and (<= |#Ultimate.C_memset_#t~loopctr48| 2) (<= 2 |#Ultimate.C_memset_#t~loopctr48|)), 32779#(and (<= 3 |#Ultimate.C_memset_#t~loopctr48|) (<= |#Ultimate.C_memset_#t~loopctr48| 3)), 32780#(and (<= 4 |#Ultimate.C_memset_#t~loopctr48|) (<= |#Ultimate.C_memset_#t~loopctr48| 4)), 32781#(and (<= 5 |#Ultimate.C_memset_#t~loopctr48|) (<= |#Ultimate.C_memset_#t~loopctr48| 5)), 32782#(and (<= |#Ultimate.C_memset_#t~loopctr48| 6) (<= 6 |#Ultimate.C_memset_#t~loopctr48|)), 32783#(and (<= 7 |#Ultimate.C_memset_#t~loopctr48|) (<= |#Ultimate.C_memset_#t~loopctr48| 7)), 32592#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 32784#(and (<= |#Ultimate.C_memset_#t~loopctr48| 8) (<= 8 |#Ultimate.C_memset_#t~loopctr48|)), 32785#(and (<= 9 |#Ultimate.C_memset_#t~loopctr48|) (<= |#Ultimate.C_memset_#t~loopctr48| 9)), 32786#(and (<= 10 |#Ultimate.C_memset_#t~loopctr48|) (<= |#Ultimate.C_memset_#t~loopctr48| 10)), 32787#(and (<= 11 |#Ultimate.C_memset_#t~loopctr48|) (<= |#Ultimate.C_memset_#t~loopctr48| 11)), 32788#(and (<= 12 |#Ultimate.C_memset_#t~loopctr48|) (<= |#Ultimate.C_memset_#t~loopctr48| 12)), 32725#(= zalloc_or_die_~size |zalloc_or_die_#in~size|), 32789#(and (<= |#Ultimate.C_memset_#t~loopctr48| 13) (<= 13 |#Ultimate.C_memset_#t~loopctr48|)), 32790#(and (<= 14 |#Ultimate.C_memset_#t~loopctr48|) (<= |#Ultimate.C_memset_#t~loopctr48| 14)), 32791#(and (< 14 |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#t~loopctr48| 15)), 32792#(and (< 14 |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#amount| 15)), 32557#(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)|)), 32558#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 32753#(not (= |zalloc_or_die_#in~size| 119)), 32754#(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:32:51,902 INFO L134 CoverageAnalysis]: Checked inductivity of 2085 backedges. 785 proven. 120 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2018-02-04 20:32:51,902 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-04 20:32:51,903 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-04 20:32:51,903 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=598, Unknown=0, NotChecked=0, Total=650 [2018-02-04 20:32:51,903 INFO L87 Difference]: Start difference. First operand 410 states and 527 transitions. Second operand 26 states. [2018-02-04 20:32:53,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:32:53,547 INFO L93 Difference]: Finished difference Result 476 states and 577 transitions. [2018-02-04 20:32:53,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-02-04 20:32:53,548 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 197 [2018-02-04 20:32:53,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:32:53,549 INFO L225 Difference]: With dead ends: 476 [2018-02-04 20:32:53,549 INFO L226 Difference]: Without dead ends: 469 [2018-02-04 20:32:53,550 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=103, Invalid=1087, Unknown=0, NotChecked=0, Total=1190 [2018-02-04 20:32:53,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2018-02-04 20:32:53,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 411. [2018-02-04 20:32:53,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2018-02-04 20:32:53,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 529 transitions. [2018-02-04 20:32:53,553 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 529 transitions. Word has length 197 [2018-02-04 20:32:53,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:32:53,553 INFO L432 AbstractCegarLoop]: Abstraction has 411 states and 529 transitions. [2018-02-04 20:32:53,553 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-04 20:32:53,553 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 529 transitions. [2018-02-04 20:32:53,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-02-04 20:32:53,554 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:32:53,554 INFO L351 BasicCegarLoop]: trace histogram [56, 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:32:53,554 INFO L371 AbstractCegarLoop]: === Iteration 30 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-04 20:32:53,554 INFO L82 PathProgramCache]: Analyzing trace with hash -807748239, now seen corresponding path program 17 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:32:53,557 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:32:53,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:53,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:53,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:53,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:53,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:53,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:53,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:53,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:53,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:53,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:53,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:53,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:53,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:53,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:53,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:53,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:53,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:53,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:53,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:53,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:32:56,545 WARN L143 SmtUtils]: Spent 2126ms on a formula simplification that was a NOOP. DAG size: 17 [2018-02-04 20:33:06,888 INFO L134 CoverageAnalysis]: Checked inductivity of 2146 backedges. 830 proven. 136 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2018-02-04 20:33:06,908 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:33:06,908 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-02-04 20:33:06,909 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:33:06,909 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2018-02-04 20:33:06,909 INFO L182 omatonBuilderFactory]: Interpolants [33869#(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)|)), 33870#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 34066#(not (= |zalloc_or_die_#in~size| 119)), 34067#(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)))), 33698#true, 33699#false, 34089#(or (not (= |calloc_model_#in~nmemb| 1)) (not (= (mod |calloc_model_#in~size| 4294967296) 119))), 34090#(= 0 |#Ultimate.C_memset_#t~loopctr48|), 34091#(= 1 |#Ultimate.C_memset_#t~loopctr48|), 34092#(= |#Ultimate.C_memset_#t~loopctr48| 2), 34093#(and (<= 3 |#Ultimate.C_memset_#t~loopctr48|) (<= |#Ultimate.C_memset_#t~loopctr48| 3)), 34094#(and (<= 4 |#Ultimate.C_memset_#t~loopctr48|) (<= |#Ultimate.C_memset_#t~loopctr48| 4)), 34095#(and (<= 5 |#Ultimate.C_memset_#t~loopctr48|) (<= |#Ultimate.C_memset_#t~loopctr48| 5)), 33904#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 34096#(and (<= |#Ultimate.C_memset_#t~loopctr48| 6) (<= 6 |#Ultimate.C_memset_#t~loopctr48|)), 34097#(and (<= 7 |#Ultimate.C_memset_#t~loopctr48|) (<= |#Ultimate.C_memset_#t~loopctr48| 7)), 34098#(and (<= |#Ultimate.C_memset_#t~loopctr48| 8) (<= 8 |#Ultimate.C_memset_#t~loopctr48|)), 34099#(and (<= 9 |#Ultimate.C_memset_#t~loopctr48|) (<= |#Ultimate.C_memset_#t~loopctr48| 9)), 34100#(and (<= 10 |#Ultimate.C_memset_#t~loopctr48|) (<= |#Ultimate.C_memset_#t~loopctr48| 10)), 34037#(= zalloc_or_die_~size |zalloc_or_die_#in~size|), 34101#(and (<= 11 |#Ultimate.C_memset_#t~loopctr48|) (<= |#Ultimate.C_memset_#t~loopctr48| 11)), 34102#(and (<= 12 |#Ultimate.C_memset_#t~loopctr48|) (<= |#Ultimate.C_memset_#t~loopctr48| 12)), 34103#(and (<= |#Ultimate.C_memset_#t~loopctr48| 13) (<= 13 |#Ultimate.C_memset_#t~loopctr48|)), 34104#(and (<= 14 |#Ultimate.C_memset_#t~loopctr48|) (<= |#Ultimate.C_memset_#t~loopctr48| 14)), 34105#(and (<= |#Ultimate.C_memset_#t~loopctr48| 15) (<= 15 |#Ultimate.C_memset_#t~loopctr48|)), 34106#(and (< 15 |#Ultimate.C_memset_#amount|) (<= (* 103 |#Ultimate.C_memset_#t~loopctr48|) (+ (div (+ (- 60129540496) (* 4294967193 |#Ultimate.C_memset_#amount|)) 4294967296) 4294968841))), 34107#(and (<= (* 4294967296 |#Ultimate.C_memset_#amount|) (+ (* 4294967193 |#Ultimate.C_memset_#t~loopctr48|) (div (+ (- 60129540496) (* 4294967193 |#Ultimate.C_memset_#amount|)) 4294967296) 4294968841)) (< 15 |#Ultimate.C_memset_#amount|))] [2018-02-04 20:33:06,910 INFO L134 CoverageAnalysis]: Checked inductivity of 2146 backedges. 830 proven. 136 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2018-02-04 20:33:06,910 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-04 20:33:06,910 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-04 20:33:06,910 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=643, Unknown=5, NotChecked=0, Total=702 [2018-02-04 20:33:06,910 INFO L87 Difference]: Start difference. First operand 411 states and 529 transitions. Second operand 27 states. [2018-02-04 20:33:27,667 WARN L143 SmtUtils]: Spent 2118ms on a formula simplification that was a NOOP. DAG size: 21 Received shutdown request... [2018-02-04 20:34:24,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-04 20:34:24,174 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-04 20:34:24,179 WARN L185 ceAbstractionStarter]: Timeout [2018-02-04 20:34:24,179 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 08:34:24 BoogieIcfgContainer [2018-02-04 20:34:24,179 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 20:34:24,180 INFO L168 Benchmark]: Toolchain (without parser) took 215183.43 ms. Allocated memory was 399.5 MB in the beginning and 957.3 MB in the end (delta: 557.8 MB). Free memory was 356.2 MB in the beginning and 718.1 MB in the end (delta: -361.9 MB). Peak memory consumption was 195.9 MB. Max. memory is 5.3 GB. [2018-02-04 20:34:24,181 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 399.5 MB. Free memory is still 361.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 20:34:24,181 INFO L168 Benchmark]: CACSL2BoogieTranslator took 191.74 ms. Allocated memory is still 399.5 MB. Free memory was 356.2 MB in the beginning and 343.0 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:34:24,181 INFO L168 Benchmark]: Boogie Preprocessor took 35.15 ms. Allocated memory is still 399.5 MB. Free memory was 343.0 MB in the beginning and 340.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-04 20:34:24,182 INFO L168 Benchmark]: RCFGBuilder took 563.62 ms. Allocated memory is still 399.5 MB. Free memory was 340.3 MB in the beginning and 280.6 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:34:24,182 INFO L168 Benchmark]: TraceAbstraction took 214389.85 ms. Allocated memory was 399.5 MB in the beginning and 957.3 MB in the end (delta: 557.8 MB). Free memory was 280.6 MB in the beginning and 718.1 MB in the end (delta: -437.5 MB). Peak memory consumption was 120.3 MB. Max. memory is 5.3 GB. [2018-02-04 20:34:24,184 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.14 ms. Allocated memory is still 399.5 MB. Free memory is still 361.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 191.74 ms. Allocated memory is still 399.5 MB. Free memory was 356.2 MB in the beginning and 343.0 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 35.15 ms. Allocated memory is still 399.5 MB. Free memory was 343.0 MB in the beginning and 340.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 563.62 ms. Allocated memory is still 399.5 MB. Free memory was 340.3 MB in the beginning and 280.6 MB in the end (delta: 59.7 MB). Peak memory consumption was 59.7 MB. Max. memory is 5.3 GB. * TraceAbstraction took 214389.85 ms. Allocated memory was 399.5 MB in the beginning and 957.3 MB in the end (delta: 557.8 MB). Free memory was 280.6 MB in the beginning and 718.1 MB in the end (delta: -437.5 MB). Peak memory consumption was 120.3 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 831). Cancelled while BasicCegarLoop was constructing difference of abstraction (411states) and interpolant automaton (currently 31 states, 27 states before enhancement), while ReachableStatesComputation was computing reachable states (351 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 832). Cancelled while BasicCegarLoop was constructing difference of abstraction (411states) and interpolant automaton (currently 31 states, 27 states before enhancement), while ReachableStatesComputation was computing reachable states (351 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 831). Cancelled while BasicCegarLoop was constructing difference of abstraction (411states) and interpolant automaton (currently 31 states, 27 states before enhancement), while ReachableStatesComputation was computing reachable states (351 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 832). Cancelled while BasicCegarLoop was constructing difference of abstraction (411states) and interpolant automaton (currently 31 states, 27 states before enhancement), while ReachableStatesComputation was computing reachable states (351 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 834). Cancelled while BasicCegarLoop was constructing difference of abstraction (411states) and interpolant automaton (currently 31 states, 27 states before enhancement), while ReachableStatesComputation was computing reachable states (351 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 834). Cancelled while BasicCegarLoop was constructing difference of abstraction (411states) and interpolant automaton (currently 31 states, 27 states before enhancement), while ReachableStatesComputation was computing reachable states (351 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 812). Cancelled while BasicCegarLoop was constructing difference of abstraction (411states) and interpolant automaton (currently 31 states, 27 states before enhancement), while ReachableStatesComputation was computing reachable states (351 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 812). Cancelled while BasicCegarLoop was constructing difference of abstraction (411states) and interpolant automaton (currently 31 states, 27 states before enhancement), while ReachableStatesComputation was computing reachable states (351 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 813). Cancelled while BasicCegarLoop was constructing difference of abstraction (411states) and interpolant automaton (currently 31 states, 27 states before enhancement), while ReachableStatesComputation was computing reachable states (351 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 812). Cancelled while BasicCegarLoop was constructing difference of abstraction (411states) and interpolant automaton (currently 31 states, 27 states before enhancement), while ReachableStatesComputation was computing reachable states (351 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 813). Cancelled while BasicCegarLoop was constructing difference of abstraction (411states) and interpolant automaton (currently 31 states, 27 states before enhancement), while ReachableStatesComputation was computing reachable states (351 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 812). Cancelled while BasicCegarLoop was constructing difference of abstraction (411states) and interpolant automaton (currently 31 states, 27 states before enhancement), while ReachableStatesComputation was computing reachable states (351 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 820). Cancelled while BasicCegarLoop was constructing difference of abstraction (411states) and interpolant automaton (currently 31 states, 27 states before enhancement), while ReachableStatesComputation was computing reachable states (351 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 822). Cancelled while BasicCegarLoop was constructing difference of abstraction (411states) and interpolant automaton (currently 31 states, 27 states before enhancement), while ReachableStatesComputation was computing reachable states (351 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 819). Cancelled while BasicCegarLoop was constructing difference of abstraction (411states) and interpolant automaton (currently 31 states, 27 states before enhancement), while ReachableStatesComputation was computing reachable states (351 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 819). Cancelled while BasicCegarLoop was constructing difference of abstraction (411states) and interpolant automaton (currently 31 states, 27 states before enhancement), while ReachableStatesComputation was computing reachable states (351 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 819). Cancelled while BasicCegarLoop was constructing difference of abstraction (411states) and interpolant automaton (currently 31 states, 27 states before enhancement), while ReachableStatesComputation was computing reachable states (351 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 822). Cancelled while BasicCegarLoop was constructing difference of abstraction (411states) and interpolant automaton (currently 31 states, 27 states before enhancement), while ReachableStatesComputation was computing reachable states (351 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 819). Cancelled while BasicCegarLoop was constructing difference of abstraction (411states) and interpolant automaton (currently 31 states, 27 states before enhancement), while ReachableStatesComputation was computing reachable states (351 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 820). Cancelled while BasicCegarLoop was constructing difference of abstraction (411states) and interpolant automaton (currently 31 states, 27 states before enhancement), while ReachableStatesComputation was computing reachable states (351 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 794). Cancelled while BasicCegarLoop was constructing difference of abstraction (411states) and interpolant automaton (currently 31 states, 27 states before enhancement), while ReachableStatesComputation was computing reachable states (351 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 795). Cancelled while BasicCegarLoop was constructing difference of abstraction (411states) and interpolant automaton (currently 31 states, 27 states before enhancement), while ReachableStatesComputation was computing reachable states (351 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 794). Cancelled while BasicCegarLoop was constructing difference of abstraction (411states) and interpolant automaton (currently 31 states, 27 states before enhancement), while ReachableStatesComputation was computing reachable states (351 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 794). Cancelled while BasicCegarLoop was constructing difference of abstraction (411states) and interpolant automaton (currently 31 states, 27 states before enhancement), while ReachableStatesComputation was computing reachable states (351 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 795). Cancelled while BasicCegarLoop was constructing difference of abstraction (411states) and interpolant automaton (currently 31 states, 27 states before enhancement), while ReachableStatesComputation was computing reachable states (351 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 794). Cancelled while BasicCegarLoop was constructing difference of abstraction (411states) and interpolant automaton (currently 31 states, 27 states before enhancement), while ReachableStatesComputation was computing reachable states (351 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 883). Cancelled while BasicCegarLoop was constructing difference of abstraction (411states) and interpolant automaton (currently 31 states, 27 states before enhancement), while ReachableStatesComputation was computing reachable states (351 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 887). Cancelled while BasicCegarLoop was constructing difference of abstraction (411states) and interpolant automaton (currently 31 states, 27 states before enhancement), while ReachableStatesComputation was computing reachable states (351 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 881). Cancelled while BasicCegarLoop was constructing difference of abstraction (411states) and interpolant automaton (currently 31 states, 27 states before enhancement), while ReachableStatesComputation was computing reachable states (351 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 885). Cancelled while BasicCegarLoop was constructing difference of abstraction (411states) and interpolant automaton (currently 31 states, 27 states before enhancement), while ReachableStatesComputation was computing reachable states (351 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 881). Cancelled while BasicCegarLoop was constructing difference of abstraction (411states) and interpolant automaton (currently 31 states, 27 states before enhancement), while ReachableStatesComputation was computing reachable states (351 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 882). Cancelled while BasicCegarLoop was constructing difference of abstraction (411states) and interpolant automaton (currently 31 states, 27 states before enhancement), while ReachableStatesComputation was computing reachable states (351 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 884). Cancelled while BasicCegarLoop was constructing difference of abstraction (411states) and interpolant automaton (currently 31 states, 27 states before enhancement), while ReachableStatesComputation was computing reachable states (351 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 886). Cancelled while BasicCegarLoop was constructing difference of abstraction (411states) and interpolant automaton (currently 31 states, 27 states before enhancement), while ReachableStatesComputation was computing reachable states (351 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 875]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 875). Cancelled while BasicCegarLoop was constructing difference of abstraction (411states) and interpolant automaton (currently 31 states, 27 states before enhancement), while ReachableStatesComputation was computing reachable states (351 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 885). Cancelled while BasicCegarLoop was constructing difference of abstraction (411states) and interpolant automaton (currently 31 states, 27 states before enhancement), while ReachableStatesComputation was computing reachable states (351 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 886). Cancelled while BasicCegarLoop was constructing difference of abstraction (411states) and interpolant automaton (currently 31 states, 27 states before enhancement), while ReachableStatesComputation was computing reachable states (351 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 882). Cancelled while BasicCegarLoop was constructing difference of abstraction (411states) and interpolant automaton (currently 31 states, 27 states before enhancement), while ReachableStatesComputation was computing reachable states (351 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 883). Cancelled while BasicCegarLoop was constructing difference of abstraction (411states) and interpolant automaton (currently 31 states, 27 states before enhancement), while ReachableStatesComputation was computing reachable states (351 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 887). Cancelled while BasicCegarLoop was constructing difference of abstraction (411states) and interpolant automaton (currently 31 states, 27 states before enhancement), while ReachableStatesComputation was computing reachable states (351 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 884). Cancelled while BasicCegarLoop was constructing difference of abstraction (411states) and interpolant automaton (currently 31 states, 27 states before enhancement), while ReachableStatesComputation was computing reachable states (351 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 786). Cancelled while BasicCegarLoop was constructing difference of abstraction (411states) and interpolant automaton (currently 31 states, 27 states before enhancement), while ReachableStatesComputation was computing reachable states (351 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 785). Cancelled while BasicCegarLoop was constructing difference of abstraction (411states) and interpolant automaton (currently 31 states, 27 states before enhancement), while ReachableStatesComputation was computing reachable states (351 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 786). Cancelled while BasicCegarLoop was constructing difference of abstraction (411states) and interpolant automaton (currently 31 states, 27 states before enhancement), while ReachableStatesComputation was computing reachable states (351 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 785). Cancelled while BasicCegarLoop was constructing difference of abstraction (411states) and interpolant automaton (currently 31 states, 27 states before enhancement), while ReachableStatesComputation was computing reachable states (351 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 785). Cancelled while BasicCegarLoop was constructing difference of abstraction (411states) and interpolant automaton (currently 31 states, 27 states before enhancement), while ReachableStatesComputation was computing reachable states (351 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 785). Cancelled while BasicCegarLoop was constructing difference of abstraction (411states) and interpolant automaton (currently 31 states, 27 states before enhancement), while ReachableStatesComputation was computing reachable states (351 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 804). Cancelled while BasicCegarLoop was constructing difference of abstraction (411states) and interpolant automaton (currently 31 states, 27 states before enhancement), while ReachableStatesComputation was computing reachable states (351 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 803). Cancelled while BasicCegarLoop was constructing difference of abstraction (411states) and interpolant automaton (currently 31 states, 27 states before enhancement), while ReachableStatesComputation was computing reachable states (351 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 803). Cancelled while BasicCegarLoop was constructing difference of abstraction (411states) and interpolant automaton (currently 31 states, 27 states before enhancement), while ReachableStatesComputation was computing reachable states (351 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 803). Cancelled while BasicCegarLoop was constructing difference of abstraction (411states) and interpolant automaton (currently 31 states, 27 states before enhancement), while ReachableStatesComputation was computing reachable states (351 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 803). Cancelled while BasicCegarLoop was constructing difference of abstraction (411states) and interpolant automaton (currently 31 states, 27 states before enhancement), while ReachableStatesComputation was computing reachable states (351 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 804). Cancelled while BasicCegarLoop was constructing difference of abstraction (411states) and interpolant automaton (currently 31 states, 27 states before enhancement), while ReachableStatesComputation was computing reachable states (351 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 870). Cancelled while BasicCegarLoop was constructing difference of abstraction (411states) and interpolant automaton (currently 31 states, 27 states before enhancement), while ReachableStatesComputation was computing reachable states (351 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 868). Cancelled while BasicCegarLoop was constructing difference of abstraction (411states) and interpolant automaton (currently 31 states, 27 states before enhancement), while ReachableStatesComputation was computing reachable states (351 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 867). Cancelled while BasicCegarLoop was constructing difference of abstraction (411states) and interpolant automaton (currently 31 states, 27 states before enhancement), while ReachableStatesComputation was computing reachable states (351 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 867). Cancelled while BasicCegarLoop was constructing difference of abstraction (411states) and interpolant automaton (currently 31 states, 27 states before enhancement), while ReachableStatesComputation was computing reachable states (351 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 870). Cancelled while BasicCegarLoop was constructing difference of abstraction (411states) and interpolant automaton (currently 31 states, 27 states before enhancement), while ReachableStatesComputation was computing reachable states (351 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 868). Cancelled while BasicCegarLoop was constructing difference of abstraction (411states) and interpolant automaton (currently 31 states, 27 states before enhancement), while ReachableStatesComputation was computing reachable states (351 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 742). Cancelled while BasicCegarLoop was constructing difference of abstraction (411states) and interpolant automaton (currently 31 states, 27 states before enhancement), while ReachableStatesComputation was computing reachable states (351 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 742). Cancelled while BasicCegarLoop was constructing difference of abstraction (411states) and interpolant automaton (currently 31 states, 27 states before enhancement), while ReachableStatesComputation was computing reachable states (351 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 776). Cancelled while BasicCegarLoop was constructing difference of abstraction (411states) and interpolant automaton (currently 31 states, 27 states before enhancement), while ReachableStatesComputation was computing reachable states (351 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 776). Cancelled while BasicCegarLoop was constructing difference of abstraction (411states) and interpolant automaton (currently 31 states, 27 states before enhancement), while ReachableStatesComputation was computing reachable states (351 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 776). Cancelled while BasicCegarLoop was constructing difference of abstraction (411states) and interpolant automaton (currently 31 states, 27 states before enhancement), while ReachableStatesComputation was computing reachable states (351 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 777). Cancelled while BasicCegarLoop was constructing difference of abstraction (411states) and interpolant automaton (currently 31 states, 27 states before enhancement), while ReachableStatesComputation was computing reachable states (351 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 776). Cancelled while BasicCegarLoop was constructing difference of abstraction (411states) and interpolant automaton (currently 31 states, 27 states before enhancement), while ReachableStatesComputation was computing reachable states (351 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 775). Cancelled while BasicCegarLoop was constructing difference of abstraction (411states) and interpolant automaton (currently 31 states, 27 states before enhancement), while ReachableStatesComputation was computing reachable states (351 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 775). Cancelled while BasicCegarLoop was constructing difference of abstraction (411states) and interpolant automaton (currently 31 states, 27 states before enhancement), while ReachableStatesComputation was computing reachable states (351 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 777). Cancelled while BasicCegarLoop was constructing difference of abstraction (411states) and interpolant automaton (currently 31 states, 27 states before enhancement), while ReachableStatesComputation was computing reachable states (351 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 877). Cancelled while BasicCegarLoop was constructing difference of abstraction (411states) and interpolant automaton (currently 31 states, 27 states before enhancement), while ReachableStatesComputation was computing reachable states (351 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 877). Cancelled while BasicCegarLoop was constructing difference of abstraction (411states) and interpolant automaton (currently 31 states, 27 states before enhancement), while ReachableStatesComputation was computing reachable states (351 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 856). Cancelled while BasicCegarLoop was constructing difference of abstraction (411states) and interpolant automaton (currently 31 states, 27 states before enhancement), while ReachableStatesComputation was computing reachable states (351 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 858). Cancelled while BasicCegarLoop was constructing difference of abstraction (411states) and interpolant automaton (currently 31 states, 27 states before enhancement), while ReachableStatesComputation was computing reachable states (351 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 855). Cancelled while BasicCegarLoop was constructing difference of abstraction (411states) and interpolant automaton (currently 31 states, 27 states before enhancement), while ReachableStatesComputation was computing reachable states (351 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 855). Cancelled while BasicCegarLoop was constructing difference of abstraction (411states) and interpolant automaton (currently 31 states, 27 states before enhancement), while ReachableStatesComputation was computing reachable states (351 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 858). Cancelled while BasicCegarLoop was constructing difference of abstraction (411states) and interpolant automaton (currently 31 states, 27 states before enhancement), while ReachableStatesComputation was computing reachable states (351 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 856). Cancelled while BasicCegarLoop was constructing difference of abstraction (411states) and interpolant automaton (currently 31 states, 27 states before enhancement), while ReachableStatesComputation was computing reachable states (351 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 843). Cancelled while BasicCegarLoop was constructing difference of abstraction (411states) and interpolant automaton (currently 31 states, 27 states before enhancement), while ReachableStatesComputation was computing reachable states (351 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 843). Cancelled while BasicCegarLoop was constructing difference of abstraction (411states) and interpolant automaton (currently 31 states, 27 states before enhancement), while ReachableStatesComputation was computing reachable states (351 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 844). Cancelled while BasicCegarLoop was constructing difference of abstraction (411states) and interpolant automaton (currently 31 states, 27 states before enhancement), while ReachableStatesComputation was computing reachable states (351 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 846). Cancelled while BasicCegarLoop was constructing difference of abstraction (411states) and interpolant automaton (currently 31 states, 27 states before enhancement), while ReachableStatesComputation was computing reachable states (351 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 846). Cancelled while BasicCegarLoop was constructing difference of abstraction (411states) and interpolant automaton (currently 31 states, 27 states before enhancement), while ReachableStatesComputation was computing reachable states (351 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 844). Cancelled while BasicCegarLoop was constructing difference of abstraction (411states) and interpolant automaton (currently 31 states, 27 states before enhancement), while ReachableStatesComputation was computing reachable states (351 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 16 procedures, 270 locations, 83 error locations. TIMEOUT Result, 214.3s OverallTime, 30 OverallIterations, 56 TraceHistogramMax, 185.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 7157 SDtfs, 7435 SDslu, 55093 SDs, 0 SdLazy, 62279 SolverSat, 1922 SolverUnsat, 75 SolverUnknown, 0 SolverNotchecked, 161.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1649 GetRequests, 940 SyntacticMatches, 0 SemanticMatches, 709 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 2146 ImplicationChecksByTransitivity, 37.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=411occurred in iteration=29, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 32030/34116 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 29 MinimizatonAttempts, 1385 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.5s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 26.6s InterpolantComputationTime, 4613 NumberOfCodeBlocks, 4613 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 4583 ConstructedInterpolants, 8 QuantifiedInterpolants, 2441758 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 30 InterpolantComputations, 6 PerfectInterpolantSequences, 32030/34116 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0235_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_z3.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_20-34-24-193.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0235_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_z3.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_20-34-24-193.csv Completed graceful shutdown