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/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_z3.epf -i ../../../trunk/examples/svcomp/memsafety/test-0235_false-valid-deref.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-26d9e06-m [2018-02-02 10:54:00,925 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 10:54:00,926 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 10:54:00,939 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 10:54:00,939 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 10:54:00,940 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 10:54:00,941 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 10:54:00,942 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 10:54:00,943 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 10:54:00,944 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 10:54:00,945 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 10:54:00,945 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 10:54:00,946 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 10:54:00,947 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 10:54:00,948 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 10:54:00,949 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 10:54:00,951 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 10:54:00,952 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 10:54:00,953 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 10:54:00,954 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 10:54:00,956 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 10:54:00,956 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 10:54:00,957 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 10:54:00,957 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 10:54:00,958 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 10:54:00,959 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 10:54:00,959 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 10:54:00,960 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 10:54:00,960 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 10:54:00,960 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 10:54:00,960 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 10:54:00,961 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_z3.epf [2018-02-02 10:54:00,969 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 10:54:00,970 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 10:54:00,970 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 10:54:00,970 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 10:54:00,971 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 10:54:00,971 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 10:54:00,971 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 10:54:00,971 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 10:54:00,971 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 10:54:00,971 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 10:54:00,971 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 10:54:00,971 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 10:54:00,971 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 10:54:00,972 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 10:54:00,972 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 10:54:00,972 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 10:54:00,972 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 10:54:00,972 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 10:54:00,972 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 10:54:00,972 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 10:54:00,972 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 10:54:00,972 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 10:54:00,972 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-02-02 10:54:00,973 INFO L133 SettingsManager]: * SMT solver=External_Z3InterpolationMode [2018-02-02 10:54:00,973 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 10:54:00,999 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 10:54:01,006 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 10:54:01,009 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 10:54:01,010 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 10:54:01,010 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 10:54:01,011 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/test-0235_false-valid-deref.i [2018-02-02 10:54:01,135 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 10:54:01,136 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 10:54:01,136 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 10:54:01,136 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 10:54:01,140 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 10:54:01,141 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:54:01" (1/1) ... [2018-02-02 10:54:01,147 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3390db28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:54:01, skipping insertion in model container [2018-02-02 10:54:01,148 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:54:01" (1/1) ... [2018-02-02 10:54:01,158 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:54:01,190 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:54:01,292 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:54:01,315 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:54:01,325 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:54:01 WrapperNode [2018-02-02 10:54:01,326 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 10:54:01,326 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 10:54:01,326 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 10:54:01,327 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 10:54:01,336 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:54:01" (1/1) ... [2018-02-02 10:54:01,336 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:54:01" (1/1) ... [2018-02-02 10:54:01,345 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:54:01" (1/1) ... [2018-02-02 10:54:01,345 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:54:01" (1/1) ... [2018-02-02 10:54:01,353 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:54:01" (1/1) ... [2018-02-02 10:54:01,358 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:54:01" (1/1) ... [2018-02-02 10:54:01,360 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:54:01" (1/1) ... [2018-02-02 10:54:01,363 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 10:54:01,364 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 10:54:01,364 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 10:54:01,364 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 10:54:01,365 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:54:01" (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-02 10:54:01,401 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 10:54:01,402 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 10:54:01,402 INFO L136 BoogieDeclarations]: Found implementation of procedure calloc_model [2018-02-02 10:54:01,402 INFO L136 BoogieDeclarations]: Found implementation of procedure zalloc_or_die [2018-02-02 10:54:01,402 INFO L136 BoogieDeclarations]: Found implementation of procedure l4_insert [2018-02-02 10:54:01,402 INFO L136 BoogieDeclarations]: Found implementation of procedure l3_insert [2018-02-02 10:54:01,402 INFO L136 BoogieDeclarations]: Found implementation of procedure l2_insert [2018-02-02 10:54:01,402 INFO L136 BoogieDeclarations]: Found implementation of procedure l1_insert [2018-02-02 10:54:01,402 INFO L136 BoogieDeclarations]: Found implementation of procedure l0_insert [2018-02-02 10:54:01,403 INFO L136 BoogieDeclarations]: Found implementation of procedure l4_destroy [2018-02-02 10:54:01,403 INFO L136 BoogieDeclarations]: Found implementation of procedure l3_destroy [2018-02-02 10:54:01,403 INFO L136 BoogieDeclarations]: Found implementation of procedure l2_destroy [2018-02-02 10:54:01,403 INFO L136 BoogieDeclarations]: Found implementation of procedure l1_destroy [2018-02-02 10:54:01,403 INFO L136 BoogieDeclarations]: Found implementation of procedure l0_destroy [2018-02-02 10:54:01,403 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 10:54:01,403 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-02 10:54:01,403 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-02 10:54:01,404 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 10:54:01,404 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 10:54:01,404 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 10:54:01,404 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2018-02-02 10:54:01,404 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2018-02-02 10:54:01,404 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-02 10:54:01,404 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-02 10:54:01,404 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-02-02 10:54:01,404 INFO L128 BoogieDeclarations]: Found specification of procedure memset [2018-02-02 10:54:01,405 INFO L128 BoogieDeclarations]: Found specification of procedure calloc_model [2018-02-02 10:54:01,405 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 10:54:01,405 INFO L128 BoogieDeclarations]: Found specification of procedure zalloc_or_die [2018-02-02 10:54:01,405 INFO L128 BoogieDeclarations]: Found specification of procedure l4_insert [2018-02-02 10:54:01,405 INFO L128 BoogieDeclarations]: Found specification of procedure l3_insert [2018-02-02 10:54:01,405 INFO L128 BoogieDeclarations]: Found specification of procedure l2_insert [2018-02-02 10:54:01,405 INFO L128 BoogieDeclarations]: Found specification of procedure l1_insert [2018-02-02 10:54:01,406 INFO L128 BoogieDeclarations]: Found specification of procedure l0_insert [2018-02-02 10:54:01,406 INFO L128 BoogieDeclarations]: Found specification of procedure l4_destroy [2018-02-02 10:54:01,406 INFO L128 BoogieDeclarations]: Found specification of procedure l3_destroy [2018-02-02 10:54:01,406 INFO L128 BoogieDeclarations]: Found specification of procedure l2_destroy [2018-02-02 10:54:01,406 INFO L128 BoogieDeclarations]: Found specification of procedure l1_destroy [2018-02-02 10:54:01,406 INFO L128 BoogieDeclarations]: Found specification of procedure l0_destroy [2018-02-02 10:54:01,406 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 10:54:01,406 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 10:54:01,407 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 10:54:01,756 WARN L455 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-02-02 10:54:01,948 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 10:54:01,948 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:54:01 BoogieIcfgContainer [2018-02-02 10:54:01,948 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 10:54:01,949 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 10:54:01,949 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 10:54:01,952 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 10:54:01,952 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 10:54:01" (1/3) ... [2018-02-02 10:54:01,953 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d0eab1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:54:01, skipping insertion in model container [2018-02-02 10:54:01,953 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:54:01" (2/3) ... [2018-02-02 10:54:01,953 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d0eab1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:54:01, skipping insertion in model container [2018-02-02 10:54:01,953 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:54:01" (3/3) ... [2018-02-02 10:54:01,955 INFO L107 eAbstractionObserver]: Analyzing ICFG test-0235_false-valid-deref.i [2018-02-02 10:54:01,961 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-02 10:54:01,966 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 85 error locations. [2018-02-02 10:54:01,997 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 10:54:01,997 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 10:54:01,997 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-02-02 10:54:01,997 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-02 10:54:01,998 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 10:54:01,998 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 10:54:01,998 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 10:54:01,998 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 10:54:01,998 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 10:54:02,010 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states. [2018-02-02 10:54:02,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-02-02 10:54:02,017 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:54:02,018 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-02-02 10:54:02,019 INFO L371 AbstractCegarLoop]: === Iteration 1 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-02 10:54:02,022 INFO L82 PathProgramCache]: Analyzing trace with hash 15319548, 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-02 10:54:02,032 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:54:02,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:02,089 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-02 10:54:02,118 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:54:02,118 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 10:54:02,119 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:54:02,120 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-02 10:54:02,120 INFO L182 omatonBuilderFactory]: Interpolants [278#true, 279#false, 280#(= 1 (select |#valid| |~#list~0.base|))] [2018-02-02 10:54:02,120 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-02 10:54:02,121 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 10:54:02,136 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 10:54:02,136 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 10:54:02,138 INFO L87 Difference]: Start difference. First operand 275 states. Second operand 3 states. [2018-02-02 10:54:02,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:54:02,457 INFO L93 Difference]: Finished difference Result 394 states and 450 transitions. [2018-02-02 10:54:02,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 10:54:02,459 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-02-02 10:54:02,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:54:02,472 INFO L225 Difference]: With dead ends: 394 [2018-02-02 10:54:02,472 INFO L226 Difference]: Without dead ends: 391 [2018-02-02 10:54:02,474 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-02 10:54:02,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2018-02-02 10:54:02,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 345. [2018-02-02 10:54:02,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2018-02-02 10:54:02,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 426 transitions. [2018-02-02 10:54:02,615 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 426 transitions. Word has length 4 [2018-02-02 10:54:02,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:54:02,616 INFO L432 AbstractCegarLoop]: Abstraction has 345 states and 426 transitions. [2018-02-02 10:54:02,616 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 10:54:02,616 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 426 transitions. [2018-02-02 10:54:02,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-02-02 10:54:02,616 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:54:02,617 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-02-02 10:54:02,617 INFO L371 AbstractCegarLoop]: === Iteration 2 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-02 10:54:02,617 INFO L82 PathProgramCache]: Analyzing trace with hash 15319549, 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-02 10:54:02,620 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:54:02,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:02,628 WARN L195 Executor]: ExternalInterpolator (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in) stderr output: WARNING: array quantifier [2018-02-02 10:54:02,631 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-02 10:54:02,631 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-02 10:54:02,632 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-02 10:54:02,632 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-02 10:54:02,668 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-02 10:54:02,690 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-02 10:54:02,719 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:54:02,719 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 10:54:02,719 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:54:02,720 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-02 10:54:02,720 INFO L182 omatonBuilderFactory]: Interpolants [1020#true, 1021#false, 1022#(exists ((%0 (Array Int Int))) (! (forall ((%1 Int)) (! (= (store %0 %1 4) (store |#length| %1 4)) :qid itp)) :qid itp)), 1023#(and (<= (+ |~#list~0.offset| 4) (select |#length| |~#list~0.base|)) (= 4 (select |#length| |~#list~0.base|)) (<= 0 |~#list~0.offset|))] [2018-02-02 10:54:02,720 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-02 10:54:02,721 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:54:02,721 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:54:02,722 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2018-02-02 10:54:02,722 INFO L87 Difference]: Start difference. First operand 345 states and 426 transitions. Second operand 4 states. [2018-02-02 10:54:02,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:54:02,850 INFO L93 Difference]: Finished difference Result 352 states and 436 transitions. [2018-02-02 10:54:02,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 10:54:02,850 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2018-02-02 10:54:02,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:54:02,853 INFO L225 Difference]: With dead ends: 352 [2018-02-02 10:54:02,853 INFO L226 Difference]: Without dead ends: 352 [2018-02-02 10:54:02,853 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-02 10:54:02,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2018-02-02 10:54:02,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 344. [2018-02-02 10:54:02,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2018-02-02 10:54:02,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 425 transitions. [2018-02-02 10:54:02,871 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 425 transitions. Word has length 4 [2018-02-02 10:54:02,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:54:02,871 INFO L432 AbstractCegarLoop]: Abstraction has 344 states and 425 transitions. [2018-02-02 10:54:02,871 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:54:02,871 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 425 transitions. [2018-02-02 10:54:02,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-02 10:54:02,872 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:54:02,872 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:54:02,872 INFO L371 AbstractCegarLoop]: === Iteration 3 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-02 10:54:02,872 INFO L82 PathProgramCache]: Analyzing trace with hash 116258063, 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-02 10:54:02,876 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:54:02,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:02,895 WARN L195 Executor]: ExternalInterpolator (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in) stderr output: WARNING: array quantifier [2018-02-02 10:54:02,899 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-02 10:54:02,899 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-02 10:54:02,900 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-02 10:54:02,900 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-02 10:54:02,947 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-02 10:54:03,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:03,005 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-02 10:54:03,031 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:54:03,031 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:54:03,031 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:54:03,032 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-02 10:54:03,032 INFO L182 omatonBuilderFactory]: Interpolants [1728#(= 1 (select |#valid| |calloc_model_#t~malloc0.base|)), 1729#(= 1 (select |#valid| calloc_model_~ptr~0.base)), 1730#(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)|)), 1720#true, 1721#false, 1727#(exists ((%0 (Array Int Int))) (! (forall ((%1 Int)) (! (= (store |#valid| %1 1) (store %0 %1 1)) :qid itp)) :qid itp))] [2018-02-02 10:54:03,032 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-02 10:54:03,033 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:54:03,033 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:54:03,033 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=14, Unknown=1, NotChecked=6, Total=30 [2018-02-02 10:54:03,033 INFO L87 Difference]: Start difference. First operand 344 states and 425 transitions. Second operand 6 states. [2018-02-02 10:54:03,064 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-02 10:54:03,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:54:03,665 INFO L93 Difference]: Finished difference Result 432 states and 529 transitions. [2018-02-02 10:54:03,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:54:03,666 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-02-02 10:54:03,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:54:03,667 INFO L225 Difference]: With dead ends: 432 [2018-02-02 10:54:03,668 INFO L226 Difference]: Without dead ends: 432 [2018-02-02 10:54:03,668 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-02 10:54:03,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2018-02-02 10:54:03,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 388. [2018-02-02 10:54:03,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2018-02-02 10:54:03,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 501 transitions. [2018-02-02 10:54:03,678 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 501 transitions. Word has length 17 [2018-02-02 10:54:03,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:54:03,678 INFO L432 AbstractCegarLoop]: Abstraction has 388 states and 501 transitions. [2018-02-02 10:54:03,678 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:54:03,678 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 501 transitions. [2018-02-02 10:54:03,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-02 10:54:03,679 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:54:03,679 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:54:03,679 INFO L371 AbstractCegarLoop]: === Iteration 4 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-02 10:54:03,679 INFO L82 PathProgramCache]: Analyzing trace with hash 116258064, 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-02 10:54:03,681 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:54:03,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:03,694 WARN L195 Executor]: ExternalInterpolator (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in) stderr output: WARNING: array quantifier WARNING: array quantifier [2018-02-02 10:54:03,699 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-02 10:54:03,700 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-02 10:54:03,700 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-02 10:54:03,700 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-02 10:54:03,708 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-02 10:54:03,709 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-02 10:54:03,709 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-02 10:54:03,709 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-02 10:54:03,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:03,832 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-02 10:54:03,852 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:54:03,852 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 10:54:03,852 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:54:03,853 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-02 10:54:03,853 INFO L182 omatonBuilderFactory]: Interpolants [2562#(= |zalloc_or_die_#in~size| 8), 2563#(= 8 zalloc_or_die_~size), 2564#(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)), 2565#(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)), 2566#(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|)), 2567#(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)))), 2568#(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)|)), 2555#true, 2556#false] [2018-02-02 10:54:03,853 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-02 10:54:03,853 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 10:54:03,854 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 10:54:03,854 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=56, Unknown=1, NotChecked=0, Total=72 [2018-02-02 10:54:03,854 INFO L87 Difference]: Start difference. First operand 388 states and 501 transitions. Second operand 9 states. [2018-02-02 10:54:03,957 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-02 10:54:05,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:54:05,173 INFO L93 Difference]: Finished difference Result 445 states and 543 transitions. [2018-02-02 10:54:05,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 10:54:05,173 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 17 [2018-02-02 10:54:05,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:54:05,176 INFO L225 Difference]: With dead ends: 445 [2018-02-02 10:54:05,176 INFO L226 Difference]: Without dead ends: 445 [2018-02-02 10:54:05,176 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-02 10:54:05,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2018-02-02 10:54:05,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 401. [2018-02-02 10:54:05,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 401 states. [2018-02-02 10:54:05,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 514 transitions. [2018-02-02 10:54:05,190 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 514 transitions. Word has length 17 [2018-02-02 10:54:05,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:54:05,191 INFO L432 AbstractCegarLoop]: Abstraction has 401 states and 514 transitions. [2018-02-02 10:54:05,191 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 10:54:05,191 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 514 transitions. [2018-02-02 10:54:05,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-02-02 10:54:05,194 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:54:05,195 INFO L351 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:54:05,195 INFO L371 AbstractCegarLoop]: === Iteration 5 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-02 10:54:05,195 INFO L82 PathProgramCache]: Analyzing trace with hash 612491321, 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-02 10:54:05,201 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:54:05,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:05,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:05,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:05,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:05,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:05,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:05,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:05,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:05,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:05,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:05,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:05,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:05,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:05,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:05,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:05,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:05,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:05,630 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2018-02-02 10:54:05,660 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:54:05,660 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-02 10:54:05,660 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:54:05,661 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2018-02-02 10:54:05,661 INFO L182 omatonBuilderFactory]: Interpolants [3425#true, 3426#false, 3522#(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)|)), 3523#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 3541#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 3606#(not (= 8 |zalloc_or_die_#in~size|)), 3607#(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)))), 3593#(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))), 3613#(or (not (= |calloc_model_#in~nmemb| 1)) (not (= (mod |calloc_model_#in~size| 4294967296) 8))), 3614#(= 0 |#Ultimate.C_memset_#t~loopctr49|), 3615#(<= |#Ultimate.C_memset_#amount| 0)] [2018-02-02 10:54:05,661 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2018-02-02 10:54:05,662 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 10:54:05,662 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 10:54:05,662 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-02-02 10:54:05,662 INFO L87 Difference]: Start difference. First operand 401 states and 514 transitions. Second operand 11 states. [2018-02-02 10:54:06,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:54:06,799 INFO L93 Difference]: Finished difference Result 459 states and 556 transitions. [2018-02-02 10:54:06,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 10:54:06,799 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 129 [2018-02-02 10:54:06,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:54:06,801 INFO L225 Difference]: With dead ends: 459 [2018-02-02 10:54:06,801 INFO L226 Difference]: Without dead ends: 452 [2018-02-02 10:54:06,801 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=86, Invalid=334, Unknown=0, NotChecked=0, Total=420 [2018-02-02 10:54:06,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2018-02-02 10:54:06,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 404. [2018-02-02 10:54:06,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 404 states. [2018-02-02 10:54:06,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 518 transitions. [2018-02-02 10:54:06,808 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 518 transitions. Word has length 129 [2018-02-02 10:54:06,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:54:06,808 INFO L432 AbstractCegarLoop]: Abstraction has 404 states and 518 transitions. [2018-02-02 10:54:06,808 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 10:54:06,808 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 518 transitions. [2018-02-02 10:54:06,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-02-02 10:54:06,809 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:54:06,809 INFO L351 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:54:06,809 INFO L371 AbstractCegarLoop]: === Iteration 6 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-02 10:54:06,809 INFO L82 PathProgramCache]: Analyzing trace with hash -750293478, 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-02 10:54:06,816 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:54:06,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:06,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:06,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:06,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:07,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:07,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:07,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:07,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:07,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:07,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:07,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:07,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:07,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:07,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:07,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:07,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:07,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:07,094 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 30 proven. 69 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2018-02-02 10:54:07,109 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:54:07,109 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-02 10:54:07,110 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:54:07,110 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2018-02-02 10:54:07,110 INFO L182 omatonBuilderFactory]: Interpolants [4626#(not (= (mod (* (mod |calloc_model_#in~nmemb| 4294967296) (mod |calloc_model_#in~size| 4294967296)) 4294967296) 8)), 4627#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 4500#true, 4628#(= 0 |#Ultimate.C_memset_#t~loopctr49|), 4501#false, 4629#(or (and (<= |#Ultimate.C_memset_#amount| |#Ultimate.C_memset_#t~loopctr49|) (<= |#Ultimate.C_memset_#amount| 1)) (and (< |#Ultimate.C_memset_#t~loopctr49| |#Ultimate.C_memset_#amount|) (< 1 |#Ultimate.C_memset_#amount|))), 4630#(<= |#Ultimate.C_memset_#amount| 1), 4602#(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)|)), 4618#(not (= 8 |zalloc_or_die_#in~size|)), 4603#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 4619#(= (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)), 4604#(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-02 10:54:07,110 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 30 proven. 69 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2018-02-02 10:54:07,110 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 10:54:07,110 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 10:54:07,111 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-02-02 10:54:07,111 INFO L87 Difference]: Start difference. First operand 404 states and 518 transitions. Second operand 12 states. [2018-02-02 10:54:08,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:54:08,152 INFO L93 Difference]: Finished difference Result 465 states and 563 transitions. [2018-02-02 10:54:08,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 10:54:08,152 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 134 [2018-02-02 10:54:08,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:54:08,154 INFO L225 Difference]: With dead ends: 465 [2018-02-02 10:54:08,154 INFO L226 Difference]: Without dead ends: 458 [2018-02-02 10:54:08,155 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=453, Unknown=0, NotChecked=0, Total=552 [2018-02-02 10:54:08,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2018-02-02 10:54:08,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 405. [2018-02-02 10:54:08,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2018-02-02 10:54:08,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 520 transitions. [2018-02-02 10:54:08,166 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 520 transitions. Word has length 134 [2018-02-02 10:54:08,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:54:08,166 INFO L432 AbstractCegarLoop]: Abstraction has 405 states and 520 transitions. [2018-02-02 10:54:08,166 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 10:54:08,166 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 520 transitions. [2018-02-02 10:54:08,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-02-02 10:54:08,168 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:54:08,168 INFO L351 BasicCegarLoop]: trace histogram [10, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:54:08,168 INFO L371 AbstractCegarLoop]: === Iteration 7 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-02 10:54:08,169 INFO L82 PathProgramCache]: Analyzing trace with hash 1870375513, 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-02 10:54:08,172 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:54:08,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:08,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:08,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:08,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:08,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:08,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:08,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:08,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:08,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:08,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:08,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:08,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:08,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:08,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:08,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:08,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:08,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:08,435 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 30 proven. 91 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2018-02-02 10:54:08,450 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:54:08,450 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-02 10:54:08,450 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:54:08,451 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-02-02 10:54:08,451 INFO L182 omatonBuilderFactory]: Interpolants [5602#true, 5603#false, 5735#(not (= (mod (* (mod |calloc_model_#in~nmemb| 4294967296) (mod |calloc_model_#in~size| 4294967296)) 4294967296) 8)), 5736#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 5737#(= 0 |#Ultimate.C_memset_#t~loopctr49|), 5738#(= 1 |#Ultimate.C_memset_#t~loopctr49|), 5739#(or (and (< 2 |#Ultimate.C_memset_#amount|) (< |#Ultimate.C_memset_#t~loopctr49| |#Ultimate.C_memset_#amount|)) (and (<= |#Ultimate.C_memset_#amount| |#Ultimate.C_memset_#t~loopctr49|) (<= |#Ultimate.C_memset_#amount| 2))), 5740#(<= |#Ultimate.C_memset_#amount| 2), 5709#(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)|)), 5710#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 5711#(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))), 5726#(not (= 8 |zalloc_or_die_#in~size|)), 5727#(= (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-02 10:54:08,451 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 30 proven. 91 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2018-02-02 10:54:08,451 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 10:54:08,451 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 10:54:08,452 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2018-02-02 10:54:08,452 INFO L87 Difference]: Start difference. First operand 405 states and 520 transitions. Second operand 13 states. [2018-02-02 10:54:09,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:54:09,471 INFO L93 Difference]: Finished difference Result 468 states and 567 transitions. [2018-02-02 10:54:09,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 10:54:09,471 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 139 [2018-02-02 10:54:09,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:54:09,473 INFO L225 Difference]: With dead ends: 468 [2018-02-02 10:54:09,473 INFO L226 Difference]: Without dead ends: 461 [2018-02-02 10:54:09,474 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 34 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-02 10:54:09,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2018-02-02 10:54:09,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 406. [2018-02-02 10:54:09,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 406 states. [2018-02-02 10:54:09,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 522 transitions. [2018-02-02 10:54:09,484 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 522 transitions. Word has length 139 [2018-02-02 10:54:09,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:54:09,485 INFO L432 AbstractCegarLoop]: Abstraction has 406 states and 522 transitions. [2018-02-02 10:54:09,485 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 10:54:09,485 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 522 transitions. [2018-02-02 10:54:09,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-02-02 10:54:09,486 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:54:09,487 INFO L351 BasicCegarLoop]: trace histogram [15, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:54:09,487 INFO L371 AbstractCegarLoop]: === Iteration 8 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-02 10:54:09,487 INFO L82 PathProgramCache]: Analyzing trace with hash 1443053562, 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-02 10:54:09,492 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:54:09,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:09,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:09,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:09,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:09,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:09,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:09,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:09,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:09,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:09,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:09,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:09,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:09,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:09,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:09,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:09,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:09,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:09,765 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 30 proven. 122 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2018-02-02 10:54:09,793 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:54:09,793 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-02 10:54:09,794 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:54:09,794 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 68 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2018-02-02 10:54:09,794 INFO L182 omatonBuilderFactory]: Interpolants [6726#true, 6727#false, 6856#(not (= 8 |zalloc_or_die_#in~size|)), 6857#(= (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)), 6866#(not (= (mod (* (mod |calloc_model_#in~nmemb| 4294967296) (mod |calloc_model_#in~size| 4294967296)) 4294967296) 8)), 6867#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 6868#(= 0 |#Ultimate.C_memset_#t~loopctr49|), 6869#(= 1 |#Ultimate.C_memset_#t~loopctr49|), 6838#(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)|)), 6870#(<= |#Ultimate.C_memset_#t~loopctr49| 2), 6839#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 6871#(<= |#Ultimate.C_memset_#t~loopctr49| 3), 6840#(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))), 6872#(not (= 8 |#Ultimate.C_memset_#amount|))] [2018-02-02 10:54:09,794 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 30 proven. 122 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2018-02-02 10:54:09,794 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 10:54:09,794 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 10:54:09,795 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2018-02-02 10:54:09,795 INFO L87 Difference]: Start difference. First operand 406 states and 522 transitions. Second operand 14 states. [2018-02-02 10:54:10,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:54:10,812 INFO L93 Difference]: Finished difference Result 471 states and 571 transitions. [2018-02-02 10:54:10,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-02 10:54:10,813 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 144 [2018-02-02 10:54:10,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:54:10,814 INFO L225 Difference]: With dead ends: 471 [2018-02-02 10:54:10,814 INFO L226 Difference]: Without dead ends: 464 [2018-02-02 10:54:10,815 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=126, Invalid=630, Unknown=0, NotChecked=0, Total=756 [2018-02-02 10:54:10,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2018-02-02 10:54:10,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 407. [2018-02-02 10:54:10,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2018-02-02 10:54:10,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 524 transitions. [2018-02-02 10:54:10,825 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 524 transitions. Word has length 144 [2018-02-02 10:54:10,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:54:10,825 INFO L432 AbstractCegarLoop]: Abstraction has 407 states and 524 transitions. [2018-02-02 10:54:10,825 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 10:54:10,825 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 524 transitions. [2018-02-02 10:54:10,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-02-02 10:54:10,827 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:54:10,827 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-02 10:54:10,827 INFO L371 AbstractCegarLoop]: === Iteration 9 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-02 10:54:10,828 INFO L82 PathProgramCache]: Analyzing trace with hash 1407298681, 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-02 10:54:10,839 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:54:10,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:10,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:10,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:10,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:11,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:11,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:11,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:11,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:11,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:11,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:11,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:11,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:11,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:11,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:11,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:11,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:11,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:11,179 INFO L134 CoverageAnalysis]: Checked inductivity of 500 backedges. 30 proven. 162 refuted. 0 times theorem prover too weak. 308 trivial. 0 not checked. [2018-02-02 10:54:11,208 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:54:11,208 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-02 10:54:11,208 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:54:11,209 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2018-02-02 10:54:11,209 INFO L182 omatonBuilderFactory]: Interpolants [7872#true, 7873#false, 8008#(not (= 8 |zalloc_or_die_#in~size|)), 8009#(= (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)), 8019#(not (= (mod (* (mod |calloc_model_#in~nmemb| 4294967296) (mod |calloc_model_#in~size| 4294967296)) 4294967296) 8)), 8020#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 7989#(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)|)), 8021#(= 0 |#Ultimate.C_memset_#t~loopctr49|), 7990#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 8022#(= |#Ultimate.C_memset_#t~loopctr49| 1), 7991#(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))), 8023#(= |#Ultimate.C_memset_#t~loopctr49| 2), 8024#(= |#Ultimate.C_memset_#t~loopctr49| 3), 8025#(or (and (<= |#Ultimate.C_memset_#amount| |#Ultimate.C_memset_#t~loopctr49|) (<= |#Ultimate.C_memset_#amount| 4)) (and (< 4 |#Ultimate.C_memset_#amount|) (< |#Ultimate.C_memset_#t~loopctr49| |#Ultimate.C_memset_#amount|))), 8026#(<= |#Ultimate.C_memset_#amount| 4)] [2018-02-02 10:54:11,209 INFO L134 CoverageAnalysis]: Checked inductivity of 500 backedges. 30 proven. 162 refuted. 0 times theorem prover too weak. 308 trivial. 0 not checked. [2018-02-02 10:54:11,209 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 10:54:11,209 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 10:54:11,210 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2018-02-02 10:54:11,210 INFO L87 Difference]: Start difference. First operand 407 states and 524 transitions. Second operand 15 states. [2018-02-02 10:54:12,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:54:12,401 INFO L93 Difference]: Finished difference Result 474 states and 575 transitions. [2018-02-02 10:54:12,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-02 10:54:12,401 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 149 [2018-02-02 10:54:12,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:54:12,402 INFO L225 Difference]: With dead ends: 474 [2018-02-02 10:54:12,402 INFO L226 Difference]: Without dead ends: 467 [2018-02-02 10:54:12,403 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=123, Invalid=747, Unknown=0, NotChecked=0, Total=870 [2018-02-02 10:54:12,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2018-02-02 10:54:12,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 408. [2018-02-02 10:54:12,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2018-02-02 10:54:12,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 526 transitions. [2018-02-02 10:54:12,409 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 526 transitions. Word has length 149 [2018-02-02 10:54:12,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:54:12,409 INFO L432 AbstractCegarLoop]: Abstraction has 408 states and 526 transitions. [2018-02-02 10:54:12,409 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 10:54:12,409 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 526 transitions. [2018-02-02 10:54:12,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-02-02 10:54:12,411 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:54:12,411 INFO L351 BasicCegarLoop]: trace histogram [25, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:54:12,411 INFO L371 AbstractCegarLoop]: === Iteration 10 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-02 10:54:12,411 INFO L82 PathProgramCache]: Analyzing trace with hash -114763302, 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-02 10:54:12,416 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:54:12,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:12,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:12,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:12,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:12,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:12,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:12,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:12,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:12,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:12,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:12,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:12,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:12,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:12,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:12,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:12,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:12,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:12,758 INFO L134 CoverageAnalysis]: Checked inductivity of 635 backedges. 30 proven. 211 refuted. 0 times theorem prover too weak. 394 trivial. 0 not checked. [2018-02-02 10:54:12,774 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:54:12,774 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-02 10:54:12,774 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:54:12,775 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2018-02-02 10:54:12,775 INFO L182 omatonBuilderFactory]: Interpolants [9162#(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)|)), 9194#(not (= (mod (* (mod |calloc_model_#in~nmemb| 4294967296) (mod |calloc_model_#in~size| 4294967296)) 4294967296) 8)), 9163#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 9195#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 9164#(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))), 9196#(= 0 |#Ultimate.C_memset_#t~loopctr49|), 9197#(= 1 |#Ultimate.C_memset_#t~loopctr49|), 9198#(= |#Ultimate.C_memset_#t~loopctr49| 2), 9199#(<= |#Ultimate.C_memset_#t~loopctr49| 3), 9040#true, 9200#(<= |#Ultimate.C_memset_#t~loopctr49| 4), 9041#false, 9201#(<= |#Ultimate.C_memset_#t~loopctr49| 5), 9202#(not (= 8 |#Ultimate.C_memset_#amount|)), 9182#(not (= 8 |zalloc_or_die_#in~size|)), 9183#(= (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-02 10:54:12,775 INFO L134 CoverageAnalysis]: Checked inductivity of 635 backedges. 30 proven. 211 refuted. 0 times theorem prover too weak. 394 trivial. 0 not checked. [2018-02-02 10:54:12,775 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 10:54:12,775 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 10:54:12,776 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2018-02-02 10:54:12,776 INFO L87 Difference]: Start difference. First operand 408 states and 526 transitions. Second operand 16 states. [2018-02-02 10:54:13,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:54:13,992 INFO L93 Difference]: Finished difference Result 477 states and 579 transitions. [2018-02-02 10:54:13,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-02 10:54:13,992 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 154 [2018-02-02 10:54:13,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:54:13,994 INFO L225 Difference]: With dead ends: 477 [2018-02-02 10:54:13,994 INFO L226 Difference]: Without dead ends: 470 [2018-02-02 10:54:13,995 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 34 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-02 10:54:13,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2018-02-02 10:54:14,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 409. [2018-02-02 10:54:14,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 409 states. [2018-02-02 10:54:14,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 528 transitions. [2018-02-02 10:54:14,004 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 528 transitions. Word has length 154 [2018-02-02 10:54:14,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:54:14,004 INFO L432 AbstractCegarLoop]: Abstraction has 409 states and 528 transitions. [2018-02-02 10:54:14,004 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 10:54:14,004 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 528 transitions. [2018-02-02 10:54:14,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-02-02 10:54:14,006 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:54:14,006 INFO L351 BasicCegarLoop]: trace histogram [30, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:54:14,006 INFO L371 AbstractCegarLoop]: === Iteration 11 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-02 10:54:14,007 INFO L82 PathProgramCache]: Analyzing trace with hash 1808131737, 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-02 10:54:14,010 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:54:14,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:14,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:14,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:14,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:14,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:14,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:14,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:14,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:14,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:14,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:14,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:14,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:14,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:14,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:14,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:14,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:14,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:14,402 INFO L134 CoverageAnalysis]: Checked inductivity of 795 backedges. 30 proven. 269 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2018-02-02 10:54:14,431 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:54:14,431 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-02 10:54:14,431 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:54:14,432 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2018-02-02 10:54:14,432 INFO L182 omatonBuilderFactory]: Interpolants [10400#(not (= 8 |#Ultimate.C_memset_#amount|)), 10378#(not (= 8 |zalloc_or_die_#in~size|)), 10379#(= (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)), 10357#(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)|)), 10230#true, 10358#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 10231#false, 10359#(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))), 10391#(not (= (mod (* (mod |calloc_model_#in~nmemb| 4294967296) (mod |calloc_model_#in~size| 4294967296)) 4294967296) 8)), 10392#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 10393#(= 0 |#Ultimate.C_memset_#t~loopctr49|), 10394#(= 1 |#Ultimate.C_memset_#t~loopctr49|), 10395#(= |#Ultimate.C_memset_#t~loopctr49| 2), 10396#(= |#Ultimate.C_memset_#t~loopctr49| 3), 10397#(<= |#Ultimate.C_memset_#t~loopctr49| 4), 10398#(<= |#Ultimate.C_memset_#t~loopctr49| 5), 10399#(<= |#Ultimate.C_memset_#t~loopctr49| 6)] [2018-02-02 10:54:14,432 INFO L134 CoverageAnalysis]: Checked inductivity of 795 backedges. 30 proven. 269 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2018-02-02 10:54:14,432 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 10:54:14,433 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 10:54:14,433 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2018-02-02 10:54:14,433 INFO L87 Difference]: Start difference. First operand 409 states and 528 transitions. Second operand 17 states. [2018-02-02 10:54:15,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:54:15,762 INFO L93 Difference]: Finished difference Result 480 states and 583 transitions. [2018-02-02 10:54:15,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-02 10:54:15,762 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 159 [2018-02-02 10:54:15,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:54:15,765 INFO L225 Difference]: With dead ends: 480 [2018-02-02 10:54:15,765 INFO L226 Difference]: Without dead ends: 473 [2018-02-02 10:54:15,765 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=175, Invalid=947, Unknown=0, NotChecked=0, Total=1122 [2018-02-02 10:54:15,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2018-02-02 10:54:15,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 410. [2018-02-02 10:54:15,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-02-02 10:54:15,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 530 transitions. [2018-02-02 10:54:15,776 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 530 transitions. Word has length 159 [2018-02-02 10:54:15,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:54:15,776 INFO L432 AbstractCegarLoop]: Abstraction has 410 states and 530 transitions. [2018-02-02 10:54:15,776 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 10:54:15,776 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 530 transitions. [2018-02-02 10:54:15,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-02-02 10:54:15,778 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:54:15,778 INFO L351 BasicCegarLoop]: trace histogram [35, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:54:15,778 INFO L371 AbstractCegarLoop]: === Iteration 12 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-02 10:54:15,778 INFO L82 PathProgramCache]: Analyzing trace with hash -194626630, 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-02 10:54:15,789 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:54:15,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:15,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:15,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:15,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:15,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:16,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:16,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:16,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:16,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:16,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:16,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:16,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:16,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:16,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:16,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:16,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:16,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:16,105 INFO L134 CoverageAnalysis]: Checked inductivity of 980 backedges. 30 proven. 336 refuted. 0 times theorem prover too weak. 614 trivial. 0 not checked. [2018-02-02 10:54:16,121 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:54:16,121 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-02 10:54:16,121 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:54:16,121 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2018-02-02 10:54:16,122 INFO L182 omatonBuilderFactory]: Interpolants [11616#(= 4 |#Ultimate.C_memset_#t~loopctr49|), 11617#(<= |#Ultimate.C_memset_#t~loopctr49| 5), 11618#(<= |#Ultimate.C_memset_#t~loopctr49| 6), 11619#(<= |#Ultimate.C_memset_#t~loopctr49| 7), 11620#(not (= 8 |#Ultimate.C_memset_#amount|)), 11596#(not (= 8 |zalloc_or_die_#in~size|)), 11597#(= (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)), 11442#true, 11443#false, 11574#(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)|)), 11575#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 11576#(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))), 11610#(not (= (mod (* (mod |calloc_model_#in~nmemb| 4294967296) (mod |calloc_model_#in~size| 4294967296)) 4294967296) 8)), 11611#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 11612#(= 0 |#Ultimate.C_memset_#t~loopctr49|), 11613#(= 1 |#Ultimate.C_memset_#t~loopctr49|), 11614#(= |#Ultimate.C_memset_#t~loopctr49| 2), 11615#(= |#Ultimate.C_memset_#t~loopctr49| 3)] [2018-02-02 10:54:16,122 INFO L134 CoverageAnalysis]: Checked inductivity of 980 backedges. 30 proven. 336 refuted. 0 times theorem prover too weak. 614 trivial. 0 not checked. [2018-02-02 10:54:16,122 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 10:54:16,122 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 10:54:16,122 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2018-02-02 10:54:16,122 INFO L87 Difference]: Start difference. First operand 410 states and 530 transitions. Second operand 18 states. [2018-02-02 10:54:17,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:54:17,304 INFO L93 Difference]: Finished difference Result 483 states and 587 transitions. [2018-02-02 10:54:17,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-02 10:54:17,304 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 164 [2018-02-02 10:54:17,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:54:17,305 INFO L225 Difference]: With dead ends: 483 [2018-02-02 10:54:17,306 INFO L226 Difference]: Without dead ends: 476 [2018-02-02 10:54:17,306 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=1070, Unknown=0, NotChecked=0, Total=1260 [2018-02-02 10:54:17,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2018-02-02 10:54:17,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 411. [2018-02-02 10:54:17,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2018-02-02 10:54:17,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 532 transitions. [2018-02-02 10:54:17,311 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 532 transitions. Word has length 164 [2018-02-02 10:54:17,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:54:17,311 INFO L432 AbstractCegarLoop]: Abstraction has 411 states and 532 transitions. [2018-02-02 10:54:17,311 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 10:54:17,311 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 532 transitions. [2018-02-02 10:54:17,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-02-02 10:54:17,313 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:54:17,313 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-02 10:54:17,313 INFO L371 AbstractCegarLoop]: === Iteration 13 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-02 10:54:17,313 INFO L82 PathProgramCache]: Analyzing trace with hash 1622825145, 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-02 10:54:17,315 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:54:17,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:17,365 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-02 10:54:17,377 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-02 10:54:17,377 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-02 10:54:17,378 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-02 10:54:17,378 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-02 10:54:17,384 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-02 10:54:17,384 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-02 10:54:17,384 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-02 10:54:17,384 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-02 10:54:17,387 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-02-02 10:54:17,388 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 10:54:17,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:17,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:17,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:17,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:17,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:17,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:17,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:17,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:17,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:17,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:17,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:17,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:17,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:17,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:17,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:17,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:17,572 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 20 proven. 10 refuted. 0 times theorem prover too weak. 1160 trivial. 0 not checked. [2018-02-02 10:54:17,588 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:54:17,588 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-02 10:54:17,588 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:54:17,588 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2018-02-02 10:54:17,589 INFO L182 omatonBuilderFactory]: Interpolants [12816#(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)), 12817#(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|)), 12818#(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)))), 12819#(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)|)), 12676#true, 12820#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 12677#false, 12854#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 12813#(= |zalloc_or_die_#in~size| 119), 12814#(= 119 zalloc_or_die_~size), 12815#(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))] [2018-02-02 10:54:17,589 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 20 proven. 10 refuted. 0 times theorem prover too weak. 1160 trivial. 0 not checked. [2018-02-02 10:54:17,589 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 10:54:17,589 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 10:54:17,589 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=86, Unknown=2, NotChecked=0, Total=110 [2018-02-02 10:54:17,589 INFO L87 Difference]: Start difference. First operand 411 states and 532 transitions. Second operand 11 states. [2018-02-02 10:54:18,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:54:18,557 INFO L93 Difference]: Finished difference Result 460 states and 564 transitions. [2018-02-02 10:54:18,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 10:54:18,558 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 169 [2018-02-02 10:54:18,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:54:18,560 INFO L225 Difference]: With dead ends: 460 [2018-02-02 10:54:18,560 INFO L226 Difference]: Without dead ends: 460 [2018-02-02 10:54:18,560 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=288, Unknown=15, NotChecked=0, Total=380 [2018-02-02 10:54:18,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2018-02-02 10:54:18,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 410. [2018-02-02 10:54:18,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-02-02 10:54:18,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 531 transitions. [2018-02-02 10:54:18,569 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 531 transitions. Word has length 169 [2018-02-02 10:54:18,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:54:18,569 INFO L432 AbstractCegarLoop]: Abstraction has 410 states and 531 transitions. [2018-02-02 10:54:18,569 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 10:54:18,569 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 531 transitions. [2018-02-02 10:54:18,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-02-02 10:54:18,570 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:54:18,570 INFO L351 BasicCegarLoop]: trace histogram [40, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:54:18,570 INFO L371 AbstractCegarLoop]: === Iteration 14 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-02 10:54:18,571 INFO L82 PathProgramCache]: Analyzing trace with hash -1025496070, 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-02 10:54:18,574 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:54:18,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:18,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:18,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:18,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:18,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:18,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:18,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:18,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:18,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:18,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:18,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:18,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:18,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:18,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:18,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:18,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:18,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:18,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:18,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:18,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:18,810 INFO L134 CoverageAnalysis]: Checked inductivity of 1290 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2018-02-02 10:54:18,826 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:54:18,826 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-02 10:54:18,826 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:54:18,827 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2018-02-02 10:54:18,827 INFO L182 omatonBuilderFactory]: Interpolants [14065#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 13875#true, 14211#(not (= 119 |zalloc_or_die_#in~size|)), 13876#false, 14212#(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))), 14198#(= |zalloc_or_die_#in~size| zalloc_or_die_~size), 14218#(or (not (= (mod |calloc_model_#in~nmemb| 4294967296) 1)) (not (= |calloc_model_#in~size| 119))), 14219#(= 0 |#Ultimate.C_memset_#t~loopctr49|), 14220#(<= |#Ultimate.C_memset_#amount| 0), 14030#(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)|)), 14031#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))] [2018-02-02 10:54:18,827 INFO L134 CoverageAnalysis]: Checked inductivity of 1290 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2018-02-02 10:54:18,827 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 10:54:18,827 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 10:54:18,827 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-02-02 10:54:18,827 INFO L87 Difference]: Start difference. First operand 410 states and 531 transitions. Second operand 11 states. [2018-02-02 10:54:19,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:54:19,573 INFO L93 Difference]: Finished difference Result 460 states and 563 transitions. [2018-02-02 10:54:19,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 10:54:19,573 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 182 [2018-02-02 10:54:19,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:54:19,574 INFO L225 Difference]: With dead ends: 460 [2018-02-02 10:54:19,575 INFO L226 Difference]: Without dead ends: 451 [2018-02-02 10:54:19,575 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-02 10:54:19,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2018-02-02 10:54:19,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 410. [2018-02-02 10:54:19,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-02-02 10:54:19,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 530 transitions. [2018-02-02 10:54:19,579 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 530 transitions. Word has length 182 [2018-02-02 10:54:19,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:54:19,580 INFO L432 AbstractCegarLoop]: Abstraction has 410 states and 530 transitions. [2018-02-02 10:54:19,580 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 10:54:19,580 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 530 transitions. [2018-02-02 10:54:19,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-02-02 10:54:19,580 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:54:19,580 INFO L351 BasicCegarLoop]: trace histogram [41, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:54:19,581 INFO L371 AbstractCegarLoop]: === Iteration 15 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-02 10:54:19,581 INFO L82 PathProgramCache]: Analyzing trace with hash -1838740207, 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-02 10:54:19,585 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:54:19,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:19,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:19,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:19,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:19,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:19,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:19,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:19,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:19,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:19,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:19,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:19,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:19,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:19,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:19,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:19,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:19,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:19,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:19,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:19,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:19,924 INFO L134 CoverageAnalysis]: Checked inductivity of 1336 backedges. 155 proven. 1 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2018-02-02 10:54:19,940 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:54:19,940 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-02 10:54:19,940 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:54:19,940 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2018-02-02 10:54:19,941 INFO L182 omatonBuilderFactory]: Interpolants [15456#(= (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)), 15441#(= zalloc_or_die_~size |zalloc_or_die_#in~size|), 15463#(not (= (mod (* (mod |calloc_model_#in~nmemb| 4294967296) (mod |calloc_model_#in~size| 4294967296)) 4294967296) 119)), 15464#(= 0 |#Ultimate.C_memset_#t~loopctr49|), 15273#(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)|)), 15465#(or (and (<= |#Ultimate.C_memset_#amount| |#Ultimate.C_memset_#t~loopctr49|) (<= |#Ultimate.C_memset_#amount| 1)) (and (< |#Ultimate.C_memset_#t~loopctr49| |#Ultimate.C_memset_#amount|) (< 1 |#Ultimate.C_memset_#amount|))), 15274#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 15466#(<= |#Ultimate.C_memset_#amount| 1), 15308#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 15117#true, 15118#false, 15455#(not (= |zalloc_or_die_#in~size| 119))] [2018-02-02 10:54:19,941 INFO L134 CoverageAnalysis]: Checked inductivity of 1336 backedges. 155 proven. 1 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2018-02-02 10:54:19,941 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 10:54:19,941 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 10:54:19,941 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-02-02 10:54:19,941 INFO L87 Difference]: Start difference. First operand 410 states and 530 transitions. Second operand 12 states. [2018-02-02 10:54:20,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:54:20,848 INFO L93 Difference]: Finished difference Result 460 states and 562 transitions. [2018-02-02 10:54:20,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 10:54:20,849 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 183 [2018-02-02 10:54:20,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:54:20,850 INFO L225 Difference]: With dead ends: 460 [2018-02-02 10:54:20,850 INFO L226 Difference]: Without dead ends: 451 [2018-02-02 10:54:20,850 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=345, Unknown=0, NotChecked=0, Total=420 [2018-02-02 10:54:20,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2018-02-02 10:54:20,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 410. [2018-02-02 10:54:20,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-02-02 10:54:20,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 529 transitions. [2018-02-02 10:54:20,857 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 529 transitions. Word has length 183 [2018-02-02 10:54:20,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:54:20,857 INFO L432 AbstractCegarLoop]: Abstraction has 410 states and 529 transitions. [2018-02-02 10:54:20,857 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 10:54:20,857 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 529 transitions. [2018-02-02 10:54:20,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-02-02 10:54:20,858 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:54:20,858 INFO L351 BasicCegarLoop]: trace histogram [42, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:54:20,859 INFO L371 AbstractCegarLoop]: === Iteration 16 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-02 10:54:20,859 INFO L82 PathProgramCache]: Analyzing trace with hash -1279504678, 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-02 10:54:20,868 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:54:20,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:21,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:21,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:21,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:21,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:21,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:21,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:21,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:21,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:21,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:21,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:21,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:21,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:21,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:21,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:21,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:21,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:21,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:21,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:21,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:21,321 INFO L134 CoverageAnalysis]: Checked inductivity of 1383 backedges. 200 proven. 3 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2018-02-02 10:54:21,337 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:54:21,337 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-02 10:54:21,337 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:54:21,337 INFO L134 CoverageAnalysis]: Checked inductivity of 285 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2018-02-02 10:54:21,338 INFO L182 omatonBuilderFactory]: Interpolants [16512#(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)|)), 16704#(or (not (= (mod |calloc_model_#in~nmemb| 4294967296) 1)) (not (= |calloc_model_#in~size| 119))), 16513#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 16705#(= 0 |#Ultimate.C_memset_#t~loopctr49|), 16706#(= 1 |#Ultimate.C_memset_#t~loopctr49|), 16355#true, 16547#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 16707#(and (< 1 |#Ultimate.C_memset_#amount|) (or (and (< 2 |#Ultimate.C_memset_#amount|) (< |#Ultimate.C_memset_#t~loopctr49| |#Ultimate.C_memset_#amount|)) (and (<= |#Ultimate.C_memset_#amount| |#Ultimate.C_memset_#t~loopctr49|) (<= |#Ultimate.C_memset_#amount| 2)))), 16356#false, 16708#(= |#Ultimate.C_memset_#amount| 2), 16680#(= zalloc_or_die_~size |zalloc_or_die_#in~size|), 16695#(not (= |zalloc_or_die_#in~size| 119)), 16696#(and (= calloc_model_~size |calloc_model_#in~size|) (= (mod (* (mod |calloc_model_#in~nmemb| 4294967296) (mod calloc_model_~size 4294967296)) 4294967296) (mod (* (mod calloc_model_~nmemb 4294967296) (mod calloc_model_~size 4294967296)) 4294967296)))] [2018-02-02 10:54:21,338 INFO L134 CoverageAnalysis]: Checked inductivity of 1383 backedges. 200 proven. 3 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2018-02-02 10:54:21,338 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 10:54:21,338 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 10:54:21,338 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2018-02-02 10:54:21,338 INFO L87 Difference]: Start difference. First operand 410 states and 529 transitions. Second operand 13 states. [2018-02-02 10:54:22,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:54:22,255 INFO L93 Difference]: Finished difference Result 460 states and 561 transitions. [2018-02-02 10:54:22,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-02 10:54:22,259 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 184 [2018-02-02 10:54:22,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:54:22,260 INFO L225 Difference]: With dead ends: 460 [2018-02-02 10:54:22,260 INFO L226 Difference]: Without dead ends: 451 [2018-02-02 10:54:22,260 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=498, Unknown=0, NotChecked=0, Total=600 [2018-02-02 10:54:22,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2018-02-02 10:54:22,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 410. [2018-02-02 10:54:22,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-02-02 10:54:22,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 528 transitions. [2018-02-02 10:54:22,268 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 528 transitions. Word has length 184 [2018-02-02 10:54:22,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:54:22,268 INFO L432 AbstractCegarLoop]: Abstraction has 410 states and 528 transitions. [2018-02-02 10:54:22,268 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 10:54:22,269 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 528 transitions. [2018-02-02 10:54:22,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-02-02 10:54:22,269 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:54:22,270 INFO L351 BasicCegarLoop]: trace histogram [43, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:54:22,270 INFO L371 AbstractCegarLoop]: === Iteration 17 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-02 10:54:22,270 INFO L82 PathProgramCache]: Analyzing trace with hash -1123072463, 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-02 10:54:22,278 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:54:22,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:22,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:22,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:22,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:22,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:22,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:22,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:22,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:22,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:22,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:22,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:22,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:22,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:22,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:22,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:22,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:22,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:22,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:22,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:22,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:22,585 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 245 proven. 6 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2018-02-02 10:54:22,601 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:54:22,617 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-02 10:54:22,617 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:54:22,618 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2018-02-02 10:54:22,618 INFO L182 omatonBuilderFactory]: Interpolants [17761#(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)|)), 17762#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 17603#true, 17955#(not (= (mod (* (mod |calloc_model_#in~nmemb| 4294967296) (mod |calloc_model_#in~size| 4294967296)) 4294967296) 119)), 17604#false, 17796#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 17956#(= 0 |#Ultimate.C_memset_#t~loopctr49|), 17957#(<= |#Ultimate.C_memset_#t~loopctr49| 1), 17958#(<= |#Ultimate.C_memset_#t~loopctr49| 2), 17959#(<= |#Ultimate.C_memset_#t~loopctr49| 3), 17960#(not (= |#Ultimate.C_memset_#amount| 119)), 17929#(= zalloc_or_die_~size |zalloc_or_die_#in~size|), 17945#(not (= |zalloc_or_die_#in~size| 119)), 17946#(= (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-02 10:54:22,618 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 245 proven. 6 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2018-02-02 10:54:22,618 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 10:54:22,618 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 10:54:22,618 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2018-02-02 10:54:22,619 INFO L87 Difference]: Start difference. First operand 410 states and 528 transitions. Second operand 14 states. [2018-02-02 10:54:23,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:54:23,666 INFO L93 Difference]: Finished difference Result 460 states and 560 transitions. [2018-02-02 10:54:23,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 10:54:23,666 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 185 [2018-02-02 10:54:23,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:54:23,667 INFO L225 Difference]: With dead ends: 460 [2018-02-02 10:54:23,668 INFO L226 Difference]: Without dead ends: 451 [2018-02-02 10:54:23,668 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=418, Unknown=0, NotChecked=0, Total=506 [2018-02-02 10:54:23,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2018-02-02 10:54:23,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 410. [2018-02-02 10:54:23,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-02-02 10:54:23,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 527 transitions. [2018-02-02 10:54:23,675 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 527 transitions. Word has length 185 [2018-02-02 10:54:23,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:54:23,675 INFO L432 AbstractCegarLoop]: Abstraction has 410 states and 527 transitions. [2018-02-02 10:54:23,675 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 10:54:23,675 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 527 transitions. [2018-02-02 10:54:23,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-02-02 10:54:23,676 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:54:23,676 INFO L351 BasicCegarLoop]: trace histogram [44, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:54:23,676 INFO L371 AbstractCegarLoop]: === Iteration 18 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-02 10:54:23,676 INFO L82 PathProgramCache]: Analyzing trace with hash -568641094, 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-02 10:54:23,680 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:54:23,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:23,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:23,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:23,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:23,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:23,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:23,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:23,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:23,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:23,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:23,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:23,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:23,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:23,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:23,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:23,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:23,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:23,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:23,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:23,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:23,947 INFO L134 CoverageAnalysis]: Checked inductivity of 1480 backedges. 290 proven. 10 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2018-02-02 10:54:23,963 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:54:23,963 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-02 10:54:23,963 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:54:23,964 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2018-02-02 10:54:23,964 INFO L182 omatonBuilderFactory]: Interpolants [19008#(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)|)), 18849#true, 19009#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 18850#false, 19043#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 19204#(not (= (mod (* (mod |calloc_model_#in~nmemb| 4294967296) (mod |calloc_model_#in~size| 4294967296)) 4294967296) 119)), 19205#(= 0 |#Ultimate.C_memset_#t~loopctr49|), 19206#(= 1 |#Ultimate.C_memset_#t~loopctr49|), 19207#(<= |#Ultimate.C_memset_#t~loopctr49| 2), 19176#(= zalloc_or_die_~size |zalloc_or_die_#in~size|), 19208#(<= |#Ultimate.C_memset_#t~loopctr49| 3), 19209#(<= |#Ultimate.C_memset_#t~loopctr49| 4), 19210#(not (= |#Ultimate.C_memset_#amount| 119)), 19193#(not (= |zalloc_or_die_#in~size| 119)), 19194#(= (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-02 10:54:23,964 INFO L134 CoverageAnalysis]: Checked inductivity of 1480 backedges. 290 proven. 10 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2018-02-02 10:54:23,964 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 10:54:23,964 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 10:54:23,964 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2018-02-02 10:54:23,964 INFO L87 Difference]: Start difference. First operand 410 states and 527 transitions. Second operand 15 states. [2018-02-02 10:54:24,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:54:24,915 INFO L93 Difference]: Finished difference Result 460 states and 559 transitions. [2018-02-02 10:54:24,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 10:54:24,915 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 186 [2018-02-02 10:54:24,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:54:24,917 INFO L225 Difference]: With dead ends: 460 [2018-02-02 10:54:24,917 INFO L226 Difference]: Without dead ends: 451 [2018-02-02 10:54:24,917 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=459, Unknown=0, NotChecked=0, Total=552 [2018-02-02 10:54:24,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2018-02-02 10:54:24,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 410. [2018-02-02 10:54:24,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-02-02 10:54:24,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 526 transitions. [2018-02-02 10:54:24,924 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 526 transitions. Word has length 186 [2018-02-02 10:54:24,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:54:24,925 INFO L432 AbstractCegarLoop]: Abstraction has 410 states and 526 transitions. [2018-02-02 10:54:24,925 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 10:54:24,925 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 526 transitions. [2018-02-02 10:54:24,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-02-02 10:54:24,925 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:54:24,926 INFO L351 BasicCegarLoop]: trace histogram [45, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:54:24,926 INFO L371 AbstractCegarLoop]: === Iteration 19 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-02 10:54:24,926 INFO L82 PathProgramCache]: Analyzing trace with hash -561137839, 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-02 10:54:24,929 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:54:24,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:24,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:25,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:25,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:25,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:25,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:25,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:25,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:25,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:25,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:25,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:25,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:25,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:25,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:25,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:25,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:25,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:25,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:25,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:25,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:25,218 INFO L134 CoverageAnalysis]: Checked inductivity of 1530 backedges. 335 proven. 15 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2018-02-02 10:54:25,233 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:54:25,233 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-02 10:54:25,234 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:54:25,234 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2018-02-02 10:54:25,234 INFO L182 omatonBuilderFactory]: Interpolants [20099#true, 20259#(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)|)), 20100#false, 20260#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 20294#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 20457#(not (= (mod (* (mod |calloc_model_#in~nmemb| 4294967296) (mod |calloc_model_#in~size| 4294967296)) 4294967296) 119)), 20458#(= 0 |#Ultimate.C_memset_#t~loopctr49|), 20427#(= zalloc_or_die_~size |zalloc_or_die_#in~size|), 20459#(= 1 |#Ultimate.C_memset_#t~loopctr49|), 20460#(= |#Ultimate.C_memset_#t~loopctr49| 2), 20461#(= |#Ultimate.C_memset_#t~loopctr49| 3), 20462#(= 4 |#Ultimate.C_memset_#t~loopctr49|), 20463#(or (and (<= |#Ultimate.C_memset_#amount| |#Ultimate.C_memset_#t~loopctr49|) (<= |#Ultimate.C_memset_#amount| 5)) (and (< |#Ultimate.C_memset_#t~loopctr49| |#Ultimate.C_memset_#amount|) (< 5 |#Ultimate.C_memset_#amount|))), 20464#(<= |#Ultimate.C_memset_#amount| 5), 20445#(not (= |zalloc_or_die_#in~size| 119)), 20446#(= (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-02 10:54:25,234 INFO L134 CoverageAnalysis]: Checked inductivity of 1530 backedges. 335 proven. 15 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2018-02-02 10:54:25,235 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 10:54:25,235 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 10:54:25,235 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2018-02-02 10:54:25,235 INFO L87 Difference]: Start difference. First operand 410 states and 526 transitions. Second operand 16 states. [2018-02-02 10:54:26,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:54:26,265 INFO L93 Difference]: Finished difference Result 460 states and 558 transitions. [2018-02-02 10:54:26,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-02 10:54:26,265 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 187 [2018-02-02 10:54:26,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:54:26,267 INFO L225 Difference]: With dead ends: 460 [2018-02-02 10:54:26,267 INFO L226 Difference]: Without dead ends: 451 [2018-02-02 10:54:26,267 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=517, Unknown=0, NotChecked=0, Total=600 [2018-02-02 10:54:26,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2018-02-02 10:54:26,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 410. [2018-02-02 10:54:26,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-02-02 10:54:26,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 525 transitions. [2018-02-02 10:54:26,271 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 525 transitions. Word has length 187 [2018-02-02 10:54:26,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:54:26,272 INFO L432 AbstractCegarLoop]: Abstraction has 410 states and 525 transitions. [2018-02-02 10:54:26,272 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 10:54:26,272 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 525 transitions. [2018-02-02 10:54:26,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-02-02 10:54:26,272 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:54:26,272 INFO L351 BasicCegarLoop]: trace histogram [46, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:54:26,273 INFO L371 AbstractCegarLoop]: === Iteration 20 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-02 10:54:26,273 INFO L82 PathProgramCache]: Analyzing trace with hash -328536934, 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-02 10:54:26,275 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:54:26,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:26,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:26,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:26,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:26,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:26,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:26,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:26,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:26,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:26,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:26,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:26,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:26,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:26,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:26,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:26,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:26,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:26,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:26,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:26,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:26,579 INFO L134 CoverageAnalysis]: Checked inductivity of 1581 backedges. 380 proven. 21 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2018-02-02 10:54:26,596 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:54:26,596 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-02 10:54:26,596 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:54:26,597 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2018-02-02 10:54:26,597 INFO L182 omatonBuilderFactory]: Interpolants [21701#(not (= |zalloc_or_die_#in~size| 119)), 21702#(= (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)), 21353#true, 21354#false, 21514#(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)|)), 21515#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 21549#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 21682#(= zalloc_or_die_~size |zalloc_or_die_#in~size|), 21714#(not (= (mod (* (mod |calloc_model_#in~nmemb| 4294967296) (mod |calloc_model_#in~size| 4294967296)) 4294967296) 119)), 21715#(= 0 |#Ultimate.C_memset_#t~loopctr49|), 21716#(= 1 |#Ultimate.C_memset_#t~loopctr49|), 21717#(= |#Ultimate.C_memset_#t~loopctr49| 2), 21718#(= |#Ultimate.C_memset_#t~loopctr49| 3), 21719#(<= |#Ultimate.C_memset_#t~loopctr49| 4), 21720#(<= |#Ultimate.C_memset_#t~loopctr49| 5), 21721#(<= |#Ultimate.C_memset_#t~loopctr49| 6), 21722#(not (= |#Ultimate.C_memset_#amount| 119))] [2018-02-02 10:54:26,597 INFO L134 CoverageAnalysis]: Checked inductivity of 1581 backedges. 380 proven. 21 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2018-02-02 10:54:26,597 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 10:54:26,597 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 10:54:26,597 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2018-02-02 10:54:26,597 INFO L87 Difference]: Start difference. First operand 410 states and 525 transitions. Second operand 17 states. [2018-02-02 10:54:27,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:54:27,635 INFO L93 Difference]: Finished difference Result 460 states and 557 transitions. [2018-02-02 10:54:27,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 10:54:27,636 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 188 [2018-02-02 10:54:27,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:54:27,637 INFO L225 Difference]: With dead ends: 460 [2018-02-02 10:54:27,637 INFO L226 Difference]: Without dead ends: 451 [2018-02-02 10:54:27,637 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=547, Unknown=0, NotChecked=0, Total=650 [2018-02-02 10:54:27,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2018-02-02 10:54:27,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 410. [2018-02-02 10:54:27,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-02-02 10:54:27,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 524 transitions. [2018-02-02 10:54:27,641 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 524 transitions. Word has length 188 [2018-02-02 10:54:27,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:54:27,641 INFO L432 AbstractCegarLoop]: Abstraction has 410 states and 524 transitions. [2018-02-02 10:54:27,641 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 10:54:27,641 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 524 transitions. [2018-02-02 10:54:27,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-02-02 10:54:27,642 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:54:27,642 INFO L351 BasicCegarLoop]: trace histogram [47, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:54:27,642 INFO L371 AbstractCegarLoop]: === Iteration 21 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-02 10:54:27,642 INFO L82 PathProgramCache]: Analyzing trace with hash -1707843471, 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-02 10:54:27,645 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:54:27,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:27,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:27,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:27,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:27,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:27,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:27,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:27,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:27,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:27,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:27,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:27,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:27,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:27,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:27,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:27,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:27,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:27,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:27,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:27,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:27,941 INFO L134 CoverageAnalysis]: Checked inductivity of 1633 backedges. 425 proven. 28 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2018-02-02 10:54:27,956 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:54:27,957 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-02 10:54:27,957 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:54:27,957 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2018-02-02 10:54:27,957 INFO L182 omatonBuilderFactory]: Interpolants [22976#(= 0 |#Ultimate.C_memset_#t~loopctr49|), 22977#(= 1 |#Ultimate.C_memset_#t~loopctr49|), 22978#(= |#Ultimate.C_memset_#t~loopctr49| 2), 22979#(<= |#Ultimate.C_memset_#t~loopctr49| 3), 22980#(<= |#Ultimate.C_memset_#t~loopctr49| 4), 22981#(<= |#Ultimate.C_memset_#t~loopctr49| 5), 22982#(<= |#Ultimate.C_memset_#t~loopctr49| 6), 22983#(<= |#Ultimate.C_memset_#t~loopctr49| 7), 22984#(not (= |#Ultimate.C_memset_#amount| 119)), 22961#(not (= |zalloc_or_die_#in~size| 119)), 22962#(= (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)), 22611#true, 22612#false, 22773#(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)|)), 22774#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 22808#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 22941#(= zalloc_or_die_~size |zalloc_or_die_#in~size|), 22975#(not (= (mod (* (mod |calloc_model_#in~nmemb| 4294967296) (mod |calloc_model_#in~size| 4294967296)) 4294967296) 119))] [2018-02-02 10:54:27,958 INFO L134 CoverageAnalysis]: Checked inductivity of 1633 backedges. 425 proven. 28 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2018-02-02 10:54:27,958 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 10:54:27,958 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 10:54:27,958 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2018-02-02 10:54:27,958 INFO L87 Difference]: Start difference. First operand 410 states and 524 transitions. Second operand 18 states. [2018-02-02 10:54:29,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:54:29,061 INFO L93 Difference]: Finished difference Result 458 states and 554 transitions. [2018-02-02 10:54:29,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-02 10:54:29,062 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 189 [2018-02-02 10:54:29,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:54:29,063 INFO L225 Difference]: With dead ends: 458 [2018-02-02 10:54:29,063 INFO L226 Difference]: Without dead ends: 449 [2018-02-02 10:54:29,063 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=117, Invalid=585, Unknown=0, NotChecked=0, Total=702 [2018-02-02 10:54:29,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2018-02-02 10:54:29,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 408. [2018-02-02 10:54:29,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2018-02-02 10:54:29,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 521 transitions. [2018-02-02 10:54:29,067 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 521 transitions. Word has length 189 [2018-02-02 10:54:29,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:54:29,067 INFO L432 AbstractCegarLoop]: Abstraction has 408 states and 521 transitions. [2018-02-02 10:54:29,067 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 10:54:29,067 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 521 transitions. [2018-02-02 10:54:29,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-02-02 10:54:29,068 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:54:29,068 INFO L351 BasicCegarLoop]: trace histogram [48, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:54:29,068 INFO L371 AbstractCegarLoop]: === Iteration 22 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-02 10:54:29,068 INFO L82 PathProgramCache]: Analyzing trace with hash -1516673158, 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-02 10:54:29,071 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:54:29,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:29,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:29,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:29,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:29,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:29,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:29,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:29,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:29,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:29,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:29,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:29,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:29,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:29,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:29,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:29,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:29,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:29,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:29,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:29,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:29,384 INFO L134 CoverageAnalysis]: Checked inductivity of 1686 backedges. 470 proven. 36 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2018-02-02 10:54:29,400 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:54:29,400 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-02 10:54:29,400 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:54:29,401 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2018-02-02 10:54:29,401 INFO L182 omatonBuilderFactory]: Interpolants [24032#(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)|)), 24033#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 24067#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 24200#(= zalloc_or_die_~size |zalloc_or_die_#in~size|), 24236#(not (= (mod (* (mod |calloc_model_#in~nmemb| 4294967296) (mod |calloc_model_#in~size| 4294967296)) 4294967296) 119)), 24237#(= 0 |#Ultimate.C_memset_#t~loopctr49|), 24238#(<= |#Ultimate.C_memset_#t~loopctr49| 1), 24239#(<= |#Ultimate.C_memset_#t~loopctr49| 2), 24240#(<= |#Ultimate.C_memset_#t~loopctr49| 3), 24241#(<= |#Ultimate.C_memset_#t~loopctr49| 4), 24242#(<= |#Ultimate.C_memset_#t~loopctr49| 5), 24243#(<= |#Ultimate.C_memset_#t~loopctr49| 6), 24244#(<= |#Ultimate.C_memset_#t~loopctr49| 7), 24245#(<= |#Ultimate.C_memset_#t~loopctr49| 8), 24246#(not (= |#Ultimate.C_memset_#amount| 119)), 23869#true, 24221#(not (= |zalloc_or_die_#in~size| 119)), 23870#false, 24222#(= (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-02 10:54:29,401 INFO L134 CoverageAnalysis]: Checked inductivity of 1686 backedges. 470 proven. 36 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2018-02-02 10:54:29,401 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 10:54:29,402 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 10:54:29,402 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2018-02-02 10:54:29,402 INFO L87 Difference]: Start difference. First operand 408 states and 521 transitions. Second operand 19 states. [2018-02-02 10:54:30,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:54:30,533 INFO L93 Difference]: Finished difference Result 462 states and 559 transitions. [2018-02-02 10:54:30,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-02 10:54:30,533 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 190 [2018-02-02 10:54:30,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:54:30,535 INFO L225 Difference]: With dead ends: 462 [2018-02-02 10:54:30,535 INFO L226 Difference]: Without dead ends: 455 [2018-02-02 10:54:30,535 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=133, Invalid=623, Unknown=0, NotChecked=0, Total=756 [2018-02-02 10:54:30,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2018-02-02 10:54:30,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 411. [2018-02-02 10:54:30,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2018-02-02 10:54:30,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 525 transitions. [2018-02-02 10:54:30,542 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 525 transitions. Word has length 190 [2018-02-02 10:54:30,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:54:30,543 INFO L432 AbstractCegarLoop]: Abstraction has 411 states and 525 transitions. [2018-02-02 10:54:30,543 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 10:54:30,543 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 525 transitions. [2018-02-02 10:54:30,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-02-02 10:54:30,544 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:54:30,544 INFO L351 BasicCegarLoop]: trace histogram [49, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:54:30,544 INFO L371 AbstractCegarLoop]: === Iteration 23 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-02 10:54:30,544 INFO L82 PathProgramCache]: Analyzing trace with hash 114639249, 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-02 10:54:30,547 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:54:30,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:30,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:30,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:30,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:30,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:30,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:30,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:30,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:30,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:30,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:30,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:30,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:30,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:30,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:30,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:30,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:30,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:30,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:30,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:30,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:30,797 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 515 proven. 45 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2018-02-02 10:54:30,814 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:54:30,814 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-02 10:54:30,814 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:54:30,814 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2018-02-02 10:54:30,814 INFO L182 omatonBuilderFactory]: Interpolants [25508#(or (not (= |calloc_model_#in~nmemb| 1)) (not (= |calloc_model_#in~size| 119))), 25509#(= 0 |#Ultimate.C_memset_#t~loopctr49|), 25510#(= 1 |#Ultimate.C_memset_#t~loopctr49|), 25511#(= |#Ultimate.C_memset_#t~loopctr49| 2), 25512#(<= |#Ultimate.C_memset_#t~loopctr49| 3), 25513#(<= |#Ultimate.C_memset_#t~loopctr49| 4), 25514#(<= |#Ultimate.C_memset_#t~loopctr49| 5), 25515#(<= |#Ultimate.C_memset_#t~loopctr49| 6), 25516#(<= |#Ultimate.C_memset_#t~loopctr49| 7), 25517#(<= |#Ultimate.C_memset_#t~loopctr49| 8), 25518#(<= |#Ultimate.C_memset_#t~loopctr49| 9), 25519#(not (= |#Ultimate.C_memset_#amount| 119)), 25138#true, 25139#false, 25492#(not (= |zalloc_or_die_#in~size| 119)), 25493#(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)))), 25302#(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)|)), 25303#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 25337#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 25470#(= zalloc_or_die_~size |zalloc_or_die_#in~size|)] [2018-02-02 10:54:30,815 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 515 proven. 45 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2018-02-02 10:54:30,815 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 10:54:30,815 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 10:54:30,815 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2018-02-02 10:54:30,815 INFO L87 Difference]: Start difference. First operand 411 states and 525 transitions. Second operand 20 states. [2018-02-02 10:54:32,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:54:32,091 INFO L93 Difference]: Finished difference Result 462 states and 560 transitions. [2018-02-02 10:54:32,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-02 10:54:32,092 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 191 [2018-02-02 10:54:32,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:54:32,093 INFO L225 Difference]: With dead ends: 462 [2018-02-02 10:54:32,093 INFO L226 Difference]: Without dead ends: 455 [2018-02-02 10:54:32,093 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=171, Invalid=885, Unknown=0, NotChecked=0, Total=1056 [2018-02-02 10:54:32,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2018-02-02 10:54:32,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 412. [2018-02-02 10:54:32,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 412 states. [2018-02-02 10:54:32,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 527 transitions. [2018-02-02 10:54:32,097 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 527 transitions. Word has length 191 [2018-02-02 10:54:32,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:54:32,098 INFO L432 AbstractCegarLoop]: Abstraction has 412 states and 527 transitions. [2018-02-02 10:54:32,098 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 10:54:32,098 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 527 transitions. [2018-02-02 10:54:32,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-02-02 10:54:32,098 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:54:32,098 INFO L351 BasicCegarLoop]: trace histogram [50, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:54:32,098 INFO L371 AbstractCegarLoop]: === Iteration 24 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-02 10:54:32,099 INFO L82 PathProgramCache]: Analyzing trace with hash -854283686, 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-02 10:54:32,112 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:54:32,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:32,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:32,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:32,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:32,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:32,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:32,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:32,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:32,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:32,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:32,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:32,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:32,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:32,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:32,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:32,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:32,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:32,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:32,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:32,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:32,677 INFO L134 CoverageAnalysis]: Checked inductivity of 1795 backedges. 560 proven. 55 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2018-02-02 10:54:32,693 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:54:32,708 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-02 10:54:32,708 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:54:32,709 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2018-02-02 10:54:32,709 INFO L182 omatonBuilderFactory]: Interpolants [26753#(= zalloc_or_die_~size |zalloc_or_die_#in~size|), 26793#(or (not (= |calloc_model_#in~nmemb| 1)) (not (= (mod |calloc_model_#in~size| 4294967296) 119))), 26794#(= 0 |#Ultimate.C_memset_#t~loopctr49|), 26795#(= 1 |#Ultimate.C_memset_#t~loopctr49|), 26796#(= |#Ultimate.C_memset_#t~loopctr49| 2), 26797#(and (<= |#Ultimate.C_memset_#t~loopctr49| 3) (<= 3 |#Ultimate.C_memset_#t~loopctr49|)), 26798#(and (<= |#Ultimate.C_memset_#t~loopctr49| 4) (<= 4 |#Ultimate.C_memset_#t~loopctr49|)), 26799#(and (<= 5 |#Ultimate.C_memset_#t~loopctr49|) (<= |#Ultimate.C_memset_#t~loopctr49| 5)), 26800#(and (<= 6 |#Ultimate.C_memset_#t~loopctr49|) (<= |#Ultimate.C_memset_#t~loopctr49| 6)), 26801#(and (<= 7 |#Ultimate.C_memset_#t~loopctr49|) (<= |#Ultimate.C_memset_#t~loopctr49| 7)), 26802#(and (<= 8 |#Ultimate.C_memset_#t~loopctr49|) (<= |#Ultimate.C_memset_#t~loopctr49| 8)), 26803#(and (<= |#Ultimate.C_memset_#t~loopctr49| 9) (<= 9 |#Ultimate.C_memset_#t~loopctr49|)), 26420#true, 26804#(and (< 9 |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#t~loopctr49| 10)), 26421#false, 26805#(and (<= |#Ultimate.C_memset_#amount| 10) (< 9 |#Ultimate.C_memset_#amount|)), 26776#(not (= |zalloc_or_die_#in~size| 119)), 26585#(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)|)), 26777#(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)))), 26586#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 26620#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))] [2018-02-02 10:54:32,709 INFO L134 CoverageAnalysis]: Checked inductivity of 1795 backedges. 560 proven. 55 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2018-02-02 10:54:32,710 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-02 10:54:32,710 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-02 10:54:32,710 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=378, Unknown=0, NotChecked=0, Total=420 [2018-02-02 10:54:32,710 INFO L87 Difference]: Start difference. First operand 412 states and 527 transitions. Second operand 21 states. [2018-02-02 10:54:34,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:54:34,080 INFO L93 Difference]: Finished difference Result 468 states and 567 transitions. [2018-02-02 10:54:34,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-02 10:54:34,080 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 192 [2018-02-02 10:54:34,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:54:34,082 INFO L225 Difference]: With dead ends: 468 [2018-02-02 10:54:34,082 INFO L226 Difference]: Without dead ends: 461 [2018-02-02 10:54:34,082 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=93, Invalid=777, Unknown=0, NotChecked=0, Total=870 [2018-02-02 10:54:34,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2018-02-02 10:54:34,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 413. [2018-02-02 10:54:34,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 413 states. [2018-02-02 10:54:34,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 529 transitions. [2018-02-02 10:54:34,088 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 529 transitions. Word has length 192 [2018-02-02 10:54:34,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:54:34,089 INFO L432 AbstractCegarLoop]: Abstraction has 413 states and 529 transitions. [2018-02-02 10:54:34,089 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-02 10:54:34,089 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 529 transitions. [2018-02-02 10:54:34,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-02-02 10:54:34,090 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:54:34,090 INFO L351 BasicCegarLoop]: trace histogram [51, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:54:34,090 INFO L371 AbstractCegarLoop]: === Iteration 25 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-02 10:54:34,090 INFO L82 PathProgramCache]: Analyzing trace with hash -826123599, 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-02 10:54:34,094 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:54:34,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:34,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:34,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:34,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:34,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:34,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:34,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:34,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:34,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:34,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:34,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:34,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:34,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:34,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:34,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:34,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:34,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:34,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:34,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:34,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:36,653 INFO L134 CoverageAnalysis]: Checked inductivity of 1851 backedges. 605 proven. 66 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2018-02-02 10:54:36,669 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:54:36,669 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-02 10:54:36,669 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:54:36,670 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2018-02-02 10:54:36,670 INFO L182 omatonBuilderFactory]: Interpolants [27872#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 28064#(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)))), 27906#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 28039#(= zalloc_or_die_~size |zalloc_or_die_#in~size|), 28081#(or (not (= |calloc_model_#in~nmemb| 1)) (not (= (mod |calloc_model_#in~size| 4294967296) 119))), 28082#(= 0 |#Ultimate.C_memset_#t~loopctr49|), 28083#(= 1 |#Ultimate.C_memset_#t~loopctr49|), 28084#(and (= |#Ultimate.C_memset_#t~loopctr49| 2) (< 1 |#Ultimate.C_memset_#amount|)), 28085#(and (<= |#Ultimate.C_memset_#t~loopctr49| 3) (<= 3 |#Ultimate.C_memset_#t~loopctr49|) (< 1 |#Ultimate.C_memset_#amount|)), 28086#(and (<= |#Ultimate.C_memset_#t~loopctr49| 4) (<= 4 |#Ultimate.C_memset_#t~loopctr49|) (< 1 |#Ultimate.C_memset_#amount|)), 28087#(and (< 1 |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#t~loopctr49| 5)), 28088#(and (<= |#Ultimate.C_memset_#t~loopctr49| 6) (< 1 |#Ultimate.C_memset_#amount|)), 27705#true, 28089#(and (< 1 |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#t~loopctr49| 7)), 27706#false, 28090#(and (<= |#Ultimate.C_memset_#t~loopctr49| 8) (< 1 |#Ultimate.C_memset_#amount|)), 28091#(and (<= |#Ultimate.C_memset_#t~loopctr49| 9) (< 1 |#Ultimate.C_memset_#amount|)), 28092#(and (< 1 |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#t~loopctr49| 10)), 28093#(and (<= |#Ultimate.C_memset_#t~loopctr49| 11) (< 1 |#Ultimate.C_memset_#amount|)), 28094#(and (<= 0 (+ (div (+ (- 9663676119) (* (- 27) |#Ultimate.C_memset_#amount|)) 1073741824) 11)) (< 1 |#Ultimate.C_memset_#amount|)), 27871#(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)|)), 28063#(not (= |zalloc_or_die_#in~size| 119))] [2018-02-02 10:54:36,670 INFO L134 CoverageAnalysis]: Checked inductivity of 1851 backedges. 605 proven. 66 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2018-02-02 10:54:36,670 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 10:54:36,671 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 10:54:36,671 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=375, Unknown=1, NotChecked=0, Total=462 [2018-02-02 10:54:36,671 INFO L87 Difference]: Start difference. First operand 413 states and 529 transitions. Second operand 22 states. [2018-02-02 10:54:37,334 WARN L143 SmtUtils]: Spent 237ms on a formula simplification that was a NOOP. DAG size: 19 [2018-02-02 10:54:47,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:54:47,648 INFO L93 Difference]: Finished difference Result 471 states and 571 transitions. [2018-02-02 10:54:47,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-02 10:54:47,648 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 193 [2018-02-02 10:54:47,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:54:47,650 INFO L225 Difference]: With dead ends: 471 [2018-02-02 10:54:47,650 INFO L226 Difference]: Without dead ends: 464 [2018-02-02 10:54:47,651 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=161, Invalid=960, Unknown=1, NotChecked=0, Total=1122 [2018-02-02 10:54:47,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2018-02-02 10:54:47,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 414. [2018-02-02 10:54:47,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 414 states. [2018-02-02 10:54:47,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 531 transitions. [2018-02-02 10:54:47,656 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 531 transitions. Word has length 193 [2018-02-02 10:54:47,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:54:47,657 INFO L432 AbstractCegarLoop]: Abstraction has 414 states and 531 transitions. [2018-02-02 10:54:47,657 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 10:54:47,657 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 531 transitions. [2018-02-02 10:54:47,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-02-02 10:54:47,658 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:54:47,658 INFO L351 BasicCegarLoop]: trace histogram [52, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:54:47,658 INFO L371 AbstractCegarLoop]: === Iteration 26 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-02 10:54:47,658 INFO L82 PathProgramCache]: Analyzing trace with hash 46839098, 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-02 10:54:47,663 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:54:47,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:47,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:47,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:47,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:47,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:47,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:47,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:47,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:47,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:47,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:47,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:47,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:47,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:47,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:47,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:47,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:47,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:47,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:47,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:47,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:48,144 INFO L134 CoverageAnalysis]: Checked inductivity of 1908 backedges. 650 proven. 78 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2018-02-02 10:54:48,161 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:54:48,161 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-02 10:54:48,161 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:54:48,162 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2018-02-02 10:54:48,162 INFO L182 omatonBuilderFactory]: Interpolants [29383#(or (not (= |calloc_model_#in~nmemb| 1)) (not (= (mod |calloc_model_#in~size| 4294967296) 119))), 29384#(= 0 |#Ultimate.C_memset_#t~loopctr49|), 29385#(and (= 1 |#Ultimate.C_memset_#t~loopctr49|) (< 0 |#Ultimate.C_memset_#amount|)), 29386#(and (<= 2 |#Ultimate.C_memset_#t~loopctr49|) (< 0 |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#t~loopctr49| 2)), 29387#(and (<= |#Ultimate.C_memset_#t~loopctr49| 3) (<= 3 |#Ultimate.C_memset_#t~loopctr49|) (< 0 |#Ultimate.C_memset_#amount|)), 29004#true, 29388#(and (<= |#Ultimate.C_memset_#t~loopctr49| 4) (<= 4 |#Ultimate.C_memset_#t~loopctr49|) (< 0 |#Ultimate.C_memset_#amount|)), 29005#false, 29389#(and (<= 5 |#Ultimate.C_memset_#t~loopctr49|) (< 0 |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#t~loopctr49| 5)), 29390#(and (<= 6 |#Ultimate.C_memset_#t~loopctr49|) (<= |#Ultimate.C_memset_#t~loopctr49| 6) (< 0 |#Ultimate.C_memset_#amount|)), 29391#(and (<= 7 |#Ultimate.C_memset_#t~loopctr49|) (< 0 |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#t~loopctr49| 7)), 29392#(and (<= 8 |#Ultimate.C_memset_#t~loopctr49|) (<= |#Ultimate.C_memset_#t~loopctr49| 8) (< 0 |#Ultimate.C_memset_#amount|)), 29393#(and (<= |#Ultimate.C_memset_#t~loopctr49| 9) (< 0 |#Ultimate.C_memset_#amount|) (<= 9 |#Ultimate.C_memset_#t~loopctr49|)), 29394#(and (<= 10 |#Ultimate.C_memset_#t~loopctr49|) (< 0 |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#t~loopctr49| 10)), 29171#(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)|)), 29395#(and (<= 11 |#Ultimate.C_memset_#t~loopctr49|) (<= |#Ultimate.C_memset_#t~loopctr49| 11) (< 0 |#Ultimate.C_memset_#amount|)), 29172#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 29396#(and (<= |#Ultimate.C_memset_#t~loopctr49| 12) (< 11 |#Ultimate.C_memset_#amount|)), 29364#(not (= |zalloc_or_die_#in~size| 119)), 29365#(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)))), 29397#(and (< 11 |#Ultimate.C_memset_#amount|) (<= |#Ultimate.C_memset_#amount| 12)), 29206#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 29339#(= zalloc_or_die_~size |zalloc_or_die_#in~size|)] [2018-02-02 10:54:48,162 INFO L134 CoverageAnalysis]: Checked inductivity of 1908 backedges. 650 proven. 78 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2018-02-02 10:54:48,162 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-02 10:54:48,162 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-02 10:54:48,163 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=460, Unknown=0, NotChecked=0, Total=506 [2018-02-02 10:54:48,163 INFO L87 Difference]: Start difference. First operand 414 states and 531 transitions. Second operand 23 states. [2018-02-02 10:54:49,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:54:49,741 INFO L93 Difference]: Finished difference Result 474 states and 575 transitions. [2018-02-02 10:54:49,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-02 10:54:49,741 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 194 [2018-02-02 10:54:49,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:54:49,742 INFO L225 Difference]: With dead ends: 474 [2018-02-02 10:54:49,742 INFO L226 Difference]: Without dead ends: 467 [2018-02-02 10:54:49,742 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-02 10:54:49,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2018-02-02 10:54:49,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 415. [2018-02-02 10:54:49,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 415 states. [2018-02-02 10:54:49,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 533 transitions. [2018-02-02 10:54:49,745 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 533 transitions. Word has length 194 [2018-02-02 10:54:49,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:54:49,746 INFO L432 AbstractCegarLoop]: Abstraction has 415 states and 533 transitions. [2018-02-02 10:54:49,746 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-02 10:54:49,746 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 533 transitions. [2018-02-02 10:54:49,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-02-02 10:54:49,746 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:54:49,746 INFO L351 BasicCegarLoop]: trace histogram [53, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:54:49,746 INFO L371 AbstractCegarLoop]: === Iteration 27 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-02 10:54:49,746 INFO L82 PathProgramCache]: Analyzing trace with hash 1338878929, now seen corresponding path program 14 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 10:54:49,748 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:54:49,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:49,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:49,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:49,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:49,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:49,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:49,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:49,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:49,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:49,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:49,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:49,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:49,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:49,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:49,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:49,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:49,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:49,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:49,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:50,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:54:52,207 WARN L1011 $PredicateComparison]: unable to prove that (and (< 12 |c_#Ultimate.C_memset_#amount|) (<= (* 53 |c_#Ultimate.C_memset_#t~loopctr49|) (+ (div (+ (- 19327352143) (* 2147483595 |c_#Ultimate.C_memset_#amount|)) 2147483648) 2147484284))) is different from false [2018-02-02 10:55:03,588 WARN L143 SmtUtils]: Spent 4970ms on a formula simplification that was a NOOP. DAG size: 17 [2018-02-02 10:55:03,625 INFO L134 CoverageAnalysis]: Checked inductivity of 1966 backedges. 695 proven. 78 refuted. 0 times theorem prover too weak. 1180 trivial. 13 not checked. [2018-02-02 10:55:03,652 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:55:03,652 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-02 10:55:03,652 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:55:03,653 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2018-02-02 10:55:03,653 INFO L182 omatonBuilderFactory]: Interpolants [30688#(= 0 |#Ultimate.C_memset_#t~loopctr49|), 30305#true, 30689#(and (<= 1 |#Ultimate.C_memset_#t~loopctr49|) (<= |#Ultimate.C_memset_#t~loopctr49| 1)), 30306#false, 30690#(and (<= 2 |#Ultimate.C_memset_#t~loopctr49|) (<= |#Ultimate.C_memset_#t~loopctr49| 2)), 30691#(and (<= |#Ultimate.C_memset_#t~loopctr49| 3) (<= 3 |#Ultimate.C_memset_#t~loopctr49|)), 30692#(and (<= |#Ultimate.C_memset_#t~loopctr49| 4) (<= 4 |#Ultimate.C_memset_#t~loopctr49|)), 30693#(and (<= 5 |#Ultimate.C_memset_#t~loopctr49|) (<= |#Ultimate.C_memset_#t~loopctr49| 5)), 30694#(and (<= 6 |#Ultimate.C_memset_#t~loopctr49|) (<= |#Ultimate.C_memset_#t~loopctr49| 6)), 30695#(and (<= 7 |#Ultimate.C_memset_#t~loopctr49|) (<= |#Ultimate.C_memset_#t~loopctr49| 7)), 30696#(and (<= 8 |#Ultimate.C_memset_#t~loopctr49|) (<= |#Ultimate.C_memset_#t~loopctr49| 8)), 30473#(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)|)), 30697#(and (<= |#Ultimate.C_memset_#t~loopctr49| 9) (<= 9 |#Ultimate.C_memset_#t~loopctr49|)), 30474#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 30698#(and (<= 10 |#Ultimate.C_memset_#t~loopctr49|) (<= |#Ultimate.C_memset_#t~loopctr49| 10)), 30699#(and (<= 11 |#Ultimate.C_memset_#t~loopctr49|) (<= |#Ultimate.C_memset_#t~loopctr49| 11)), 30667#(not (= |zalloc_or_die_#in~size| 119)), 30508#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 30668#(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)))), 30700#(and (<= |#Ultimate.C_memset_#t~loopctr49| 12) (<= 12 |#Ultimate.C_memset_#t~loopctr49|)), 30701#(and (< 12 |#Ultimate.C_memset_#amount|) (<= (* 53 |#Ultimate.C_memset_#t~loopctr49|) (+ (div (+ (- 19327352143) (* 2147483595 |#Ultimate.C_memset_#amount|)) 2147483648) 2147484284))), 30702#(and (< 12 |#Ultimate.C_memset_#amount|) (<= (* 2147483648 |#Ultimate.C_memset_#amount|) (+ (* 2147483595 |#Ultimate.C_memset_#t~loopctr49|) (div (+ (- 19327352143) (* 2147483595 |#Ultimate.C_memset_#amount|)) 2147483648) 2147484284))), 30641#(= zalloc_or_die_~size |zalloc_or_die_#in~size|), 30687#(or (not (= |calloc_model_#in~nmemb| 1)) (not (= (mod |calloc_model_#in~size| 4294967296) 119)))] [2018-02-02 10:55:03,653 INFO L134 CoverageAnalysis]: Checked inductivity of 1966 backedges. 695 proven. 78 refuted. 0 times theorem prover too weak. 1180 trivial. 13 not checked. [2018-02-02 10:55:03,653 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-02 10:55:03,654 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-02 10:55:03,654 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=458, Unknown=4, NotChecked=42, Total=552 [2018-02-02 10:55:03,654 INFO L87 Difference]: Start difference. First operand 415 states and 533 transitions. Second operand 24 states. Received shutdown request... [2018-02-02 10:55:06,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 10:55:06,076 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-02 10:55:06,082 WARN L185 ceAbstractionStarter]: Timeout [2018-02-02 10:55:06,082 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 10:55:06 BoogieIcfgContainer [2018-02-02 10:55:06,082 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 10:55:06,083 INFO L168 Benchmark]: Toolchain (without parser) took 64948.05 ms. Allocated memory was 401.6 MB in the beginning and 1.1 GB in the end (delta: 677.4 MB). Free memory was 355.7 MB in the beginning and 390.9 MB in the end (delta: -35.3 MB). Peak memory consumption was 642.1 MB. Max. memory is 5.3 GB. [2018-02-02 10:55:06,084 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 401.6 MB. Free memory is still 362.3 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 10:55:06,085 INFO L168 Benchmark]: CACSL2BoogieTranslator took 189.94 ms. Allocated memory is still 401.6 MB. Free memory was 355.7 MB in the beginning and 342.3 MB in the end (delta: 13.3 MB). Peak memory consumption was 13.3 MB. Max. memory is 5.3 GB. [2018-02-02 10:55:06,085 INFO L168 Benchmark]: Boogie Preprocessor took 37.16 ms. Allocated memory is still 401.6 MB. Free memory was 342.3 MB in the beginning and 341.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-02 10:55:06,085 INFO L168 Benchmark]: RCFGBuilder took 584.77 ms. Allocated memory is still 401.6 MB. Free memory was 341.0 MB in the beginning and 280.0 MB in the end (delta: 61.0 MB). Peak memory consumption was 61.0 MB. Max. memory is 5.3 GB. [2018-02-02 10:55:06,086 INFO L168 Benchmark]: TraceAbstraction took 64133.21 ms. Allocated memory was 401.6 MB in the beginning and 1.1 GB in the end (delta: 677.4 MB). Free memory was 280.0 MB in the beginning and 390.9 MB in the end (delta: -110.9 MB). Peak memory consumption was 566.5 MB. Max. memory is 5.3 GB. [2018-02-02 10:55:06,089 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.10 ms. Allocated memory is still 401.6 MB. Free memory is still 362.3 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 189.94 ms. Allocated memory is still 401.6 MB. Free memory was 355.7 MB in the beginning and 342.3 MB in the end (delta: 13.3 MB). Peak memory consumption was 13.3 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 37.16 ms. Allocated memory is still 401.6 MB. Free memory was 342.3 MB in the beginning and 341.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 584.77 ms. Allocated memory is still 401.6 MB. Free memory was 341.0 MB in the beginning and 280.0 MB in the end (delta: 61.0 MB). Peak memory consumption was 61.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 64133.21 ms. Allocated memory was 401.6 MB in the beginning and 1.1 GB in the end (delta: 677.4 MB). Free memory was 280.0 MB in the beginning and 390.9 MB in the end (delta: -110.9 MB). Peak memory consumption was 566.5 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 831). Cancelled while BasicCegarLoop was constructing difference of abstraction (415states) and interpolant automaton (currently 4 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (2 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 832). Cancelled while BasicCegarLoop was constructing difference of abstraction (415states) and interpolant automaton (currently 4 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (2 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 831). Cancelled while BasicCegarLoop was constructing difference of abstraction (415states) and interpolant automaton (currently 4 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (2 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 832). Cancelled while BasicCegarLoop was constructing difference of abstraction (415states) and interpolant automaton (currently 4 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (2 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 834). Cancelled while BasicCegarLoop was constructing difference of abstraction (415states) and interpolant automaton (currently 4 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (2 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 834). Cancelled while BasicCegarLoop was constructing difference of abstraction (415states) and interpolant automaton (currently 4 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (2 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 (415states) and interpolant automaton (currently 4 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (2 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 (415states) and interpolant automaton (currently 4 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (2 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 (415states) and interpolant automaton (currently 4 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (2 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 (415states) and interpolant automaton (currently 4 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (2 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 (415states) and interpolant automaton (currently 4 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (2 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 (415states) and interpolant automaton (currently 4 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (2 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 820). Cancelled while BasicCegarLoop was constructing difference of abstraction (415states) and interpolant automaton (currently 4 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (2 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 822). Cancelled while BasicCegarLoop was constructing difference of abstraction (415states) and interpolant automaton (currently 4 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (2 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 819). Cancelled while BasicCegarLoop was constructing difference of abstraction (415states) and interpolant automaton (currently 4 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (2 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 819). Cancelled while BasicCegarLoop was constructing difference of abstraction (415states) and interpolant automaton (currently 4 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (2 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 819). Cancelled while BasicCegarLoop was constructing difference of abstraction (415states) and interpolant automaton (currently 4 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (2 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 822). Cancelled while BasicCegarLoop was constructing difference of abstraction (415states) and interpolant automaton (currently 4 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (2 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 819). Cancelled while BasicCegarLoop was constructing difference of abstraction (415states) and interpolant automaton (currently 4 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (2 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 820). Cancelled while BasicCegarLoop was constructing difference of abstraction (415states) and interpolant automaton (currently 4 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (2 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 794). Cancelled while BasicCegarLoop was constructing difference of abstraction (415states) and interpolant automaton (currently 4 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (2 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 795). Cancelled while BasicCegarLoop was constructing difference of abstraction (415states) and interpolant automaton (currently 4 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (2 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 794). Cancelled while BasicCegarLoop was constructing difference of abstraction (415states) and interpolant automaton (currently 4 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (2 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 794). Cancelled while BasicCegarLoop was constructing difference of abstraction (415states) and interpolant automaton (currently 4 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (2 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 795). Cancelled while BasicCegarLoop was constructing difference of abstraction (415states) and interpolant automaton (currently 4 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (2 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 794). Cancelled while BasicCegarLoop was constructing difference of abstraction (415states) and interpolant automaton (currently 4 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (2 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 883). Cancelled while BasicCegarLoop was constructing difference of abstraction (415states) and interpolant automaton (currently 4 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (2 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 887). Cancelled while BasicCegarLoop was constructing difference of abstraction (415states) and interpolant automaton (currently 4 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (2 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 881). Cancelled while BasicCegarLoop was constructing difference of abstraction (415states) and interpolant automaton (currently 4 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (2 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 875]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 875). Cancelled while BasicCegarLoop was constructing difference of abstraction (415states) and interpolant automaton (currently 4 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (2 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 885). Cancelled while BasicCegarLoop was constructing difference of abstraction (415states) and interpolant automaton (currently 4 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (2 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 881). Cancelled while BasicCegarLoop was constructing difference of abstraction (415states) and interpolant automaton (currently 4 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (2 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 882). Cancelled while BasicCegarLoop was constructing difference of abstraction (415states) and interpolant automaton (currently 4 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (2 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 884). Cancelled while BasicCegarLoop was constructing difference of abstraction (415states) and interpolant automaton (currently 4 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (2 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 886). Cancelled while BasicCegarLoop was constructing difference of abstraction (415states) and interpolant automaton (currently 4 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (2 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 885). Cancelled while BasicCegarLoop was constructing difference of abstraction (415states) and interpolant automaton (currently 4 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (2 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 886). Cancelled while BasicCegarLoop was constructing difference of abstraction (415states) and interpolant automaton (currently 4 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (2 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 888). Cancelled while BasicCegarLoop was constructing difference of abstraction (415states) and interpolant automaton (currently 4 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (2 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 882). Cancelled while BasicCegarLoop was constructing difference of abstraction (415states) and interpolant automaton (currently 4 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (2 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 883). Cancelled while BasicCegarLoop was constructing difference of abstraction (415states) and interpolant automaton (currently 4 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (2 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 887). Cancelled while BasicCegarLoop was constructing difference of abstraction (415states) and interpolant automaton (currently 4 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (2 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 884). Cancelled while BasicCegarLoop was constructing difference of abstraction (415states) and interpolant automaton (currently 4 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (2 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 888). Cancelled while BasicCegarLoop was constructing difference of abstraction (415states) and interpolant automaton (currently 4 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (2 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 786). Cancelled while BasicCegarLoop was constructing difference of abstraction (415states) and interpolant automaton (currently 4 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (2 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 785). Cancelled while BasicCegarLoop was constructing difference of abstraction (415states) and interpolant automaton (currently 4 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (2 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 786). Cancelled while BasicCegarLoop was constructing difference of abstraction (415states) and interpolant automaton (currently 4 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (2 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 785). Cancelled while BasicCegarLoop was constructing difference of abstraction (415states) and interpolant automaton (currently 4 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (2 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 785). Cancelled while BasicCegarLoop was constructing difference of abstraction (415states) and interpolant automaton (currently 4 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (2 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 785). Cancelled while BasicCegarLoop was constructing difference of abstraction (415states) and interpolant automaton (currently 4 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (2 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 804). Cancelled while BasicCegarLoop was constructing difference of abstraction (415states) and interpolant automaton (currently 4 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (2 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 (415states) and interpolant automaton (currently 4 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (2 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 (415states) and interpolant automaton (currently 4 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (2 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 (415states) and interpolant automaton (currently 4 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (2 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 (415states) and interpolant automaton (currently 4 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (2 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 804). Cancelled while BasicCegarLoop was constructing difference of abstraction (415states) and interpolant automaton (currently 4 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (2 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 870). Cancelled while BasicCegarLoop was constructing difference of abstraction (415states) and interpolant automaton (currently 4 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (2 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 (415states) and interpolant automaton (currently 4 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (2 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 (415states) and interpolant automaton (currently 4 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (2 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 (415states) and interpolant automaton (currently 4 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (2 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 870). Cancelled while BasicCegarLoop was constructing difference of abstraction (415states) and interpolant automaton (currently 4 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (2 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 (415states) and interpolant automaton (currently 4 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (2 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 (415states) and interpolant automaton (currently 4 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (2 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 (415states) and interpolant automaton (currently 4 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (2 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 776). Cancelled while BasicCegarLoop was constructing difference of abstraction (415states) and interpolant automaton (currently 4 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (2 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 776). Cancelled while BasicCegarLoop was constructing difference of abstraction (415states) and interpolant automaton (currently 4 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (2 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 776). Cancelled while BasicCegarLoop was constructing difference of abstraction (415states) and interpolant automaton (currently 4 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (2 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 777). Cancelled while BasicCegarLoop was constructing difference of abstraction (415states) and interpolant automaton (currently 4 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (2 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 776). Cancelled while BasicCegarLoop was constructing difference of abstraction (415states) and interpolant automaton (currently 4 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (2 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 775). Cancelled while BasicCegarLoop was constructing difference of abstraction (415states) and interpolant automaton (currently 4 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (2 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 775). Cancelled while BasicCegarLoop was constructing difference of abstraction (415states) and interpolant automaton (currently 4 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (2 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 777). Cancelled while BasicCegarLoop was constructing difference of abstraction (415states) and interpolant automaton (currently 4 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (2 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 877). Cancelled while BasicCegarLoop was constructing difference of abstraction (415states) and interpolant automaton (currently 4 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (2 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 877). Cancelled while BasicCegarLoop was constructing difference of abstraction (415states) and interpolant automaton (currently 4 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (2 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 856). Cancelled while BasicCegarLoop was constructing difference of abstraction (415states) and interpolant automaton (currently 4 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (2 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 858). Cancelled while BasicCegarLoop was constructing difference of abstraction (415states) and interpolant automaton (currently 4 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (2 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 855). Cancelled while BasicCegarLoop was constructing difference of abstraction (415states) and interpolant automaton (currently 4 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (2 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 855). Cancelled while BasicCegarLoop was constructing difference of abstraction (415states) and interpolant automaton (currently 4 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (2 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 858). Cancelled while BasicCegarLoop was constructing difference of abstraction (415states) and interpolant automaton (currently 4 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (2 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 856). Cancelled while BasicCegarLoop was constructing difference of abstraction (415states) and interpolant automaton (currently 4 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (2 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 843). Cancelled while BasicCegarLoop was constructing difference of abstraction (415states) and interpolant automaton (currently 4 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (2 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 843). Cancelled while BasicCegarLoop was constructing difference of abstraction (415states) and interpolant automaton (currently 4 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (2 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 844). Cancelled while BasicCegarLoop was constructing difference of abstraction (415states) and interpolant automaton (currently 4 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (2 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 846). Cancelled while BasicCegarLoop was constructing difference of abstraction (415states) and interpolant automaton (currently 4 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (2 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 846). Cancelled while BasicCegarLoop was constructing difference of abstraction (415states) and interpolant automaton (currently 4 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (2 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 844). Cancelled while BasicCegarLoop was constructing difference of abstraction (415states) and interpolant automaton (currently 4 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (2 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 16 procedures, 275 locations, 85 error locations. TIMEOUT Result, 64.0s OverallTime, 27 OverallIterations, 53 TraceHistogramMax, 39.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 6368 SDtfs, 6455 SDslu, 43165 SDs, 0 SdLazy, 48508 SolverSat, 1697 SolverUnsat, 21 SolverUnknown, 0 SolverNotchecked, 30.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1439 GetRequests, 837 SyntacticMatches, 0 SemanticMatches, 602 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1890 ImplicationChecksByTransitivity, 23.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=415occurred in iteration=26, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 26135/27860 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, 26 MinimizatonAttempts, 1218 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.5s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 22.4s InterpolantComputationTime, 4022 NumberOfCodeBlocks, 4022 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 3995 ConstructedInterpolants, 8 QuantifiedInterpolants, 2072525 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 27 InterpolantComputations, 6 PerfectInterpolantSequences, 26135/27860 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0235_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_z3.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_10-55-06-098.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0235_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_z3.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-02_10-55-06-098.csv Completed graceful shutdown