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-0237_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ccafca9-m [2018-02-04 04:36:02,753 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 04:36:02,755 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 04:36:02,769 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 04:36:02,769 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 04:36:02,770 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 04:36:02,775 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 04:36:02,777 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 04:36:02,779 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 04:36:02,780 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 04:36:02,781 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 04:36:02,781 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 04:36:02,782 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 04:36:02,789 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 04:36:02,790 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 04:36:02,792 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 04:36:02,794 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 04:36:02,796 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 04:36:02,797 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 04:36:02,798 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 04:36:02,800 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 04:36:02,800 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 04:36:02,801 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 04:36:02,802 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 04:36:02,802 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 04:36:02,804 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 04:36:02,804 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 04:36:02,805 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 04:36:02,805 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 04:36:02,805 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 04:36:02,806 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 04:36:02,806 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 04:36:02,817 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 04:36:02,817 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 04:36:02,818 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 04:36:02,819 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 04:36:02,819 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 04:36:02,819 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 04:36:02,819 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 04:36:02,819 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 04:36:02,819 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 04:36:02,819 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 04:36:02,819 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 04:36:02,820 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 04:36:02,820 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 04:36:02,820 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-04 04:36:02,820 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 04:36:02,820 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 04:36:02,820 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 04:36:02,820 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 04:36:02,821 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 04:36:02,821 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 04:36:02,821 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 04:36:02,821 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 04:36:02,821 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-02-04 04:36:02,821 INFO L133 SettingsManager]: * SMT solver=External_Z3InterpolationMode [2018-02-04 04:36:02,821 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:36:02,849 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 04:36:02,858 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 04:36:02,860 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 04:36:02,861 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 04:36:02,862 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 04:36:02,862 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/test-0237_true-valid-memsafety.i [2018-02-04 04:36:02,998 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 04:36:02,999 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 04:36:03,000 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 04:36:03,000 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 04:36:03,007 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 04:36:03,009 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 04:36:02" (1/1) ... [2018-02-04 04:36:03,012 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69a9abb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:36:03, skipping insertion in model container [2018-02-04 04:36:03,012 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 04:36:02" (1/1) ... [2018-02-04 04:36:03,028 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 04:36:03,064 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 04:36:03,172 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 04:36:03,196 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 04:36:03,205 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:36:03 WrapperNode [2018-02-04 04:36:03,205 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 04:36:03,206 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 04:36:03,206 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 04:36:03,207 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 04:36:03,218 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:36:03" (1/1) ... [2018-02-04 04:36:03,219 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:36:03" (1/1) ... [2018-02-04 04:36:03,228 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:36:03" (1/1) ... [2018-02-04 04:36:03,228 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:36:03" (1/1) ... [2018-02-04 04:36:03,236 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:36:03" (1/1) ... [2018-02-04 04:36:03,240 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:36:03" (1/1) ... [2018-02-04 04:36:03,242 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:36:03" (1/1) ... [2018-02-04 04:36:03,245 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 04:36:03,245 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 04:36:03,245 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 04:36:03,246 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 04:36:03,247 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:36:03" (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 04:36:03,284 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 04:36:03,285 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 04:36:03,285 INFO L136 BoogieDeclarations]: Found implementation of procedure calloc_model [2018-02-04 04:36:03,285 INFO L136 BoogieDeclarations]: Found implementation of procedure zalloc_or_die [2018-02-04 04:36:03,285 INFO L136 BoogieDeclarations]: Found implementation of procedure l4_insert [2018-02-04 04:36:03,285 INFO L136 BoogieDeclarations]: Found implementation of procedure l3_insert [2018-02-04 04:36:03,285 INFO L136 BoogieDeclarations]: Found implementation of procedure l2_insert [2018-02-04 04:36:03,285 INFO L136 BoogieDeclarations]: Found implementation of procedure l1_insert [2018-02-04 04:36:03,285 INFO L136 BoogieDeclarations]: Found implementation of procedure l0_insert [2018-02-04 04:36:03,286 INFO L136 BoogieDeclarations]: Found implementation of procedure l4_destroy [2018-02-04 04:36:03,286 INFO L136 BoogieDeclarations]: Found implementation of procedure l3_destroy [2018-02-04 04:36:03,286 INFO L136 BoogieDeclarations]: Found implementation of procedure l2_destroy [2018-02-04 04:36:03,286 INFO L136 BoogieDeclarations]: Found implementation of procedure l1_destroy [2018-02-04 04:36:03,286 INFO L136 BoogieDeclarations]: Found implementation of procedure l0_destroy [2018-02-04 04:36:03,286 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 04:36:03,286 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-04 04:36:03,286 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-04 04:36:03,287 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 04:36:03,287 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 04:36:03,287 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 04:36:03,287 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2018-02-04 04:36:03,287 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2018-02-04 04:36:03,287 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-04 04:36:03,287 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-04 04:36:03,287 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-02-04 04:36:03,288 INFO L128 BoogieDeclarations]: Found specification of procedure memset [2018-02-04 04:36:03,288 INFO L128 BoogieDeclarations]: Found specification of procedure calloc_model [2018-02-04 04:36:03,288 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 04:36:03,288 INFO L128 BoogieDeclarations]: Found specification of procedure zalloc_or_die [2018-02-04 04:36:03,288 INFO L128 BoogieDeclarations]: Found specification of procedure l4_insert [2018-02-04 04:36:03,288 INFO L128 BoogieDeclarations]: Found specification of procedure l3_insert [2018-02-04 04:36:03,288 INFO L128 BoogieDeclarations]: Found specification of procedure l2_insert [2018-02-04 04:36:03,288 INFO L128 BoogieDeclarations]: Found specification of procedure l1_insert [2018-02-04 04:36:03,289 INFO L128 BoogieDeclarations]: Found specification of procedure l0_insert [2018-02-04 04:36:03,289 INFO L128 BoogieDeclarations]: Found specification of procedure l4_destroy [2018-02-04 04:36:03,289 INFO L128 BoogieDeclarations]: Found specification of procedure l3_destroy [2018-02-04 04:36:03,289 INFO L128 BoogieDeclarations]: Found specification of procedure l2_destroy [2018-02-04 04:36:03,289 INFO L128 BoogieDeclarations]: Found specification of procedure l1_destroy [2018-02-04 04:36:03,289 INFO L128 BoogieDeclarations]: Found specification of procedure l0_destroy [2018-02-04 04:36:03,289 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 04:36:03,289 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 04:36:03,290 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 04:36:03,501 WARN L455 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-02-04 04:36:03,745 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 04:36:03,746 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 04:36:03 BoogieIcfgContainer [2018-02-04 04:36:03,746 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 04:36:03,747 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 04:36:03,747 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 04:36:03,751 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 04:36:03,751 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 04:36:02" (1/3) ... [2018-02-04 04:36:03,752 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e6259f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 04:36:03, skipping insertion in model container [2018-02-04 04:36:03,752 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:36:03" (2/3) ... [2018-02-04 04:36:03,752 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e6259f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 04:36:03, skipping insertion in model container [2018-02-04 04:36:03,752 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 04:36:03" (3/3) ... [2018-02-04 04:36:03,754 INFO L107 eAbstractionObserver]: Analyzing ICFG test-0237_true-valid-memsafety.i [2018-02-04 04:36:03,762 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-04 04:36:03,768 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 83 error locations. [2018-02-04 04:36:03,801 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 04:36:03,801 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 04:36:03,801 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-02-04 04:36:03,801 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-04 04:36:03,801 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 04:36:03,802 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 04:36:03,802 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 04:36:03,802 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 04:36:03,803 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 04:36:03,820 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states. [2018-02-04 04:36:03,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-02-04 04:36:03,828 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:36:03,829 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-02-04 04:36:03,829 INFO L371 AbstractCegarLoop]: === Iteration 1 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr7RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr6RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr7RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr6RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr7RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr13RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr8RequiresViolation, l4_insertErr10RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr9RequiresViolation, l4_insertErr12RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr11RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-04 04:36:03,833 INFO L82 PathProgramCache]: Analyzing trace with hash 12677088, 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 04:36:03,845 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:36:03,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:03,918 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 04:36:03,949 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:36:03,949 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 04:36:03,950 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:36:03,951 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 04:36:03,951 INFO L182 omatonBuilderFactory]: Interpolants [253#true, 254#false, 255#(= 1 (select |#valid| |~#list~0.base|))] [2018-02-04 04:36:03,951 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 04:36:03,953 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 04:36:03,962 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 04:36:03,962 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 04:36:03,964 INFO L87 Difference]: Start difference. First operand 250 states. Second operand 3 states. [2018-02-04 04:36:04,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:36:04,172 INFO L93 Difference]: Finished difference Result 279 states and 298 transitions. [2018-02-04 04:36:04,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 04:36:04,173 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-02-04 04:36:04,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:36:04,182 INFO L225 Difference]: With dead ends: 279 [2018-02-04 04:36:04,182 INFO L226 Difference]: Without dead ends: 276 [2018-02-04 04:36:04,183 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 04:36:04,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2018-02-04 04:36:04,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 245. [2018-02-04 04:36:04,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-02-04 04:36:04,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 260 transitions. [2018-02-04 04:36:04,292 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 260 transitions. Word has length 4 [2018-02-04 04:36:04,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:36:04,292 INFO L432 AbstractCegarLoop]: Abstraction has 245 states and 260 transitions. [2018-02-04 04:36:04,292 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 04:36:04,292 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 260 transitions. [2018-02-04 04:36:04,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-02-04 04:36:04,293 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:36:04,293 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-02-04 04:36:04,293 INFO L371 AbstractCegarLoop]: === Iteration 2 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr7RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr6RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr7RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr6RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr7RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr13RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr8RequiresViolation, l4_insertErr10RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr9RequiresViolation, l4_insertErr12RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr11RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-04 04:36:04,293 INFO L82 PathProgramCache]: Analyzing trace with hash 12677089, 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 04:36:04,296 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:36:04,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:04,303 WARN L195 Executor]: ExternalInterpolator (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in) stderr output: WARNING: array quantifier [2018-02-04 04:36:04,306 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 04:36:04,307 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 04:36:04,308 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 04:36:04,308 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 04:36:04,339 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 04:36:04,361 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 04:36:04,378 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:36:04,378 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 04:36:04,378 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:36:04,378 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 04:36:04,378 INFO L182 omatonBuilderFactory]: Interpolants [780#true, 781#false, 782#(exists ((%0 (Array Int Int))) (! (forall ((%1 Int)) (! (= (store %0 %1 4) (store |#length| %1 4)) :qid itp)) :qid itp)), 783#(and (<= (+ |~#list~0.offset| 4) (select |#length| |~#list~0.base|)) (= 4 (select |#length| |~#list~0.base|)) (<= 0 |~#list~0.offset|))] [2018-02-04 04:36:04,378 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 04:36:04,379 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 04:36:04,379 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 04:36:04,380 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2018-02-04 04:36:04,380 INFO L87 Difference]: Start difference. First operand 245 states and 260 transitions. Second operand 4 states. [2018-02-04 04:36:04,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:36:04,504 INFO L93 Difference]: Finished difference Result 252 states and 270 transitions. [2018-02-04 04:36:04,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 04:36:04,504 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2018-02-04 04:36:04,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:36:04,506 INFO L225 Difference]: With dead ends: 252 [2018-02-04 04:36:04,506 INFO L226 Difference]: Without dead ends: 252 [2018-02-04 04:36:04,509 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 04:36:04,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2018-02-04 04:36:04,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 244. [2018-02-04 04:36:04,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2018-02-04 04:36:04,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 259 transitions. [2018-02-04 04:36:04,529 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 259 transitions. Word has length 4 [2018-02-04 04:36:04,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:36:04,529 INFO L432 AbstractCegarLoop]: Abstraction has 244 states and 259 transitions. [2018-02-04 04:36:04,529 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 04:36:04,529 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 259 transitions. [2018-02-04 04:36:04,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 04:36:04,530 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:36:04,530 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 04:36:04,530 INFO L371 AbstractCegarLoop]: === Iteration 3 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr7RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr6RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr7RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr6RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr7RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr13RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr8RequiresViolation, l4_insertErr10RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr9RequiresViolation, l4_insertErr12RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr11RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-04 04:36:04,530 INFO L82 PathProgramCache]: Analyzing trace with hash -144742640, 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 04:36:04,533 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:36:04,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:04,548 WARN L195 Executor]: ExternalInterpolator (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in) stderr output: WARNING: array quantifier [2018-02-04 04:36:04,549 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 04:36:04,549 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 04:36:04,549 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 04:36:04,550 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 04:36:04,561 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 04:36:04,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:04,592 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 04:36:04,614 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:36:04,614 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 04:36:04,614 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:36:04,615 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 04:36:04,615 INFO L182 omatonBuilderFactory]: Interpolants [1280#true, 1281#false, 1287#(exists ((%0 (Array Int Int))) (! (forall ((%1 Int)) (! (= (store |#valid| %1 1) (store %0 %1 1)) :qid itp)) :qid itp)), 1288#(= 1 (select |#valid| |calloc_model_#t~malloc0.base|)), 1289#(= 1 (select |#valid| calloc_model_~ptr~0.base)), 1290#(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 04:36:04,615 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 04:36:04,615 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 04:36:04,615 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 04:36:04,615 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=14, Unknown=1, NotChecked=6, Total=30 [2018-02-04 04:36:04,616 INFO L87 Difference]: Start difference. First operand 244 states and 259 transitions. Second operand 6 states. [2018-02-04 04:36:04,651 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 04:36:05,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:36:05,094 INFO L93 Difference]: Finished difference Result 275 states and 296 transitions. [2018-02-04 04:36:05,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 04:36:05,096 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-02-04 04:36:05,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:36:05,098 INFO L225 Difference]: With dead ends: 275 [2018-02-04 04:36:05,098 INFO L226 Difference]: Without dead ends: 275 [2018-02-04 04:36:05,098 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 04:36:05,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2018-02-04 04:36:05,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 243. [2018-02-04 04:36:05,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-02-04 04:36:05,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 258 transitions. [2018-02-04 04:36:05,111 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 258 transitions. Word has length 17 [2018-02-04 04:36:05,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:36:05,111 INFO L432 AbstractCegarLoop]: Abstraction has 243 states and 258 transitions. [2018-02-04 04:36:05,111 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 04:36:05,112 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 258 transitions. [2018-02-04 04:36:05,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 04:36:05,112 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:36:05,112 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 04:36:05,112 INFO L371 AbstractCegarLoop]: === Iteration 4 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr7RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr6RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr7RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr6RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr7RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr13RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr8RequiresViolation, l4_insertErr10RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr9RequiresViolation, l4_insertErr12RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr11RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-04 04:36:05,113 INFO L82 PathProgramCache]: Analyzing trace with hash -144742639, 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 04:36:05,116 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:36:05,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:05,135 WARN L195 Executor]: ExternalInterpolator (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in) stderr output: WARNING: array quantifier WARNING: array quantifier [2018-02-04 04:36:05,158 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 04:36:05,158 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 04:36:05,159 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 04:36:05,159 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 04:36:05,175 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 04:36:05,175 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 04:36:05,176 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 04:36:05,176 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 04:36:05,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:05,298 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 04:36:05,320 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:36:05,320 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 04:36:05,320 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:36:05,321 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 04:36:05,321 INFO L182 omatonBuilderFactory]: Interpolants [1824#(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|)), 1825#(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)))), 1826#(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)|)), 1813#true, 1814#false, 1820#(= |zalloc_or_die_#in~size| 8), 1821#(= 8 zalloc_or_die_~size), 1822#(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)), 1823#(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))] [2018-02-04 04:36:05,321 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 04:36:05,321 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 04:36:05,322 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 04:36:05,322 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=56, Unknown=1, NotChecked=0, Total=72 [2018-02-04 04:36:05,322 INFO L87 Difference]: Start difference. First operand 243 states and 258 transitions. Second operand 9 states. [2018-02-04 04:36:05,401 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 04:36:06,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:36:06,032 INFO L93 Difference]: Finished difference Result 288 states and 310 transitions. [2018-02-04 04:36:06,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 04:36:06,032 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 17 [2018-02-04 04:36:06,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:36:06,033 INFO L225 Difference]: With dead ends: 288 [2018-02-04 04:36:06,033 INFO L226 Difference]: Without dead ends: 288 [2018-02-04 04:36:06,034 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=121, Unknown=3, NotChecked=22, Total=182 [2018-02-04 04:36:06,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2018-02-04 04:36:06,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 256. [2018-02-04 04:36:06,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-02-04 04:36:06,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 271 transitions. [2018-02-04 04:36:06,042 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 271 transitions. Word has length 17 [2018-02-04 04:36:06,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:36:06,042 INFO L432 AbstractCegarLoop]: Abstraction has 256 states and 271 transitions. [2018-02-04 04:36:06,042 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 04:36:06,042 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 271 transitions. [2018-02-04 04:36:06,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-02-04 04:36:06,043 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:36:06,043 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 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 04:36:06,047 INFO L371 AbstractCegarLoop]: === Iteration 5 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr7RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr6RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr7RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr6RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr7RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr13RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr8RequiresViolation, l4_insertErr10RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr9RequiresViolation, l4_insertErr12RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr11RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-04 04:36:06,047 INFO L82 PathProgramCache]: Analyzing trace with hash -1020493077, 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 04:36:06,055 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:36:06,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:06,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:06,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:06,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:06,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:06,248 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:36:06,270 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:36:06,270 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-04 04:36:06,270 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:36:06,270 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 04:36:06,270 INFO L182 omatonBuilderFactory]: Interpolants [2421#(not (= 8 |zalloc_or_die_#in~size|)), 2406#(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)|)), 2422#(= (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)), 2407#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 2408#(or (and (not (= zalloc_or_die_~size 8)) (not (= |zalloc_or_die_#in~size| 8))) (and (= zalloc_or_die_~size 8) (= |zalloc_or_die_#in~size| 8))), 2428#(not (= (mod (* (mod |calloc_model_#in~nmemb| 4294967296) (mod |calloc_model_#in~size| 4294967296)) 4294967296) 8)), 2381#true, 2429#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 2382#false, 2430#(= 0 |#Ultimate.C_memset_#t~loopctr48|), 2431#(<= |#Ultimate.C_memset_#amount| 0)] [2018-02-04 04:36:06,270 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:36:06,271 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 04:36:06,271 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 04:36:06,271 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-02-04 04:36:06,271 INFO L87 Difference]: Start difference. First operand 256 states and 271 transitions. Second operand 11 states. [2018-02-04 04:36:07,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:36:07,514 INFO L93 Difference]: Finished difference Result 316 states and 346 transitions. [2018-02-04 04:36:07,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 04:36:07,514 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 40 [2018-02-04 04:36:07,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:36:07,516 INFO L225 Difference]: With dead ends: 316 [2018-02-04 04:36:07,516 INFO L226 Difference]: Without dead ends: 309 [2018-02-04 04:36:07,516 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=334, Unknown=0, NotChecked=0, Total=420 [2018-02-04 04:36:07,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2018-02-04 04:36:07,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 259. [2018-02-04 04:36:07,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2018-02-04 04:36:07,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 275 transitions. [2018-02-04 04:36:07,531 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 275 transitions. Word has length 40 [2018-02-04 04:36:07,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:36:07,532 INFO L432 AbstractCegarLoop]: Abstraction has 259 states and 275 transitions. [2018-02-04 04:36:07,532 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 04:36:07,532 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 275 transitions. [2018-02-04 04:36:07,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-04 04:36:07,533 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:36:07,533 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 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 04:36:07,533 INFO L371 AbstractCegarLoop]: === Iteration 6 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr7RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr6RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr7RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr6RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr7RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr13RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr8RequiresViolation, l4_insertErr10RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr9RequiresViolation, l4_insertErr12RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr11RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-04 04:36:07,533 INFO L82 PathProgramCache]: Analyzing trace with hash -569439612, now seen corresponding path program 1 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:36:07,537 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:36:07,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:07,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:07,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:07,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:07,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:07,772 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:36:07,795 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:36:07,795 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-04 04:36:07,796 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:36:07,796 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 04:36:07,796 INFO L182 omatonBuilderFactory]: Interpolants [3027#true, 3028#false, 3077#(not (= (mod (* (mod |calloc_model_#in~nmemb| 4294967296) (mod |calloc_model_#in~size| 4294967296)) 4294967296) 8)), 3078#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 3079#(= |#Ultimate.C_memset_#t~loopctr48| 0), 3080#(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|))), 3081#(<= |#Ultimate.C_memset_#amount| 1), 3053#(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)|)), 3069#(not (= 8 |zalloc_or_die_#in~size|)), 3054#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 3070#(= (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)), 3055#(or (and (not (= zalloc_or_die_~size 8)) (not (= |zalloc_or_die_#in~size| 8))) (and (= zalloc_or_die_~size 8) (= |zalloc_or_die_#in~size| 8)))] [2018-02-04 04:36:07,796 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:36:07,797 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 04:36:07,797 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 04:36:07,797 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-02-04 04:36:07,797 INFO L87 Difference]: Start difference. First operand 259 states and 275 transitions. Second operand 12 states. [2018-02-04 04:36:08,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:36:08,668 INFO L93 Difference]: Finished difference Result 322 states and 353 transitions. [2018-02-04 04:36:08,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 04:36:08,668 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 41 [2018-02-04 04:36:08,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:36:08,669 INFO L225 Difference]: With dead ends: 322 [2018-02-04 04:36:08,669 INFO L226 Difference]: Without dead ends: 315 [2018-02-04 04:36:08,670 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=453, Unknown=0, NotChecked=0, Total=552 [2018-02-04 04:36:08,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2018-02-04 04:36:08,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 260. [2018-02-04 04:36:08,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-02-04 04:36:08,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 277 transitions. [2018-02-04 04:36:08,680 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 277 transitions. Word has length 41 [2018-02-04 04:36:08,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:36:08,680 INFO L432 AbstractCegarLoop]: Abstraction has 260 states and 277 transitions. [2018-02-04 04:36:08,680 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 04:36:08,680 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 277 transitions. [2018-02-04 04:36:08,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-04 04:36:08,681 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:36:08,681 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 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 04:36:08,682 INFO L371 AbstractCegarLoop]: === Iteration 7 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr7RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr6RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr7RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr6RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr7RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr13RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr8RequiresViolation, l4_insertErr10RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr9RequiresViolation, l4_insertErr12RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr11RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-04 04:36:08,682 INFO L82 PathProgramCache]: Analyzing trace with hash 528315915, 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 04:36:08,690 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:36:08,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:08,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:08,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:08,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:08,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:08,851 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:36:08,868 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:36:08,868 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-04 04:36:08,868 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:36:08,869 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 04:36:08,869 INFO L182 omatonBuilderFactory]: Interpolants [3744#(= 1 |#Ultimate.C_memset_#t~loopctr48|), 3745#(or (and (< 2 |#Ultimate.C_memset_#amount|) (< |#Ultimate.C_memset_#t~loopctr48| |#Ultimate.C_memset_#amount|)) (and (<= |#Ultimate.C_memset_#amount| |#Ultimate.C_memset_#t~loopctr48|) (<= |#Ultimate.C_memset_#amount| 2))), 3746#(<= |#Ultimate.C_memset_#amount| 2), 3715#(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)|)), 3716#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 3717#(or (and (not (= zalloc_or_die_~size 8)) (not (= |zalloc_or_die_#in~size| 8))) (and (= zalloc_or_die_~size 8) (= |zalloc_or_die_#in~size| 8))), 3688#true, 3689#false, 3732#(not (= 8 |zalloc_or_die_#in~size|)), 3733#(= (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)), 3741#(not (= (mod (* (mod |calloc_model_#in~nmemb| 4294967296) (mod |calloc_model_#in~size| 4294967296)) 4294967296) 8)), 3742#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 3743#(= 0 |#Ultimate.C_memset_#t~loopctr48|)] [2018-02-04 04:36:08,869 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:36:08,869 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 04:36:08,869 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 04:36:08,869 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2018-02-04 04:36:08,870 INFO L87 Difference]: Start difference. First operand 260 states and 277 transitions. Second operand 13 states. [2018-02-04 04:36:09,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:36:09,900 INFO L93 Difference]: Finished difference Result 325 states and 357 transitions. [2018-02-04 04:36:09,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-04 04:36:09,900 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 42 [2018-02-04 04:36:09,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:36:09,902 INFO L225 Difference]: With dead ends: 325 [2018-02-04 04:36:09,902 INFO L226 Difference]: Without dead ends: 318 [2018-02-04 04:36:09,902 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=107, Invalid=543, Unknown=0, NotChecked=0, Total=650 [2018-02-04 04:36:09,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2018-02-04 04:36:09,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 261. [2018-02-04 04:36:09,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2018-02-04 04:36:09,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 279 transitions. [2018-02-04 04:36:09,910 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 279 transitions. Word has length 42 [2018-02-04 04:36:09,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:36:09,910 INFO L432 AbstractCegarLoop]: Abstraction has 261 states and 279 transitions. [2018-02-04 04:36:09,910 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 04:36:09,910 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 279 transitions. [2018-02-04 04:36:09,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-04 04:36:09,911 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:36:09,911 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 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 04:36:09,911 INFO L371 AbstractCegarLoop]: === Iteration 8 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr7RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr6RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr7RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr6RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr7RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr13RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr8RequiresViolation, l4_insertErr10RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr9RequiresViolation, l4_insertErr12RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr11RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-04 04:36:09,911 INFO L82 PathProgramCache]: Analyzing trace with hash 198998884, 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 04:36:09,913 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:36:09,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:09,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:09,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:09,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:10,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:10,078 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:36:10,095 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:36:10,096 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-04 04:36:10,096 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:36:10,096 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 04:36:10,096 INFO L182 omatonBuilderFactory]: Interpolants [4416#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 4417#(= 0 |#Ultimate.C_memset_#t~loopctr48|), 4418#(= 1 |#Ultimate.C_memset_#t~loopctr48|), 4387#(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)|)), 4419#(<= |#Ultimate.C_memset_#t~loopctr48| 2), 4388#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 4420#(<= |#Ultimate.C_memset_#t~loopctr48| 3), 4389#(or (and (not (= zalloc_or_die_~size 8)) (not (= |zalloc_or_die_#in~size| 8))) (and (= zalloc_or_die_~size 8) (= |zalloc_or_die_#in~size| 8))), 4421#(not (= 8 |#Ultimate.C_memset_#amount|)), 4359#true, 4360#false, 4405#(not (= 8 |zalloc_or_die_#in~size|)), 4406#(= (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)), 4415#(not (= (mod (* (mod |calloc_model_#in~nmemb| 4294967296) (mod |calloc_model_#in~size| 4294967296)) 4294967296) 8))] [2018-02-04 04:36:10,097 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:36:10,097 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 04:36:10,097 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 04:36:10,097 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2018-02-04 04:36:10,098 INFO L87 Difference]: Start difference. First operand 261 states and 279 transitions. Second operand 14 states. [2018-02-04 04:36:11,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:36:11,045 INFO L93 Difference]: Finished difference Result 328 states and 361 transitions. [2018-02-04 04:36:11,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-04 04:36:11,045 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 43 [2018-02-04 04:36:11,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:36:11,047 INFO L225 Difference]: With dead ends: 328 [2018-02-04 04:36:11,047 INFO L226 Difference]: Without dead ends: 321 [2018-02-04 04:36:11,047 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=126, Invalid=630, Unknown=0, NotChecked=0, Total=756 [2018-02-04 04:36:11,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2018-02-04 04:36:11,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 262. [2018-02-04 04:36:11,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2018-02-04 04:36:11,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 281 transitions. [2018-02-04 04:36:11,052 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 281 transitions. Word has length 43 [2018-02-04 04:36:11,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:36:11,052 INFO L432 AbstractCegarLoop]: Abstraction has 262 states and 281 transitions. [2018-02-04 04:36:11,052 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 04:36:11,052 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 281 transitions. [2018-02-04 04:36:11,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-02-04 04:36:11,052 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:36:11,052 INFO L351 BasicCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 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 04:36:11,053 INFO L371 AbstractCegarLoop]: === Iteration 9 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr7RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr6RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr7RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr6RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr7RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr13RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr8RequiresViolation, l4_insertErr10RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr9RequiresViolation, l4_insertErr12RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr11RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-04 04:36:11,053 INFO L82 PathProgramCache]: Analyzing trace with hash -1419894485, now seen corresponding path program 4 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:36:11,056 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:36:11,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:11,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:11,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:11,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:11,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:11,312 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:36:11,329 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:36:11,329 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-04 04:36:11,330 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:36:11,330 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 04:36:11,330 INFO L182 omatonBuilderFactory]: Interpolants [5088#(not (= 8 |zalloc_or_die_#in~size|)), 5089#(= (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)), 5099#(not (= (mod (* (mod |calloc_model_#in~nmemb| 4294967296) (mod |calloc_model_#in~size| 4294967296)) 4294967296) 8)), 5100#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 5069#(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)|)), 5101#(= 0 |#Ultimate.C_memset_#t~loopctr48|), 5070#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 5102#(= 1 |#Ultimate.C_memset_#t~loopctr48|), 5071#(or (and (not (= zalloc_or_die_~size 8)) (not (= |zalloc_or_die_#in~size| 8))) (and (= zalloc_or_die_~size 8) (= |zalloc_or_die_#in~size| 8))), 5103#(<= |#Ultimate.C_memset_#t~loopctr48| 2), 5040#true, 5104#(<= |#Ultimate.C_memset_#t~loopctr48| 3), 5041#false, 5105#(<= |#Ultimate.C_memset_#t~loopctr48| 4), 5106#(not (= 8 |#Ultimate.C_memset_#amount|))] [2018-02-04 04:36:11,330 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:36:11,330 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 04:36:11,330 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 04:36:11,330 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2018-02-04 04:36:11,331 INFO L87 Difference]: Start difference. First operand 262 states and 281 transitions. Second operand 15 states. [2018-02-04 04:36:12,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:36:12,256 INFO L93 Difference]: Finished difference Result 331 states and 365 transitions. [2018-02-04 04:36:12,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-04 04:36:12,256 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 44 [2018-02-04 04:36:12,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:36:12,258 INFO L225 Difference]: With dead ends: 331 [2018-02-04 04:36:12,258 INFO L226 Difference]: Without dead ends: 324 [2018-02-04 04:36:12,258 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=145, Invalid=725, Unknown=0, NotChecked=0, Total=870 [2018-02-04 04:36:12,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2018-02-04 04:36:12,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 263. [2018-02-04 04:36:12,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2018-02-04 04:36:12,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 283 transitions. [2018-02-04 04:36:12,263 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 283 transitions. Word has length 44 [2018-02-04 04:36:12,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:36:12,263 INFO L432 AbstractCegarLoop]: Abstraction has 263 states and 283 transitions. [2018-02-04 04:36:12,263 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 04:36:12,263 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 283 transitions. [2018-02-04 04:36:12,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-02-04 04:36:12,263 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:36:12,263 INFO L351 BasicCegarLoop]: trace histogram [5, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 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 04:36:12,263 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_insertErr7RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr6RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr7RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr6RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr7RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr13RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr8RequiresViolation, l4_insertErr10RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr9RequiresViolation, l4_insertErr12RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr11RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-04 04:36:12,264 INFO L82 PathProgramCache]: Analyzing trace with hash -65981372, 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 04:36:12,267 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:36:12,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:12,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:12,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:12,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:12,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:12,456 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:36:12,473 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:36:12,473 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-04 04:36:12,473 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:36:12,474 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 04:36:12,474 INFO L182 omatonBuilderFactory]: Interpolants [5761#(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)|)), 5793#(not (= (mod (* (mod |calloc_model_#in~nmemb| 4294967296) (mod |calloc_model_#in~size| 4294967296)) 4294967296) 8)), 5762#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 5794#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 5731#true, 5763#(or (and (not (= zalloc_or_die_~size 8)) (not (= |zalloc_or_die_#in~size| 8))) (and (= zalloc_or_die_~size 8) (= |zalloc_or_die_#in~size| 8))), 5795#(= 0 |#Ultimate.C_memset_#t~loopctr48|), 5732#false, 5796#(= 1 |#Ultimate.C_memset_#t~loopctr48|), 5797#(= |#Ultimate.C_memset_#t~loopctr48| 2), 5798#(<= |#Ultimate.C_memset_#t~loopctr48| 3), 5799#(<= |#Ultimate.C_memset_#t~loopctr48| 4), 5800#(<= |#Ultimate.C_memset_#t~loopctr48| 5), 5801#(not (= 8 |#Ultimate.C_memset_#amount|)), 5781#(not (= 8 |zalloc_or_die_#in~size|)), 5782#(= (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 04:36:12,474 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:36:12,474 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 04:36:12,475 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 04:36:12,475 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2018-02-04 04:36:12,475 INFO L87 Difference]: Start difference. First operand 263 states and 283 transitions. Second operand 16 states. [2018-02-04 04:36:13,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:36:13,566 INFO L93 Difference]: Finished difference Result 334 states and 369 transitions. [2018-02-04 04:36:13,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-04 04:36:13,567 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 45 [2018-02-04 04:36:13,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:36:13,568 INFO L225 Difference]: With dead ends: 334 [2018-02-04 04:36:13,568 INFO L226 Difference]: Without dead ends: 327 [2018-02-04 04:36:13,568 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=160, Invalid=832, Unknown=0, NotChecked=0, Total=992 [2018-02-04 04:36:13,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2018-02-04 04:36:13,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 264. [2018-02-04 04:36:13,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2018-02-04 04:36:13,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 285 transitions. [2018-02-04 04:36:13,572 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 285 transitions. Word has length 45 [2018-02-04 04:36:13,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:36:13,572 INFO L432 AbstractCegarLoop]: Abstraction has 264 states and 285 transitions. [2018-02-04 04:36:13,573 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 04:36:13,573 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 285 transitions. [2018-02-04 04:36:13,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-02-04 04:36:13,573 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:36:13,573 INFO L351 BasicCegarLoop]: trace histogram [6, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 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 04:36:13,573 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_insertErr7RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr6RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr7RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr6RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr7RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr13RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr8RequiresViolation, l4_insertErr10RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr9RequiresViolation, l4_insertErr12RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr11RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-04 04:36:13,573 INFO L82 PathProgramCache]: Analyzing trace with hash -1044347829, 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 04:36:13,576 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:36:13,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:13,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:13,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:13,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:13,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:13,769 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:36:13,785 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:36:13,785 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-04 04:36:13,786 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:36:13,786 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 04:36:13,786 INFO L182 omatonBuilderFactory]: Interpolants [6432#true, 6464#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 6433#false, 6465#(or (and (not (= zalloc_or_die_~size 8)) (not (= |zalloc_or_die_#in~size| 8))) (and (= zalloc_or_die_~size 8) (= |zalloc_or_die_#in~size| 8))), 6497#(not (= (mod (* (mod |calloc_model_#in~nmemb| 4294967296) (mod |calloc_model_#in~size| 4294967296)) 4294967296) 8)), 6498#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 6499#(= 0 |#Ultimate.C_memset_#t~loopctr48|), 6500#(= 1 |#Ultimate.C_memset_#t~loopctr48|), 6501#(= |#Ultimate.C_memset_#t~loopctr48| 2), 6502#(= |#Ultimate.C_memset_#t~loopctr48| 3), 6503#(<= |#Ultimate.C_memset_#t~loopctr48| 4), 6504#(<= |#Ultimate.C_memset_#t~loopctr48| 5), 6505#(<= |#Ultimate.C_memset_#t~loopctr48| 6), 6506#(not (= 8 |#Ultimate.C_memset_#amount|)), 6484#(not (= 8 |zalloc_or_die_#in~size|)), 6485#(= (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)), 6463#(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 04:36:13,786 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:36:13,786 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 04:36:13,787 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 04:36:13,787 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2018-02-04 04:36:13,787 INFO L87 Difference]: Start difference. First operand 264 states and 285 transitions. Second operand 17 states. [2018-02-04 04:36:14,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:36:14,912 INFO L93 Difference]: Finished difference Result 337 states and 373 transitions. [2018-02-04 04:36:14,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-04 04:36:14,912 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 46 [2018-02-04 04:36:14,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:36:14,913 INFO L225 Difference]: With dead ends: 337 [2018-02-04 04:36:14,913 INFO L226 Difference]: Without dead ends: 330 [2018-02-04 04:36:14,914 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 9 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 04:36:14,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2018-02-04 04:36:14,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 265. [2018-02-04 04:36:14,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2018-02-04 04:36:14,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 287 transitions. [2018-02-04 04:36:14,919 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 287 transitions. Word has length 46 [2018-02-04 04:36:14,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:36:14,920 INFO L432 AbstractCegarLoop]: Abstraction has 265 states and 287 transitions. [2018-02-04 04:36:14,920 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 04:36:14,920 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 287 transitions. [2018-02-04 04:36:14,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-04 04:36:14,921 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:36:14,921 INFO L351 BasicCegarLoop]: trace histogram [7, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 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 04:36:14,921 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_insertErr7RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr6RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr7RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr6RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr7RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr13RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr8RequiresViolation, l4_insertErr10RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr9RequiresViolation, l4_insertErr12RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr11RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-04 04:36:14,921 INFO L82 PathProgramCache]: Analyzing trace with hash -1308936924, 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 04:36:14,928 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:36:14,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:14,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:14,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:14,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:15,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:15,127 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:36:15,143 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:36:15,143 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-04 04:36:15,143 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:36:15,143 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 04:36:15,144 INFO L182 omatonBuilderFactory]: Interpolants [7143#true, 7175#(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)|)), 7144#false, 7176#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 7177#(or (and (not (= zalloc_or_die_~size 8)) (not (= |zalloc_or_die_#in~size| 8))) (and (= zalloc_or_die_~size 8) (= |zalloc_or_die_#in~size| 8))), 7211#(not (= (mod (* (mod |calloc_model_#in~nmemb| 4294967296) (mod |calloc_model_#in~size| 4294967296)) 4294967296) 8)), 7212#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 7213#(= 0 |#Ultimate.C_memset_#t~loopctr48|), 7214#(<= |#Ultimate.C_memset_#t~loopctr48| 1), 7215#(<= |#Ultimate.C_memset_#t~loopctr48| 2), 7216#(<= |#Ultimate.C_memset_#t~loopctr48| 3), 7217#(<= |#Ultimate.C_memset_#t~loopctr48| 4), 7218#(<= |#Ultimate.C_memset_#t~loopctr48| 5), 7219#(<= |#Ultimate.C_memset_#t~loopctr48| 6), 7220#(<= |#Ultimate.C_memset_#t~loopctr48| 7), 7221#(not (= 8 |#Ultimate.C_memset_#amount|)), 7197#(not (= 8 |zalloc_or_die_#in~size|)), 7198#(= (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 04:36:15,144 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:36:15,144 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 04:36:15,144 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 04:36:15,144 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2018-02-04 04:36:15,144 INFO L87 Difference]: Start difference. First operand 265 states and 287 transitions. Second operand 18 states. [2018-02-04 04:36:16,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:36:16,305 INFO L93 Difference]: Finished difference Result 340 states and 377 transitions. [2018-02-04 04:36:16,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-04 04:36:16,305 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 47 [2018-02-04 04:36:16,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:36:16,306 INFO L225 Difference]: With dead ends: 340 [2018-02-04 04:36:16,306 INFO L226 Difference]: Without dead ends: 333 [2018-02-04 04:36:16,306 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=224, Invalid=1036, Unknown=0, NotChecked=0, Total=1260 [2018-02-04 04:36:16,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2018-02-04 04:36:16,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 266. [2018-02-04 04:36:16,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2018-02-04 04:36:16,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 289 transitions. [2018-02-04 04:36:16,312 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 289 transitions. Word has length 47 [2018-02-04 04:36:16,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:36:16,313 INFO L432 AbstractCegarLoop]: Abstraction has 266 states and 289 transitions. [2018-02-04 04:36:16,313 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 04:36:16,313 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 289 transitions. [2018-02-04 04:36:16,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-04 04:36:16,313 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:36:16,314 INFO L351 BasicCegarLoop]: trace histogram [8, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 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 04:36:16,314 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_insertErr7RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr6RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr7RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr6RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr7RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr13RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr8RequiresViolation, l4_insertErr10RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr9RequiresViolation, l4_insertErr12RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr11RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-04 04:36:16,314 INFO L82 PathProgramCache]: Analyzing trace with hash -921264277, 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 04:36:16,319 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:36:16,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:16,346 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 04:36:16,364 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 04:36:16,365 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 04:36:16,365 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 04:36:16,365 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 04:36:16,374 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 04:36:16,375 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 04:36:16,375 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 04:36:16,375 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 04:36:16,379 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-02-04 04:36:16,380 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 04:36:16,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:16,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:16,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:16,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:16,516 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-02-04 04:36:16,533 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:36:16,533 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-04 04:36:16,534 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:36:16,534 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 04:36:16,534 INFO L182 omatonBuilderFactory]: Interpolants [7904#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 7938#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 7864#true, 7865#false, 7897#(= |zalloc_or_die_#in~size| 12), 7898#(= 12 zalloc_or_die_~size), 7899#(exists ((%0 (Array Int Int))) (! (and (= |calloc_model_#in~nmemb| 1) (forall ((%1 Int)) (! (= (store %0 %1 12) (store |#length| %1 12)) :qid itp)) (= |calloc_model_#in~size| 12)) :qid itp)), 7900#(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))) 12) (forall ((%1 Int)) (! (= (store %0 %1 12) (store |#length| %1 12)) :qid itp))) :qid itp)), 7901#(and (= 12 (mod (* (mod calloc_model_~nmemb 4294967296) (mod calloc_model_~size 4294967296)) 4294967296)) (= 0 |calloc_model_#t~malloc0.offset|) (= 12 (select |#length| |calloc_model_#t~malloc0.base|))), 7902#(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)))), 7903#(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 04:36:16,534 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-02-04 04:36:16,534 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 04:36:16,534 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 04:36:16,535 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=86, Unknown=2, NotChecked=0, Total=110 [2018-02-04 04:36:16,535 INFO L87 Difference]: Start difference. First operand 266 states and 289 transitions. Second operand 11 states. [2018-02-04 04:36:16,638 WARN L1011 $PredicateComparison]: unable to prove that (and (= |c_~#list~0.base| |c_old(~#list~0.base)|) (= |c_#valid| |c_old(#valid)|) (= |c_~#list~0.offset| |c_old(~#list~0.offset)|) (= |c_#NULL.base| |c_old(#NULL.base)|) (exists ((%0 (Array Int Int))) (! (and (= |c_calloc_model_#in~nmemb| 1) (forall ((%1 Int)) (! (= (store %0 %1 12) (store |c_#length| %1 12)) :qid itp)) (= |c_calloc_model_#in~size| 12)) :qid itp)) (= |c_#NULL.offset| |c_old(#NULL.offset)|) (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= |c_old(#length)| |c_#length|) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|)) is different from false [2018-02-04 04:36:17,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:36:17,200 INFO L93 Difference]: Finished difference Result 317 states and 347 transitions. [2018-02-04 04:36:17,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 04:36:17,200 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 48 [2018-02-04 04:36:17,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:36:17,202 INFO L225 Difference]: With dead ends: 317 [2018-02-04 04:36:17,202 INFO L226 Difference]: Without dead ends: 317 [2018-02-04 04:36:17,202 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=4, NotChecked=26, Total=240 [2018-02-04 04:36:17,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2018-02-04 04:36:17,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 279. [2018-02-04 04:36:17,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2018-02-04 04:36:17,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 303 transitions. [2018-02-04 04:36:17,208 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 303 transitions. Word has length 48 [2018-02-04 04:36:17,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:36:17,208 INFO L432 AbstractCegarLoop]: Abstraction has 279 states and 303 transitions. [2018-02-04 04:36:17,209 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 04:36:17,209 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 303 transitions. [2018-02-04 04:36:17,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-02-04 04:36:17,210 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:36:17,210 INFO L351 BasicCegarLoop]: trace histogram [8, 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 04:36:17,210 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_insertErr7RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr6RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr7RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr6RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr7RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr13RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr8RequiresViolation, l4_insertErr10RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr9RequiresViolation, l4_insertErr12RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr11RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-04 04:36:17,211 INFO L82 PathProgramCache]: Analyzing trace with hash 2128145214, 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 04:36:17,219 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:36:17,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:17,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:17,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:17,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:17,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:17,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:17,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:17,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:17,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:17,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:17,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:17,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:17,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:17,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:17,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:17,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:17,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:17,430 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2018-02-04 04:36:17,445 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:36:17,446 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-04 04:36:17,446 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:36:17,446 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2018-02-04 04:36:17,446 INFO L182 omatonBuilderFactory]: Interpolants [8545#true, 8737#(or (and (= zalloc_or_die_~size 12) (= |zalloc_or_die_#in~size| 12)) (and (not (= zalloc_or_die_~size 12)) (not (= |zalloc_or_die_#in~size| 12)))), 8546#false, 8757#(not (= (mod (* (mod |calloc_model_#in~nmemb| 4294967296) (mod |calloc_model_#in~size| 4294967296)) 4294967296) 12)), 8758#(= 0 |#Ultimate.C_memset_#t~loopctr48|), 8759#(<= |#Ultimate.C_memset_#amount| 0), 8650#(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)|)), 8651#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 8685#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 8750#(not (= 12 |zalloc_or_die_#in~size|)), 8751#(= (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 04:36:17,446 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2018-02-04 04:36:17,447 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 04:36:17,447 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 04:36:17,447 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-02-04 04:36:17,447 INFO L87 Difference]: Start difference. First operand 279 states and 303 transitions. Second operand 11 states. [2018-02-04 04:36:18,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:36:18,202 INFO L93 Difference]: Finished difference Result 324 states and 353 transitions. [2018-02-04 04:36:18,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 04:36:18,203 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 137 [2018-02-04 04:36:18,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:36:18,204 INFO L225 Difference]: With dead ends: 324 [2018-02-04 04:36:18,204 INFO L226 Difference]: Without dead ends: 317 [2018-02-04 04:36:18,204 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 34 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 04:36:18,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2018-02-04 04:36:18,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 281. [2018-02-04 04:36:18,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2018-02-04 04:36:18,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 305 transitions. [2018-02-04 04:36:18,208 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 305 transitions. Word has length 137 [2018-02-04 04:36:18,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:36:18,208 INFO L432 AbstractCegarLoop]: Abstraction has 281 states and 305 transitions. [2018-02-04 04:36:18,208 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 04:36:18,208 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 305 transitions. [2018-02-04 04:36:18,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-02-04 04:36:18,209 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:36:18,209 INFO L351 BasicCegarLoop]: trace histogram [12, 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 04:36:18,210 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_insertErr7RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr6RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr7RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr6RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr7RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr13RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr8RequiresViolation, l4_insertErr10RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr9RequiresViolation, l4_insertErr12RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr11RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-04 04:36:18,210 INFO L82 PathProgramCache]: Analyzing trace with hash -501524986, now seen corresponding path program 2 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:36:18,214 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:36:18,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:18,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:18,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:18,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:18,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:18,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:18,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:18,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:18,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:18,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:18,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:18,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:18,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:18,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:18,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:18,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:18,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:18,411 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 61 proven. 52 refuted. 0 times theorem prover too weak. 223 trivial. 0 not checked. [2018-02-04 04:36:18,428 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:36:18,428 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-04 04:36:18,428 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:36:18,428 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 2 proven. 45 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2018-02-04 04:36:18,428 INFO L182 omatonBuilderFactory]: Interpolants [9553#(or (not (= |calloc_model_#in~size| 12)) (not (= |calloc_model_#in~nmemb| 1))), 9554#(= 0 |#Ultimate.C_memset_#t~loopctr48|), 9555#(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|))), 9556#(<= |#Ultimate.C_memset_#amount| 1), 9495#(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)|)), 9496#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 9545#(not (= 12 |zalloc_or_die_#in~size|)), 9386#true, 9530#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 9546#(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)))), 9387#false, 9531#(or (and (= zalloc_or_die_~size 12) (= |zalloc_or_die_#in~size| 12)) (and (not (= zalloc_or_die_~size 12)) (not (= |zalloc_or_die_#in~size| 12))))] [2018-02-04 04:36:18,429 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 61 proven. 52 refuted. 0 times theorem prover too weak. 223 trivial. 0 not checked. [2018-02-04 04:36:18,429 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 04:36:18,429 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 04:36:18,429 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-02-04 04:36:18,429 INFO L87 Difference]: Start difference. First operand 281 states and 305 transitions. Second operand 12 states. [2018-02-04 04:36:20,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:36:20,019 INFO L93 Difference]: Finished difference Result 326 states and 355 transitions. [2018-02-04 04:36:20,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-04 04:36:20,019 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 141 [2018-02-04 04:36:20,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:36:20,020 INFO L225 Difference]: With dead ends: 326 [2018-02-04 04:36:20,021 INFO L226 Difference]: Without dead ends: 319 [2018-02-04 04:36:20,021 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=117, Invalid=533, Unknown=0, NotChecked=0, Total=650 [2018-02-04 04:36:20,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2018-02-04 04:36:20,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 281. [2018-02-04 04:36:20,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2018-02-04 04:36:20,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 305 transitions. [2018-02-04 04:36:20,025 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 305 transitions. Word has length 141 [2018-02-04 04:36:20,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:36:20,025 INFO L432 AbstractCegarLoop]: Abstraction has 281 states and 305 transitions. [2018-02-04 04:36:20,025 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 04:36:20,025 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 305 transitions. [2018-02-04 04:36:20,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-02-04 04:36:20,026 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:36:20,026 INFO L351 BasicCegarLoop]: trace histogram [16, 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 04:36:20,026 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_insertErr7RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr6RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr7RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr6RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr7RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr13RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr8RequiresViolation, l4_insertErr10RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr9RequiresViolation, l4_insertErr12RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr11RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-04 04:36:20,026 INFO L82 PathProgramCache]: Analyzing trace with hash -897071938, 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 04:36:20,039 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:36:20,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:20,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:20,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:20,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:20,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:20,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:20,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:20,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:20,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:20,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:20,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:20,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:20,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:20,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:20,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:20,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:20,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:20,209 INFO L134 CoverageAnalysis]: Checked inductivity of 410 backedges. 70 proven. 69 refuted. 0 times theorem prover too weak. 271 trivial. 0 not checked. [2018-02-04 04:36:20,225 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:36:20,225 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-04 04:36:20,225 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:36:20,226 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 3 proven. 48 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2018-02-04 04:36:20,226 INFO L182 omatonBuilderFactory]: Interpolants [10250#true, 10251#false, 10414#(not (= 12 |zalloc_or_die_#in~size|)), 10415#(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)))), 10423#(or (not (= |calloc_model_#in~size| 12)) (not (= |calloc_model_#in~nmemb| 1))), 10424#(= 0 |#Ultimate.C_memset_#t~loopctr48|), 10425#(= 1 |#Ultimate.C_memset_#t~loopctr48|), 10426#(or (and (< 2 |#Ultimate.C_memset_#amount|) (< |#Ultimate.C_memset_#t~loopctr48| |#Ultimate.C_memset_#amount|)) (and (<= |#Ultimate.C_memset_#amount| |#Ultimate.C_memset_#t~loopctr48|) (<= |#Ultimate.C_memset_#amount| 2))), 10363#(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)|)), 10427#(<= |#Ultimate.C_memset_#amount| 2), 10364#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 10398#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 10399#(or (and (= zalloc_or_die_~size 12) (= |zalloc_or_die_#in~size| 12)) (and (not (= zalloc_or_die_~size 12)) (not (= |zalloc_or_die_#in~size| 12))))] [2018-02-04 04:36:20,226 INFO L134 CoverageAnalysis]: Checked inductivity of 410 backedges. 70 proven. 69 refuted. 0 times theorem prover too weak. 271 trivial. 0 not checked. [2018-02-04 04:36:20,226 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 04:36:20,226 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 04:36:20,226 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2018-02-04 04:36:20,226 INFO L87 Difference]: Start difference. First operand 281 states and 305 transitions. Second operand 13 states. [2018-02-04 04:36:21,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:36:21,034 INFO L93 Difference]: Finished difference Result 328 states and 357 transitions. [2018-02-04 04:36:21,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-04 04:36:21,034 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 145 [2018-02-04 04:36:21,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:36:21,035 INFO L225 Difference]: With dead ends: 328 [2018-02-04 04:36:21,035 INFO L226 Difference]: Without dead ends: 321 [2018-02-04 04:36:21,036 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=125, Invalid=631, Unknown=0, NotChecked=0, Total=756 [2018-02-04 04:36:21,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2018-02-04 04:36:21,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 281. [2018-02-04 04:36:21,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2018-02-04 04:36:21,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 305 transitions. [2018-02-04 04:36:21,039 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 305 transitions. Word has length 145 [2018-02-04 04:36:21,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:36:21,039 INFO L432 AbstractCegarLoop]: Abstraction has 281 states and 305 transitions. [2018-02-04 04:36:21,039 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 04:36:21,039 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 305 transitions. [2018-02-04 04:36:21,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-02-04 04:36:21,039 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:36:21,040 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 04:36:21,040 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_insertErr7RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr6RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr7RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr6RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr7RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr13RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr8RequiresViolation, l4_insertErr10RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr9RequiresViolation, l4_insertErr12RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr11RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-04 04:36:21,040 INFO L82 PathProgramCache]: Analyzing trace with hash -2110093178, 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 04:36:21,042 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:36:21,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:21,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:21,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:21,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:21,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:21,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:21,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:21,353 WARN L146 SmtUtils]: Spent 209ms on a formula simplification. DAG size of input: 40 DAG size of output 22 [2018-02-04 04:36:21,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:21,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:21,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:21,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:21,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:21,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:21,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:21,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:21,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:21,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:21,494 INFO L134 CoverageAnalysis]: Checked inductivity of 500 backedges. 79 proven. 93 refuted. 0 times theorem prover too weak. 328 trivial. 0 not checked. [2018-02-04 04:36:21,510 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:36:21,510 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-04 04:36:21,511 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:36:21,511 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 4 proven. 51 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2018-02-04 04:36:21,511 INFO L182 omatonBuilderFactory]: Interpolants [11300#(not (= 12 |zalloc_or_die_#in~size|)), 11301#(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)))), 11310#(or (not (= (mod |calloc_model_#in~size| 4294967296) 12)) (not (= |calloc_model_#in~nmemb| 1))), 11311#(= 0 |#Ultimate.C_memset_#t~loopctr48|), 11248#(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)|)), 11312#(= 1 |#Ultimate.C_memset_#t~loopctr48|), 11249#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 11313#(and (<= |#Ultimate.C_memset_#t~loopctr48| 2) (<= 2 |#Ultimate.C_memset_#t~loopctr48|)), 11314#(and (< 2 |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#t~loopctr48| 3)), 11283#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 11315#(and (< 2 |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#amount| 3)), 11284#(or (and (= zalloc_or_die_~size 12) (= |zalloc_or_die_#in~size| 12)) (and (not (= zalloc_or_die_~size 12)) (not (= |zalloc_or_die_#in~size| 12)))), 11131#true, 11132#false] [2018-02-04 04:36:21,511 INFO L134 CoverageAnalysis]: Checked inductivity of 500 backedges. 79 proven. 93 refuted. 0 times theorem prover too weak. 328 trivial. 0 not checked. [2018-02-04 04:36:21,511 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 04:36:21,512 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 04:36:21,512 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2018-02-04 04:36:21,512 INFO L87 Difference]: Start difference. First operand 281 states and 305 transitions. Second operand 14 states. [2018-02-04 04:36:22,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:36:22,840 INFO L93 Difference]: Finished difference Result 333 states and 362 transitions. [2018-02-04 04:36:22,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 04:36:22,840 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 149 [2018-02-04 04:36:22,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:36:22,842 INFO L225 Difference]: With dead ends: 333 [2018-02-04 04:36:22,842 INFO L226 Difference]: Without dead ends: 326 [2018-02-04 04:36:22,842 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=86, Invalid=466, Unknown=0, NotChecked=0, Total=552 [2018-02-04 04:36:22,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2018-02-04 04:36:22,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 281. [2018-02-04 04:36:22,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2018-02-04 04:36:22,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 305 transitions. [2018-02-04 04:36:22,847 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 305 transitions. Word has length 149 [2018-02-04 04:36:22,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:36:22,848 INFO L432 AbstractCegarLoop]: Abstraction has 281 states and 305 transitions. [2018-02-04 04:36:22,848 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 04:36:22,848 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 305 transitions. [2018-02-04 04:36:22,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-02-04 04:36:22,849 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:36:22,849 INFO L351 BasicCegarLoop]: trace histogram [24, 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 04:36:22,849 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_insertErr7RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr6RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr7RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr6RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr7RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr13RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr8RequiresViolation, l4_insertErr10RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr9RequiresViolation, l4_insertErr12RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr11RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-04 04:36:22,849 INFO L82 PathProgramCache]: Analyzing trace with hash 1031642686, 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 04:36:22,856 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:36:22,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:22,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:22,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:22,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:22,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:22,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:22,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:23,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:23,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:23,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:23,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:23,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:23,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:23,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:23,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:23,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:23,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:23,129 INFO L134 CoverageAnalysis]: Checked inductivity of 606 backedges. 88 proven. 124 refuted. 0 times theorem prover too weak. 394 trivial. 0 not checked. [2018-02-04 04:36:23,145 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:36:23,145 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-04 04:36:23,145 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:36:23,146 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 5 proven. 54 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2018-02-04 04:36:23,146 INFO L182 omatonBuilderFactory]: Interpolants [12194#(not (= 12 |zalloc_or_die_#in~size|)), 12195#(= (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)), 12141#(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)|)), 12205#(not (= (mod (* (mod |calloc_model_#in~nmemb| 4294967296) (mod |calloc_model_#in~size| 4294967296)) 4294967296) 12)), 12142#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 12206#(= 0 |#Ultimate.C_memset_#t~loopctr48|), 12207#(<= |#Ultimate.C_memset_#t~loopctr48| 1), 12176#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 12208#(<= |#Ultimate.C_memset_#t~loopctr48| 2), 12177#(or (and (= zalloc_or_die_~size 12) (= |zalloc_or_die_#in~size| 12)) (and (not (= zalloc_or_die_~size 12)) (not (= |zalloc_or_die_#in~size| 12)))), 12209#(<= |#Ultimate.C_memset_#t~loopctr48| 3), 12210#(<= |#Ultimate.C_memset_#t~loopctr48| 4), 12211#(not (= 12 |#Ultimate.C_memset_#amount|)), 12020#true, 12021#false] [2018-02-04 04:36:23,146 INFO L134 CoverageAnalysis]: Checked inductivity of 606 backedges. 88 proven. 124 refuted. 0 times theorem prover too weak. 394 trivial. 0 not checked. [2018-02-04 04:36:23,146 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 04:36:23,146 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 04:36:23,146 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2018-02-04 04:36:23,147 INFO L87 Difference]: Start difference. First operand 281 states and 305 transitions. Second operand 15 states. [2018-02-04 04:36:24,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:36:24,119 INFO L93 Difference]: Finished difference Result 335 states and 364 transitions. [2018-02-04 04:36:24,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-04 04:36:24,119 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 153 [2018-02-04 04:36:24,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:36:24,120 INFO L225 Difference]: With dead ends: 335 [2018-02-04 04:36:24,120 INFO L226 Difference]: Without dead ends: 328 [2018-02-04 04:36:24,120 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=149, Invalid=721, Unknown=0, NotChecked=0, Total=870 [2018-02-04 04:36:24,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2018-02-04 04:36:24,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 281. [2018-02-04 04:36:24,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2018-02-04 04:36:24,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 305 transitions. [2018-02-04 04:36:24,124 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 305 transitions. Word has length 153 [2018-02-04 04:36:24,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:36:24,124 INFO L432 AbstractCegarLoop]: Abstraction has 281 states and 305 transitions. [2018-02-04 04:36:24,124 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 04:36:24,124 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 305 transitions. [2018-02-04 04:36:24,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-02-04 04:36:24,125 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:36:24,125 INFO L351 BasicCegarLoop]: trace histogram [28, 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 04:36:24,125 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_insertErr7RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr6RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr7RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr6RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr7RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr13RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr8RequiresViolation, l4_insertErr10RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr9RequiresViolation, l4_insertErr12RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr11RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-04 04:36:24,125 INFO L82 PathProgramCache]: Analyzing trace with hash -1389217018, 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 04:36:24,127 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:36:24,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:24,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:24,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:24,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:24,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:24,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:24,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:24,449 WARN L146 SmtUtils]: Spent 218ms on a formula simplification. DAG size of input: 40 DAG size of output 22 [2018-02-04 04:36:24,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:26,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:26,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:26,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:26,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:26,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:26,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:26,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:26,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:26,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:26,759 INFO L134 CoverageAnalysis]: Checked inductivity of 728 backedges. 97 proven. 162 refuted. 0 times theorem prover too weak. 469 trivial. 0 not checked. [2018-02-04 04:36:26,774 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:36:26,775 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-04 04:36:26,775 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:36:26,775 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 6 proven. 57 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2018-02-04 04:36:26,775 INFO L182 omatonBuilderFactory]: Interpolants [13059#(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)|)), 13060#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 13125#(or (not (= (mod |calloc_model_#in~size| 4294967296) 12)) (not (= |calloc_model_#in~nmemb| 1))), 12934#true, 13094#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 13126#(= 0 |#Ultimate.C_memset_#t~loopctr48|), 12935#false, 13095#(or (and (= zalloc_or_die_~size 12) (= |zalloc_or_die_#in~size| 12)) (and (not (= zalloc_or_die_~size 12)) (not (= |zalloc_or_die_#in~size| 12)))), 13127#(= 1 |#Ultimate.C_memset_#t~loopctr48|), 13128#(and (<= |#Ultimate.C_memset_#t~loopctr48| 2) (<= 2 |#Ultimate.C_memset_#t~loopctr48|) (< 1 |#Ultimate.C_memset_#amount|)), 13129#(and (<= 3 |#Ultimate.C_memset_#t~loopctr48|) (<= |#Ultimate.C_memset_#t~loopctr48| 3) (< 1 |#Ultimate.C_memset_#amount|)), 13130#(and (<= 4 |#Ultimate.C_memset_#t~loopctr48|) (< 1 |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#t~loopctr48| 4)), 13131#(and (< 1 |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#t~loopctr48| 5)), 13132#(and (< 1 |#Ultimate.C_memset_#amount|) (<= 0 (+ (div (+ (- 17179869149) (* (- 7) |#Ultimate.C_memset_#amount|)) 4294967296) 5))), 13113#(not (= 12 |zalloc_or_die_#in~size|)), 13114#(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 04:36:26,775 INFO L134 CoverageAnalysis]: Checked inductivity of 728 backedges. 97 proven. 162 refuted. 0 times theorem prover too weak. 469 trivial. 0 not checked. [2018-02-04 04:36:26,776 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 04:36:26,776 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 04:36:26,776 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=204, Unknown=1, NotChecked=0, Total=240 [2018-02-04 04:36:26,776 INFO L87 Difference]: Start difference. First operand 281 states and 305 transitions. Second operand 16 states. [2018-02-04 04:36:36,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:36:36,615 INFO L93 Difference]: Finished difference Result 337 states and 366 transitions. [2018-02-04 04:36:36,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-04 04:36:36,615 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 157 [2018-02-04 04:36:36,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:36:36,616 INFO L225 Difference]: With dead ends: 337 [2018-02-04 04:36:36,616 INFO L226 Difference]: Without dead ends: 330 [2018-02-04 04:36:36,617 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=111, Invalid=699, Unknown=2, NotChecked=0, Total=812 [2018-02-04 04:36:36,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2018-02-04 04:36:36,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 281. [2018-02-04 04:36:36,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2018-02-04 04:36:36,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 305 transitions. [2018-02-04 04:36:36,621 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 305 transitions. Word has length 157 [2018-02-04 04:36:36,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:36:36,621 INFO L432 AbstractCegarLoop]: Abstraction has 281 states and 305 transitions. [2018-02-04 04:36:36,621 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 04:36:36,621 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 305 transitions. [2018-02-04 04:36:36,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-02-04 04:36:36,622 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:36:36,622 INFO L351 BasicCegarLoop]: trace histogram [32, 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 04:36:36,622 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_insertErr7RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr6RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr7RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr6RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr7RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr13RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr8RequiresViolation, l4_insertErr10RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr9RequiresViolation, l4_insertErr12RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr11RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-04 04:36:36,622 INFO L82 PathProgramCache]: Analyzing trace with hash 2117236670, 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 04:36:36,640 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:36:36,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:36,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:36,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:36,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:36,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:36,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:36,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:36,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:36,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:36,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:36,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:36,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:36,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:36,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:36,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:36,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:36,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:36,950 INFO L134 CoverageAnalysis]: Checked inductivity of 866 backedges. 106 proven. 207 refuted. 0 times theorem prover too weak. 553 trivial. 0 not checked. [2018-02-04 04:36:36,966 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:36:36,966 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-04 04:36:36,967 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:36:36,967 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 7 proven. 60 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2018-02-04 04:36:36,967 INFO L182 omatonBuilderFactory]: Interpolants [13859#true, 13860#false, 13988#(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)|)), 13989#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 14023#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 14024#(or (and (= zalloc_or_die_~size 12) (= |zalloc_or_die_#in~size| 12)) (and (not (= zalloc_or_die_~size 12)) (not (= |zalloc_or_die_#in~size| 12)))), 14056#(not (= (mod (* (mod |calloc_model_#in~nmemb| 4294967296) (mod |calloc_model_#in~size| 4294967296)) 4294967296) 12)), 14057#(= 0 |#Ultimate.C_memset_#t~loopctr48|), 14058#(= 1 |#Ultimate.C_memset_#t~loopctr48|), 14059#(<= |#Ultimate.C_memset_#t~loopctr48| 2), 14060#(<= |#Ultimate.C_memset_#t~loopctr48| 3), 14061#(<= |#Ultimate.C_memset_#t~loopctr48| 4), 14062#(<= |#Ultimate.C_memset_#t~loopctr48| 5), 14063#(<= |#Ultimate.C_memset_#t~loopctr48| 6), 14064#(not (= |#Ultimate.C_memset_#amount| 12)), 14043#(not (= 12 |zalloc_or_die_#in~size|)), 14044#(= (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 04:36:36,967 INFO L134 CoverageAnalysis]: Checked inductivity of 866 backedges. 106 proven. 207 refuted. 0 times theorem prover too weak. 553 trivial. 0 not checked. [2018-02-04 04:36:36,967 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 04:36:36,968 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 04:36:36,968 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2018-02-04 04:36:36,968 INFO L87 Difference]: Start difference. First operand 281 states and 305 transitions. Second operand 17 states. [2018-02-04 04:36:38,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:36:38,151 INFO L93 Difference]: Finished difference Result 339 states and 368 transitions. [2018-02-04 04:36:38,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-04 04:36:38,152 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 161 [2018-02-04 04:36:38,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:36:38,153 INFO L225 Difference]: With dead ends: 339 [2018-02-04 04:36:38,153 INFO L226 Difference]: Without dead ends: 332 [2018-02-04 04:36:38,153 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=192, Invalid=930, Unknown=0, NotChecked=0, Total=1122 [2018-02-04 04:36:38,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2018-02-04 04:36:38,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 281. [2018-02-04 04:36:38,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2018-02-04 04:36:38,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 305 transitions. [2018-02-04 04:36:38,162 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 305 transitions. Word has length 161 [2018-02-04 04:36:38,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:36:38,162 INFO L432 AbstractCegarLoop]: Abstraction has 281 states and 305 transitions. [2018-02-04 04:36:38,162 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 04:36:38,162 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 305 transitions. [2018-02-04 04:36:38,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-02-04 04:36:38,163 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:36:38,163 INFO L351 BasicCegarLoop]: trace histogram [36, 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 04:36:38,163 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_insertErr7RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr6RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr7RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr6RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr7RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr13RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr8RequiresViolation, l4_insertErr10RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr9RequiresViolation, l4_insertErr12RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr11RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-04 04:36:38,163 INFO L82 PathProgramCache]: Analyzing trace with hash 1531604358, 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 04:36:38,167 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:36:38,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:38,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:38,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:38,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:38,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:38,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:38,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:38,931 WARN L146 SmtUtils]: Spent 626ms on a formula simplification. DAG size of input: 40 DAG size of output 22 [2018-02-04 04:36:38,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:39,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:39,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:39,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:39,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:39,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:39,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:39,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:39,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:39,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:39,157 INFO L134 CoverageAnalysis]: Checked inductivity of 1020 backedges. 115 proven. 259 refuted. 0 times theorem prover too weak. 646 trivial. 0 not checked. [2018-02-04 04:36:39,181 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:36:39,182 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-04 04:36:39,182 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:36:39,182 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 8 proven. 63 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2018-02-04 04:36:39,182 INFO L182 omatonBuilderFactory]: Interpolants [14976#(or (and (= zalloc_or_die_~size 12) (= |zalloc_or_die_#in~size| 12)) (and (not (= zalloc_or_die_~size 12)) (not (= |zalloc_or_die_#in~size| 12)))), 15010#(or (not (= (mod |calloc_model_#in~size| 4294967296) 12)) (not (= |calloc_model_#in~nmemb| 1))), 15011#(= 0 |#Ultimate.C_memset_#t~loopctr48|), 15012#(= 1 |#Ultimate.C_memset_#t~loopctr48|), 15013#(and (= |#Ultimate.C_memset_#t~loopctr48| 2) (< 1 |#Ultimate.C_memset_#amount|)), 15014#(and (<= |#Ultimate.C_memset_#t~loopctr48| 3) (< 1 |#Ultimate.C_memset_#amount|)), 15015#(and (< 1 |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#t~loopctr48| 4)), 15016#(and (< 1 |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#t~loopctr48| 5)), 15017#(and (<= |#Ultimate.C_memset_#t~loopctr48| 6) (< 1 |#Ultimate.C_memset_#amount|)), 15018#(and (< 1 |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#t~loopctr48| 7)), 15019#(and (<= |#Ultimate.C_memset_#amount| 7) (< 1 |#Ultimate.C_memset_#amount|)), 14996#(not (= 12 |zalloc_or_die_#in~size|)), 14997#(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)))), 14807#true, 14808#false, 14940#(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)|)), 14941#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 14975#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))] [2018-02-04 04:36:39,183 INFO L134 CoverageAnalysis]: Checked inductivity of 1020 backedges. 115 proven. 259 refuted. 0 times theorem prover too weak. 646 trivial. 0 not checked. [2018-02-04 04:36:39,183 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 04:36:39,183 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 04:36:39,183 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2018-02-04 04:36:39,183 INFO L87 Difference]: Start difference. First operand 281 states and 305 transitions. Second operand 18 states. [2018-02-04 04:36:40,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:36:40,379 INFO L93 Difference]: Finished difference Result 339 states and 367 transitions. [2018-02-04 04:36:40,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-04 04:36:40,379 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 165 [2018-02-04 04:36:40,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:36:40,380 INFO L225 Difference]: With dead ends: 339 [2018-02-04 04:36:40,380 INFO L226 Difference]: Without dead ends: 332 [2018-02-04 04:36:40,380 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=159, Invalid=897, Unknown=0, NotChecked=0, Total=1056 [2018-02-04 04:36:40,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2018-02-04 04:36:40,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 279. [2018-02-04 04:36:40,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2018-02-04 04:36:40,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 302 transitions. [2018-02-04 04:36:40,385 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 302 transitions. Word has length 165 [2018-02-04 04:36:40,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:36:40,386 INFO L432 AbstractCegarLoop]: Abstraction has 279 states and 302 transitions. [2018-02-04 04:36:40,386 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 04:36:40,386 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 302 transitions. [2018-02-04 04:36:40,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-02-04 04:36:40,387 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:36:40,387 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 04:36:40,387 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_insertErr7RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr6RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr7RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr6RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr7RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr13RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr8RequiresViolation, l4_insertErr10RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr9RequiresViolation, l4_insertErr12RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr11RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-04 04:36:40,387 INFO L82 PathProgramCache]: Analyzing trace with hash 1864257854, 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 04:36:40,391 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:36:40,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:40,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:40,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:40,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:40,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:40,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:40,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:40,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:40,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:40,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:40,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:40,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:40,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:40,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:40,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:40,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:40,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:40,719 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 124 proven. 318 refuted. 0 times theorem prover too weak. 748 trivial. 0 not checked. [2018-02-04 04:36:40,736 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:36:40,736 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-04 04:36:40,736 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:36:40,736 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 11 proven. 66 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2018-02-04 04:36:40,736 INFO L182 omatonBuilderFactory]: Interpolants [15971#(not (= (mod (* (mod |calloc_model_#in~nmemb| 4294967296) (mod |calloc_model_#in~size| 4294967296)) 4294967296) 12)), 15972#(= 0 |#Ultimate.C_memset_#t~loopctr48|), 15973#(= 1 |#Ultimate.C_memset_#t~loopctr48|), 15974#(<= |#Ultimate.C_memset_#t~loopctr48| 2), 15975#(<= |#Ultimate.C_memset_#t~loopctr48| 3), 15976#(<= |#Ultimate.C_memset_#t~loopctr48| 4), 15977#(<= |#Ultimate.C_memset_#t~loopctr48| 5), 15978#(<= |#Ultimate.C_memset_#t~loopctr48| 6), 15979#(<= |#Ultimate.C_memset_#t~loopctr48| 7), 15980#(<= |#Ultimate.C_memset_#t~loopctr48| 8), 15981#(not (= 12 |#Ultimate.C_memset_#amount|)), 15762#true, 15763#false, 15956#(not (= 12 |zalloc_or_die_#in~size|)), 15957#(= (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)), 15899#(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)|)), 15900#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 15934#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 15935#(or (and (= zalloc_or_die_~size 12) (= |zalloc_or_die_#in~size| 12)) (and (not (= zalloc_or_die_~size 12)) (not (= |zalloc_or_die_#in~size| 12))))] [2018-02-04 04:36:40,737 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 124 proven. 318 refuted. 0 times theorem prover too weak. 748 trivial. 0 not checked. [2018-02-04 04:36:40,737 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 04:36:40,737 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 04:36:40,737 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2018-02-04 04:36:40,737 INFO L87 Difference]: Start difference. First operand 279 states and 302 transitions. Second operand 19 states. [2018-02-04 04:36:42,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:36:42,033 INFO L93 Difference]: Finished difference Result 345 states and 375 transitions. [2018-02-04 04:36:42,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-02-04 04:36:42,033 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 169 [2018-02-04 04:36:42,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:36:42,034 INFO L225 Difference]: With dead ends: 345 [2018-02-04 04:36:42,034 INFO L226 Difference]: Without dead ends: 338 [2018-02-04 04:36:42,035 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=251, Invalid=1155, Unknown=0, NotChecked=0, Total=1406 [2018-02-04 04:36:42,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2018-02-04 04:36:42,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 282. [2018-02-04 04:36:42,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2018-02-04 04:36:42,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 307 transitions. [2018-02-04 04:36:42,039 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 307 transitions. Word has length 169 [2018-02-04 04:36:42,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:36:42,040 INFO L432 AbstractCegarLoop]: Abstraction has 282 states and 307 transitions. [2018-02-04 04:36:42,040 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 04:36:42,040 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 307 transitions. [2018-02-04 04:36:42,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-02-04 04:36:42,041 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:36:42,041 INFO L351 BasicCegarLoop]: trace histogram [44, 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 04:36:42,041 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_insertErr7RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr6RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr7RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr6RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr7RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr13RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr8RequiresViolation, l4_insertErr10RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr9RequiresViolation, l4_insertErr12RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr11RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-04 04:36:42,041 INFO L82 PathProgramCache]: Analyzing trace with hash -1463083002, 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 04:36:42,052 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:36:42,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:42,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:42,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:42,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:42,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:42,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:42,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:42,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:45,973 WARN L143 SmtUtils]: Spent 2185ms on a formula simplification that was a NOOP. DAG size: 17 [2018-02-04 04:36:45,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:45,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:45,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:45,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:45,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:46,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:46,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:46,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:46,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:36:46,031 INFO L134 CoverageAnalysis]: Checked inductivity of 1376 backedges. 133 proven. 384 refuted. 0 times theorem prover too weak. 859 trivial. 0 not checked. [2018-02-04 04:36:46,048 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:36:46,048 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-04 04:36:46,048 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:36:46,049 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 9 proven. 69 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2018-02-04 04:36:46,049 INFO L182 omatonBuilderFactory]: Interpolants [16962#(or (not (= (mod |calloc_model_#in~size| 4294967296) 12)) (not (= |calloc_model_#in~nmemb| 1))), 16963#(= 0 |#Ultimate.C_memset_#t~loopctr48|), 16964#(= 1 |#Ultimate.C_memset_#t~loopctr48|), 16965#(and (<= |#Ultimate.C_memset_#t~loopctr48| 2) (<= 2 |#Ultimate.C_memset_#t~loopctr48|)), 16966#(and (<= 3 |#Ultimate.C_memset_#t~loopctr48|) (<= |#Ultimate.C_memset_#t~loopctr48| 3)), 16967#(and (<= 4 |#Ultimate.C_memset_#t~loopctr48|) (<= |#Ultimate.C_memset_#t~loopctr48| 4)), 16968#(and (<= 5 |#Ultimate.C_memset_#t~loopctr48|) (<= |#Ultimate.C_memset_#t~loopctr48| 5)), 16969#(and (<= |#Ultimate.C_memset_#t~loopctr48| 6) (<= 6 |#Ultimate.C_memset_#t~loopctr48|)), 16970#(and (<= 7 |#Ultimate.C_memset_#t~loopctr48|) (<= |#Ultimate.C_memset_#t~loopctr48| 7)), 16747#true, 16971#(and (<= |#Ultimate.C_memset_#t~loopctr48| 8) (<= 8 |#Ultimate.C_memset_#t~loopctr48|)), 16748#false, 16972#(and (< 8 |#Ultimate.C_memset_#amount|) (<= (* 3 |#Ultimate.C_memset_#t~loopctr48|) (+ (div (+ (- 25769803749) (* 4294967293 |#Ultimate.C_memset_#amount|)) 4294967296) 4294967320))), 16973#(and (< 8 |#Ultimate.C_memset_#amount|) (<= (* 4294967296 |#Ultimate.C_memset_#amount|) (+ (* 4294967293 |#Ultimate.C_memset_#t~loopctr48|) (div (+ (- 25769803749) (* 4294967293 |#Ultimate.C_memset_#amount|)) 4294967296) 4294967320))), 16946#(not (= 12 |zalloc_or_die_#in~size|)), 16947#(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)))), 16888#(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)|)), 16889#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 16923#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 16924#(or (and (= zalloc_or_die_~size 12) (= |zalloc_or_die_#in~size| 12)) (and (not (= zalloc_or_die_~size 12)) (not (= |zalloc_or_die_#in~size| 12))))] [2018-02-04 04:36:46,049 INFO L134 CoverageAnalysis]: Checked inductivity of 1376 backedges. 133 proven. 384 refuted. 0 times theorem prover too weak. 859 trivial. 0 not checked. [2018-02-04 04:36:46,049 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-04 04:36:46,049 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-04 04:36:46,049 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=340, Unknown=0, NotChecked=0, Total=380 [2018-02-04 04:36:46,050 INFO L87 Difference]: Start difference. First operand 282 states and 307 transitions. Second operand 20 states. [2018-02-04 04:36:49,258 WARN L1033 $PredicateComparison]: unable to prove that (let ((.cse0 (div (+ (- 25769803749) (* 4294967293 |c_#Ultimate.C_memset_#amount|)) 4294967296))) (and (< 8 |c_#Ultimate.C_memset_#amount|) (<= (* 3 |c_#Ultimate.C_memset_#t~loopctr48|) (+ .cse0 4294967320)) (<= (* 4294967296 |c_#Ultimate.C_memset_#amount|) (+ (* 4294967293 |c_#Ultimate.C_memset_#t~loopctr48|) .cse0 4294967320)))) is different from true [2018-02-04 04:37:06,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:37:06,712 INFO L93 Difference]: Finished difference Result 348 states and 380 transitions. [2018-02-04 04:37:06,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-04 04:37:06,712 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 173 [2018-02-04 04:37:06,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:37:06,714 INFO L225 Difference]: With dead ends: 348 [2018-02-04 04:37:06,714 INFO L226 Difference]: Without dead ends: 341 [2018-02-04 04:37:06,714 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=96, Invalid=719, Unknown=1, NotChecked=54, Total=870 [2018-02-04 04:37:06,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2018-02-04 04:37:06,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 283. [2018-02-04 04:37:06,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2018-02-04 04:37:06,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 309 transitions. [2018-02-04 04:37:06,721 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 309 transitions. Word has length 173 [2018-02-04 04:37:06,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:37:06,721 INFO L432 AbstractCegarLoop]: Abstraction has 283 states and 309 transitions. [2018-02-04 04:37:06,721 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-04 04:37:06,721 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 309 transitions. [2018-02-04 04:37:06,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-02-04 04:37:06,722 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:37:06,722 INFO L351 BasicCegarLoop]: trace histogram [48, 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 04:37:06,722 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_insertErr7RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr6RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr7RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr6RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr7RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr13RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr8RequiresViolation, l4_insertErr10RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr9RequiresViolation, l4_insertErr12RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr11RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-04 04:37:06,723 INFO L82 PathProgramCache]: Analyzing trace with hash -1363596610, 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 04:37:06,728 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:37:06,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:06,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:06,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:06,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:06,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:06,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:06,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:06,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:06,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:06,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:06,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:07,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:07,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:07,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:07,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:07,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:07,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:07,048 INFO L134 CoverageAnalysis]: Checked inductivity of 1578 backedges. 142 proven. 457 refuted. 0 times theorem prover too weak. 979 trivial. 0 not checked. [2018-02-04 04:37:07,066 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:37:07,066 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-04 04:37:07,066 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:37:07,066 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 9 proven. 72 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2018-02-04 04:37:07,066 INFO L182 omatonBuilderFactory]: Interpolants [17952#(or (not (= |calloc_model_#in~size| 12)) (not (= |calloc_model_#in~nmemb| 1))), 17953#(= 0 |#Ultimate.C_memset_#t~loopctr48|), 17954#(= 1 |#Ultimate.C_memset_#t~loopctr48|), 17731#true, 17955#(= |#Ultimate.C_memset_#t~loopctr48| 2), 17732#false, 17956#(<= |#Ultimate.C_memset_#t~loopctr48| 3), 17957#(<= |#Ultimate.C_memset_#t~loopctr48| 4), 17958#(<= |#Ultimate.C_memset_#t~loopctr48| 5), 17959#(<= |#Ultimate.C_memset_#t~loopctr48| 6), 17960#(<= |#Ultimate.C_memset_#t~loopctr48| 7), 17961#(<= |#Ultimate.C_memset_#t~loopctr48| 8), 17962#(<= |#Ultimate.C_memset_#t~loopctr48| 9), 17963#(<= |#Ultimate.C_memset_#t~loopctr48| 10), 17964#(not (= 12 |#Ultimate.C_memset_#amount|)), 17935#(not (= 12 |zalloc_or_die_#in~size|)), 17936#(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)))), 17876#(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)|)), 17877#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 17911#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 17912#(or (and (= zalloc_or_die_~size 12) (= |zalloc_or_die_#in~size| 12)) (and (not (= zalloc_or_die_~size 12)) (not (= |zalloc_or_die_#in~size| 12))))] [2018-02-04 04:37:07,067 INFO L134 CoverageAnalysis]: Checked inductivity of 1578 backedges. 142 proven. 457 refuted. 0 times theorem prover too weak. 979 trivial. 0 not checked. [2018-02-04 04:37:07,067 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-04 04:37:07,067 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-04 04:37:07,067 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2018-02-04 04:37:07,067 INFO L87 Difference]: Start difference. First operand 283 states and 309 transitions. Second operand 21 states. [2018-02-04 04:37:08,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:37:08,981 INFO L93 Difference]: Finished difference Result 345 states and 379 transitions. [2018-02-04 04:37:08,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-02-04 04:37:08,982 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 177 [2018-02-04 04:37:08,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:37:08,982 INFO L225 Difference]: With dead ends: 345 [2018-02-04 04:37:08,983 INFO L226 Difference]: Without dead ends: 338 [2018-02-04 04:37:08,983 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=333, Invalid=1559, Unknown=0, NotChecked=0, Total=1892 [2018-02-04 04:37:08,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2018-02-04 04:37:08,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 284. [2018-02-04 04:37:08,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2018-02-04 04:37:08,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 311 transitions. [2018-02-04 04:37:08,986 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 311 transitions. Word has length 177 [2018-02-04 04:37:08,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:37:08,986 INFO L432 AbstractCegarLoop]: Abstraction has 284 states and 311 transitions. [2018-02-04 04:37:08,986 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-04 04:37:08,986 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 311 transitions. [2018-02-04 04:37:08,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-02-04 04:37:08,986 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:37:08,986 INFO L351 BasicCegarLoop]: trace histogram [52, 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 04:37:08,987 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_insertErr7RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr6RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr7RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr6RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr7RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr13RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr8RequiresViolation, l4_insertErr10RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr9RequiresViolation, l4_insertErr12RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr11RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-04 04:37:08,987 INFO L82 PathProgramCache]: Analyzing trace with hash 1442599558, 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 04:37:08,991 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:37:09,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:09,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:09,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:09,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:09,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:09,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:09,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:09,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:09,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:09,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:09,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:09,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:09,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:09,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:09,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:09,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:09,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:09,267 INFO L134 CoverageAnalysis]: Checked inductivity of 1796 backedges. 151 proven. 537 refuted. 0 times theorem prover too weak. 1108 trivial. 0 not checked. [2018-02-04 04:37:09,283 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:37:09,283 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-04 04:37:09,283 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:37:09,284 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 9 proven. 75 refuted. 0 times theorem prover too weak. 134 trivial. 0 not checked. [2018-02-04 04:37:09,284 INFO L182 omatonBuilderFactory]: Interpolants [18752#true, 18753#false, 18979#(or (not (= |calloc_model_#in~size| 12)) (not (= |calloc_model_#in~nmemb| 1))), 18980#(= 0 |#Ultimate.C_memset_#t~loopctr48|), 18981#(= 1 |#Ultimate.C_memset_#t~loopctr48|), 18982#(= |#Ultimate.C_memset_#t~loopctr48| 2), 18983#(= |#Ultimate.C_memset_#t~loopctr48| 3), 18984#(<= |#Ultimate.C_memset_#t~loopctr48| 4), 18985#(<= |#Ultimate.C_memset_#t~loopctr48| 5), 18986#(<= |#Ultimate.C_memset_#t~loopctr48| 6), 18987#(<= |#Ultimate.C_memset_#t~loopctr48| 7), 18988#(<= |#Ultimate.C_memset_#t~loopctr48| 8), 18989#(<= |#Ultimate.C_memset_#t~loopctr48| 9), 18990#(<= |#Ultimate.C_memset_#t~loopctr48| 10), 18991#(<= |#Ultimate.C_memset_#t~loopctr48| 11), 18992#(not (= 12 |#Ultimate.C_memset_#amount|)), 18961#(not (= 12 |zalloc_or_die_#in~size|)), 18962#(and (= |calloc_model_#in~size| calloc_model_~size) (or (and (not (= calloc_model_~nmemb 1)) (not (= |calloc_model_#in~nmemb| 1))) (and (= |calloc_model_#in~nmemb| 1) (= calloc_model_~nmemb 1)))), 18901#(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)|)), 18902#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 18936#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 18937#(or (and (= zalloc_or_die_~size 12) (= |zalloc_or_die_#in~size| 12)) (and (not (= zalloc_or_die_~size 12)) (not (= |zalloc_or_die_#in~size| 12))))] [2018-02-04 04:37:09,284 INFO L134 CoverageAnalysis]: Checked inductivity of 1796 backedges. 151 proven. 537 refuted. 0 times theorem prover too weak. 1108 trivial. 0 not checked. [2018-02-04 04:37:09,284 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 04:37:09,285 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 04:37:09,285 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=358, Unknown=0, NotChecked=0, Total=462 [2018-02-04 04:37:09,285 INFO L87 Difference]: Start difference. First operand 284 states and 311 transitions. Second operand 22 states. [2018-02-04 04:37:10,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:37:10,533 INFO L93 Difference]: Finished difference Result 348 states and 384 transitions. [2018-02-04 04:37:10,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-02-04 04:37:10,533 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 181 [2018-02-04 04:37:10,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:37:10,534 INFO L225 Difference]: With dead ends: 348 [2018-02-04 04:37:10,534 INFO L226 Difference]: Without dead ends: 341 [2018-02-04 04:37:10,535 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=363, Invalid=1707, Unknown=0, NotChecked=0, Total=2070 [2018-02-04 04:37:10,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2018-02-04 04:37:10,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 285. [2018-02-04 04:37:10,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2018-02-04 04:37:10,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 313 transitions. [2018-02-04 04:37:10,538 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 313 transitions. Word has length 181 [2018-02-04 04:37:10,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:37:10,538 INFO L432 AbstractCegarLoop]: Abstraction has 285 states and 313 transitions. [2018-02-04 04:37:10,538 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 04:37:10,538 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 313 transitions. [2018-02-04 04:37:10,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-02-04 04:37:10,539 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:37:10,539 INFO L351 BasicCegarLoop]: trace histogram [56, 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 04:37:10,539 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_insertErr7RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr6RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr7RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr6RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr7RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr13RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr8RequiresViolation, l4_insertErr10RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr9RequiresViolation, l4_insertErr12RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr11RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-04 04:37:10,539 INFO L82 PathProgramCache]: Analyzing trace with hash 393937982, 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 04:37:10,545 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:37:10,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:10,596 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 04:37:10,601 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 04:37:10,602 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 04:37:10,602 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 04:37:10,602 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 04:37:10,607 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 04:37:10,607 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 04:37:10,607 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 04:37:10,607 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 04:37:10,610 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-02-04 04:37:10,610 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 04:37:10,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:10,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:10,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:10,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:10,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:10,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:10,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:10,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:10,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:10,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:10,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:10,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:10,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:10,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:10,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:10,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:10,787 INFO L134 CoverageAnalysis]: Checked inductivity of 2030 backedges. 20 proven. 10 refuted. 0 times theorem prover too weak. 2000 trivial. 0 not checked. [2018-02-04 04:37:10,804 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:37:10,804 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-04 04:37:10,804 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:37:10,804 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2018-02-04 04:37:10,804 INFO L182 omatonBuilderFactory]: Interpolants [19792#true, 19952#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 19793#false, 19986#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 19945#(= |zalloc_or_die_#in~size| 119), 19946#(= 119 zalloc_or_die_~size), 19947#(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)), 19948#(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)), 19949#(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|)), 19950#(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)))), 19951#(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 04:37:10,805 INFO L134 CoverageAnalysis]: Checked inductivity of 2030 backedges. 20 proven. 10 refuted. 0 times theorem prover too weak. 2000 trivial. 0 not checked. [2018-02-04 04:37:10,805 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 04:37:10,805 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 04:37:10,805 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=85, Unknown=3, NotChecked=0, Total=110 [2018-02-04 04:37:10,805 INFO L87 Difference]: Start difference. First operand 285 states and 313 transitions. Second operand 11 states. [2018-02-04 04:37:11,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:37:11,528 INFO L93 Difference]: Finished difference Result 322 states and 355 transitions. [2018-02-04 04:37:11,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 04:37:11,529 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 185 [2018-02-04 04:37:11,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:37:11,530 INFO L225 Difference]: With dead ends: 322 [2018-02-04 04:37:11,530 INFO L226 Difference]: Without dead ends: 322 [2018-02-04 04:37:11,530 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=291, Unknown=12, NotChecked=0, Total=380 [2018-02-04 04:37:11,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2018-02-04 04:37:11,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 284. [2018-02-04 04:37:11,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2018-02-04 04:37:11,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 312 transitions. [2018-02-04 04:37:11,534 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 312 transitions. Word has length 185 [2018-02-04 04:37:11,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:37:11,534 INFO L432 AbstractCegarLoop]: Abstraction has 284 states and 312 transitions. [2018-02-04 04:37:11,534 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 04:37:11,535 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 312 transitions. [2018-02-04 04:37:11,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-02-04 04:37:11,535 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:37:11,536 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 04:37:11,536 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_insertErr7RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr6RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr7RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr6RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr7RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr13RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr8RequiresViolation, l4_insertErr10RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr9RequiresViolation, l4_insertErr12RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr11RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-04 04:37:11,536 INFO L82 PathProgramCache]: Analyzing trace with hash 1717176598, now seen corresponding path program 1 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 04:37:11,540 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:37:11,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:11,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:11,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:11,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:11,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:11,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:11,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:11,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:11,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:11,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:11,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:11,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:11,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:11,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:11,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:11,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:11,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:11,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:11,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:11,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:11,808 INFO L134 CoverageAnalysis]: Checked inductivity of 2146 backedges. 126 proven. 0 refuted. 0 times theorem prover too weak. 2020 trivial. 0 not checked. [2018-02-04 04:37:11,824 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:37:11,824 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-04 04:37:11,824 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:37:11,825 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2018-02-04 04:37:11,825 INFO L182 omatonBuilderFactory]: Interpolants [21168#(<= |#Ultimate.C_memset_#amount| 0), 20946#(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)|)), 20947#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 20981#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 20775#true, 21159#(not (= 119 |zalloc_or_die_#in~size|)), 20776#false, 21160#(and (= |calloc_model_#in~size| calloc_model_~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))), 21146#(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))), 21166#(or (not (= (mod |calloc_model_#in~nmemb| 4294967296) 1)) (not (= |calloc_model_#in~size| 119))), 21167#(= 0 |#Ultimate.C_memset_#t~loopctr48|)] [2018-02-04 04:37:11,825 INFO L134 CoverageAnalysis]: Checked inductivity of 2146 backedges. 126 proven. 0 refuted. 0 times theorem prover too weak. 2020 trivial. 0 not checked. [2018-02-04 04:37:11,826 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 04:37:11,826 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 04:37:11,826 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-02-04 04:37:11,826 INFO L87 Difference]: Start difference. First operand 284 states and 312 transitions. Second operand 11 states. [2018-02-04 04:37:12,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:37:12,601 INFO L93 Difference]: Finished difference Result 322 states and 354 transitions. [2018-02-04 04:37:12,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 04:37:12,601 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 198 [2018-02-04 04:37:12,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:37:12,602 INFO L225 Difference]: With dead ends: 322 [2018-02-04 04:37:12,603 INFO L226 Difference]: Without dead ends: 313 [2018-02-04 04:37:12,603 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=109, Invalid=443, Unknown=0, NotChecked=0, Total=552 [2018-02-04 04:37:12,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2018-02-04 04:37:12,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 284. [2018-02-04 04:37:12,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2018-02-04 04:37:12,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 311 transitions. [2018-02-04 04:37:12,605 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 311 transitions. Word has length 198 [2018-02-04 04:37:12,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:37:12,605 INFO L432 AbstractCegarLoop]: Abstraction has 284 states and 311 transitions. [2018-02-04 04:37:12,605 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 04:37:12,606 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 311 transitions. [2018-02-04 04:37:12,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-02-04 04:37:12,606 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:37:12,606 INFO L351 BasicCegarLoop]: trace histogram [57, 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 04:37:12,606 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_insertErr7RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr6RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr7RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr6RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr7RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr13RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr8RequiresViolation, l4_insertErr10RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr9RequiresViolation, l4_insertErr12RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr11RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-04 04:37:12,606 INFO L82 PathProgramCache]: Analyzing trace with hash -1442176407, now seen corresponding path program 2 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 04:37:12,609 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:37:12,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:12,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:12,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:12,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:12,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:12,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:12,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:12,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:12,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:12,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:12,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:12,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:12,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:12,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:12,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:12,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:12,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:12,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:12,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:13,281 WARN L146 SmtUtils]: Spent 504ms on a formula simplification. DAG size of input: 40 DAG size of output 22 [2018-02-04 04:37:13,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:13,331 INFO L134 CoverageAnalysis]: Checked inductivity of 2208 backedges. 187 proven. 1 refuted. 0 times theorem prover too weak. 2020 trivial. 0 not checked. [2018-02-04 04:37:13,347 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:37:13,347 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-04 04:37:13,347 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:37:13,347 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2018-02-04 04:37:13,347 INFO L182 omatonBuilderFactory]: Interpolants [22195#(or (not (= |calloc_model_#in~nmemb| 1)) (not (= (mod |calloc_model_#in~size| 4294967296) 119))), 22196#(= 0 |#Ultimate.C_memset_#t~loopctr48|), 21973#(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)|)), 22197#(and (<= |#Ultimate.C_memset_#t~loopctr48| 1) (< 0 |#Ultimate.C_memset_#amount|)), 21974#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 22198#(and (<= |#Ultimate.C_memset_#amount| 1) (< 0 |#Ultimate.C_memset_#amount|)), 22008#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 21801#true, 21802#false, 22187#(not (= |zalloc_or_die_#in~size| 119)), 22188#(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)))), 22173#(or (and (not (= zalloc_or_die_~size 119)) (not (= |zalloc_or_die_#in~size| 119))) (and (= zalloc_or_die_~size 119) (= |zalloc_or_die_#in~size| 119)))] [2018-02-04 04:37:13,348 INFO L134 CoverageAnalysis]: Checked inductivity of 2208 backedges. 187 proven. 1 refuted. 0 times theorem prover too weak. 2020 trivial. 0 not checked. [2018-02-04 04:37:13,348 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 04:37:13,348 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 04:37:13,348 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-02-04 04:37:13,348 INFO L87 Difference]: Start difference. First operand 284 states and 311 transitions. Second operand 12 states. [2018-02-04 04:37:14,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:37:14,192 INFO L93 Difference]: Finished difference Result 322 states and 353 transitions. [2018-02-04 04:37:14,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 04:37:14,192 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 199 [2018-02-04 04:37:14,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:37:14,193 INFO L225 Difference]: With dead ends: 322 [2018-02-04 04:37:14,193 INFO L226 Difference]: Without dead ends: 313 [2018-02-04 04:37:14,194 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=75, Invalid=345, Unknown=0, NotChecked=0, Total=420 [2018-02-04 04:37:14,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2018-02-04 04:37:14,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 284. [2018-02-04 04:37:14,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2018-02-04 04:37:14,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 310 transitions. [2018-02-04 04:37:14,197 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 310 transitions. Word has length 199 [2018-02-04 04:37:14,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:37:14,198 INFO L432 AbstractCegarLoop]: Abstraction has 284 states and 310 transitions. [2018-02-04 04:37:14,198 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 04:37:14,198 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 310 transitions. [2018-02-04 04:37:14,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-02-04 04:37:14,199 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:37:14,199 INFO L351 BasicCegarLoop]: trace histogram [58, 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 04:37:14,199 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_insertErr7RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr6RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr7RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr6RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr7RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr13RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr8RequiresViolation, l4_insertErr10RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr9RequiresViolation, l4_insertErr12RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr11RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-04 04:37:14,199 INFO L82 PathProgramCache]: Analyzing trace with hash -597871754, now seen corresponding path program 3 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 04:37:14,202 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:37:14,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:14,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:14,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:14,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:14,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:14,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:14,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:14,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:14,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:14,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:14,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:14,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:14,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:14,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:14,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:14,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:14,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:14,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:14,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:14,580 WARN L146 SmtUtils]: Spent 202ms on a formula simplification. DAG size of input: 40 DAG size of output 22 [2018-02-04 04:37:14,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:14,647 INFO L134 CoverageAnalysis]: Checked inductivity of 2271 backedges. 248 proven. 3 refuted. 0 times theorem prover too weak. 2020 trivial. 0 not checked. [2018-02-04 04:37:14,664 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:37:14,664 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-04 04:37:14,664 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:37:14,664 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2018-02-04 04:37:14,665 INFO L182 omatonBuilderFactory]: Interpolants [22823#true, 22824#false, 23211#(not (= |zalloc_or_die_#in~size| 119)), 23212#(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)))), 22996#(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)|)), 23220#(or (not (= |calloc_model_#in~nmemb| 1)) (not (= (mod |calloc_model_#in~size| 4294967296) 119))), 22997#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 23221#(= 0 |#Ultimate.C_memset_#t~loopctr48|), 23222#(and (= 1 |#Ultimate.C_memset_#t~loopctr48|) (< 0 |#Ultimate.C_memset_#amount|)), 23031#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 23223#(and (<= |#Ultimate.C_memset_#t~loopctr48| 2) (< 1 |#Ultimate.C_memset_#amount|)), 23224#(and (< 1 |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#amount| 2)), 23196#(or (and (not (= zalloc_or_die_~size 119)) (not (= |zalloc_or_die_#in~size| 119))) (and (= zalloc_or_die_~size 119) (= |zalloc_or_die_#in~size| 119)))] [2018-02-04 04:37:14,665 INFO L134 CoverageAnalysis]: Checked inductivity of 2271 backedges. 248 proven. 3 refuted. 0 times theorem prover too weak. 2020 trivial. 0 not checked. [2018-02-04 04:37:14,665 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 04:37:14,665 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 04:37:14,665 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2018-02-04 04:37:14,665 INFO L87 Difference]: Start difference. First operand 284 states and 310 transitions. Second operand 13 states. [2018-02-04 04:37:17,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:37:17,070 INFO L93 Difference]: Finished difference Result 322 states and 352 transitions. [2018-02-04 04:37:17,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-04 04:37:17,070 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 200 [2018-02-04 04:37:17,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:37:17,071 INFO L225 Difference]: With dead ends: 322 [2018-02-04 04:37:17,071 INFO L226 Difference]: Without dead ends: 313 [2018-02-04 04:37:17,071 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=77, Invalid=385, Unknown=0, NotChecked=0, Total=462 [2018-02-04 04:37:17,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2018-02-04 04:37:17,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 284. [2018-02-04 04:37:17,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2018-02-04 04:37:17,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 309 transitions. [2018-02-04 04:37:17,074 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 309 transitions. Word has length 200 [2018-02-04 04:37:17,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:37:17,075 INFO L432 AbstractCegarLoop]: Abstraction has 284 states and 309 transitions. [2018-02-04 04:37:17,075 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 04:37:17,075 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 309 transitions. [2018-02-04 04:37:17,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2018-02-04 04:37:17,076 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:37:17,076 INFO L351 BasicCegarLoop]: trace histogram [59, 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 04:37:17,076 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_insertErr7RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr6RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr7RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr6RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr7RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr13RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr8RequiresViolation, l4_insertErr10RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr9RequiresViolation, l4_insertErr12RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr11RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-04 04:37:17,076 INFO L82 PathProgramCache]: Analyzing trace with hash -194231287, now seen corresponding path program 4 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 04:37:17,080 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:37:17,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:17,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:17,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:17,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:17,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:17,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:17,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:17,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:17,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:17,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:17,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:17,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:17,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:17,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:17,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:17,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:17,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:17,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:17,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:17,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:17,339 INFO L134 CoverageAnalysis]: Checked inductivity of 2335 backedges. 309 proven. 6 refuted. 0 times theorem prover too weak. 2020 trivial. 0 not checked. [2018-02-04 04:37:17,355 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:37:17,355 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-04 04:37:17,355 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:37:17,356 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2018-02-04 04:37:17,356 INFO L182 omatonBuilderFactory]: Interpolants [23849#true, 23850#false, 24239#(not (= |zalloc_or_die_#in~size| 119)), 24240#(and (= |calloc_model_#in~size| calloc_model_~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))), 24023#(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)|)), 24024#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 24249#(or (not (= (mod |calloc_model_#in~nmemb| 4294967296) 1)) (not (= |calloc_model_#in~size| 119))), 24058#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 24250#(= 0 |#Ultimate.C_memset_#t~loopctr48|), 24251#(= 1 |#Ultimate.C_memset_#t~loopctr48|), 24252#(<= |#Ultimate.C_memset_#t~loopctr48| 2), 24253#(<= |#Ultimate.C_memset_#t~loopctr48| 3), 24254#(<= |#Ultimate.C_memset_#amount| 3), 24223#(or (and (not (= zalloc_or_die_~size 119)) (not (= |zalloc_or_die_#in~size| 119))) (and (= zalloc_or_die_~size 119) (= |zalloc_or_die_#in~size| 119)))] [2018-02-04 04:37:17,356 INFO L134 CoverageAnalysis]: Checked inductivity of 2335 backedges. 309 proven. 6 refuted. 0 times theorem prover too weak. 2020 trivial. 0 not checked. [2018-02-04 04:37:17,356 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 04:37:17,356 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 04:37:17,357 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2018-02-04 04:37:17,357 INFO L87 Difference]: Start difference. First operand 284 states and 309 transitions. Second operand 14 states. [2018-02-04 04:37:20,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:37:20,330 INFO L93 Difference]: Finished difference Result 322 states and 351 transitions. [2018-02-04 04:37:20,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-04 04:37:20,330 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 201 [2018-02-04 04:37:20,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:37:20,331 INFO L225 Difference]: With dead ends: 322 [2018-02-04 04:37:20,331 INFO L226 Difference]: Without dead ends: 313 [2018-02-04 04:37:20,331 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=539, Unknown=0, NotChecked=0, Total=650 [2018-02-04 04:37:20,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2018-02-04 04:37:20,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 284. [2018-02-04 04:37:20,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2018-02-04 04:37:20,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 308 transitions. [2018-02-04 04:37:20,334 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 308 transitions. Word has length 201 [2018-02-04 04:37:20,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:37:20,334 INFO L432 AbstractCegarLoop]: Abstraction has 284 states and 308 transitions. [2018-02-04 04:37:20,334 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 04:37:20,334 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 308 transitions. [2018-02-04 04:37:20,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-02-04 04:37:20,335 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:37:20,335 INFO L351 BasicCegarLoop]: trace histogram [60, 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 04:37:20,335 INFO L371 AbstractCegarLoop]: === Iteration 31 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr7RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr6RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr7RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr6RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr7RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr13RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr8RequiresViolation, l4_insertErr10RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr9RequiresViolation, l4_insertErr12RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr11RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-04 04:37:20,335 INFO L82 PathProgramCache]: Analyzing trace with hash -566278698, now seen corresponding path program 5 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:37:20,341 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:37:20,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:20,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:20,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:20,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:20,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:20,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:20,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:20,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:20,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:20,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:20,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:20,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:20,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:20,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:20,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:20,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:20,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:20,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:20,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:20,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:20,606 INFO L134 CoverageAnalysis]: Checked inductivity of 2400 backedges. 370 proven. 10 refuted. 0 times theorem prover too weak. 2020 trivial. 0 not checked. [2018-02-04 04:37:20,623 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:37:20,624 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-04 04:37:20,624 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:37:20,624 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2018-02-04 04:37:20,624 INFO L182 omatonBuilderFactory]: Interpolants [25060#(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)|)), 25061#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 25095#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 25288#(or (not (= |calloc_model_#in~nmemb| 1)) (not (= |calloc_model_#in~size| 119))), 25289#(= 0 |#Ultimate.C_memset_#t~loopctr48|), 25290#(= 1 |#Ultimate.C_memset_#t~loopctr48|), 25291#(= |#Ultimate.C_memset_#t~loopctr48| 2), 25260#(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))), 25292#(= |#Ultimate.C_memset_#t~loopctr48| 3), 25293#(or (and (<= |#Ultimate.C_memset_#amount| 4) (<= |#Ultimate.C_memset_#amount| |#Ultimate.C_memset_#t~loopctr48|)) (and (< 4 |#Ultimate.C_memset_#amount|) (< |#Ultimate.C_memset_#t~loopctr48| |#Ultimate.C_memset_#amount|))), 25294#(<= |#Ultimate.C_memset_#amount| 4), 24885#true, 24886#false, 25277#(not (= |zalloc_or_die_#in~size| 119)), 25278#(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))))] [2018-02-04 04:37:20,625 INFO L134 CoverageAnalysis]: Checked inductivity of 2400 backedges. 370 proven. 10 refuted. 0 times theorem prover too weak. 2020 trivial. 0 not checked. [2018-02-04 04:37:20,625 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 04:37:20,625 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 04:37:20,625 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2018-02-04 04:37:20,625 INFO L87 Difference]: Start difference. First operand 284 states and 308 transitions. Second operand 15 states. [2018-02-04 04:37:21,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:37:21,401 INFO L93 Difference]: Finished difference Result 322 states and 350 transitions. [2018-02-04 04:37:21,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-04 04:37:21,402 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 202 [2018-02-04 04:37:21,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:37:21,403 INFO L225 Difference]: With dead ends: 322 [2018-02-04 04:37:21,403 INFO L226 Difference]: Without dead ends: 313 [2018-02-04 04:37:21,403 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=596, Unknown=0, NotChecked=0, Total=702 [2018-02-04 04:37:21,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2018-02-04 04:37:21,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 284. [2018-02-04 04:37:21,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2018-02-04 04:37:21,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 307 transitions. [2018-02-04 04:37:21,406 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 307 transitions. Word has length 202 [2018-02-04 04:37:21,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:37:21,406 INFO L432 AbstractCegarLoop]: Abstraction has 284 states and 307 transitions. [2018-02-04 04:37:21,406 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 04:37:21,406 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 307 transitions. [2018-02-04 04:37:21,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2018-02-04 04:37:21,407 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:37:21,407 INFO L351 BasicCegarLoop]: trace histogram [61, 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 04:37:21,407 INFO L371 AbstractCegarLoop]: === Iteration 32 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr7RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr6RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr7RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr6RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr7RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr13RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr8RequiresViolation, l4_insertErr10RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr9RequiresViolation, l4_insertErr12RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr11RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-04 04:37:21,407 INFO L82 PathProgramCache]: Analyzing trace with hash 785153449, now seen corresponding path program 6 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:37:21,412 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:37:21,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:21,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:21,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:21,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:21,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:21,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:21,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:21,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:21,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:21,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:21,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:21,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:21,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:21,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:21,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:21,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:21,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:21,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:21,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:21,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:21,636 INFO L134 CoverageAnalysis]: Checked inductivity of 2466 backedges. 431 proven. 15 refuted. 0 times theorem prover too weak. 2020 trivial. 0 not checked. [2018-02-04 04:37:21,652 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:37:21,652 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-04 04:37:21,652 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:37:21,653 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2018-02-04 04:37:21,653 INFO L182 omatonBuilderFactory]: Interpolants [26336#(<= |#Ultimate.C_memset_#t~loopctr48| 4), 26337#(<= |#Ultimate.C_memset_#t~loopctr48| 5), 26338#(not (= |#Ultimate.C_memset_#amount| 119)), 25925#true, 25926#false, 26319#(not (= |zalloc_or_die_#in~size| 119)), 26320#(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)))), 26101#(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)|)), 26102#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 26136#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 26331#(or (not (= |calloc_model_#in~nmemb| 1)) (not (= |calloc_model_#in~size| 119))), 26332#(= 0 |#Ultimate.C_memset_#t~loopctr48|), 26301#(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))), 26333#(= 1 |#Ultimate.C_memset_#t~loopctr48|), 26334#(= |#Ultimate.C_memset_#t~loopctr48| 2), 26335#(= |#Ultimate.C_memset_#t~loopctr48| 3)] [2018-02-04 04:37:21,653 INFO L134 CoverageAnalysis]: Checked inductivity of 2466 backedges. 431 proven. 15 refuted. 0 times theorem prover too weak. 2020 trivial. 0 not checked. [2018-02-04 04:37:21,653 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 04:37:21,653 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 04:37:21,653 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2018-02-04 04:37:21,653 INFO L87 Difference]: Start difference. First operand 284 states and 307 transitions. Second operand 16 states. [2018-02-04 04:37:22,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:37:22,374 INFO L93 Difference]: Finished difference Result 322 states and 349 transitions. [2018-02-04 04:37:22,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-04 04:37:22,374 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 203 [2018-02-04 04:37:22,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:37:22,375 INFO L225 Difference]: With dead ends: 322 [2018-02-04 04:37:22,375 INFO L226 Difference]: Without dead ends: 313 [2018-02-04 04:37:22,375 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=637, Unknown=0, NotChecked=0, Total=756 [2018-02-04 04:37:22,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2018-02-04 04:37:22,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 284. [2018-02-04 04:37:22,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2018-02-04 04:37:22,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 306 transitions. [2018-02-04 04:37:22,378 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 306 transitions. Word has length 203 [2018-02-04 04:37:22,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:37:22,378 INFO L432 AbstractCegarLoop]: Abstraction has 284 states and 306 transitions. [2018-02-04 04:37:22,378 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 04:37:22,378 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 306 transitions. [2018-02-04 04:37:22,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-02-04 04:37:22,379 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:37:22,379 INFO L351 BasicCegarLoop]: trace histogram [62, 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 04:37:22,379 INFO L371 AbstractCegarLoop]: === Iteration 33 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr7RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr6RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr7RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr6RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr7RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr13RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr8RequiresViolation, l4_insertErr10RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr9RequiresViolation, l4_insertErr12RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr11RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-04 04:37:22,379 INFO L82 PathProgramCache]: Analyzing trace with hash -270122954, now seen corresponding path program 7 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:37:22,384 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:37:22,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:22,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:22,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:22,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:22,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:22,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:22,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:22,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:22,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:22,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:22,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:22,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:22,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:22,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:22,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:22,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:22,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:22,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:22,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:23,023 WARN L146 SmtUtils]: Spent 463ms on a formula simplification. DAG size of input: 40 DAG size of output 22 [2018-02-04 04:37:23,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:23,142 INFO L134 CoverageAnalysis]: Checked inductivity of 2533 backedges. 492 proven. 21 refuted. 0 times theorem prover too weak. 2020 trivial. 0 not checked. [2018-02-04 04:37:23,159 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:37:23,159 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-04 04:37:23,159 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:37:23,159 INFO L134 CoverageAnalysis]: Checked inductivity of 269 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2018-02-04 04:37:23,160 INFO L182 omatonBuilderFactory]: Interpolants [27365#(not (= |zalloc_or_die_#in~size| 119)), 27366#(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)))), 27146#(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)|)), 27147#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 27181#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 27346#(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))), 27378#(or (not (= |calloc_model_#in~nmemb| 1)) (not (= (mod |calloc_model_#in~size| 4294967296) 119))), 27379#(= 0 |#Ultimate.C_memset_#t~loopctr48|), 27380#(= 1 |#Ultimate.C_memset_#t~loopctr48|), 27381#(and (<= |#Ultimate.C_memset_#t~loopctr48| 2) (<= 2 |#Ultimate.C_memset_#t~loopctr48|)), 27382#(and (<= 3 |#Ultimate.C_memset_#t~loopctr48|) (<= |#Ultimate.C_memset_#t~loopctr48| 3)), 27383#(and (<= 4 |#Ultimate.C_memset_#t~loopctr48|) (<= |#Ultimate.C_memset_#t~loopctr48| 4)), 27384#(and (<= 5 |#Ultimate.C_memset_#t~loopctr48|) (<= |#Ultimate.C_memset_#t~loopctr48| 5)), 26969#true, 27385#(and (<= |#Ultimate.C_memset_#t~loopctr48| 6) (< 5 |#Ultimate.C_memset_#amount|)), 26970#false, 27386#(and (<= |#Ultimate.C_memset_#amount| 6) (< 5 |#Ultimate.C_memset_#amount|))] [2018-02-04 04:37:23,160 INFO L134 CoverageAnalysis]: Checked inductivity of 2533 backedges. 492 proven. 21 refuted. 0 times theorem prover too weak. 2020 trivial. 0 not checked. [2018-02-04 04:37:23,160 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 04:37:23,160 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 04:37:23,160 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=238, Unknown=0, NotChecked=0, Total=272 [2018-02-04 04:37:23,160 INFO L87 Difference]: Start difference. First operand 284 states and 306 transitions. Second operand 17 states. [2018-02-04 04:37:24,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:37:24,313 INFO L93 Difference]: Finished difference Result 322 states and 348 transitions. [2018-02-04 04:37:24,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-04 04:37:24,313 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 204 [2018-02-04 04:37:24,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:37:24,314 INFO L225 Difference]: With dead ends: 322 [2018-02-04 04:37:24,314 INFO L226 Difference]: Without dead ends: 313 [2018-02-04 04:37:24,315 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=85, Invalid=565, Unknown=0, NotChecked=0, Total=650 [2018-02-04 04:37:24,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2018-02-04 04:37:24,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 284. [2018-02-04 04:37:24,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2018-02-04 04:37:24,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 305 transitions. [2018-02-04 04:37:24,317 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 305 transitions. Word has length 204 [2018-02-04 04:37:24,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:37:24,317 INFO L432 AbstractCegarLoop]: Abstraction has 284 states and 305 transitions. [2018-02-04 04:37:24,317 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 04:37:24,317 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 305 transitions. [2018-02-04 04:37:24,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2018-02-04 04:37:24,318 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:37:24,318 INFO L351 BasicCegarLoop]: trace histogram [63, 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 04:37:24,318 INFO L371 AbstractCegarLoop]: === Iteration 34 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr7RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr6RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr7RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr6RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr7RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr13RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr8RequiresViolation, l4_insertErr10RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr9RequiresViolation, l4_insertErr12RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr11RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-04 04:37:24,318 INFO L82 PathProgramCache]: Analyzing trace with hash 1376046921, now seen corresponding path program 8 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:37:24,326 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:37:24,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:24,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:24,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:24,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:24,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:24,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:24,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:24,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:24,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:24,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:24,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:24,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:24,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:24,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:24,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:24,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:24,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:24,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:24,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:24,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:24,622 INFO L134 CoverageAnalysis]: Checked inductivity of 2601 backedges. 553 proven. 28 refuted. 0 times theorem prover too weak. 2020 trivial. 0 not checked. [2018-02-04 04:37:24,639 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:37:24,639 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-04 04:37:24,639 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:37:24,639 INFO L134 CoverageAnalysis]: Checked inductivity of 274 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2018-02-04 04:37:24,640 INFO L182 omatonBuilderFactory]: Interpolants [28224#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 28389#(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))), 28423#(or (not (= |calloc_model_#in~nmemb| 1)) (not (= |calloc_model_#in~size| 119))), 28424#(= 0 |#Ultimate.C_memset_#t~loopctr48|), 28425#(= 1 |#Ultimate.C_memset_#t~loopctr48|), 28426#(= |#Ultimate.C_memset_#t~loopctr48| 2), 28011#true, 28427#(= |#Ultimate.C_memset_#t~loopctr48| 3), 28012#false, 28428#(= 4 |#Ultimate.C_memset_#t~loopctr48|), 28429#(= |#Ultimate.C_memset_#t~loopctr48| 5), 28430#(<= |#Ultimate.C_memset_#t~loopctr48| 6), 28431#(<= |#Ultimate.C_memset_#t~loopctr48| 7), 28432#(not (= |#Ultimate.C_memset_#amount| 119)), 28409#(not (= |zalloc_or_die_#in~size| 119)), 28410#(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)))), 28189#(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)|)), 28190#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))] [2018-02-04 04:37:24,640 INFO L134 CoverageAnalysis]: Checked inductivity of 2601 backedges. 553 proven. 28 refuted. 0 times theorem prover too weak. 2020 trivial. 0 not checked. [2018-02-04 04:37:24,640 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 04:37:24,640 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 04:37:24,640 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2018-02-04 04:37:24,641 INFO L87 Difference]: Start difference. First operand 284 states and 305 transitions. Second operand 18 states. [2018-02-04 04:37:25,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:37:25,442 INFO L93 Difference]: Finished difference Result 320 states and 345 transitions. [2018-02-04 04:37:25,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-04 04:37:25,443 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 205 [2018-02-04 04:37:25,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:37:25,444 INFO L225 Difference]: With dead ends: 320 [2018-02-04 04:37:25,444 INFO L226 Difference]: Without dead ends: 311 [2018-02-04 04:37:25,444 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=127, Invalid=743, Unknown=0, NotChecked=0, Total=870 [2018-02-04 04:37:25,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2018-02-04 04:37:25,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 282. [2018-02-04 04:37:25,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2018-02-04 04:37:25,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 302 transitions. [2018-02-04 04:37:25,446 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 302 transitions. Word has length 205 [2018-02-04 04:37:25,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:37:25,447 INFO L432 AbstractCegarLoop]: Abstraction has 282 states and 302 transitions. [2018-02-04 04:37:25,447 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 04:37:25,447 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 302 transitions. [2018-02-04 04:37:25,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-02-04 04:37:25,447 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:37:25,447 INFO L351 BasicCegarLoop]: trace histogram [64, 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 04:37:25,447 INFO L371 AbstractCegarLoop]: === Iteration 35 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr7RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr6RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr7RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr6RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr7RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr13RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr8RequiresViolation, l4_insertErr10RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr9RequiresViolation, l4_insertErr12RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr11RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-04 04:37:25,448 INFO L82 PathProgramCache]: Analyzing trace with hash 867705494, now seen corresponding path program 9 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:37:25,450 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:37:25,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:25,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:25,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:25,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:25,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:25,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:25,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:25,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:25,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:25,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:25,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:25,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:25,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:25,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:25,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:25,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:25,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:25,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:25,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:25,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:37:26,062 INFO L134 CoverageAnalysis]: Checked inductivity of 2670 backedges. 614 proven. 36 refuted. 0 times theorem prover too weak. 2020 trivial. 0 not checked. [2018-02-04 04:37:26,091 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:37:26,091 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-04 04:37:26,091 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:37:26,091 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2018-02-04 04:37:26,091 INFO L182 omatonBuilderFactory]: Interpolants [29474#(or (not (= |calloc_model_#in~nmemb| 1)) (not (= (mod |calloc_model_#in~size| 4294967296) 119))), 29059#true, 29475#(= 0 |#Ultimate.C_memset_#t~loopctr48|), 29060#false, 29476#(and (<= |#Ultimate.C_memset_#t~loopctr48| 1) (<= 1 |#Ultimate.C_memset_#t~loopctr48|)), 29477#(and (<= |#Ultimate.C_memset_#t~loopctr48| 2) (<= 2 |#Ultimate.C_memset_#t~loopctr48|)), 29478#(and (<= 3 |#Ultimate.C_memset_#t~loopctr48|) (<= |#Ultimate.C_memset_#t~loopctr48| 3)), 29479#(and (<= 4 |#Ultimate.C_memset_#t~loopctr48|) (<= |#Ultimate.C_memset_#t~loopctr48| 4)), 29480#(and (<= 5 |#Ultimate.C_memset_#t~loopctr48|) (<= |#Ultimate.C_memset_#t~loopctr48| 5)), 29481#(and (<= |#Ultimate.C_memset_#t~loopctr48| 6) (<= 6 |#Ultimate.C_memset_#t~loopctr48|)), 29482#(and (<= 7 |#Ultimate.C_memset_#t~loopctr48|) (<= |#Ultimate.C_memset_#t~loopctr48| 7)), 29483#(and (< 7 |#Ultimate.C_memset_#amount|) (<= (* 111 |#Ultimate.C_memset_#t~loopctr48|) (+ (div (+ (- 21474835592) (* 4294967185 |#Ultimate.C_memset_#amount|)) 4294967296) 4294968073))), 29484#(and (< 7 |#Ultimate.C_memset_#amount|) (<= (* 4294967296 |#Ultimate.C_memset_#amount|) (+ (* 4294967185 |#Ultimate.C_memset_#t~loopctr48|) (div (+ (- 21474835592) (* 4294967185 |#Ultimate.C_memset_#amount|)) 4294967296) 4294968073))), 29459#(not (= |zalloc_or_die_#in~size| 119)), 29460#(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)))), 29238#(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)|)), 29239#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 29273#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 29438#(or (and (not (= zalloc_or_die_~size 119)) (not (= |zalloc_or_die_#in~size| 119))) (and (= zalloc_or_die_~size 119) (= |zalloc_or_die_#in~size| 119)))] [2018-02-04 04:37:26,091 INFO L134 CoverageAnalysis]: Checked inductivity of 2670 backedges. 614 proven. 36 refuted. 0 times theorem prover too weak. 2020 trivial. 0 not checked. [2018-02-04 04:37:26,091 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 04:37:26,092 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 04:37:26,092 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=304, Unknown=0, NotChecked=0, Total=342 [2018-02-04 04:37:26,092 INFO L87 Difference]: Start difference. First operand 282 states and 302 transitions. Second operand 19 states. [2018-02-04 04:38:04,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:38:04,234 INFO L93 Difference]: Finished difference Result 323 states and 348 transitions. [2018-02-04 04:38:04,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-04 04:38:04,234 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 206 [2018-02-04 04:38:04,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:38:04,235 INFO L225 Difference]: With dead ends: 323 [2018-02-04 04:38:04,235 INFO L226 Difference]: Without dead ends: 316 [2018-02-04 04:38:04,235 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=89, Invalid=667, Unknown=0, NotChecked=0, Total=756 [2018-02-04 04:38:04,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2018-02-04 04:38:04,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 284. [2018-02-04 04:38:04,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2018-02-04 04:38:04,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 304 transitions. [2018-02-04 04:38:04,237 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 304 transitions. Word has length 206 [2018-02-04 04:38:04,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:38:04,238 INFO L432 AbstractCegarLoop]: Abstraction has 284 states and 304 transitions. [2018-02-04 04:38:04,238 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 04:38:04,238 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 304 transitions. [2018-02-04 04:38:04,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-02-04 04:38:04,238 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:38:04,238 INFO L351 BasicCegarLoop]: trace histogram [65, 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 04:38:04,238 INFO L371 AbstractCegarLoop]: === Iteration 36 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr7RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr6RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr7RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr6RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr7RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr13RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr8RequiresViolation, l4_insertErr10RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr9RequiresViolation, l4_insertErr12RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr11RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-04 04:38:04,239 INFO L82 PathProgramCache]: Analyzing trace with hash -2005976855, now seen corresponding path program 10 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:38:04,241 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:38:04,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:38:04,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:38:04,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:38:04,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:38:04,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:38:04,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:38:04,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:38:04,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:38:04,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:38:04,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:38:04,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:38:04,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:38:04,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:38:04,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:38:04,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:38:04,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:38:04,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:38:04,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:38:04,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:38:04,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:38:04,501 INFO L134 CoverageAnalysis]: Checked inductivity of 2740 backedges. 675 proven. 45 refuted. 0 times theorem prover too weak. 2020 trivial. 0 not checked. [2018-02-04 04:38:04,519 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:38:04,519 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-04 04:38:04,520 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:38:04,520 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2018-02-04 04:38:04,520 INFO L182 omatonBuilderFactory]: Interpolants [30528#(or (not (= |calloc_model_#in~nmemb| 1)) (not (= |calloc_model_#in~size| 119))), 30529#(= 0 |#Ultimate.C_memset_#t~loopctr48|), 30530#(= 1 |#Ultimate.C_memset_#t~loopctr48|), 30531#(= |#Ultimate.C_memset_#t~loopctr48| 2), 30532#(= |#Ultimate.C_memset_#t~loopctr48| 3), 30533#(<= |#Ultimate.C_memset_#t~loopctr48| 4), 30534#(<= |#Ultimate.C_memset_#t~loopctr48| 5), 30535#(<= |#Ultimate.C_memset_#t~loopctr48| 6), 30536#(<= |#Ultimate.C_memset_#t~loopctr48| 7), 30537#(<= |#Ultimate.C_memset_#t~loopctr48| 8), 30538#(<= |#Ultimate.C_memset_#t~loopctr48| 9), 30539#(not (= |#Ultimate.C_memset_#amount| 119)), 30512#(not (= |zalloc_or_die_#in~size| 119)), 30513#(and (= |calloc_model_#in~size| calloc_model_~size) (or (and (not (= calloc_model_~nmemb 1)) (not (= |calloc_model_#in~nmemb| 1))) (and (= |calloc_model_#in~nmemb| 1) (= calloc_model_~nmemb 1)))), 30290#(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)|)), 30291#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 30325#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 30490#(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))), 30110#true, 30111#false] [2018-02-04 04:38:04,521 INFO L134 CoverageAnalysis]: Checked inductivity of 2740 backedges. 675 proven. 45 refuted. 0 times theorem prover too weak. 2020 trivial. 0 not checked. [2018-02-04 04:38:04,521 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-04 04:38:04,521 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-04 04:38:04,521 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2018-02-04 04:38:04,521 INFO L87 Difference]: Start difference. First operand 284 states and 304 transitions. Second operand 20 states. [2018-02-04 04:38:05,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:38:05,480 INFO L93 Difference]: Finished difference Result 322 states and 347 transitions. [2018-02-04 04:38:05,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-04 04:38:05,480 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 207 [2018-02-04 04:38:05,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:38:05,481 INFO L225 Difference]: With dead ends: 322 [2018-02-04 04:38:05,481 INFO L226 Difference]: Without dead ends: 315 [2018-02-04 04:38:05,482 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=167, Invalid=889, Unknown=0, NotChecked=0, Total=1056 [2018-02-04 04:38:05,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2018-02-04 04:38:05,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 284. [2018-02-04 04:38:05,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2018-02-04 04:38:05,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 304 transitions. [2018-02-04 04:38:05,485 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 304 transitions. Word has length 207 [2018-02-04 04:38:05,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:38:05,485 INFO L432 AbstractCegarLoop]: Abstraction has 284 states and 304 transitions. [2018-02-04 04:38:05,485 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-04 04:38:05,485 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 304 transitions. [2018-02-04 04:38:05,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-02-04 04:38:05,486 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:38:05,486 INFO L351 BasicCegarLoop]: trace histogram [66, 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 04:38:05,486 INFO L371 AbstractCegarLoop]: === Iteration 37 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr7RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr6RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr7RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr6RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr7RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr13RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr8RequiresViolation, l4_insertErr10RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr9RequiresViolation, l4_insertErr12RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr11RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-04 04:38:05,486 INFO L82 PathProgramCache]: Analyzing trace with hash -895816458, now seen corresponding path program 11 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:38:05,488 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:38:05,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:38:05,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:38:05,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:38:05,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:38:05,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:38:05,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:38:05,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:38:05,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:38:05,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:38:05,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:38:05,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:38:05,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:38:05,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:38:05,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:38:05,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:38:05,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:38:05,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:38:05,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:38:05,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:38:05,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:38:05,826 INFO L134 CoverageAnalysis]: Checked inductivity of 2811 backedges. 736 proven. 55 refuted. 0 times theorem prover too weak. 2020 trivial. 0 not checked. [2018-02-04 04:38:05,843 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:38:05,843 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-04 04:38:05,843 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:38:05,844 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2018-02-04 04:38:05,844 INFO L182 omatonBuilderFactory]: Interpolants [31553#(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))), 31172#true, 31173#false, 31593#(not (= (mod (* (mod |calloc_model_#in~nmemb| 4294967296) (mod |calloc_model_#in~size| 4294967296)) 4294967296) 119)), 31594#(= 0 |#Ultimate.C_memset_#t~loopctr48|), 31595#(= |#Ultimate.C_memset_#t~loopctr48| 1), 31596#(<= |#Ultimate.C_memset_#t~loopctr48| 2), 31597#(<= |#Ultimate.C_memset_#t~loopctr48| 3), 31598#(<= |#Ultimate.C_memset_#t~loopctr48| 4), 31599#(<= |#Ultimate.C_memset_#t~loopctr48| 5), 31600#(<= |#Ultimate.C_memset_#t~loopctr48| 6), 31601#(<= |#Ultimate.C_memset_#t~loopctr48| 7), 31602#(<= |#Ultimate.C_memset_#t~loopctr48| 8), 31603#(<= |#Ultimate.C_memset_#t~loopctr48| 9), 31604#(<= |#Ultimate.C_memset_#t~loopctr48| 10), 31605#(not (= |#Ultimate.C_memset_#amount| 119)), 31576#(not (= |zalloc_or_die_#in~size| 119)), 31353#(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)|)), 31577#(= (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)), 31354#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 31388#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))] [2018-02-04 04:38:05,844 INFO L134 CoverageAnalysis]: Checked inductivity of 2811 backedges. 736 proven. 55 refuted. 0 times theorem prover too weak. 2020 trivial. 0 not checked. [2018-02-04 04:38:05,844 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-04 04:38:05,844 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-04 04:38:05,844 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=324, Unknown=0, NotChecked=0, Total=420 [2018-02-04 04:38:05,844 INFO L87 Difference]: Start difference. First operand 284 states and 304 transitions. Second operand 21 states. [2018-02-04 04:38:06,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:38:06,916 INFO L93 Difference]: Finished difference Result 327 states and 352 transitions. [2018-02-04 04:38:06,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-04 04:38:06,916 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 208 [2018-02-04 04:38:06,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:38:06,917 INFO L225 Difference]: With dead ends: 327 [2018-02-04 04:38:06,917 INFO L226 Difference]: Without dead ends: 320 [2018-02-04 04:38:06,917 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=170, Invalid=822, Unknown=0, NotChecked=0, Total=992 [2018-02-04 04:38:06,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2018-02-04 04:38:06,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 284. [2018-02-04 04:38:06,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2018-02-04 04:38:06,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 304 transitions. [2018-02-04 04:38:06,920 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 304 transitions. Word has length 208 [2018-02-04 04:38:06,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:38:06,920 INFO L432 AbstractCegarLoop]: Abstraction has 284 states and 304 transitions. [2018-02-04 04:38:06,920 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-04 04:38:06,920 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 304 transitions. [2018-02-04 04:38:06,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2018-02-04 04:38:06,921 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:38:06,921 INFO L351 BasicCegarLoop]: trace histogram [67, 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 04:38:06,922 INFO L371 AbstractCegarLoop]: === Iteration 38 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr7RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr6RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr7RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr6RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr7RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr13RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr8RequiresViolation, l4_insertErr10RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr9RequiresViolation, l4_insertErr12RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr11RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-04 04:38:06,922 INFO L82 PathProgramCache]: Analyzing trace with hash -840582519, now seen corresponding path program 12 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:38:06,926 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:38:06,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:38:06,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:38:07,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:38:07,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:38:07,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:38:07,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:38:07,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:38:07,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:38:07,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:38:07,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:38:07,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:38:07,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:38:07,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:38:07,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:38:07,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:38:07,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:38:07,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:38:07,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:38:07,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:38:07,777 WARN L146 SmtUtils]: Spent 660ms on a formula simplification. DAG size of input: 40 DAG size of output 22 [2018-02-04 04:38:07,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:38:08,048 INFO L134 CoverageAnalysis]: Checked inductivity of 2883 backedges. 797 proven. 66 refuted. 0 times theorem prover too weak. 2020 trivial. 0 not checked. [2018-02-04 04:38:08,065 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:38:08,065 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-04 04:38:08,065 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:38:08,066 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2018-02-04 04:38:08,066 INFO L182 omatonBuilderFactory]: Interpolants [32672#(and (<= |#Ultimate.C_memset_#t~loopctr48| 8) (<= 8 |#Ultimate.C_memset_#t~loopctr48|) (< 1 |#Ultimate.C_memset_#amount|)), 32673#(and (<= 9 |#Ultimate.C_memset_#t~loopctr48|) (< 1 |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#t~loopctr48| 9)), 32674#(and (<= 10 |#Ultimate.C_memset_#t~loopctr48|) (< 1 |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#t~loopctr48| 10)), 32675#(and (< 10 |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#t~loopctr48| 11)), 32676#(and (< 10 |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#amount| 11)), 32421#(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)|)), 32645#(not (= |zalloc_or_die_#in~size| 119)), 32422#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 32646#(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)))), 32456#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 32621#(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))), 32239#true, 32240#false, 32663#(or (not (= |calloc_model_#in~nmemb| 1)) (not (= (mod |calloc_model_#in~size| 4294967296) 119))), 32664#(= 0 |#Ultimate.C_memset_#t~loopctr48|), 32665#(= 1 |#Ultimate.C_memset_#t~loopctr48|), 32666#(and (= |#Ultimate.C_memset_#t~loopctr48| 2) (< 1 |#Ultimate.C_memset_#amount|)), 32667#(and (<= 3 |#Ultimate.C_memset_#t~loopctr48|) (<= |#Ultimate.C_memset_#t~loopctr48| 3) (< 1 |#Ultimate.C_memset_#amount|)), 32668#(and (<= 4 |#Ultimate.C_memset_#t~loopctr48|) (< 1 |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#t~loopctr48| 4)), 32669#(and (<= 5 |#Ultimate.C_memset_#t~loopctr48|) (< 1 |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#t~loopctr48| 5)), 32670#(and (<= |#Ultimate.C_memset_#t~loopctr48| 6) (< 1 |#Ultimate.C_memset_#amount|) (<= 6 |#Ultimate.C_memset_#t~loopctr48|)), 32671#(and (<= 7 |#Ultimate.C_memset_#t~loopctr48|) (< 1 |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#t~loopctr48| 7))] [2018-02-04 04:38:08,066 INFO L134 CoverageAnalysis]: Checked inductivity of 2883 backedges. 797 proven. 66 refuted. 0 times theorem prover too weak. 2020 trivial. 0 not checked. [2018-02-04 04:38:08,066 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 04:38:08,066 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 04:38:08,066 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=418, Unknown=0, NotChecked=0, Total=462 [2018-02-04 04:38:08,066 INFO L87 Difference]: Start difference. First operand 284 states and 304 transitions. Second operand 22 states. [2018-02-04 04:38:09,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:38:09,444 INFO L93 Difference]: Finished difference Result 327 states and 351 transitions. [2018-02-04 04:38:09,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-04 04:38:09,445 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 209 [2018-02-04 04:38:09,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:38:09,445 INFO L225 Difference]: With dead ends: 327 [2018-02-04 04:38:09,445 INFO L226 Difference]: Without dead ends: 320 [2018-02-04 04:38:09,446 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=95, Invalid=835, Unknown=0, NotChecked=0, Total=930 [2018-02-04 04:38:09,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2018-02-04 04:38:09,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 282. [2018-02-04 04:38:09,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2018-02-04 04:38:09,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 301 transitions. [2018-02-04 04:38:09,450 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 301 transitions. Word has length 209 [2018-02-04 04:38:09,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:38:09,450 INFO L432 AbstractCegarLoop]: Abstraction has 282 states and 301 transitions. [2018-02-04 04:38:09,450 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 04:38:09,450 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 301 transitions. [2018-02-04 04:38:09,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-02-04 04:38:09,451 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:38:09,451 INFO L351 BasicCegarLoop]: trace histogram [68, 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 04:38:09,451 INFO L371 AbstractCegarLoop]: === Iteration 39 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr7RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr6RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr7RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr6RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr7RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr13RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr8RequiresViolation, l4_insertErr10RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr9RequiresViolation, l4_insertErr12RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr11RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-04 04:38:09,452 INFO L82 PathProgramCache]: Analyzing trace with hash 871669590, now seen corresponding path program 13 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:38:09,454 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:38:09,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:38:09,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:38:09,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:38:09,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:38:09,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:38:09,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:38:09,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:38:09,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:38:09,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:38:09,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:38:09,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:38:09,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:38:09,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:38:09,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:38:09,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:38:09,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:38:09,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:38:09,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:38:09,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:38:09,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:38:09,946 INFO L134 CoverageAnalysis]: Checked inductivity of 2956 backedges. 858 proven. 78 refuted. 0 times theorem prover too weak. 2020 trivial. 0 not checked. [2018-02-04 04:38:09,963 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:38:09,963 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-04 04:38:09,963 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:38:09,963 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2018-02-04 04:38:09,963 INFO L182 omatonBuilderFactory]: Interpolants [33731#(or (not (= |calloc_model_#in~nmemb| 1)) (not (= (mod |calloc_model_#in~size| 4294967296) 119))), 33732#(= 0 |#Ultimate.C_memset_#t~loopctr48|), 33733#(= 1 |#Ultimate.C_memset_#t~loopctr48|), 33734#(= 2 |#Ultimate.C_memset_#t~loopctr48|), 33735#(and (<= 3 |#Ultimate.C_memset_#t~loopctr48|) (<= |#Ultimate.C_memset_#t~loopctr48| 3)), 33736#(and (<= 4 |#Ultimate.C_memset_#t~loopctr48|) (<= |#Ultimate.C_memset_#t~loopctr48| 4)), 33737#(and (<= 5 |#Ultimate.C_memset_#t~loopctr48|) (<= |#Ultimate.C_memset_#t~loopctr48| 5)), 33738#(and (<= |#Ultimate.C_memset_#t~loopctr48| 6) (<= 6 |#Ultimate.C_memset_#t~loopctr48|)), 33739#(and (<= 7 |#Ultimate.C_memset_#t~loopctr48|) (<= |#Ultimate.C_memset_#t~loopctr48| 7)), 33740#(and (<= |#Ultimate.C_memset_#t~loopctr48| 8) (<= 8 |#Ultimate.C_memset_#t~loopctr48|)), 33741#(and (<= 9 |#Ultimate.C_memset_#t~loopctr48|) (<= |#Ultimate.C_memset_#t~loopctr48| 9)), 33742#(and (<= 10 |#Ultimate.C_memset_#t~loopctr48|) (<= |#Ultimate.C_memset_#t~loopctr48| 10)), 33487#(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)|)), 33743#(and (<= 11 |#Ultimate.C_memset_#t~loopctr48|) (<= |#Ultimate.C_memset_#t~loopctr48| 11)), 33488#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 33744#(and (< 11 |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#t~loopctr48| 12)), 33712#(not (= |zalloc_or_die_#in~size| 119)), 33713#(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)))), 33745#(and (< 11 |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#amount| 12)), 33522#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 33687#(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))), 33304#true, 33305#false] [2018-02-04 04:38:09,964 INFO L134 CoverageAnalysis]: Checked inductivity of 2956 backedges. 858 proven. 78 refuted. 0 times theorem prover too weak. 2020 trivial. 0 not checked. [2018-02-04 04:38:09,964 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-04 04:38:09,964 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-04 04:38:09,964 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=460, Unknown=0, NotChecked=0, Total=506 [2018-02-04 04:38:09,964 INFO L87 Difference]: Start difference. First operand 282 states and 301 transitions. Second operand 23 states. [2018-02-04 04:38:11,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:38:11,257 INFO L93 Difference]: Finished difference Result 333 states and 359 transitions. [2018-02-04 04:38:11,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-04 04:38:11,258 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 210 [2018-02-04 04:38:11,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:38:11,258 INFO L225 Difference]: With dead ends: 333 [2018-02-04 04:38:11,258 INFO L226 Difference]: Without dead ends: 326 [2018-02-04 04:38:11,259 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 04:38:11,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2018-02-04 04:38:11,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 285. [2018-02-04 04:38:11,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2018-02-04 04:38:11,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 306 transitions. [2018-02-04 04:38:11,261 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 306 transitions. Word has length 210 [2018-02-04 04:38:11,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:38:11,261 INFO L432 AbstractCegarLoop]: Abstraction has 285 states and 306 transitions. [2018-02-04 04:38:11,261 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-04 04:38:11,261 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 306 transitions. [2018-02-04 04:38:11,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-02-04 04:38:11,262 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:38:11,262 INFO L351 BasicCegarLoop]: trace histogram [69, 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 04:38:11,262 INFO L371 AbstractCegarLoop]: === Iteration 40 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr7RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr6RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr7RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr6RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr7RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr13RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr8RequiresViolation, l4_insertErr10RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr9RequiresViolation, l4_insertErr12RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr11RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-04 04:38:11,262 INFO L82 PathProgramCache]: Analyzing trace with hash -1883089879, now seen corresponding path program 14 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:38:11,265 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:38:11,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:38:11,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:38:11,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:38:11,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:38:11,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:38:11,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:38:11,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:38:11,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:38:11,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:38:11,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:38:11,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:38:11,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:38:11,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:38:11,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:38:11,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:38:11,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:38:11,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:38:11,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:38:11,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:38:11,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:38:11,847 INFO L134 CoverageAnalysis]: Checked inductivity of 3030 backedges. 919 proven. 91 refuted. 0 times theorem prover too weak. 2020 trivial. 0 not checked. [2018-02-04 04:38:11,864 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:38:11,865 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-04 04:38:11,865 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:38:11,865 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2018-02-04 04:38:11,865 INFO L182 omatonBuilderFactory]: Interpolants [34816#(and (<= 3 |#Ultimate.C_memset_#t~loopctr48|) (<= |#Ultimate.C_memset_#t~loopctr48| 3)), 34817#(and (<= 4 |#Ultimate.C_memset_#t~loopctr48|) (<= |#Ultimate.C_memset_#t~loopctr48| 4)), 34818#(and (<= 5 |#Ultimate.C_memset_#t~loopctr48|) (<= |#Ultimate.C_memset_#t~loopctr48| 5)), 34819#(and (<= |#Ultimate.C_memset_#t~loopctr48| 6) (<= 6 |#Ultimate.C_memset_#t~loopctr48|)), 34820#(and (<= 7 |#Ultimate.C_memset_#t~loopctr48|) (<= |#Ultimate.C_memset_#t~loopctr48| 7)), 34821#(and (<= |#Ultimate.C_memset_#t~loopctr48| 8) (<= 8 |#Ultimate.C_memset_#t~loopctr48|)), 34566#(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)|)), 34822#(and (<= 9 |#Ultimate.C_memset_#t~loopctr48|) (<= |#Ultimate.C_memset_#t~loopctr48| 9)), 34567#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 34823#(and (<= 10 |#Ultimate.C_memset_#t~loopctr48|) (<= |#Ultimate.C_memset_#t~loopctr48| 10)), 34824#(and (<= 11 |#Ultimate.C_memset_#t~loopctr48|) (<= |#Ultimate.C_memset_#t~loopctr48| 11)), 34792#(not (= |zalloc_or_die_#in~size| 119)), 34601#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 34793#(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)))), 34825#(and (<= 12 |#Ultimate.C_memset_#t~loopctr48|) (<= |#Ultimate.C_memset_#t~loopctr48| 12)), 34826#(and (< 12 |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#t~loopctr48| 13)), 34827#(and (< 12 |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#amount| 13)), 34382#true, 34766#(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))), 34383#false, 34812#(or (not (= |calloc_model_#in~nmemb| 1)) (not (= (mod |calloc_model_#in~size| 4294967296) 119))), 34813#(= 0 |#Ultimate.C_memset_#t~loopctr48|), 34814#(and (<= |#Ultimate.C_memset_#t~loopctr48| 1) (<= 1 |#Ultimate.C_memset_#t~loopctr48|)), 34815#(and (<= |#Ultimate.C_memset_#t~loopctr48| 2) (<= 2 |#Ultimate.C_memset_#t~loopctr48|))] [2018-02-04 04:38:11,865 INFO L134 CoverageAnalysis]: Checked inductivity of 3030 backedges. 919 proven. 91 refuted. 0 times theorem prover too weak. 2020 trivial. 0 not checked. [2018-02-04 04:38:11,865 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-04 04:38:11,866 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-04 04:38:11,866 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=504, Unknown=0, NotChecked=0, Total=552 [2018-02-04 04:38:11,866 INFO L87 Difference]: Start difference. First operand 285 states and 306 transitions. Second operand 24 states. [2018-02-04 04:38:13,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:38:13,433 INFO L93 Difference]: Finished difference Result 336 states and 364 transitions. [2018-02-04 04:38:13,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-04 04:38:13,434 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 211 [2018-02-04 04:38:13,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:38:13,435 INFO L225 Difference]: With dead ends: 336 [2018-02-04 04:38:13,435 INFO L226 Difference]: Without dead ends: 329 [2018-02-04 04:38:13,435 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=99, Invalid=957, Unknown=0, NotChecked=0, Total=1056 [2018-02-04 04:38:13,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2018-02-04 04:38:13,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 286. [2018-02-04 04:38:13,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2018-02-04 04:38:13,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 308 transitions. [2018-02-04 04:38:13,438 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 308 transitions. Word has length 211 [2018-02-04 04:38:13,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:38:13,438 INFO L432 AbstractCegarLoop]: Abstraction has 286 states and 308 transitions. [2018-02-04 04:38:13,438 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-04 04:38:13,438 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 308 transitions. [2018-02-04 04:38:13,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-02-04 04:38:13,439 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:38:13,439 INFO L351 BasicCegarLoop]: trace histogram [70, 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 04:38:13,439 INFO L371 AbstractCegarLoop]: === Iteration 41 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr7RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr6RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr7RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr6RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr7RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr13RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr8RequiresViolation, l4_insertErr10RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr9RequiresViolation, l4_insertErr12RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr11RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-04 04:38:13,439 INFO L82 PathProgramCache]: Analyzing trace with hash -1381287498, now seen corresponding path program 15 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:38:13,442 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:38:13,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:38:13,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:38:13,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:38:13,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:38:13,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:38:13,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:38:13,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:38:13,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:38:13,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:38:13,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:38:13,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:38:13,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:38:13,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:38:13,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:38:13,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:38:13,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:38:13,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:38:13,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:38:13,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:38:13,926 WARN L146 SmtUtils]: Spent 284ms on a formula simplification. DAG size of input: 40 DAG size of output 22 [2018-02-04 04:38:14,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:38:14,311 INFO L134 CoverageAnalysis]: Checked inductivity of 3105 backedges. 980 proven. 105 refuted. 0 times theorem prover too weak. 2020 trivial. 0 not checked. [2018-02-04 04:38:14,328 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:38:14,328 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-04 04:38:14,328 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:38:14,328 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2018-02-04 04:38:14,329 INFO L182 omatonBuilderFactory]: Interpolants [35904#(and (<= |#Ultimate.C_memset_#t~loopctr48| 2) (<= 2 |#Ultimate.C_memset_#t~loopctr48|)), 35905#(and (<= 3 |#Ultimate.C_memset_#t~loopctr48|) (<= |#Ultimate.C_memset_#t~loopctr48| 3)), 35906#(and (<= 4 |#Ultimate.C_memset_#t~loopctr48|) (<= |#Ultimate.C_memset_#t~loopctr48| 4)), 35907#(and (<= 5 |#Ultimate.C_memset_#t~loopctr48|) (<= |#Ultimate.C_memset_#t~loopctr48| 5)), 35908#(and (<= |#Ultimate.C_memset_#t~loopctr48| 6) (<= 6 |#Ultimate.C_memset_#t~loopctr48|)), 35653#(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)|)), 35909#(and (<= 7 |#Ultimate.C_memset_#t~loopctr48|) (<= |#Ultimate.C_memset_#t~loopctr48| 7)), 35654#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 35910#(and (<= |#Ultimate.C_memset_#t~loopctr48| 8) (<= 8 |#Ultimate.C_memset_#t~loopctr48|)), 35911#(and (<= 9 |#Ultimate.C_memset_#t~loopctr48|) (<= |#Ultimate.C_memset_#t~loopctr48| 9)), 35912#(and (<= 10 |#Ultimate.C_memset_#t~loopctr48|) (<= |#Ultimate.C_memset_#t~loopctr48| 10)), 35913#(and (<= 11 |#Ultimate.C_memset_#t~loopctr48|) (<= |#Ultimate.C_memset_#t~loopctr48| 11)), 35914#(and (<= 12 |#Ultimate.C_memset_#t~loopctr48|) (<= |#Ultimate.C_memset_#t~loopctr48| 12)), 35915#(and (<= |#Ultimate.C_memset_#t~loopctr48| 13) (<= 13 |#Ultimate.C_memset_#t~loopctr48|)), 35468#true, 35916#(and (<= |#Ultimate.C_memset_#t~loopctr48| 14) (< 13 |#Ultimate.C_memset_#amount|)), 35469#false, 35853#(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))), 35917#(and (< 13 |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#amount| 14)), 35688#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 35880#(not (= |zalloc_or_die_#in~size| 119)), 35881#(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)))), 35901#(or (not (= |calloc_model_#in~nmemb| 1)) (not (= (mod |calloc_model_#in~size| 4294967296) 119))), 35902#(= 0 |#Ultimate.C_memset_#t~loopctr48|), 35903#(and (<= |#Ultimate.C_memset_#t~loopctr48| 1) (<= 1 |#Ultimate.C_memset_#t~loopctr48|))] [2018-02-04 04:38:14,329 INFO L134 CoverageAnalysis]: Checked inductivity of 3105 backedges. 980 proven. 105 refuted. 0 times theorem prover too weak. 2020 trivial. 0 not checked. [2018-02-04 04:38:14,329 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-04 04:38:14,329 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-04 04:38:14,329 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=550, Unknown=0, NotChecked=0, Total=600 [2018-02-04 04:38:14,329 INFO L87 Difference]: Start difference. First operand 286 states and 308 transitions. Second operand 25 states. [2018-02-04 04:38:17,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:38:17,288 INFO L93 Difference]: Finished difference Result 339 states and 369 transitions. [2018-02-04 04:38:17,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-04 04:38:17,288 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 212 [2018-02-04 04:38:17,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:38:17,289 INFO L225 Difference]: With dead ends: 339 [2018-02-04 04:38:17,289 INFO L226 Difference]: Without dead ends: 332 [2018-02-04 04:38:17,289 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=101, Invalid=1021, Unknown=0, NotChecked=0, Total=1122 [2018-02-04 04:38:17,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2018-02-04 04:38:17,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 287. [2018-02-04 04:38:17,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2018-02-04 04:38:17,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 310 transitions. [2018-02-04 04:38:17,292 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 310 transitions. Word has length 212 [2018-02-04 04:38:17,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:38:17,292 INFO L432 AbstractCegarLoop]: Abstraction has 287 states and 310 transitions. [2018-02-04 04:38:17,292 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-04 04:38:17,292 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 310 transitions. [2018-02-04 04:38:17,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2018-02-04 04:38:17,293 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:38:17,293 INFO L351 BasicCegarLoop]: trace histogram [71, 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 04:38:17,293 INFO L371 AbstractCegarLoop]: === Iteration 42 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr7RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr6RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr7RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr6RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr7RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr13RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr8RequiresViolation, l4_insertErr10RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr9RequiresViolation, l4_insertErr12RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr11RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-04 04:38:17,293 INFO L82 PathProgramCache]: Analyzing trace with hash 1289684425, now seen corresponding path program 16 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:38:17,296 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:38:17,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:38:17,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:38:17,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:38:17,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:38:17,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:38:17,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:38:17,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:38:17,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:38:17,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:38:17,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:38:17,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:38:17,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:38:17,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:38:17,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:38:17,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:38:17,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:38:17,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:38:17,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:38:17,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:38:17,964 WARN L146 SmtUtils]: Spent 480ms on a formula simplification. DAG size of input: 40 DAG size of output 22 [2018-02-04 04:38:18,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:38:32,385 WARN L143 SmtUtils]: Spent 2024ms on a formula simplification that was a NOOP. DAG size: 17 [2018-02-04 04:38:32,409 INFO L134 CoverageAnalysis]: Checked inductivity of 3181 backedges. 1041 proven. 119 refuted. 1 times theorem prover too weak. 2020 trivial. 0 not checked. [2018-02-04 04:38:32,426 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:38:32,426 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-02-04 04:38:32,427 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:38:32,427 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2018-02-04 04:38:32,427 INFO L182 omatonBuilderFactory]: Interpolants [36998#(or (not (= |calloc_model_#in~nmemb| 1)) (not (= (mod |calloc_model_#in~size| 4294967296) 119))), 36999#(= 0 |#Ultimate.C_memset_#t~loopctr48|), 37000#(= 1 |#Ultimate.C_memset_#t~loopctr48|), 37001#(and (<= |#Ultimate.C_memset_#t~loopctr48| 2) (<= 2 |#Ultimate.C_memset_#t~loopctr48|)), 37002#(and (<= 3 |#Ultimate.C_memset_#t~loopctr48|) (<= |#Ultimate.C_memset_#t~loopctr48| 3)), 37003#(and (<= 4 |#Ultimate.C_memset_#t~loopctr48|) (<= |#Ultimate.C_memset_#t~loopctr48| 4)), 36748#(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)|)), 37004#(and (<= 5 |#Ultimate.C_memset_#t~loopctr48|) (<= |#Ultimate.C_memset_#t~loopctr48| 5)), 36749#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 37005#(and (<= |#Ultimate.C_memset_#t~loopctr48| 6) (<= 6 |#Ultimate.C_memset_#t~loopctr48|)), 37006#(and (<= 7 |#Ultimate.C_memset_#t~loopctr48|) (<= |#Ultimate.C_memset_#t~loopctr48| 7)), 37007#(and (<= |#Ultimate.C_memset_#t~loopctr48| 8) (<= 8 |#Ultimate.C_memset_#t~loopctr48|)), 37008#(and (<= 9 |#Ultimate.C_memset_#t~loopctr48|) (<= |#Ultimate.C_memset_#t~loopctr48| 9)), 37009#(and (<= 10 |#Ultimate.C_memset_#t~loopctr48|) (<= |#Ultimate.C_memset_#t~loopctr48| 10)), 36562#true, 37010#(and (<= 11 |#Ultimate.C_memset_#t~loopctr48|) (<= |#Ultimate.C_memset_#t~loopctr48| 11)), 36563#false, 37011#(and (<= 12 |#Ultimate.C_memset_#t~loopctr48|) (<= |#Ultimate.C_memset_#t~loopctr48| 12)), 36948#(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))), 37012#(and (<= |#Ultimate.C_memset_#t~loopctr48| 13) (<= 13 |#Ultimate.C_memset_#t~loopctr48|)), 37013#(and (<= 14 |#Ultimate.C_memset_#t~loopctr48|) (<= |#Ultimate.C_memset_#t~loopctr48| 14)), 37014#(and (<= (* 13 |#Ultimate.C_memset_#t~loopctr48|) (+ (div (+ (- 6442450749) (* 536870899 |#Ultimate.C_memset_#amount|)) 536870912) 536871094)) (< 14 |#Ultimate.C_memset_#amount|)), 37015#(and (<= (* 536870912 |#Ultimate.C_memset_#amount|) (+ (* 536870899 |#Ultimate.C_memset_#t~loopctr48|) (div (+ (- 6442450749) (* 536870899 |#Ultimate.C_memset_#amount|)) 536870912) 536871094)) (< 14 |#Ultimate.C_memset_#amount|)), 36783#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 36976#(not (= |zalloc_or_die_#in~size| 119)), 36977#(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 04:38:32,427 INFO L134 CoverageAnalysis]: Checked inductivity of 3181 backedges. 1041 proven. 119 refuted. 1 times theorem prover too weak. 2020 trivial. 0 not checked. [2018-02-04 04:38:32,427 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-04 04:38:32,427 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-04 04:38:32,427 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=593, Unknown=5, NotChecked=0, Total=650 [2018-02-04 04:38:32,428 INFO L87 Difference]: Start difference. First operand 287 states and 310 transitions. Second operand 26 states. Received shutdown request... [2018-02-04 04:39:36,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-02-04 04:39:36,851 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-04 04:39:36,856 WARN L185 ceAbstractionStarter]: Timeout [2018-02-04 04:39:36,856 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 04:39:36 BoogieIcfgContainer [2018-02-04 04:39:36,856 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 04:39:36,857 INFO L168 Benchmark]: Toolchain (without parser) took 213858.02 ms. Allocated memory was 408.4 MB in the beginning and 1.2 GB in the end (delta: 834.1 MB). Free memory was 365.3 MB in the beginning and 425.9 MB in the end (delta: -60.6 MB). Peak memory consumption was 773.6 MB. Max. memory is 5.3 GB. [2018-02-04 04:39:36,858 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 408.4 MB. Free memory is still 371.9 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 04:39:36,858 INFO L168 Benchmark]: CACSL2BoogieTranslator took 205.70 ms. Allocated memory is still 408.4 MB. Free memory was 365.3 MB in the beginning and 351.9 MB in the end (delta: 13.3 MB). Peak memory consumption was 13.3 MB. Max. memory is 5.3 GB. [2018-02-04 04:39:36,858 INFO L168 Benchmark]: Boogie Preprocessor took 38.68 ms. Allocated memory is still 408.4 MB. Free memory was 351.9 MB in the beginning and 350.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-04 04:39:36,858 INFO L168 Benchmark]: RCFGBuilder took 500.83 ms. Allocated memory is still 408.4 MB. Free memory was 350.6 MB in the beginning and 293.5 MB in the end (delta: 57.1 MB). Peak memory consumption was 57.1 MB. Max. memory is 5.3 GB. [2018-02-04 04:39:36,859 INFO L168 Benchmark]: TraceAbstraction took 213109.06 ms. Allocated memory was 408.4 MB in the beginning and 1.2 GB in the end (delta: 834.1 MB). Free memory was 293.5 MB in the beginning and 425.9 MB in the end (delta: -132.4 MB). Peak memory consumption was 701.8 MB. Max. memory is 5.3 GB. [2018-02-04 04:39:36,860 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.12 ms. Allocated memory is still 408.4 MB. Free memory is still 371.9 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 205.70 ms. Allocated memory is still 408.4 MB. Free memory was 365.3 MB in the beginning and 351.9 MB in the end (delta: 13.3 MB). Peak memory consumption was 13.3 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 38.68 ms. Allocated memory is still 408.4 MB. Free memory was 351.9 MB in the beginning and 350.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 500.83 ms. Allocated memory is still 408.4 MB. Free memory was 350.6 MB in the beginning and 293.5 MB in the end (delta: 57.1 MB). Peak memory consumption was 57.1 MB. Max. memory is 5.3 GB. * TraceAbstraction took 213109.06 ms. Allocated memory was 408.4 MB in the beginning and 1.2 GB in the end (delta: 834.1 MB). Free memory was 293.5 MB in the beginning and 425.9 MB in the end (delta: -132.4 MB). Peak memory consumption was 701.8 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 837). Cancelled while BasicCegarLoop was constructing difference of abstraction (287states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (294 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 838). Cancelled while BasicCegarLoop was constructing difference of abstraction (287states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (294 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 837). Cancelled while BasicCegarLoop was constructing difference of abstraction (287states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (294 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 838). Cancelled while BasicCegarLoop was constructing difference of abstraction (287states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (294 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 839). Cancelled while BasicCegarLoop was constructing difference of abstraction (287states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (294 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 839). Cancelled while BasicCegarLoop was constructing difference of abstraction (287states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (294 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 821). Cancelled while BasicCegarLoop was constructing difference of abstraction (287states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (294 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 821). Cancelled while BasicCegarLoop was constructing difference of abstraction (287states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (294 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 822). Cancelled while BasicCegarLoop was constructing difference of abstraction (287states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (294 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 821). Cancelled while BasicCegarLoop was constructing difference of abstraction (287states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (294 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 822). Cancelled while BasicCegarLoop was constructing difference of abstraction (287states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (294 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 821). Cancelled while BasicCegarLoop was constructing difference of abstraction (287states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (294 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 828). Cancelled while BasicCegarLoop was constructing difference of abstraction (287states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (294 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 829). Cancelled while BasicCegarLoop was constructing difference of abstraction (287states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (294 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 827). Cancelled while BasicCegarLoop was constructing difference of abstraction (287states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (294 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 827). Cancelled while BasicCegarLoop was constructing difference of abstraction (287states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (294 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 827). Cancelled while BasicCegarLoop was constructing difference of abstraction (287states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (294 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 829). Cancelled while BasicCegarLoop was constructing difference of abstraction (287states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (294 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 827). Cancelled while BasicCegarLoop was constructing difference of abstraction (287states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (294 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 828). Cancelled while BasicCegarLoop was constructing difference of abstraction (287states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (294 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 802). Cancelled while BasicCegarLoop was constructing difference of abstraction (287states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (294 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 802). Cancelled while BasicCegarLoop was constructing difference of abstraction (287states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (294 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 801). Cancelled while BasicCegarLoop was constructing difference of abstraction (287states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (294 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 801). Cancelled while BasicCegarLoop was constructing difference of abstraction (287states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (294 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 (287states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (294 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 802). Cancelled while BasicCegarLoop was constructing difference of abstraction (287states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (294 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 (287states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (294 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 802). Cancelled while BasicCegarLoop was constructing difference of abstraction (287states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (294 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 880). Cancelled while BasicCegarLoop was constructing difference of abstraction (287states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (294 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 874]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 874). Cancelled while BasicCegarLoop was constructing difference of abstraction (287states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (294 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 880). Cancelled while BasicCegarLoop was constructing difference of abstraction (287states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (294 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 793). Cancelled while BasicCegarLoop was constructing difference of abstraction (287states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (294 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 792). Cancelled while BasicCegarLoop was constructing difference of abstraction (287states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (294 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 791). Cancelled while BasicCegarLoop was constructing difference of abstraction (287states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (294 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 792). Cancelled while BasicCegarLoop was constructing difference of abstraction (287states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (294 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 792). Cancelled while BasicCegarLoop was constructing difference of abstraction (287states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (294 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 791). Cancelled while BasicCegarLoop was constructing difference of abstraction (287states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (294 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 793). Cancelled while BasicCegarLoop was constructing difference of abstraction (287states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (294 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 792). Cancelled while BasicCegarLoop was constructing difference of abstraction (287states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (294 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 (287states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (294 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 811). Cancelled while BasicCegarLoop was constructing difference of abstraction (287states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (294 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 (287states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (294 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 (287states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (294 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 (287states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (294 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 811). Cancelled while BasicCegarLoop was constructing difference of abstraction (287states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (294 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 (287states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (294 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 (287states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (294 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 869). Cancelled while BasicCegarLoop was constructing difference of abstraction (287states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (294 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 (287states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (294 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 (287states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (294 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 (287states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (294 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 869). Cancelled while BasicCegarLoop was constructing difference of abstraction (287states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (294 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 (287states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (294 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 (287states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (294 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 (287states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (294 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 780). Cancelled while BasicCegarLoop was constructing difference of abstraction (287states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (294 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 783). Cancelled while BasicCegarLoop was constructing difference of abstraction (287states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (294 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 781). Cancelled while BasicCegarLoop was constructing difference of abstraction (287states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (294 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 782). Cancelled while BasicCegarLoop was constructing difference of abstraction (287states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (294 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 782). Cancelled while BasicCegarLoop was constructing difference of abstraction (287states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (294 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 779). Cancelled while BasicCegarLoop was constructing difference of abstraction (287states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (294 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 780). Cancelled while BasicCegarLoop was constructing difference of abstraction (287states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (294 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 782). Cancelled while BasicCegarLoop was constructing difference of abstraction (287states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (294 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 783). Cancelled while BasicCegarLoop was constructing difference of abstraction (287states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (294 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 780). Cancelled while BasicCegarLoop was constructing difference of abstraction (287states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (294 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 780). Cancelled while BasicCegarLoop was constructing difference of abstraction (287states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (294 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 779). Cancelled while BasicCegarLoop was constructing difference of abstraction (287states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (294 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 782). Cancelled while BasicCegarLoop was constructing difference of abstraction (287states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (294 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 781). Cancelled while BasicCegarLoop was constructing difference of abstraction (287states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (294 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 876). Cancelled while BasicCegarLoop was constructing difference of abstraction (287states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (294 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 876). Cancelled while BasicCegarLoop was constructing difference of abstraction (287states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (294 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 858). Cancelled while BasicCegarLoop was constructing difference of abstraction (287states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (294 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 859). Cancelled while BasicCegarLoop was constructing difference of abstraction (287states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (294 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 857). Cancelled while BasicCegarLoop was constructing difference of abstraction (287states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (294 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 857). Cancelled while BasicCegarLoop was constructing difference of abstraction (287states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (294 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 859). Cancelled while BasicCegarLoop was constructing difference of abstraction (287states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (294 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 858). Cancelled while BasicCegarLoop was constructing difference of abstraction (287states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (294 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 847). Cancelled while BasicCegarLoop was constructing difference of abstraction (287states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (294 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 847). Cancelled while BasicCegarLoop was constructing difference of abstraction (287states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (294 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 848). Cancelled while BasicCegarLoop was constructing difference of abstraction (287states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (294 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 849). Cancelled while BasicCegarLoop was constructing difference of abstraction (287states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (294 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 849). Cancelled while BasicCegarLoop was constructing difference of abstraction (287states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (294 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 848). Cancelled while BasicCegarLoop was constructing difference of abstraction (287states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (294 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 16 procedures, 250 locations, 83 error locations. TIMEOUT Result, 213.0s OverallTime, 42 OverallIterations, 71 TraceHistogramMax, 176.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 9511 SDtfs, 6233 SDslu, 72063 SDs, 0 SdLazy, 76394 SolverSat, 2153 SolverUnsat, 71 SolverUnknown, 0 SolverNotchecked, 146.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2144 GetRequests, 1087 SyntacticMatches, 0 SemanticMatches, 1057 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 3865 ImplicationChecksByTransitivity, 49.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=287occurred in iteration=41, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 51786/55224 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, 41 MinimizatonAttempts, 1737 StatesRemovedByMinimization, 41 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.6s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 33.2s InterpolantComputationTime, 5819 NumberOfCodeBlocks, 5819 NumberOfCodeBlocksAsserted, 42 NumberOfCheckSat, 5777 ConstructedInterpolants, 10 QuantifiedInterpolants, 3115760 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 42 InterpolantComputations, 7 PerfectInterpolantSequences, 51786/55224 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0237_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_z3.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_04-39-36-867.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0237_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_z3.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_04-39-36-867.csv Completed graceful shutdown