./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-simple/dll2n_insert_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-simple/dll2n_insert_unequal.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 97351642d4f3bf3f6d868e0a3719427b4c33bd5e0f87a93a325784728b912f03 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 08:02:45,309 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 08:02:45,387 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-09 08:02:45,392 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 08:02:45,395 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 08:02:45,415 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 08:02:45,415 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 08:02:45,416 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 08:02:45,417 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 08:02:45,417 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 08:02:45,418 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 08:02:45,418 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 08:02:45,419 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 08:02:45,420 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 08:02:45,421 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 08:02:45,422 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 08:02:45,422 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 08:02:45,422 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 08:02:45,423 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 08:02:45,423 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 08:02:45,423 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 08:02:45,427 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 08:02:45,427 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 08:02:45,427 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 08:02:45,427 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 08:02:45,427 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 08:02:45,428 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 08:02:45,428 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 08:02:45,428 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 08:02:45,428 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 08:02:45,428 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 08:02:45,429 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 08:02:45,429 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 08:02:45,429 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 08:02:45,429 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 08:02:45,429 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 08:02:45,430 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 08:02:45,430 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 08:02:45,430 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 08:02:45,431 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 08:02:45,432 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 08:02:45,432 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 08:02:45,432 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 97351642d4f3bf3f6d868e0a3719427b4c33bd5e0f87a93a325784728b912f03 [2024-11-09 08:02:45,704 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 08:02:45,730 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 08:02:45,733 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 08:02:45,734 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 08:02:45,734 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 08:02:45,735 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2n_insert_unequal.i [2024-11-09 08:02:47,165 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 08:02:47,456 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 08:02:47,457 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_insert_unequal.i [2024-11-09 08:02:47,480 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88e5e910b/a43bc99134e14205868f09035ba25945/FLAGf51d83ed0 [2024-11-09 08:02:47,735 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88e5e910b/a43bc99134e14205868f09035ba25945 [2024-11-09 08:02:47,738 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 08:02:47,739 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 08:02:47,740 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 08:02:47,740 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 08:02:47,744 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 08:02:47,744 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 08:02:47" (1/1) ... [2024-11-09 08:02:47,745 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f61ff8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:02:47, skipping insertion in model container [2024-11-09 08:02:47,745 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 08:02:47" (1/1) ... [2024-11-09 08:02:47,789 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 08:02:48,124 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 08:02:48,133 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 08:02:48,199 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 08:02:48,232 INFO L204 MainTranslator]: Completed translation [2024-11-09 08:02:48,233 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:02:48 WrapperNode [2024-11-09 08:02:48,233 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 08:02:48,234 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 08:02:48,234 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 08:02:48,235 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 08:02:48,242 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:02:48" (1/1) ... [2024-11-09 08:02:48,256 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:02:48" (1/1) ... [2024-11-09 08:02:48,286 INFO L138 Inliner]: procedures = 127, calls = 49, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 173 [2024-11-09 08:02:48,287 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 08:02:48,288 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 08:02:48,288 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 08:02:48,288 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 08:02:48,302 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:02:48" (1/1) ... [2024-11-09 08:02:48,302 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:02:48" (1/1) ... [2024-11-09 08:02:48,312 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:02:48" (1/1) ... [2024-11-09 08:02:48,345 INFO L175 MemorySlicer]: Split 31 memory accesses to 3 slices as follows [2, 21, 8]. 68 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 14 writes are split as follows [0, 13, 1]. [2024-11-09 08:02:48,346 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:02:48" (1/1) ... [2024-11-09 08:02:48,346 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:02:48" (1/1) ... [2024-11-09 08:02:48,356 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:02:48" (1/1) ... [2024-11-09 08:02:48,359 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:02:48" (1/1) ... [2024-11-09 08:02:48,361 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:02:48" (1/1) ... [2024-11-09 08:02:48,362 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:02:48" (1/1) ... [2024-11-09 08:02:48,366 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 08:02:48,367 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 08:02:48,367 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 08:02:48,367 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 08:02:48,368 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:02:48" (1/1) ... [2024-11-09 08:02:48,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 08:02:48,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:02:48,400 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 08:02:48,402 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 08:02:48,439 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2024-11-09 08:02:48,439 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2024-11-09 08:02:48,440 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 08:02:48,440 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 08:02:48,440 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-09 08:02:48,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 08:02:48,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 08:02:48,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-09 08:02:48,440 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 08:02:48,441 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 08:02:48,441 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 08:02:48,441 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-09 08:02:48,441 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-09 08:02:48,441 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-09 08:02:48,441 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-09 08:02:48,442 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-09 08:02:48,442 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-09 08:02:48,442 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 08:02:48,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-09 08:02:48,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-09 08:02:48,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-09 08:02:48,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 08:02:48,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 08:02:48,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-09 08:02:48,443 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 08:02:48,443 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 08:02:48,563 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 08:02:48,565 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 08:02:48,582 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2024-11-09 08:02:48,998 INFO L? ?]: Removed 160 outVars from TransFormulas that were not future-live. [2024-11-09 08:02:48,998 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 08:02:49,020 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 08:02:49,022 INFO L316 CfgBuilder]: Removed 5 assume(true) statements. [2024-11-09 08:02:49,022 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 08:02:49 BoogieIcfgContainer [2024-11-09 08:02:49,023 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 08:02:49,025 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 08:02:49,026 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 08:02:49,029 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 08:02:49,029 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 08:02:47" (1/3) ... [2024-11-09 08:02:49,030 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@773b0cdb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 08:02:49, skipping insertion in model container [2024-11-09 08:02:49,030 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:02:48" (2/3) ... [2024-11-09 08:02:49,031 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@773b0cdb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 08:02:49, skipping insertion in model container [2024-11-09 08:02:49,031 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 08:02:49" (3/3) ... [2024-11-09 08:02:49,032 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2n_insert_unequal.i [2024-11-09 08:02:49,049 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 08:02:49,050 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 61 error locations. [2024-11-09 08:02:49,100 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 08:02:49,106 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1d99de59, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 08:02:49,106 INFO L334 AbstractCegarLoop]: Starting to check reachability of 61 error locations. [2024-11-09 08:02:49,111 INFO L276 IsEmpty]: Start isEmpty. Operand has 137 states, 73 states have (on average 2.1232876712328768) internal successors, (155), 135 states have internal predecessors, (155), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:02:49,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-09 08:02:49,118 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:02:49,119 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-09 08:02:49,120 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-09 08:02:49,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:02:49,128 INFO L85 PathProgramCache]: Analyzing trace with hash 33471376, now seen corresponding path program 1 times [2024-11-09 08:02:49,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:02:49,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465452863] [2024-11-09 08:02:49,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:02:49,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:02:49,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:49,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 08:02:49,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:02:49,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465452863] [2024-11-09 08:02:49,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465452863] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:02:49,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:02:49,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 08:02:49,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352970606] [2024-11-09 08:02:49,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:02:49,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 08:02:49,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:02:49,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 08:02:49,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:02:49,457 INFO L87 Difference]: Start difference. First operand has 137 states, 73 states have (on average 2.1232876712328768) internal successors, (155), 135 states have internal predecessors, (155), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:02:49,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:02:49,627 INFO L93 Difference]: Finished difference Result 133 states and 146 transitions. [2024-11-09 08:02:49,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 08:02:49,629 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-09 08:02:49,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:02:49,637 INFO L225 Difference]: With dead ends: 133 [2024-11-09 08:02:49,638 INFO L226 Difference]: Without dead ends: 127 [2024-11-09 08:02:49,639 INFO L431 NwaCegarLoop]: 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 [2024-11-09 08:02:49,644 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 9 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 08:02:49,645 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 209 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 08:02:49,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-11-09 08:02:49,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2024-11-09 08:02:49,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 69 states have (on average 2.0) internal successors, (138), 126 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:02:49,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 138 transitions. [2024-11-09 08:02:49,686 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 138 transitions. Word has length 5 [2024-11-09 08:02:49,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:02:49,687 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 138 transitions. [2024-11-09 08:02:49,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:02:49,687 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 138 transitions. [2024-11-09 08:02:49,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-09 08:02:49,687 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:02:49,688 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-09 08:02:49,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 08:02:49,688 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-09 08:02:49,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:02:49,689 INFO L85 PathProgramCache]: Analyzing trace with hash 33471377, now seen corresponding path program 1 times [2024-11-09 08:02:49,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:02:49,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128094672] [2024-11-09 08:02:49,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:02:49,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:02:49,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:49,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 08:02:49,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:02:49,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128094672] [2024-11-09 08:02:49,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128094672] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:02:49,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:02:49,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 08:02:49,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706486774] [2024-11-09 08:02:49,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:02:49,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 08:02:49,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:02:49,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 08:02:49,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:02:49,807 INFO L87 Difference]: Start difference. First operand 127 states and 138 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:02:49,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:02:49,908 INFO L93 Difference]: Finished difference Result 124 states and 135 transitions. [2024-11-09 08:02:49,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 08:02:49,909 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-09 08:02:49,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:02:49,910 INFO L225 Difference]: With dead ends: 124 [2024-11-09 08:02:49,912 INFO L226 Difference]: Without dead ends: 124 [2024-11-09 08:02:49,912 INFO L431 NwaCegarLoop]: 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 [2024-11-09 08:02:49,913 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 8 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 08:02:49,915 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 201 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 08:02:49,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-11-09 08:02:49,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2024-11-09 08:02:49,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 69 states have (on average 1.9565217391304348) internal successors, (135), 123 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:02:49,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 135 transitions. [2024-11-09 08:02:49,930 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 135 transitions. Word has length 5 [2024-11-09 08:02:49,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:02:49,931 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 135 transitions. [2024-11-09 08:02:49,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:02:49,931 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 135 transitions. [2024-11-09 08:02:49,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-09 08:02:49,932 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:02:49,932 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:02:49,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 08:02:49,933 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-09 08:02:49,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:02:49,933 INFO L85 PathProgramCache]: Analyzing trace with hash 2100113040, now seen corresponding path program 1 times [2024-11-09 08:02:49,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:02:49,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452170213] [2024-11-09 08:02:49,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:02:49,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:02:49,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:49,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 08:02:49,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:02:49,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452170213] [2024-11-09 08:02:49,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452170213] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:02:49,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:02:49,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 08:02:49,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858434428] [2024-11-09 08:02:49,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:02:49,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 08:02:49,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:02:49,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 08:02:49,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:02:49,995 INFO L87 Difference]: Start difference. First operand 124 states and 135 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:02:50,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:02:50,009 INFO L93 Difference]: Finished difference Result 134 states and 146 transitions. [2024-11-09 08:02:50,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 08:02:50,010 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-09 08:02:50,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:02:50,011 INFO L225 Difference]: With dead ends: 134 [2024-11-09 08:02:50,011 INFO L226 Difference]: Without dead ends: 134 [2024-11-09 08:02:50,011 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:02:50,012 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 10 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 08:02:50,012 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 263 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 08:02:50,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2024-11-09 08:02:50,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 125. [2024-11-09 08:02:50,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 70 states have (on average 1.9428571428571428) internal successors, (136), 124 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:02:50,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 136 transitions. [2024-11-09 08:02:50,020 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 136 transitions. Word has length 7 [2024-11-09 08:02:50,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:02:50,021 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 136 transitions. [2024-11-09 08:02:50,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:02:50,021 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 136 transitions. [2024-11-09 08:02:50,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-09 08:02:50,022 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:02:50,022 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:02:50,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 08:02:50,022 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-09 08:02:50,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:02:50,023 INFO L85 PathProgramCache]: Analyzing trace with hash 638916372, now seen corresponding path program 1 times [2024-11-09 08:02:50,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:02:50,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539401553] [2024-11-09 08:02:50,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:02:50,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:02:50,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:50,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 08:02:50,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:02:50,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539401553] [2024-11-09 08:02:50,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539401553] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:02:50,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:02:50,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 08:02:50,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588913318] [2024-11-09 08:02:50,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:02:50,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 08:02:50,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:02:50,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 08:02:50,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:02:50,091 INFO L87 Difference]: Start difference. First operand 125 states and 136 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:02:50,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:02:50,111 INFO L93 Difference]: Finished difference Result 130 states and 141 transitions. [2024-11-09 08:02:50,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 08:02:50,112 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-09 08:02:50,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:02:50,113 INFO L225 Difference]: With dead ends: 130 [2024-11-09 08:02:50,113 INFO L226 Difference]: Without dead ends: 130 [2024-11-09 08:02:50,113 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:02:50,114 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 0 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 08:02:50,116 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 258 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 08:02:50,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-11-09 08:02:50,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2024-11-09 08:02:50,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 75 states have (on average 1.88) internal successors, (141), 129 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:02:50,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 141 transitions. [2024-11-09 08:02:50,123 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 141 transitions. Word has length 9 [2024-11-09 08:02:50,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:02:50,123 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 141 transitions. [2024-11-09 08:02:50,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:02:50,123 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 141 transitions. [2024-11-09 08:02:50,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-09 08:02:50,124 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:02:50,124 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:02:50,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 08:02:50,124 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-09 08:02:50,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:02:50,125 INFO L85 PathProgramCache]: Analyzing trace with hash -763066913, now seen corresponding path program 1 times [2024-11-09 08:02:50,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:02:50,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147281774] [2024-11-09 08:02:50,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:02:50,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:02:50,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:50,217 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 08:02:50,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:02:50,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147281774] [2024-11-09 08:02:50,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147281774] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:02:50,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1672922999] [2024-11-09 08:02:50,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:02:50,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:02:50,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:02:50,220 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 08:02:50,222 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 08:02:50,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:50,344 INFO L255 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 08:02:50,348 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:02:50,398 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 08:02:50,399 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 08:02:50,435 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 08:02:50,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1672922999] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 08:02:50,435 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 08:02:50,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2024-11-09 08:02:50,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133854336] [2024-11-09 08:02:50,436 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 08:02:50,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 08:02:50,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:02:50,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 08:02:50,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-09 08:02:50,442 INFO L87 Difference]: Start difference. First operand 130 states and 141 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:02:50,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:02:50,468 INFO L93 Difference]: Finished difference Result 132 states and 143 transitions. [2024-11-09 08:02:50,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 08:02:50,469 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-11-09 08:02:50,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:02:50,470 INFO L225 Difference]: With dead ends: 132 [2024-11-09 08:02:50,473 INFO L226 Difference]: Without dead ends: 132 [2024-11-09 08:02:50,473 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-09 08:02:50,474 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 10 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 08:02:50,474 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 384 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 08:02:50,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-11-09 08:02:50,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2024-11-09 08:02:50,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 77 states have (on average 1.8571428571428572) internal successors, (143), 131 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:02:50,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 143 transitions. [2024-11-09 08:02:50,480 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 143 transitions. Word has length 14 [2024-11-09 08:02:50,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:02:50,481 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 143 transitions. [2024-11-09 08:02:50,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:02:50,481 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 143 transitions. [2024-11-09 08:02:50,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-09 08:02:50,481 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:02:50,482 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-11-09 08:02:50,500 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-09 08:02:50,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:02:50,683 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-09 08:02:50,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:02:50,683 INFO L85 PathProgramCache]: Analyzing trace with hash -2097949021, now seen corresponding path program 1 times [2024-11-09 08:02:50,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:02:50,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700897096] [2024-11-09 08:02:50,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:02:50,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:02:50,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:50,868 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 08:02:50,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:02:50,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700897096] [2024-11-09 08:02:50,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700897096] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:02:50,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1896578634] [2024-11-09 08:02:50,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:02:50,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:02:50,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:02:50,872 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 08:02:50,873 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 08:02:50,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:50,981 INFO L255 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 08:02:50,982 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:02:51,007 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 08:02:51,042 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-09 08:02:51,042 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-11-09 08:02:51,068 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 08:02:51,068 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 08:02:51,109 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 08:02:51,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1896578634] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 08:02:51,110 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 08:02:51,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 4 [2024-11-09 08:02:51,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167530742] [2024-11-09 08:02:51,110 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 08:02:51,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 08:02:51,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:02:51,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 08:02:51,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 08:02:51,113 INFO L87 Difference]: Start difference. First operand 132 states and 143 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:02:51,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:02:51,255 INFO L93 Difference]: Finished difference Result 131 states and 142 transitions. [2024-11-09 08:02:51,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 08:02:51,255 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-09 08:02:51,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:02:51,256 INFO L225 Difference]: With dead ends: 131 [2024-11-09 08:02:51,256 INFO L226 Difference]: Without dead ends: 131 [2024-11-09 08:02:51,257 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-09 08:02:51,259 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 5 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 08:02:51,259 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 260 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 08:02:51,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-11-09 08:02:51,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2024-11-09 08:02:51,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 77 states have (on average 1.844155844155844) internal successors, (142), 130 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:02:51,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 142 transitions. [2024-11-09 08:02:51,271 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 142 transitions. Word has length 16 [2024-11-09 08:02:51,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:02:51,271 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 142 transitions. [2024-11-09 08:02:51,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:02:51,272 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 142 transitions. [2024-11-09 08:02:51,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-09 08:02:51,272 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:02:51,272 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-11-09 08:02:51,293 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-09 08:02:51,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-09 08:02:51,473 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-09 08:02:51,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:02:51,474 INFO L85 PathProgramCache]: Analyzing trace with hash -2097949020, now seen corresponding path program 1 times [2024-11-09 08:02:51,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:02:51,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122798047] [2024-11-09 08:02:51,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:02:51,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:02:51,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:51,704 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 08:02:51,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:02:51,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122798047] [2024-11-09 08:02:51,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122798047] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:02:51,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1886509506] [2024-11-09 08:02:51,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:02:51,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:02:51,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:02:51,707 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 08:02:51,708 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 08:02:51,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:51,818 INFO L255 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 08:02:51,819 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:02:51,834 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-09 08:02:51,903 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-09 08:02:51,903 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-11-09 08:02:51,952 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 08:02:51,952 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 08:02:52,188 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 08:02:52,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1886509506] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 08:02:52,188 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 08:02:52,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 3, 4] total 10 [2024-11-09 08:02:52,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79838244] [2024-11-09 08:02:52,189 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 08:02:52,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 08:02:52,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:02:52,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 08:02:52,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-11-09 08:02:52,191 INFO L87 Difference]: Start difference. First operand 131 states and 142 transitions. Second operand has 11 states, 10 states have (on average 3.8) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:02:52,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:02:52,445 INFO L93 Difference]: Finished difference Result 130 states and 141 transitions. [2024-11-09 08:02:52,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 08:02:52,445 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.8) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-09 08:02:52,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:02:52,446 INFO L225 Difference]: With dead ends: 130 [2024-11-09 08:02:52,446 INFO L226 Difference]: Without dead ends: 130 [2024-11-09 08:02:52,446 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2024-11-09 08:02:52,447 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 17 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 08:02:52,447 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 528 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 08:02:52,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-11-09 08:02:52,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2024-11-09 08:02:52,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 77 states have (on average 1.8311688311688312) internal successors, (141), 129 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:02:52,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 141 transitions. [2024-11-09 08:02:52,455 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 141 transitions. Word has length 16 [2024-11-09 08:02:52,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:02:52,455 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 141 transitions. [2024-11-09 08:02:52,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.8) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:02:52,456 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 141 transitions. [2024-11-09 08:02:52,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-09 08:02:52,457 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:02:52,457 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:02:52,476 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-09 08:02:52,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:02:52,658 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-09 08:02:52,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:02:52,658 INFO L85 PathProgramCache]: Analyzing trace with hash -1307957328, now seen corresponding path program 2 times [2024-11-09 08:02:52,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:02:52,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426849472] [2024-11-09 08:02:52,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:02:52,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:02:52,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:52,734 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 08:02:52,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:02:52,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426849472] [2024-11-09 08:02:52,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426849472] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:02:52,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2137919824] [2024-11-09 08:02:52,736 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 08:02:52,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:02:52,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:02:52,738 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 08:02:52,739 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 08:02:52,842 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-09 08:02:52,842 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 08:02:52,843 INFO L255 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 08:02:52,845 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:02:52,850 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 08:02:52,857 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-09 08:02:52,857 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 08:02:52,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2137919824] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:02:52,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 08:02:52,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2024-11-09 08:02:52,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422783594] [2024-11-09 08:02:52,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:02:52,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 08:02:52,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:02:52,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 08:02:52,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 08:02:52,859 INFO L87 Difference]: Start difference. First operand 130 states and 141 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:02:52,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:02:52,948 INFO L93 Difference]: Finished difference Result 127 states and 138 transitions. [2024-11-09 08:02:52,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 08:02:52,948 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-11-09 08:02:52,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:02:52,949 INFO L225 Difference]: With dead ends: 127 [2024-11-09 08:02:52,949 INFO L226 Difference]: Without dead ends: 127 [2024-11-09 08:02:52,949 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 08:02:52,950 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 3 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 08:02:52,950 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 189 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 08:02:52,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-11-09 08:02:52,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2024-11-09 08:02:52,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 77 states have (on average 1.7922077922077921) internal successors, (138), 126 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:02:52,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 138 transitions. [2024-11-09 08:02:52,963 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 138 transitions. Word has length 21 [2024-11-09 08:02:52,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:02:52,963 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 138 transitions. [2024-11-09 08:02:52,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:02:52,964 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 138 transitions. [2024-11-09 08:02:52,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-09 08:02:52,968 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:02:52,968 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:02:52,983 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-09 08:02:53,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:02:53,169 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-09 08:02:53,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:02:53,170 INFO L85 PathProgramCache]: Analyzing trace with hash -1307957327, now seen corresponding path program 1 times [2024-11-09 08:02:53,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:02:53,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622914144] [2024-11-09 08:02:53,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:02:53,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:02:53,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:53,255 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 08:02:53,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:02:53,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622914144] [2024-11-09 08:02:53,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622914144] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:02:53,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [993833682] [2024-11-09 08:02:53,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:02:53,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:02:53,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:02:53,258 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 08:02:53,259 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-09 08:02:53,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:53,383 INFO L255 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 08:02:53,385 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:02:53,404 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 08:02:53,404 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 08:02:53,422 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 08:02:53,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [993833682] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 08:02:53,422 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 08:02:53,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2024-11-09 08:02:53,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809324965] [2024-11-09 08:02:53,423 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 08:02:53,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 08:02:53,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:02:53,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 08:02:53,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 08:02:53,424 INFO L87 Difference]: Start difference. First operand 127 states and 138 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:02:53,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:02:53,458 INFO L93 Difference]: Finished difference Result 127 states and 137 transitions. [2024-11-09 08:02:53,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 08:02:53,459 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-11-09 08:02:53,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:02:53,459 INFO L225 Difference]: With dead ends: 127 [2024-11-09 08:02:53,460 INFO L226 Difference]: Without dead ends: 127 [2024-11-09 08:02:53,460 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 08:02:53,460 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 4 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 08:02:53,461 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 359 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 08:02:53,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-11-09 08:02:53,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2024-11-09 08:02:53,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 77 states have (on average 1.7792207792207793) internal successors, (137), 126 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:02:53,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 137 transitions. [2024-11-09 08:02:53,464 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 137 transitions. Word has length 21 [2024-11-09 08:02:53,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:02:53,464 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 137 transitions. [2024-11-09 08:02:53,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:02:53,465 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 137 transitions. [2024-11-09 08:02:53,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-09 08:02:53,465 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:02:53,465 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:02:53,483 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-09 08:02:53,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:02:53,666 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-09 08:02:53,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:02:53,667 INFO L85 PathProgramCache]: Analyzing trace with hash 2020822092, now seen corresponding path program 1 times [2024-11-09 08:02:53,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:02:53,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940928275] [2024-11-09 08:02:53,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:02:53,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:02:53,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:53,765 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-09 08:02:53,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:02:53,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940928275] [2024-11-09 08:02:53,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940928275] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:02:53,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:02:53,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 08:02:53,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499384702] [2024-11-09 08:02:53,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:02:53,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 08:02:53,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:02:53,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 08:02:53,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:02:53,770 INFO L87 Difference]: Start difference. First operand 127 states and 137 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:02:53,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:02:53,843 INFO L93 Difference]: Finished difference Result 124 states and 134 transitions. [2024-11-09 08:02:53,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 08:02:53,844 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-11-09 08:02:53,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:02:53,844 INFO L225 Difference]: With dead ends: 124 [2024-11-09 08:02:53,844 INFO L226 Difference]: Without dead ends: 124 [2024-11-09 08:02:53,845 INFO L431 NwaCegarLoop]: 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 [2024-11-09 08:02:53,845 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 3 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 08:02:53,845 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 193 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 08:02:53,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-11-09 08:02:53,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2024-11-09 08:02:53,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 77 states have (on average 1.7402597402597402) internal successors, (134), 123 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:02:53,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 134 transitions. [2024-11-09 08:02:53,850 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 134 transitions. Word has length 22 [2024-11-09 08:02:53,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:02:53,852 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 134 transitions. [2024-11-09 08:02:53,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:02:53,852 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 134 transitions. [2024-11-09 08:02:53,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-09 08:02:53,853 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:02:53,853 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:02:53,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 08:02:53,853 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-09 08:02:53,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:02:53,854 INFO L85 PathProgramCache]: Analyzing trace with hash 157247510, now seen corresponding path program 1 times [2024-11-09 08:02:53,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:02:53,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062638892] [2024-11-09 08:02:53,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:02:53,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:02:53,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:54,165 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 08:02:54,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:02:54,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062638892] [2024-11-09 08:02:54,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062638892] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:02:54,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1426789792] [2024-11-09 08:02:54,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:02:54,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:02:54,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:02:54,169 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 08:02:54,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-09 08:02:54,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:54,308 INFO L255 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-09 08:02:54,311 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:02:54,319 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 08:02:54,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 08:02:54,336 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-09 08:02:54,356 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-09 08:02:54,357 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-11-09 08:02:54,388 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-09 08:02:54,388 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-11-09 08:02:54,407 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-09 08:02:54,407 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 08:02:54,494 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-09 08:02:54,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1426789792] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 08:02:54,495 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 08:02:54,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 8 [2024-11-09 08:02:54,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418447666] [2024-11-09 08:02:54,495 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 08:02:54,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 08:02:54,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:02:54,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 08:02:54,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-09 08:02:54,496 INFO L87 Difference]: Start difference. First operand 124 states and 134 transitions. Second operand has 9 states, 8 states have (on average 5.25) internal successors, (42), 9 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:02:54,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:02:54,680 INFO L93 Difference]: Finished difference Result 130 states and 141 transitions. [2024-11-09 08:02:54,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 08:02:54,680 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.25) internal successors, (42), 9 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-11-09 08:02:54,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:02:54,681 INFO L225 Difference]: With dead ends: 130 [2024-11-09 08:02:54,681 INFO L226 Difference]: Without dead ends: 130 [2024-11-09 08:02:54,681 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 50 SyntacticMatches, 4 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2024-11-09 08:02:54,682 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 284 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 08:02:54,682 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 226 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 08:02:54,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-11-09 08:02:54,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 117. [2024-11-09 08:02:54,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 77 states have (on average 1.6493506493506493) internal successors, (127), 116 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:02:54,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 127 transitions. [2024-11-09 08:02:54,685 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 127 transitions. Word has length 27 [2024-11-09 08:02:54,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:02:54,685 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 127 transitions. [2024-11-09 08:02:54,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.25) internal successors, (42), 9 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:02:54,686 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 127 transitions. [2024-11-09 08:02:54,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-09 08:02:54,686 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:02:54,686 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:02:54,704 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-09 08:02:54,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:02:54,888 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-09 08:02:54,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:02:54,889 INFO L85 PathProgramCache]: Analyzing trace with hash 157247511, now seen corresponding path program 1 times [2024-11-09 08:02:54,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:02:54,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099692863] [2024-11-09 08:02:54,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:02:54,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:02:54,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:55,333 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 08:02:55,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:02:55,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099692863] [2024-11-09 08:02:55,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099692863] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:02:55,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [722386282] [2024-11-09 08:02:55,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:02:55,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:02:55,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:02:55,336 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 08:02:55,338 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-09 08:02:55,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:55,480 INFO L255 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-09 08:02:55,483 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:02:55,489 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-09 08:02:55,520 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 08:02:55,522 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-09 08:02:55,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 08:02:55,592 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-09 08:02:55,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 08:02:55,665 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-09 08:02:55,699 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-09 08:02:55,699 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 08:02:55,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [722386282] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:02:55,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 08:02:55,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2024-11-09 08:02:55,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201499484] [2024-11-09 08:02:55,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:02:55,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 08:02:55,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:02:55,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 08:02:55,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-09 08:02:55,701 INFO L87 Difference]: Start difference. First operand 117 states and 127 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:02:55,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:02:55,809 INFO L93 Difference]: Finished difference Result 111 states and 121 transitions. [2024-11-09 08:02:55,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 08:02:55,809 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-11-09 08:02:55,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:02:55,810 INFO L225 Difference]: With dead ends: 111 [2024-11-09 08:02:55,810 INFO L226 Difference]: Without dead ends: 111 [2024-11-09 08:02:55,810 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2024-11-09 08:02:55,811 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 121 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 08:02:55,811 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 125 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 08:02:55,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-09 08:02:55,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 110. [2024-11-09 08:02:55,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 77 states have (on average 1.5584415584415585) internal successors, (120), 109 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:02:55,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 120 transitions. [2024-11-09 08:02:55,813 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 120 transitions. Word has length 27 [2024-11-09 08:02:55,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:02:55,814 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 120 transitions. [2024-11-09 08:02:55,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:02:55,814 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 120 transitions. [2024-11-09 08:02:55,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-09 08:02:55,814 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:02:55,815 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:02:55,832 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-09 08:02:56,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:02:56,019 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-09 08:02:56,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:02:56,019 INFO L85 PathProgramCache]: Analyzing trace with hash -1248708524, now seen corresponding path program 1 times [2024-11-09 08:02:56,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:02:56,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133762638] [2024-11-09 08:02:56,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:02:56,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:02:56,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:56,287 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 08:02:56,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:02:56,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133762638] [2024-11-09 08:02:56,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133762638] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:02:56,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:02:56,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 08:02:56,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795607250] [2024-11-09 08:02:56,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:02:56,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 08:02:56,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:02:56,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 08:02:56,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-09 08:02:56,288 INFO L87 Difference]: Start difference. First operand 110 states and 120 transitions. Second operand has 9 states, 8 states have (on average 3.75) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:02:56,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:02:56,568 INFO L93 Difference]: Finished difference Result 139 states and 155 transitions. [2024-11-09 08:02:56,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 08:02:56,569 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.75) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2024-11-09 08:02:56,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:02:56,569 INFO L225 Difference]: With dead ends: 139 [2024-11-09 08:02:56,570 INFO L226 Difference]: Without dead ends: 139 [2024-11-09 08:02:56,570 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-11-09 08:02:56,570 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 103 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 429 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 08:02:56,571 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 411 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 429 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 08:02:56,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2024-11-09 08:02:56,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 118. [2024-11-09 08:02:56,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 85 states have (on average 1.6352941176470588) internal successors, (139), 117 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:02:56,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 139 transitions. [2024-11-09 08:02:56,574 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 139 transitions. Word has length 30 [2024-11-09 08:02:56,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:02:56,574 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 139 transitions. [2024-11-09 08:02:56,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.75) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:02:56,574 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 139 transitions. [2024-11-09 08:02:56,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-09 08:02:56,575 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:02:56,575 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:02:56,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 08:02:56,575 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-09 08:02:56,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:02:56,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1248708523, now seen corresponding path program 1 times [2024-11-09 08:02:56,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:02:56,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317789745] [2024-11-09 08:02:56,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:02:56,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:02:56,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:56,968 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 08:02:56,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:02:56,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317789745] [2024-11-09 08:02:56,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317789745] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:02:56,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:02:56,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 08:02:56,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942732059] [2024-11-09 08:02:56,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:02:56,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 08:02:56,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:02:56,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 08:02:56,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-09 08:02:56,971 INFO L87 Difference]: Start difference. First operand 118 states and 139 transitions. Second operand has 8 states, 7 states have (on average 4.285714285714286) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:02:57,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:02:57,244 INFO L93 Difference]: Finished difference Result 139 states and 153 transitions. [2024-11-09 08:02:57,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 08:02:57,244 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.285714285714286) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2024-11-09 08:02:57,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:02:57,245 INFO L225 Difference]: With dead ends: 139 [2024-11-09 08:02:57,245 INFO L226 Difference]: Without dead ends: 139 [2024-11-09 08:02:57,246 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-11-09 08:02:57,246 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 100 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 08:02:57,246 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 409 Invalid, 358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 08:02:57,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2024-11-09 08:02:57,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 118. [2024-11-09 08:02:57,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 85 states have (on average 1.611764705882353) internal successors, (137), 117 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:02:57,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 137 transitions. [2024-11-09 08:02:57,249 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 137 transitions. Word has length 30 [2024-11-09 08:02:57,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:02:57,249 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 137 transitions. [2024-11-09 08:02:57,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.285714285714286) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:02:57,250 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 137 transitions. [2024-11-09 08:02:57,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-09 08:02:57,250 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:02:57,251 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:02:57,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 08:02:57,251 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-09 08:02:57,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:02:57,251 INFO L85 PathProgramCache]: Analyzing trace with hash -55260162, now seen corresponding path program 1 times [2024-11-09 08:02:57,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:02:57,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750924286] [2024-11-09 08:02:57,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:02:57,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:02:57,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:57,311 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-09 08:02:57,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:02:57,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750924286] [2024-11-09 08:02:57,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750924286] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:02:57,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:02:57,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 08:02:57,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213914859] [2024-11-09 08:02:57,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:02:57,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 08:02:57,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:02:57,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 08:02:57,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:02:57,313 INFO L87 Difference]: Start difference. First operand 118 states and 137 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:02:57,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:02:57,326 INFO L93 Difference]: Finished difference Result 113 states and 124 transitions. [2024-11-09 08:02:57,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 08:02:57,326 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2024-11-09 08:02:57,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:02:57,327 INFO L225 Difference]: With dead ends: 113 [2024-11-09 08:02:57,327 INFO L226 Difference]: Without dead ends: 113 [2024-11-09 08:02:57,327 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:02:57,328 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 0 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 08:02:57,328 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 213 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 08:02:57,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-09 08:02:57,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2024-11-09 08:02:57,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 80 states have (on average 1.55) internal successors, (124), 112 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:02:57,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 124 transitions. [2024-11-09 08:02:57,331 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 124 transitions. Word has length 31 [2024-11-09 08:02:57,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:02:57,331 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 124 transitions. [2024-11-09 08:02:57,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:02:57,331 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 124 transitions. [2024-11-09 08:02:57,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-09 08:02:57,332 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:02:57,332 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:02:57,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 08:02:57,332 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-09 08:02:57,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:02:57,333 INFO L85 PathProgramCache]: Analyzing trace with hash -1713045098, now seen corresponding path program 1 times [2024-11-09 08:02:57,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:02:57,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366819219] [2024-11-09 08:02:57,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:02:57,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:02:57,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:57,422 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-09 08:02:57,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:02:57,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366819219] [2024-11-09 08:02:57,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366819219] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:02:57,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:02:57,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 08:02:57,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218625275] [2024-11-09 08:02:57,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:02:57,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 08:02:57,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:02:57,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 08:02:57,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 08:02:57,426 INFO L87 Difference]: Start difference. First operand 113 states and 124 transitions. Second operand has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:02:57,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:02:57,546 INFO L93 Difference]: Finished difference Result 111 states and 122 transitions. [2024-11-09 08:02:57,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 08:02:57,546 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2024-11-09 08:02:57,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:02:57,548 INFO L225 Difference]: With dead ends: 111 [2024-11-09 08:02:57,548 INFO L226 Difference]: Without dead ends: 111 [2024-11-09 08:02:57,548 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 08:02:57,549 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 26 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 08:02:57,550 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 242 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 08:02:57,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-09 08:02:57,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 110. [2024-11-09 08:02:57,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 80 states have (on average 1.5125) internal successors, (121), 109 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:02:57,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 121 transitions. [2024-11-09 08:02:57,553 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 121 transitions. Word has length 32 [2024-11-09 08:02:57,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:02:57,553 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 121 transitions. [2024-11-09 08:02:57,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:02:57,554 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 121 transitions. [2024-11-09 08:02:57,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-09 08:02:57,557 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:02:57,557 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:02:57,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-09 08:02:57,557 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-09 08:02:57,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:02:57,558 INFO L85 PathProgramCache]: Analyzing trace with hash -1713045097, now seen corresponding path program 1 times [2024-11-09 08:02:57,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:02:57,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910486427] [2024-11-09 08:02:57,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:02:57,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:02:57,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:57,787 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 08:02:57,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:02:57,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910486427] [2024-11-09 08:02:57,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910486427] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:02:57,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1803290034] [2024-11-09 08:02:57,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:02:57,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:02:57,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:02:57,790 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 08:02:57,792 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-09 08:02:57,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:57,984 INFO L255 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 08:02:57,986 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:02:58,032 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-09 08:02:58,032 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 08:02:58,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1803290034] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:02:58,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 08:02:58,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2024-11-09 08:02:58,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971561961] [2024-11-09 08:02:58,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:02:58,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 08:02:58,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:02:58,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 08:02:58,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 08:02:58,035 INFO L87 Difference]: Start difference. First operand 110 states and 121 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:02:58,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:02:58,053 INFO L93 Difference]: Finished difference Result 113 states and 122 transitions. [2024-11-09 08:02:58,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 08:02:58,054 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2024-11-09 08:02:58,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:02:58,055 INFO L225 Difference]: With dead ends: 113 [2024-11-09 08:02:58,055 INFO L226 Difference]: Without dead ends: 113 [2024-11-09 08:02:58,055 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-09 08:02:58,056 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 84 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 08:02:58,056 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 217 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 08:02:58,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-09 08:02:58,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 109. [2024-11-09 08:02:58,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 79 states have (on average 1.5063291139240507) internal successors, (119), 108 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:02:58,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 119 transitions. [2024-11-09 08:02:58,059 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 119 transitions. Word has length 32 [2024-11-09 08:02:58,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:02:58,059 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 119 transitions. [2024-11-09 08:02:58,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:02:58,060 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 119 transitions. [2024-11-09 08:02:58,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-09 08:02:58,060 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:02:58,060 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:02:58,079 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-09 08:02:58,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-09 08:02:58,262 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-09 08:02:58,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:02:58,263 INFO L85 PathProgramCache]: Analyzing trace with hash -1563834333, now seen corresponding path program 1 times [2024-11-09 08:02:58,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:02:58,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889830126] [2024-11-09 08:02:58,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:02:58,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:02:58,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:58,433 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 08:02:58,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:02:58,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889830126] [2024-11-09 08:02:58,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889830126] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:02:58,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1053152094] [2024-11-09 08:02:58,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:02:58,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:02:58,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:02:58,436 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 08:02:58,438 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-09 08:02:58,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:58,611 INFO L255 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 08:02:58,613 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:02:58,652 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-09 08:02:58,653 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 08:02:58,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1053152094] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:02:58,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 08:02:58,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 6 [2024-11-09 08:02:58,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613222759] [2024-11-09 08:02:58,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:02:58,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 08:02:58,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:02:58,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 08:02:58,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 08:02:58,654 INFO L87 Difference]: Start difference. First operand 109 states and 119 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:02:58,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:02:58,675 INFO L93 Difference]: Finished difference Result 110 states and 118 transitions. [2024-11-09 08:02:58,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 08:02:58,675 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2024-11-09 08:02:58,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:02:58,676 INFO L225 Difference]: With dead ends: 110 [2024-11-09 08:02:58,676 INFO L226 Difference]: Without dead ends: 110 [2024-11-09 08:02:58,676 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-11-09 08:02:58,677 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 77 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 08:02:58,677 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 223 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 08:02:58,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-11-09 08:02:58,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 106. [2024-11-09 08:02:58,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 78 states have (on average 1.4743589743589745) internal successors, (115), 105 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:02:58,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 115 transitions. [2024-11-09 08:02:58,679 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 115 transitions. Word has length 33 [2024-11-09 08:02:58,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:02:58,679 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 115 transitions. [2024-11-09 08:02:58,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:02:58,680 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 115 transitions. [2024-11-09 08:02:58,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-09 08:02:58,680 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:02:58,680 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:02:58,697 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-09 08:02:58,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-09 08:02:58,881 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-09 08:02:58,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:02:58,882 INFO L85 PathProgramCache]: Analyzing trace with hash -1234225649, now seen corresponding path program 1 times [2024-11-09 08:02:58,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:02:58,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167856875] [2024-11-09 08:02:58,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:02:58,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:02:58,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:58,972 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-09 08:02:58,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:02:58,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167856875] [2024-11-09 08:02:58,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167856875] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:02:58,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:02:58,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 08:02:58,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732532132] [2024-11-09 08:02:58,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:02:58,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 08:02:58,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:02:58,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 08:02:58,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 08:02:58,974 INFO L87 Difference]: Start difference. First operand 106 states and 115 transitions. Second operand has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:02:59,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:02:59,067 INFO L93 Difference]: Finished difference Result 105 states and 114 transitions. [2024-11-09 08:02:59,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 08:02:59,067 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2024-11-09 08:02:59,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:02:59,068 INFO L225 Difference]: With dead ends: 105 [2024-11-09 08:02:59,068 INFO L226 Difference]: Without dead ends: 105 [2024-11-09 08:02:59,068 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 08:02:59,069 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 2 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 08:02:59,069 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 205 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 08:02:59,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-11-09 08:02:59,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2024-11-09 08:02:59,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 78 states have (on average 1.4615384615384615) internal successors, (114), 104 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:02:59,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 114 transitions. [2024-11-09 08:02:59,071 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 114 transitions. Word has length 34 [2024-11-09 08:02:59,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:02:59,072 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 114 transitions. [2024-11-09 08:02:59,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:02:59,072 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 114 transitions. [2024-11-09 08:02:59,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-09 08:02:59,072 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:02:59,072 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:02:59,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-09 08:02:59,073 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-09 08:02:59,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:02:59,073 INFO L85 PathProgramCache]: Analyzing trace with hash -1234225648, now seen corresponding path program 1 times [2024-11-09 08:02:59,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:02:59,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264556859] [2024-11-09 08:02:59,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:02:59,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:02:59,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:59,301 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 08:02:59,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:02:59,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264556859] [2024-11-09 08:02:59,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264556859] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:02:59,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1960741218] [2024-11-09 08:02:59,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:02:59,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:02:59,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:02:59,303 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 08:02:59,305 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-09 08:02:59,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:59,510 INFO L255 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 08:02:59,512 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:02:59,554 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-09 08:02:59,554 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 08:02:59,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1960741218] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:02:59,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 08:02:59,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 11 [2024-11-09 08:02:59,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653800907] [2024-11-09 08:02:59,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:02:59,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 08:02:59,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:02:59,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 08:02:59,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2024-11-09 08:02:59,556 INFO L87 Difference]: Start difference. First operand 105 states and 114 transitions. Second operand has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:02:59,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:02:59,629 INFO L93 Difference]: Finished difference Result 104 states and 113 transitions. [2024-11-09 08:02:59,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 08:02:59,630 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2024-11-09 08:02:59,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:02:59,630 INFO L225 Difference]: With dead ends: 104 [2024-11-09 08:02:59,630 INFO L226 Difference]: Without dead ends: 104 [2024-11-09 08:02:59,631 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2024-11-09 08:02:59,632 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 2 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 08:02:59,632 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 243 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 08:02:59,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-09 08:02:59,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2024-11-09 08:02:59,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 78 states have (on average 1.4487179487179487) internal successors, (113), 103 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:02:59,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 113 transitions. [2024-11-09 08:02:59,639 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 113 transitions. Word has length 34 [2024-11-09 08:02:59,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:02:59,639 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 113 transitions. [2024-11-09 08:02:59,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:02:59,639 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 113 transitions. [2024-11-09 08:02:59,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-09 08:02:59,639 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:02:59,640 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:02:59,660 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-11-09 08:02:59,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:02:59,840 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-09 08:02:59,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:02:59,841 INFO L85 PathProgramCache]: Analyzing trace with hash 393710610, now seen corresponding path program 1 times [2024-11-09 08:02:59,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:02:59,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995421088] [2024-11-09 08:02:59,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:02:59,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:02:59,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:03:00,007 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-09 08:03:00,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:03:00,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995421088] [2024-11-09 08:03:00,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995421088] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:03:00,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:03:00,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 08:03:00,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765152063] [2024-11-09 08:03:00,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:03:00,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 08:03:00,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:03:00,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 08:03:00,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 08:03:00,011 INFO L87 Difference]: Start difference. First operand 104 states and 113 transitions. Second operand has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:03:00,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:03:00,122 INFO L93 Difference]: Finished difference Result 102 states and 111 transitions. [2024-11-09 08:03:00,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 08:03:00,122 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2024-11-09 08:03:00,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:03:00,123 INFO L225 Difference]: With dead ends: 102 [2024-11-09 08:03:00,123 INFO L226 Difference]: Without dead ends: 102 [2024-11-09 08:03:00,123 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 08:03:00,124 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 18 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 08:03:00,124 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 245 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 08:03:00,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-11-09 08:03:00,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2024-11-09 08:03:00,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 78 states have (on average 1.4102564102564104) internal successors, (110), 100 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:03:00,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 110 transitions. [2024-11-09 08:03:00,127 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 110 transitions. Word has length 35 [2024-11-09 08:03:00,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:03:00,127 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 110 transitions. [2024-11-09 08:03:00,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:03:00,128 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 110 transitions. [2024-11-09 08:03:00,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-09 08:03:00,128 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:03:00,128 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:03:00,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-09 08:03:00,128 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-09 08:03:00,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:03:00,129 INFO L85 PathProgramCache]: Analyzing trace with hash -522865965, now seen corresponding path program 1 times [2024-11-09 08:03:00,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:03:00,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790919573] [2024-11-09 08:03:00,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:03:00,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:03:00,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:03:00,932 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 08:03:00,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:03:00,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790919573] [2024-11-09 08:03:00,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790919573] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:03:00,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1841978778] [2024-11-09 08:03:00,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:03:00,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:03:00,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:03:00,935 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 08:03:00,937 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-09 08:03:01,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:03:01,221 INFO L255 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 66 conjuncts are in the unsatisfiable core [2024-11-09 08:03:01,227 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:03:01,255 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 08:03:01,348 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-09 08:03:01,348 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-09 08:03:01,427 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 08:03:01,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-09 08:03:01,527 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 08:03:01,527 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2024-11-09 08:03:01,676 INFO L349 Elim1Store]: treesize reduction 76, result has 36.1 percent of original size [2024-11-09 08:03:01,676 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 52 [2024-11-09 08:03:01,745 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 33 [2024-11-09 08:03:01,773 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 33 [2024-11-09 08:03:01,797 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 33 [2024-11-09 08:03:01,877 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 26 [2024-11-09 08:03:01,971 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-09 08:03:02,077 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 08:03:02,077 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 08:03:02,265 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 26 [2024-11-09 08:03:02,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2024-11-09 08:03:05,881 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 08:03:05,882 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 41 [2024-11-09 08:03:05,888 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 78 [2024-11-09 08:03:05,892 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 66 [2024-11-09 08:03:05,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 30 [2024-11-09 08:03:06,266 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 08:03:06,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1841978778] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 08:03:06,267 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 08:03:06,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15, 15] total 45 [2024-11-09 08:03:06,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580654769] [2024-11-09 08:03:06,267 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 08:03:06,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2024-11-09 08:03:06,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:03:06,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2024-11-09 08:03:06,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=1871, Unknown=15, NotChecked=0, Total=2070 [2024-11-09 08:03:06,272 INFO L87 Difference]: Start difference. First operand 101 states and 110 transitions. Second operand has 46 states, 45 states have (on average 2.4) internal successors, (108), 46 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:03:07,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:03:07,643 INFO L93 Difference]: Finished difference Result 107 states and 116 transitions. [2024-11-09 08:03:07,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-09 08:03:07,643 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 2.4) internal successors, (108), 46 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2024-11-09 08:03:07,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:03:07,644 INFO L225 Difference]: With dead ends: 107 [2024-11-09 08:03:07,644 INFO L226 Difference]: Without dead ends: 107 [2024-11-09 08:03:07,645 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 773 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=314, Invalid=2751, Unknown=15, NotChecked=0, Total=3080 [2024-11-09 08:03:07,646 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 110 mSDsluCounter, 1256 mSDsCounter, 0 mSdLazyCounter, 1768 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 1324 SdHoareTripleChecker+Invalid, 1775 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1768 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-09 08:03:07,646 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 1324 Invalid, 1775 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1768 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-09 08:03:07,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-11-09 08:03:07,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 100. [2024-11-09 08:03:07,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 78 states have (on average 1.3974358974358974) internal successors, (109), 99 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:03:07,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 109 transitions. [2024-11-09 08:03:07,649 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 109 transitions. Word has length 38 [2024-11-09 08:03:07,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:03:07,649 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 109 transitions. [2024-11-09 08:03:07,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 2.4) internal successors, (108), 46 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:03:07,649 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 109 transitions. [2024-11-09 08:03:07,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-09 08:03:07,650 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:03:07,650 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:03:07,669 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-09 08:03:07,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-11-09 08:03:07,851 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-09 08:03:07,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:03:07,851 INFO L85 PathProgramCache]: Analyzing trace with hash -522865964, now seen corresponding path program 1 times [2024-11-09 08:03:07,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:03:07,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613681947] [2024-11-09 08:03:07,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:03:07,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:03:07,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:03:09,070 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 08:03:09,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:03:09,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613681947] [2024-11-09 08:03:09,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613681947] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:03:09,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1361385571] [2024-11-09 08:03:09,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:03:09,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:03:09,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:03:09,071 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 08:03:09,072 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-09 08:03:09,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:03:09,279 INFO L255 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 90 conjuncts are in the unsatisfiable core [2024-11-09 08:03:09,284 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:03:09,308 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 08:03:09,407 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-09 08:03:09,407 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-09 08:03:09,473 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 08:03:09,478 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 08:03:09,540 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-11-09 08:03:09,549 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-11-09 08:03:09,635 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 08:03:09,636 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 57 [2024-11-09 08:03:09,642 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 16 [2024-11-09 08:03:09,897 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-11-09 08:03:09,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2024-11-09 08:03:09,907 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2024-11-09 08:03:10,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 20 [2024-11-09 08:03:10,022 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 38 [2024-11-09 08:03:10,040 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 20 [2024-11-09 08:03:10,049 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 38 [2024-11-09 08:03:10,078 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 20 [2024-11-09 08:03:10,085 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 38 [2024-11-09 08:03:10,245 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 42 [2024-11-09 08:03:10,365 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 16 [2024-11-09 08:03:10,371 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-09 08:03:10,393 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 08:03:10,393 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 08:03:10,715 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 60 [2024-11-09 08:03:10,719 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 48 [2024-11-09 08:03:10,988 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 08:03:10,989 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 121 treesize of output 125 [2024-11-09 08:03:11,213 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse3 0))) (.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse3 0))) (.cse1 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (and (forall ((v_prenex_2 Int)) (or (not (= (select |c_#valid| v_prenex_2) 0)) (forall ((v_prenex_3 (Array Int Int)) (v_ArrVal_1957 (Array Int Int))) (< (select (select (store (store .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3) v_prenex_2 v_ArrVal_1957) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 1))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_24| Int) (v_ArrVal_1950 (Array Int Int)) (v_prenex_1 (Array Int Int))) (or (< 0 (+ 9 (select (select (store (store .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1950) |v_ULTIMATE.start_node_create_~temp~0#1.base_24| v_prenex_1) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1))) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_24|) 0)))) (forall ((v_prenex_2 Int)) (or (forall ((v_ArrVal_1956 (Array Int Int)) (v_ArrVal_1949 (Array Int Int))) (not (= (select (select (store (store .cse2 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1949) v_prenex_2 v_ArrVal_1956) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1) v_prenex_2))) (not (= (select |c_#valid| v_prenex_2) 0)))) (forall ((v_prenex_2 Int)) (or (forall ((v_ArrVal_1956 (Array Int Int)) (v_ArrVal_1949 (Array Int Int))) (= (select (select (store (store .cse2 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1949) v_prenex_2 v_ArrVal_1956) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (not (= (select |c_#valid| v_prenex_2) 0))))))) is different from false [2024-11-09 08:03:11,232 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 08:03:11,233 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 38 [2024-11-09 08:03:11,239 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 08:03:11,239 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 70 [2024-11-09 08:03:11,245 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2024-11-09 08:03:11,248 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 50 [2024-11-09 08:03:11,294 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 08:03:11,294 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 37 [2024-11-09 08:03:11,297 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 08:03:11,301 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 08:03:11,301 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 31 [2024-11-09 08:03:11,304 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2024-11-09 08:03:11,321 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 08:03:11,322 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 38 [2024-11-09 08:03:11,325 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 08:03:11,329 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 08:03:11,330 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 32 [2024-11-09 08:03:11,335 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2024-11-09 08:03:11,345 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 08:03:11,345 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 36 [2024-11-09 08:03:11,349 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 08:03:11,353 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 08:03:11,353 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 28 [2024-11-09 08:03:11,357 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-09 08:03:11,886 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 6 refuted. 1 times theorem prover too weak. 0 trivial. 1 not checked. [2024-11-09 08:03:11,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1361385571] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 08:03:11,887 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 08:03:11,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 15] total 44 [2024-11-09 08:03:11,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683421816] [2024-11-09 08:03:11,887 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 08:03:11,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2024-11-09 08:03:11,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:03:11,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2024-11-09 08:03:11,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=1706, Unknown=30, NotChecked=84, Total=1980 [2024-11-09 08:03:11,890 INFO L87 Difference]: Start difference. First operand 100 states and 109 transitions. Second operand has 45 states, 44 states have (on average 2.340909090909091) internal successors, (103), 45 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:03:14,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:03:14,042 INFO L93 Difference]: Finished difference Result 106 states and 115 transitions. [2024-11-09 08:03:14,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-09 08:03:14,043 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 2.340909090909091) internal successors, (103), 45 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2024-11-09 08:03:14,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:03:14,043 INFO L225 Difference]: With dead ends: 106 [2024-11-09 08:03:14,043 INFO L226 Difference]: Without dead ends: 106 [2024-11-09 08:03:14,044 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 763 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=408, Invalid=3342, Unknown=36, NotChecked=120, Total=3906 [2024-11-09 08:03:14,045 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 114 mSDsluCounter, 1239 mSDsCounter, 0 mSdLazyCounter, 1810 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 1306 SdHoareTripleChecker+Invalid, 1924 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1810 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 104 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-09 08:03:14,045 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 1306 Invalid, 1924 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1810 Invalid, 0 Unknown, 104 Unchecked, 1.2s Time] [2024-11-09 08:03:14,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-09 08:03:14,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 99. [2024-11-09 08:03:14,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 78 states have (on average 1.3846153846153846) internal successors, (108), 98 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:03:14,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 108 transitions. [2024-11-09 08:03:14,049 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 108 transitions. Word has length 38 [2024-11-09 08:03:14,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:03:14,049 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 108 transitions. [2024-11-09 08:03:14,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 2.340909090909091) internal successors, (103), 45 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:03:14,050 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 108 transitions. [2024-11-09 08:03:14,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-09 08:03:14,050 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:03:14,050 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:03:14,071 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-09 08:03:14,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-11-09 08:03:14,251 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-09 08:03:14,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:03:14,252 INFO L85 PathProgramCache]: Analyzing trace with hash 1695206362, now seen corresponding path program 1 times [2024-11-09 08:03:14,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:03:14,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990453591] [2024-11-09 08:03:14,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:03:14,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:03:14,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:03:14,502 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 08:03:14,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:03:14,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990453591] [2024-11-09 08:03:14,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990453591] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:03:14,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1398198413] [2024-11-09 08:03:14,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:03:14,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:03:14,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:03:14,505 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 08:03:14,507 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-09 08:03:14,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:03:14,727 INFO L255 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-09 08:03:14,731 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:03:14,837 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-09 08:03:14,837 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 08:03:14,944 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-09 08:03:14,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1398198413] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 08:03:14,944 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 08:03:14,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 17 [2024-11-09 08:03:14,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539329339] [2024-11-09 08:03:14,944 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 08:03:14,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-09 08:03:14,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:03:14,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-09 08:03:14,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2024-11-09 08:03:14,946 INFO L87 Difference]: Start difference. First operand 99 states and 108 transitions. Second operand has 17 states, 17 states have (on average 4.117647058823529) internal successors, (70), 17 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:03:15,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:03:15,153 INFO L93 Difference]: Finished difference Result 88 states and 95 transitions. [2024-11-09 08:03:15,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 08:03:15,154 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.117647058823529) internal successors, (70), 17 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2024-11-09 08:03:15,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:03:15,154 INFO L225 Difference]: With dead ends: 88 [2024-11-09 08:03:15,154 INFO L226 Difference]: Without dead ends: 88 [2024-11-09 08:03:15,155 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=427, Unknown=0, NotChecked=0, Total=506 [2024-11-09 08:03:15,155 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 28 mSDsluCounter, 737 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 809 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 08:03:15,155 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 809 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 08:03:15,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-09 08:03:15,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2024-11-09 08:03:15,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 69 states have (on average 1.3768115942028984) internal successors, (95), 87 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:03:15,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 95 transitions. [2024-11-09 08:03:15,158 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 95 transitions. Word has length 40 [2024-11-09 08:03:15,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:03:15,158 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 95 transitions. [2024-11-09 08:03:15,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.117647058823529) internal successors, (70), 17 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:03:15,158 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 95 transitions. [2024-11-09 08:03:15,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-09 08:03:15,159 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:03:15,159 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:03:15,177 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-11-09 08:03:15,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-11-09 08:03:15,364 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-09 08:03:15,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:03:15,364 INFO L85 PathProgramCache]: Analyzing trace with hash 1358086886, now seen corresponding path program 1 times [2024-11-09 08:03:15,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:03:15,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683660745] [2024-11-09 08:03:15,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:03:15,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:03:15,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:03:15,576 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 08:03:15,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:03:15,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683660745] [2024-11-09 08:03:15,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683660745] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:03:15,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [739178604] [2024-11-09 08:03:15,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:03:15,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:03:15,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:03:15,580 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 08:03:15,582 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-09 08:03:15,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:03:15,807 INFO L255 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-09 08:03:15,809 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:03:15,896 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-11-09 08:03:15,927 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 08:03:15,927 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 08:03:16,029 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 08:03:16,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [739178604] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-09 08:03:16,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-09 08:03:16,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10, 9] total 15 [2024-11-09 08:03:16,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194772028] [2024-11-09 08:03:16,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:03:16,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 08:03:16,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:03:16,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 08:03:16,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2024-11-09 08:03:16,031 INFO L87 Difference]: Start difference. First operand 88 states and 95 transitions. Second operand has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:03:16,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:03:16,166 INFO L93 Difference]: Finished difference Result 96 states and 106 transitions. [2024-11-09 08:03:16,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 08:03:16,166 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2024-11-09 08:03:16,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:03:16,167 INFO L225 Difference]: With dead ends: 96 [2024-11-09 08:03:16,167 INFO L226 Difference]: Without dead ends: 96 [2024-11-09 08:03:16,167 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2024-11-09 08:03:16,168 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 60 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 08:03:16,168 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 429 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 08:03:16,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-09 08:03:16,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 89. [2024-11-09 08:03:16,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 70 states have (on average 1.3714285714285714) internal successors, (96), 88 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:03:16,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 96 transitions. [2024-11-09 08:03:16,170 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 96 transitions. Word has length 42 [2024-11-09 08:03:16,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:03:16,170 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 96 transitions. [2024-11-09 08:03:16,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:03:16,171 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 96 transitions. [2024-11-09 08:03:16,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-09 08:03:16,171 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:03:16,171 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:03:16,188 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2024-11-09 08:03:16,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:03:16,372 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-09 08:03:16,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:03:16,373 INFO L85 PathProgramCache]: Analyzing trace with hash 1358086933, now seen corresponding path program 1 times [2024-11-09 08:03:16,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:03:16,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799487795] [2024-11-09 08:03:16,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:03:16,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:03:16,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:03:16,581 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-09 08:03:16,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:03:16,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799487795] [2024-11-09 08:03:16,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799487795] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:03:16,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1947854811] [2024-11-09 08:03:16,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:03:16,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:03:16,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:03:16,584 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 08:03:16,586 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-09 08:03:16,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:03:16,816 INFO L255 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-09 08:03:16,819 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:03:16,822 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 08:03:16,877 INFO L349 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2024-11-09 08:03:16,877 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 24 [2024-11-09 08:03:16,902 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-09 08:03:16,905 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 08:03:16,905 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 08:03:16,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1947854811] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:03:16,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 08:03:16,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 12 [2024-11-09 08:03:16,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418853258] [2024-11-09 08:03:16,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:03:16,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 08:03:16,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:03:16,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 08:03:16,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2024-11-09 08:03:16,907 INFO L87 Difference]: Start difference. First operand 89 states and 96 transitions. Second operand has 8 states, 7 states have (on average 6.0) internal successors, (42), 8 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:03:17,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:03:17,058 INFO L93 Difference]: Finished difference Result 91 states and 98 transitions. [2024-11-09 08:03:17,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 08:03:17,059 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.0) internal successors, (42), 8 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2024-11-09 08:03:17,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:03:17,059 INFO L225 Difference]: With dead ends: 91 [2024-11-09 08:03:17,059 INFO L226 Difference]: Without dead ends: 91 [2024-11-09 08:03:17,060 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2024-11-09 08:03:17,060 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 54 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 08:03:17,060 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 266 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 08:03:17,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-09 08:03:17,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 87. [2024-11-09 08:03:17,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 71 states have (on average 1.3380281690140845) internal successors, (95), 86 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:03:17,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 95 transitions. [2024-11-09 08:03:17,063 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 95 transitions. Word has length 42 [2024-11-09 08:03:17,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:03:17,063 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 95 transitions. [2024-11-09 08:03:17,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.0) internal successors, (42), 8 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:03:17,063 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 95 transitions. [2024-11-09 08:03:17,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-09 08:03:17,064 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:03:17,064 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:03:17,080 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2024-11-09 08:03:17,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-11-09 08:03:17,264 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-09 08:03:17,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:03:17,265 INFO L85 PathProgramCache]: Analyzing trace with hash 1358086934, now seen corresponding path program 1 times [2024-11-09 08:03:17,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:03:17,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326443357] [2024-11-09 08:03:17,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:03:17,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:03:17,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:03:17,726 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 08:03:17,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:03:17,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326443357] [2024-11-09 08:03:17,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326443357] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:03:17,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1758791411] [2024-11-09 08:03:17,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:03:17,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:03:17,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:03:17,729 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 08:03:17,731 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-11-09 08:03:17,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:03:17,987 INFO L255 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-09 08:03:17,989 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:03:17,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-09 08:03:18,000 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 08:03:18,100 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 08:03:18,101 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-09 08:03:18,108 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-09 08:03:18,109 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2024-11-09 08:03:18,195 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-09 08:03:18,240 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 08:03:18,240 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 08:03:18,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1758791411] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:03:18,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 08:03:18,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [13] total 19 [2024-11-09 08:03:18,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287371214] [2024-11-09 08:03:18,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:03:18,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 08:03:18,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:03:18,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 08:03:18,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380 [2024-11-09 08:03:18,243 INFO L87 Difference]: Start difference. First operand 87 states and 95 transitions. Second operand has 8 states, 7 states have (on average 6.0) internal successors, (42), 8 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:03:18,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:03:18,435 INFO L93 Difference]: Finished difference Result 89 states and 96 transitions. [2024-11-09 08:03:18,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 08:03:18,436 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.0) internal successors, (42), 8 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2024-11-09 08:03:18,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:03:18,436 INFO L225 Difference]: With dead ends: 89 [2024-11-09 08:03:18,436 INFO L226 Difference]: Without dead ends: 89 [2024-11-09 08:03:18,437 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2024-11-09 08:03:18,437 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 49 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 08:03:18,437 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 259 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 08:03:18,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-09 08:03:18,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2024-11-09 08:03:18,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 73 states have (on average 1.3150684931506849) internal successors, (96), 88 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:03:18,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 96 transitions. [2024-11-09 08:03:18,439 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 96 transitions. Word has length 42 [2024-11-09 08:03:18,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:03:18,440 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 96 transitions. [2024-11-09 08:03:18,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.0) internal successors, (42), 8 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:03:18,440 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 96 transitions. [2024-11-09 08:03:18,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-09 08:03:18,440 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:03:18,440 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:03:18,458 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2024-11-09 08:03:18,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-11-09 08:03:18,641 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-09 08:03:18,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:03:18,641 INFO L85 PathProgramCache]: Analyzing trace with hash 1648469249, now seen corresponding path program 1 times [2024-11-09 08:03:18,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:03:18,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428004445] [2024-11-09 08:03:18,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:03:18,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:03:18,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:03:19,606 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 08:03:19,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:03:19,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428004445] [2024-11-09 08:03:19,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428004445] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:03:19,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1135997407] [2024-11-09 08:03:19,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:03:19,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:03:19,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:03:19,609 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 08:03:19,611 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-11-09 08:03:19,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:03:19,849 INFO L255 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 64 conjuncts are in the unsatisfiable core [2024-11-09 08:03:19,852 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:03:19,854 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 08:03:19,898 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-09 08:03:19,898 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-09 08:03:19,937 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 08:03:19,966 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-09 08:03:19,985 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 08:03:19,986 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2024-11-09 08:03:20,094 INFO L349 Elim1Store]: treesize reduction 72, result has 37.4 percent of original size [2024-11-09 08:03:20,094 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 34 treesize of output 57 [2024-11-09 08:03:20,151 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 33 [2024-11-09 08:03:20,172 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 33 [2024-11-09 08:03:20,192 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 33 [2024-11-09 08:03:20,550 INFO L349 Elim1Store]: treesize reduction 25, result has 47.9 percent of original size [2024-11-09 08:03:20,551 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 50 [2024-11-09 08:03:20,727 INFO L349 Elim1Store]: treesize reduction 25, result has 26.5 percent of original size [2024-11-09 08:03:20,727 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 95 treesize of output 79 [2024-11-09 08:03:20,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-09 08:03:20,852 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 58 [2024-11-09 08:03:21,049 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 80 [2024-11-09 08:03:21,052 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-09 08:03:21,283 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 08:03:21,284 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 81 treesize of output 59 [2024-11-09 08:03:21,913 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 08:03:21,913 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 08:03:23,233 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 35 [2024-11-09 08:03:23,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-09 08:03:27,969 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 08:03:27,970 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 66 treesize of output 57 [2024-11-09 08:03:27,982 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 08:03:27,983 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1416 treesize of output 1398 [2024-11-09 08:03:28,007 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 263 treesize of output 251 [2024-11-09 08:03:28,017 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 257 treesize of output 241 [2024-11-09 08:03:28,034 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 66 [2024-11-09 08:03:28,378 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 08:03:28,379 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 146 treesize of output 138 [2024-11-09 08:03:31,521 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 7 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 08:03:31,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1135997407] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 08:03:31,521 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 08:03:31,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 22, 23] total 60 [2024-11-09 08:03:31,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879489331] [2024-11-09 08:03:31,522 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 08:03:31,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2024-11-09 08:03:31,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:03:31,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2024-11-09 08:03:31,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=3300, Unknown=25, NotChecked=0, Total=3540 [2024-11-09 08:03:31,524 INFO L87 Difference]: Start difference. First operand 89 states and 96 transitions. Second operand has 60 states, 60 states have (on average 2.283333333333333) internal successors, (137), 60 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:03:35,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:03:35,092 INFO L93 Difference]: Finished difference Result 107 states and 115 transitions. [2024-11-09 08:03:35,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-09 08:03:35,093 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 60 states have (on average 2.283333333333333) internal successors, (137), 60 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2024-11-09 08:03:35,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:03:35,093 INFO L225 Difference]: With dead ends: 107 [2024-11-09 08:03:35,093 INFO L226 Difference]: Without dead ends: 107 [2024-11-09 08:03:35,094 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 56 SyntacticMatches, 2 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1286 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=489, Invalid=6292, Unknown=25, NotChecked=0, Total=6806 [2024-11-09 08:03:35,095 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 116 mSDsluCounter, 1211 mSDsCounter, 0 mSdLazyCounter, 2590 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 1251 SdHoareTripleChecker+Invalid, 2617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 2590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-09 08:03:35,095 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 1251 Invalid, 2617 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 2590 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-09 08:03:35,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-11-09 08:03:35,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 93. [2024-11-09 08:03:35,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 77 states have (on average 1.3376623376623376) internal successors, (103), 92 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:03:35,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 103 transitions. [2024-11-09 08:03:35,097 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 103 transitions. Word has length 47 [2024-11-09 08:03:35,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:03:35,098 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 103 transitions. [2024-11-09 08:03:35,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 60 states have (on average 2.283333333333333) internal successors, (137), 60 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:03:35,098 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 103 transitions. [2024-11-09 08:03:35,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-09 08:03:35,099 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:03:35,099 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:03:35,114 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2024-11-09 08:03:35,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-11-09 08:03:35,299 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-09 08:03:35,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:03:35,300 INFO L85 PathProgramCache]: Analyzing trace with hash -769710694, now seen corresponding path program 1 times [2024-11-09 08:03:35,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:03:35,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533576671] [2024-11-09 08:03:35,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:03:35,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:03:35,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:03:36,980 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 08:03:36,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:03:36,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533576671] [2024-11-09 08:03:36,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533576671] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:03:36,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [951535258] [2024-11-09 08:03:36,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:03:36,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:03:36,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:03:36,982 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 08:03:36,983 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-11-09 08:03:37,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:03:37,250 INFO L255 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 100 conjuncts are in the unsatisfiable core [2024-11-09 08:03:37,254 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:03:37,260 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-09 08:03:37,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 08:03:37,345 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-09 08:03:37,346 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-11-09 08:03:37,371 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-09 08:03:37,371 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-09 08:03:37,428 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-09 08:03:37,432 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-09 08:03:37,476 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-11-09 08:03:37,481 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2024-11-09 08:03:37,557 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 08:03:37,557 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2024-11-09 08:03:37,563 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 20 [2024-11-09 08:03:37,728 INFO L349 Elim1Store]: treesize reduction 41, result has 47.4 percent of original size [2024-11-09 08:03:37,729 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 41 [2024-11-09 08:03:37,754 INFO L349 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2024-11-09 08:03:37,754 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 36 [2024-11-09 08:03:37,832 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 51 [2024-11-09 08:03:37,843 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2024-11-09 08:03:37,855 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2024-11-09 08:03:37,861 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 51 [2024-11-09 08:03:37,875 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 51 [2024-11-09 08:03:37,884 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2024-11-09 08:03:38,151 INFO L349 Elim1Store]: treesize reduction 35, result has 48.5 percent of original size [2024-11-09 08:03:38,151 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 60 [2024-11-09 08:03:38,173 INFO L349 Elim1Store]: treesize reduction 104, result has 25.2 percent of original size [2024-11-09 08:03:38,174 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 50 [2024-11-09 08:03:38,308 INFO L349 Elim1Store]: treesize reduction 25, result has 26.5 percent of original size [2024-11-09 08:03:38,308 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 123 treesize of output 107 [2024-11-09 08:03:38,322 INFO L349 Elim1Store]: treesize reduction 25, result has 26.5 percent of original size [2024-11-09 08:03:38,323 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 155 treesize of output 151 [2024-11-09 08:03:38,368 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-09 08:03:38,412 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-09 08:03:38,422 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-09 08:03:38,537 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 82 [2024-11-09 08:03:38,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2024-11-09 08:03:38,628 INFO L349 Elim1Store]: treesize reduction 43, result has 44.9 percent of original size [2024-11-09 08:03:38,628 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 134 treesize of output 94 [2024-11-09 08:03:38,657 INFO L349 Elim1Store]: treesize reduction 104, result has 25.2 percent of original size [2024-11-09 08:03:38,657 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 50 [2024-11-09 08:03:39,003 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 331 treesize of output 259 [2024-11-09 08:03:39,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 263 treesize of output 219 [2024-11-09 08:03:39,459 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 08:03:39,459 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 207 treesize of output 151 [2024-11-09 08:03:39,494 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 08:03:39,495 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 126 treesize of output 166 [2024-11-09 08:03:40,971 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 08:03:40,971 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 08:03:41,644 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (and (forall ((v_ArrVal_3023 (Array Int Int)) (|ULTIMATE.start_dll_insert_~last~0#1.offset| Int) (|ULTIMATE.start_dll_insert_~last~0#1.base| Int)) (<= 0 (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_3023))) (store .cse0 |ULTIMATE.start_dll_insert_~last~0#1.base| (store (select .cse0 |ULTIMATE.start_dll_insert_~last~0#1.base|) (+ |ULTIMATE.start_dll_insert_~last~0#1.offset| 8) |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|))) .cse1) .cse2))) (forall ((v_ArrVal_3022 (Array Int Int)) (v_ArrVal_3023 (Array Int Int)) (|ULTIMATE.start_dll_insert_~last~0#1.offset| Int) (|ULTIMATE.start_dll_insert_~last~0#1.base| Int)) (let ((.cse4 (+ |ULTIMATE.start_dll_insert_~last~0#1.offset| 8))) (<= (+ 4 (select (select (let ((.cse3 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_3023))) (store .cse3 |ULTIMATE.start_dll_insert_~last~0#1.base| (store (select .cse3 |ULTIMATE.start_dll_insert_~last~0#1.base|) .cse4 |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|))) .cse1) .cse2)) (select |c_#length| (select (select (let ((.cse5 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_3022))) (store .cse5 |ULTIMATE.start_dll_insert_~last~0#1.base| (store (select .cse5 |ULTIMATE.start_dll_insert_~last~0#1.base|) .cse4 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|))) .cse1) .cse2))))))) is different from false [2024-11-09 08:03:41,672 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (and (forall ((v_ArrVal_3022 (Array Int Int)) (v_ArrVal_3023 (Array Int Int)) (|ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| Int) (|ULTIMATE.start_dll_insert_~snd_to_last~0#1.offset| Int) (|ULTIMATE.start_dll_insert_~last~0#1.offset| Int) (|ULTIMATE.start_dll_insert_~last~0#1.base| Int)) (let ((.cse1 (+ |ULTIMATE.start_dll_insert_~last~0#1.offset| 8)) (.cse2 (+ 4 |ULTIMATE.start_dll_insert_~snd_to_last~0#1.offset|))) (<= (+ (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_dll_insert_~snd_to_last~0#1.base|) .cse2 |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_3023))) (store .cse0 |ULTIMATE.start_dll_insert_~last~0#1.base| (store (select .cse0 |ULTIMATE.start_dll_insert_~last~0#1.base|) .cse1 |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|))) .cse3) .cse4) 4) (select |c_#length| (select (select (let ((.cse5 (store (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |ULTIMATE.start_dll_insert_~snd_to_last~0#1.base|) .cse2 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_3022))) (store .cse5 |ULTIMATE.start_dll_insert_~last~0#1.base| (store (select .cse5 |ULTIMATE.start_dll_insert_~last~0#1.base|) .cse1 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|))) .cse3) .cse4))))) (forall ((v_ArrVal_3023 (Array Int Int)) (|ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| Int) (|ULTIMATE.start_dll_insert_~snd_to_last~0#1.offset| Int) (|ULTIMATE.start_dll_insert_~last~0#1.offset| Int) (|ULTIMATE.start_dll_insert_~last~0#1.base| Int)) (<= 0 (select (select (let ((.cse6 (store (store |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_dll_insert_~snd_to_last~0#1.base|) (+ 4 |ULTIMATE.start_dll_insert_~snd_to_last~0#1.offset|) |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_3023))) (store .cse6 |ULTIMATE.start_dll_insert_~last~0#1.base| (store (select .cse6 |ULTIMATE.start_dll_insert_~last~0#1.base|) (+ |ULTIMATE.start_dll_insert_~last~0#1.offset| 8) |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|))) .cse3) .cse4))))) is different from false [2024-11-09 08:03:41,783 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (and (forall ((v_ArrVal_3023 (Array Int Int)) (|ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| Int) (|ULTIMATE.start_dll_insert_~snd_to_last~0#1.offset| Int) (|ULTIMATE.start_dll_insert_~last~0#1.offset| Int) (|ULTIMATE.start_dll_insert_~last~0#1.base| Int)) (<= 0 (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_dll_insert_~snd_to_last~0#1.base|) (+ 4 |ULTIMATE.start_dll_insert_~snd_to_last~0#1.offset|) |c_ULTIMATE.start_node_create_#res#1.offset|)) |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_3023))) (store .cse0 |ULTIMATE.start_dll_insert_~last~0#1.base| (store (select .cse0 |ULTIMATE.start_dll_insert_~last~0#1.base|) (+ |ULTIMATE.start_dll_insert_~last~0#1.offset| 8) |c_ULTIMATE.start_node_create_#res#1.offset|))) .cse1) .cse2))) (forall ((v_ArrVal_3022 (Array Int Int)) (v_ArrVal_3023 (Array Int Int)) (|ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| Int) (|ULTIMATE.start_dll_insert_~snd_to_last~0#1.offset| Int) (|ULTIMATE.start_dll_insert_~last~0#1.offset| Int) (|ULTIMATE.start_dll_insert_~last~0#1.base| Int)) (let ((.cse4 (+ |ULTIMATE.start_dll_insert_~last~0#1.offset| 8)) (.cse5 (+ 4 |ULTIMATE.start_dll_insert_~snd_to_last~0#1.offset|))) (<= (+ (select (select (let ((.cse3 (store (store |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_dll_insert_~snd_to_last~0#1.base|) .cse5 |c_ULTIMATE.start_node_create_#res#1.offset|)) |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_3023))) (store .cse3 |ULTIMATE.start_dll_insert_~last~0#1.base| (store (select .cse3 |ULTIMATE.start_dll_insert_~last~0#1.base|) .cse4 |c_ULTIMATE.start_node_create_#res#1.offset|))) .cse1) .cse2) 4) (select |c_#length| (select (select (let ((.cse6 (store (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |ULTIMATE.start_dll_insert_~snd_to_last~0#1.base|) .cse5 |c_ULTIMATE.start_node_create_#res#1.base|)) |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_3022))) (store .cse6 |ULTIMATE.start_dll_insert_~last~0#1.base| (store (select .cse6 |ULTIMATE.start_dll_insert_~last~0#1.base|) .cse4 |c_ULTIMATE.start_node_create_#res#1.base|))) .cse1) .cse2))))))) is different from false [2024-11-09 08:03:41,803 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (and (forall ((v_ArrVal_3023 (Array Int Int)) (|ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| Int) (|ULTIMATE.start_dll_insert_~snd_to_last~0#1.offset| Int) (|ULTIMATE.start_dll_insert_~last~0#1.offset| Int) (|ULTIMATE.start_dll_insert_~last~0#1.base| Int)) (<= 0 (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_dll_insert_~snd_to_last~0#1.base|) (+ 4 |ULTIMATE.start_dll_insert_~snd_to_last~0#1.offset|) |c_ULTIMATE.start_node_create_~temp~0#1.offset|)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_3023))) (store .cse0 |ULTIMATE.start_dll_insert_~last~0#1.base| (store (select .cse0 |ULTIMATE.start_dll_insert_~last~0#1.base|) (+ |ULTIMATE.start_dll_insert_~last~0#1.offset| 8) |c_ULTIMATE.start_node_create_~temp~0#1.offset|))) .cse1) .cse2))) (forall ((v_ArrVal_3022 (Array Int Int)) (v_ArrVal_3023 (Array Int Int)) (|ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| Int) (|ULTIMATE.start_dll_insert_~snd_to_last~0#1.offset| Int) (|ULTIMATE.start_dll_insert_~last~0#1.offset| Int) (|ULTIMATE.start_dll_insert_~last~0#1.base| Int)) (let ((.cse4 (+ |ULTIMATE.start_dll_insert_~last~0#1.offset| 8)) (.cse5 (+ 4 |ULTIMATE.start_dll_insert_~snd_to_last~0#1.offset|))) (<= (+ (select (select (let ((.cse3 (store (store |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_dll_insert_~snd_to_last~0#1.base|) .cse5 |c_ULTIMATE.start_node_create_~temp~0#1.offset|)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_3023))) (store .cse3 |ULTIMATE.start_dll_insert_~last~0#1.base| (store (select .cse3 |ULTIMATE.start_dll_insert_~last~0#1.base|) .cse4 |c_ULTIMATE.start_node_create_~temp~0#1.offset|))) .cse1) .cse2) 4) (select |c_#length| (select (select (let ((.cse6 (store (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |ULTIMATE.start_dll_insert_~snd_to_last~0#1.base|) .cse5 |c_ULTIMATE.start_node_create_~temp~0#1.base|)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_3022))) (store .cse6 |ULTIMATE.start_dll_insert_~last~0#1.base| (store (select .cse6 |ULTIMATE.start_dll_insert_~last~0#1.base|) .cse4 |c_ULTIMATE.start_node_create_~temp~0#1.base|))) .cse1) .cse2))))))) is different from false [2024-11-09 08:03:41,827 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (and (forall ((v_ArrVal_3022 (Array Int Int)) (v_ArrVal_3023 (Array Int Int)) (|ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| Int) (v_ArrVal_3015 (Array Int Int)) (v_ArrVal_3016 (Array Int Int)) (|ULTIMATE.start_dll_insert_~snd_to_last~0#1.offset| Int) (|ULTIMATE.start_dll_insert_~last~0#1.offset| Int) (|ULTIMATE.start_dll_insert_~last~0#1.base| Int)) (let ((.cse1 (+ |ULTIMATE.start_dll_insert_~last~0#1.offset| 8)) (.cse2 (+ 4 |ULTIMATE.start_dll_insert_~snd_to_last~0#1.offset|))) (<= (+ (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| (store (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_3016) |ULTIMATE.start_dll_insert_~snd_to_last~0#1.base|) .cse2 |c_ULTIMATE.start_node_create_~temp~0#1.offset|)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_3023))) (store .cse0 |ULTIMATE.start_dll_insert_~last~0#1.base| (store (select .cse0 |ULTIMATE.start_dll_insert_~last~0#1.base|) .cse1 |c_ULTIMATE.start_node_create_~temp~0#1.offset|))) .cse3) .cse4) 4) (select |c_#length| (select (select (let ((.cse5 (store (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| (store (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_3015) |ULTIMATE.start_dll_insert_~snd_to_last~0#1.base|) .cse2 |c_ULTIMATE.start_node_create_~temp~0#1.base|)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_3022))) (store .cse5 |ULTIMATE.start_dll_insert_~last~0#1.base| (store (select .cse5 |ULTIMATE.start_dll_insert_~last~0#1.base|) .cse1 |c_ULTIMATE.start_node_create_~temp~0#1.base|))) .cse3) .cse4))))) (forall ((v_ArrVal_3023 (Array Int Int)) (|ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| Int) (v_ArrVal_3016 (Array Int Int)) (|ULTIMATE.start_dll_insert_~snd_to_last~0#1.offset| Int) (|ULTIMATE.start_dll_insert_~last~0#1.offset| Int) (|ULTIMATE.start_dll_insert_~last~0#1.base| Int)) (<= 0 (select (select (let ((.cse6 (store (store |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| (store (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_3016) |ULTIMATE.start_dll_insert_~snd_to_last~0#1.base|) (+ 4 |ULTIMATE.start_dll_insert_~snd_to_last~0#1.offset|) |c_ULTIMATE.start_node_create_~temp~0#1.offset|)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_3023))) (store .cse6 |ULTIMATE.start_dll_insert_~last~0#1.base| (store (select .cse6 |ULTIMATE.start_dll_insert_~last~0#1.base|) (+ |ULTIMATE.start_dll_insert_~last~0#1.offset| 8) |c_ULTIMATE.start_node_create_~temp~0#1.offset|))) .cse3) .cse4))))) is different from false [2024-11-09 08:03:41,895 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 191 treesize of output 175 [2024-11-09 08:03:41,900 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 179 treesize of output 163