./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_remove_all_reverse.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_remove_all_reverse.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 a81d76a671fec08918102c7898e8919d02b265d05707efa1508363dab4714d44 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 18:15:47,401 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 18:15:47,463 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-11 18:15:47,470 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 18:15:47,470 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 18:15:47,488 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 18:15:47,488 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 18:15:47,489 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 18:15:47,489 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 18:15:47,490 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 18:15:47,491 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 18:15:47,491 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 18:15:47,491 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 18:15:47,492 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 18:15:47,492 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 18:15:47,492 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 18:15:47,492 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 18:15:47,493 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 18:15:47,493 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 18:15:47,493 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 18:15:47,493 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-11 18:15:47,494 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-11 18:15:47,494 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-11 18:15:47,494 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 18:15:47,495 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 18:15:47,495 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 18:15:47,495 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 18:15:47,495 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 18:15:47,495 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 18:15:47,496 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 18:15:47,496 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 18:15:47,496 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 18:15:47,496 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 18:15:47,496 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 18:15:47,503 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 18:15:47,503 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 18:15:47,503 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 18:15:47,503 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 18:15:47,503 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 18:15:47,503 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 18:15:47,504 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 18:15:47,504 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 18:15:47,504 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-clean/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-clean/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 -> a81d76a671fec08918102c7898e8919d02b265d05707efa1508363dab4714d44 [2024-10-11 18:15:47,690 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 18:15:47,715 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 18:15:47,719 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 18:15:47,721 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 18:15:47,721 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 18:15:47,723 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_remove_all_reverse.i [2024-10-11 18:15:49,015 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 18:15:49,239 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 18:15:49,239 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_remove_all_reverse.i [2024-10-11 18:15:49,250 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/0adda16ff/b7f6c8ef67854d50ad0f05cc57ae6a18/FLAGaaec8bde4 [2024-10-11 18:15:49,603 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/0adda16ff/b7f6c8ef67854d50ad0f05cc57ae6a18 [2024-10-11 18:15:49,605 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 18:15:49,606 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 18:15:49,607 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 18:15:49,607 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 18:15:49,612 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 18:15:49,612 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:15:49" (1/1) ... [2024-10-11 18:15:49,614 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49eb079a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:15:49, skipping insertion in model container [2024-10-11 18:15:49,615 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:15:49" (1/1) ... [2024-10-11 18:15:49,647 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 18:15:49,910 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 18:15:49,918 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 18:15:49,951 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 18:15:49,975 INFO L204 MainTranslator]: Completed translation [2024-10-11 18:15:49,976 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:15:49 WrapperNode [2024-10-11 18:15:49,976 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 18:15:49,977 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 18:15:49,977 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 18:15:49,977 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 18:15:49,982 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:15:49" (1/1) ... [2024-10-11 18:15:49,995 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:15:49" (1/1) ... [2024-10-11 18:15:50,017 INFO L138 Inliner]: procedures = 126, calls = 38, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 114 [2024-10-11 18:15:50,017 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 18:15:50,018 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 18:15:50,018 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 18:15:50,018 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 18:15:50,027 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:15:49" (1/1) ... [2024-10-11 18:15:50,028 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:15:49" (1/1) ... [2024-10-11 18:15:50,030 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:15:49" (1/1) ... [2024-10-11 18:15:50,045 INFO L175 MemorySlicer]: Split 21 memory accesses to 3 slices as follows [2, 11, 8]. 52 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 10 writes are split as follows [0, 9, 1]. [2024-10-11 18:15:50,046 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:15:49" (1/1) ... [2024-10-11 18:15:50,046 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:15:49" (1/1) ... [2024-10-11 18:15:50,052 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:15:49" (1/1) ... [2024-10-11 18:15:50,055 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:15:49" (1/1) ... [2024-10-11 18:15:50,056 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:15:49" (1/1) ... [2024-10-11 18:15:50,057 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:15:49" (1/1) ... [2024-10-11 18:15:50,060 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 18:15:50,060 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 18:15:50,060 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 18:15:50,061 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 18:15:50,061 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:15:49" (1/1) ... [2024-10-11 18:15:50,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 18:15:50,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:15:50,101 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 18:15:50,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 18:15:50,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 18:15:50,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 18:15:50,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-11 18:15:50,147 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-10-11 18:15:50,147 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-10-11 18:15:50,147 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 18:15:50,147 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 18:15:50,147 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-11 18:15:50,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-11 18:15:50,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-11 18:15:50,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-11 18:15:50,149 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-11 18:15:50,150 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-11 18:15:50,150 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-11 18:15:50,150 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 18:15:50,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-11 18:15:50,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-11 18:15:50,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-10-11 18:15:50,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 18:15:50,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 18:15:50,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 18:15:50,151 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 18:15:50,151 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 18:15:50,283 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 18:15:50,286 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 18:15:50,581 INFO L? ?]: Removed 107 outVars from TransFormulas that were not future-live. [2024-10-11 18:15:50,584 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 18:15:50,620 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 18:15:50,621 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-11 18:15:50,621 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:15:50 BoogieIcfgContainer [2024-10-11 18:15:50,622 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 18:15:50,625 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 18:15:50,625 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 18:15:50,628 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 18:15:50,628 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 06:15:49" (1/3) ... [2024-10-11 18:15:50,629 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@634b9568 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:15:50, skipping insertion in model container [2024-10-11 18:15:50,629 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:15:49" (2/3) ... [2024-10-11 18:15:50,630 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@634b9568 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:15:50, skipping insertion in model container [2024-10-11 18:15:50,630 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:15:50" (3/3) ... [2024-10-11 18:15:50,631 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_remove_all_reverse.i [2024-10-11 18:15:50,645 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 18:15:50,645 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 44 error locations. [2024-10-11 18:15:50,680 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 18:15:50,685 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;@1f6d3ed8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 18:15:50,685 INFO L334 AbstractCegarLoop]: Starting to check reachability of 44 error locations. [2024-10-11 18:15:50,689 INFO L276 IsEmpty]: Start isEmpty. Operand has 89 states, 41 states have (on average 2.292682926829268) internal successors, (94), 85 states have internal predecessors, (94), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 18:15:50,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-11 18:15:50,694 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:15:50,695 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-11 18:15:50,695 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-10-11 18:15:50,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:15:50,699 INFO L85 PathProgramCache]: Analyzing trace with hash 181913967, now seen corresponding path program 1 times [2024-10-11 18:15:50,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:15:50,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421361264] [2024-10-11 18:15:50,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:15:50,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:15:50,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:50,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:15:50,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:15:50,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421361264] [2024-10-11 18:15:50,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421361264] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:15:50,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:15:50,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 18:15:50,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454267332] [2024-10-11 18:15:50,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:15:50,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 18:15:50,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:15:50,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 18:15:50,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:15:50,985 INFO L87 Difference]: Start difference. First operand has 89 states, 41 states have (on average 2.292682926829268) internal successors, (94), 85 states have internal predecessors, (94), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:15:51,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:15:51,098 INFO L93 Difference]: Finished difference Result 85 states and 90 transitions. [2024-10-11 18:15:51,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 18:15:51,101 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-10-11 18:15:51,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:15:51,106 INFO L225 Difference]: With dead ends: 85 [2024-10-11 18:15:51,106 INFO L226 Difference]: Without dead ends: 83 [2024-10-11 18:15:51,108 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-10-11 18:15:51,111 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 2 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:15:51,113 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 114 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:15:51,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-10-11 18:15:51,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2024-10-11 18:15:51,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 39 states have (on average 2.128205128205128) internal successors, (83), 79 states have internal predecessors, (83), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 18:15:51,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 87 transitions. [2024-10-11 18:15:51,140 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 87 transitions. Word has length 5 [2024-10-11 18:15:51,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:15:51,140 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 87 transitions. [2024-10-11 18:15:51,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:15:51,141 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 87 transitions. [2024-10-11 18:15:51,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-11 18:15:51,141 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:15:51,141 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-11 18:15:51,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 18:15:51,141 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-10-11 18:15:51,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:15:51,142 INFO L85 PathProgramCache]: Analyzing trace with hash 181913968, now seen corresponding path program 1 times [2024-10-11 18:15:51,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:15:51,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794924069] [2024-10-11 18:15:51,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:15:51,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:15:51,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:51,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:15:51,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:15:51,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794924069] [2024-10-11 18:15:51,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794924069] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:15:51,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:15:51,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 18:15:51,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800353714] [2024-10-11 18:15:51,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:15:51,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 18:15:51,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:15:51,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 18:15:51,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:15:51,237 INFO L87 Difference]: Start difference. First operand 83 states and 87 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:15:51,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:15:51,305 INFO L93 Difference]: Finished difference Result 80 states and 84 transitions. [2024-10-11 18:15:51,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 18:15:51,306 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-10-11 18:15:51,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:15:51,307 INFO L225 Difference]: With dead ends: 80 [2024-10-11 18:15:51,308 INFO L226 Difference]: Without dead ends: 80 [2024-10-11 18:15:51,309 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-10-11 18:15:51,310 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 2 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:15:51,310 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 118 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:15:51,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-10-11 18:15:51,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2024-10-11 18:15:51,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 39 states have (on average 2.051282051282051) internal successors, (80), 76 states have internal predecessors, (80), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 18:15:51,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 84 transitions. [2024-10-11 18:15:51,322 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 84 transitions. Word has length 5 [2024-10-11 18:15:51,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:15:51,322 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 84 transitions. [2024-10-11 18:15:51,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:15:51,323 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 84 transitions. [2024-10-11 18:15:51,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-11 18:15:51,324 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:15:51,324 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:15:51,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 18:15:51,324 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-10-11 18:15:51,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:15:51,327 INFO L85 PathProgramCache]: Analyzing trace with hash -956323543, now seen corresponding path program 1 times [2024-10-11 18:15:51,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:15:51,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575932018] [2024-10-11 18:15:51,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:15:51,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:15:51,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:51,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:15:51,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:51,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:15:51,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:15:51,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575932018] [2024-10-11 18:15:51,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575932018] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:15:51,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:15:51,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 18:15:51,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682174628] [2024-10-11 18:15:51,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:15:51,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 18:15:51,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:15:51,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 18:15:51,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 18:15:51,488 INFO L87 Difference]: Start difference. First operand 80 states and 84 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:15:51,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:15:51,588 INFO L93 Difference]: Finished difference Result 81 states and 85 transitions. [2024-10-11 18:15:51,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 18:15:51,589 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-10-11 18:15:51,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:15:51,590 INFO L225 Difference]: With dead ends: 81 [2024-10-11 18:15:51,591 INFO L226 Difference]: Without dead ends: 81 [2024-10-11 18:15:51,592 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-10-11 18:15:51,592 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 10 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:15:51,593 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 153 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:15:51,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-10-11 18:15:51,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-10-11 18:15:51,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 40 states have (on average 2.025) internal successors, (81), 77 states have internal predecessors, (81), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 18:15:51,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 85 transitions. [2024-10-11 18:15:51,601 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 85 transitions. Word has length 11 [2024-10-11 18:15:51,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:15:51,602 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 85 transitions. [2024-10-11 18:15:51,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:15:51,603 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 85 transitions. [2024-10-11 18:15:51,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-11 18:15:51,604 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:15:51,604 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:15:51,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 18:15:51,605 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-10-11 18:15:51,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:15:51,605 INFO L85 PathProgramCache]: Analyzing trace with hash -422303523, now seen corresponding path program 1 times [2024-10-11 18:15:51,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:15:51,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077963095] [2024-10-11 18:15:51,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:15:51,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:15:51,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:51,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:15:51,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:51,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 18:15:51,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:51,839 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 18:15:51,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:15:51,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077963095] [2024-10-11 18:15:51,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077963095] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:15:51,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:15:51,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 18:15:51,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450272118] [2024-10-11 18:15:51,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:15:51,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 18:15:51,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:15:51,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 18:15:51,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 18:15:51,843 INFO L87 Difference]: Start difference. First operand 81 states and 85 transitions. Second operand has 7 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 18:15:52,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:15:52,021 INFO L93 Difference]: Finished difference Result 80 states and 84 transitions. [2024-10-11 18:15:52,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 18:15:52,022 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2024-10-11 18:15:52,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:15:52,023 INFO L225 Difference]: With dead ends: 80 [2024-10-11 18:15:52,024 INFO L226 Difference]: Without dead ends: 80 [2024-10-11 18:15:52,024 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 18:15:52,025 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 7 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:15:52,025 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 220 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 18:15:52,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-10-11 18:15:52,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2024-10-11 18:15:52,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 40 states have (on average 2.0) internal successors, (80), 76 states have internal predecessors, (80), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 18:15:52,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 84 transitions. [2024-10-11 18:15:52,032 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 84 transitions. Word has length 19 [2024-10-11 18:15:52,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:15:52,036 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 84 transitions. [2024-10-11 18:15:52,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 18:15:52,037 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 84 transitions. [2024-10-11 18:15:52,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-11 18:15:52,038 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:15:52,038 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:15:52,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 18:15:52,038 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-10-11 18:15:52,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:15:52,039 INFO L85 PathProgramCache]: Analyzing trace with hash -422303522, now seen corresponding path program 1 times [2024-10-11 18:15:52,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:15:52,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803267046] [2024-10-11 18:15:52,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:15:52,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:15:52,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:52,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:15:52,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:52,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 18:15:52,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:52,334 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:15:52,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:15:52,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803267046] [2024-10-11 18:15:52,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803267046] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:15:52,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:15:52,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 18:15:52,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379811040] [2024-10-11 18:15:52,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:15:52,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 18:15:52,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:15:52,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 18:15:52,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 18:15:52,336 INFO L87 Difference]: Start difference. First operand 80 states and 84 transitions. Second operand has 7 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 18:15:52,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:15:52,474 INFO L93 Difference]: Finished difference Result 79 states and 83 transitions. [2024-10-11 18:15:52,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 18:15:52,474 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2024-10-11 18:15:52,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:15:52,475 INFO L225 Difference]: With dead ends: 79 [2024-10-11 18:15:52,475 INFO L226 Difference]: Without dead ends: 79 [2024-10-11 18:15:52,475 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 18:15:52,476 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 6 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:15:52,476 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 244 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:15:52,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-10-11 18:15:52,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2024-10-11 18:15:52,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 40 states have (on average 1.975) internal successors, (79), 75 states have internal predecessors, (79), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 18:15:52,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 83 transitions. [2024-10-11 18:15:52,480 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 83 transitions. Word has length 19 [2024-10-11 18:15:52,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:15:52,480 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 83 transitions. [2024-10-11 18:15:52,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 18:15:52,481 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 83 transitions. [2024-10-11 18:15:52,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-11 18:15:52,481 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:15:52,481 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:15:52,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 18:15:52,481 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-10-11 18:15:52,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:15:52,482 INFO L85 PathProgramCache]: Analyzing trace with hash -2106760066, now seen corresponding path program 1 times [2024-10-11 18:15:52,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:15:52,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889161337] [2024-10-11 18:15:52,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:15:52,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:15:52,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:52,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:15:52,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:52,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 18:15:52,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:52,727 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:15:52,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:15:52,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889161337] [2024-10-11 18:15:52,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889161337] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:15:52,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [133871482] [2024-10-11 18:15:52,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:15:52,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:15:52,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:15:52,730 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:15:52,731 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 18:15:52,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:52,835 INFO L255 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-11 18:15:52,841 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:15:52,884 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-10-11 18:15:52,930 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2024-10-11 18:15:52,979 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-10-11 18:15:52,980 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 19 treesize of output 16 [2024-10-11 18:15:52,990 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2024-10-11 18:15:52,991 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:15:53,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [133871482] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:15:53,044 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:15:53,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 10 [2024-10-11 18:15:53,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73380269] [2024-10-11 18:15:53,045 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 18:15:53,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 18:15:53,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:15:53,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 18:15:53,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=87, Unknown=1, NotChecked=18, Total=132 [2024-10-11 18:15:53,047 INFO L87 Difference]: Start difference. First operand 79 states and 83 transitions. Second operand has 11 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 18:15:53,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:15:53,265 INFO L93 Difference]: Finished difference Result 84 states and 91 transitions. [2024-10-11 18:15:53,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 18:15:53,266 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 21 [2024-10-11 18:15:53,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:15:53,267 INFO L225 Difference]: With dead ends: 84 [2024-10-11 18:15:53,267 INFO L226 Difference]: Without dead ends: 84 [2024-10-11 18:15:53,268 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=124, Unknown=1, NotChecked=22, Total=182 [2024-10-11 18:15:53,269 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 0 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 86 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:15:53,270 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 219 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 272 Invalid, 0 Unknown, 86 Unchecked, 0.2s Time] [2024-10-11 18:15:53,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-10-11 18:15:53,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-10-11 18:15:53,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 44 states have (on average 1.9318181818181819) internal successors, (85), 79 states have internal predecessors, (85), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:15:53,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 91 transitions. [2024-10-11 18:15:53,277 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 91 transitions. Word has length 21 [2024-10-11 18:15:53,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:15:53,277 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 91 transitions. [2024-10-11 18:15:53,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 18:15:53,278 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 91 transitions. [2024-10-11 18:15:53,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-11 18:15:53,278 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:15:53,279 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:15:53,295 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 18:15:53,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:15:53,483 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-10-11 18:15:53,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:15:53,484 INFO L85 PathProgramCache]: Analyzing trace with hash -2106760065, now seen corresponding path program 1 times [2024-10-11 18:15:53,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:15:53,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562616656] [2024-10-11 18:15:53,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:15:53,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:15:53,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:53,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:15:53,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:53,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 18:15:53,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:53,915 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:15:53,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:15:53,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562616656] [2024-10-11 18:15:53,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562616656] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:15:53,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1272099698] [2024-10-11 18:15:53,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:15:53,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:15:53,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:15:53,918 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:15:53,919 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 18:15:54,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:54,018 INFO L255 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-10-11 18:15:54,021 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:15:54,032 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-10-11 18:15:54,038 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-10-11 18:15:54,160 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-11 18:15:54,161 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-10-11 18:15:54,179 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 18:15:54,179 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 11 treesize of output 11 [2024-10-11 18:15:54,212 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:15:54,212 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:15:54,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1272099698] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:15:54,317 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:15:54,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 13 [2024-10-11 18:15:54,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106633072] [2024-10-11 18:15:54,318 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 18:15:54,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-11 18:15:54,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:15:54,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-11 18:15:54,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2024-10-11 18:15:54,319 INFO L87 Difference]: Start difference. First operand 84 states and 91 transitions. Second operand has 14 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 18:15:54,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:15:54,634 INFO L93 Difference]: Finished difference Result 84 states and 90 transitions. [2024-10-11 18:15:54,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 18:15:54,634 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 21 [2024-10-11 18:15:54,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:15:54,635 INFO L225 Difference]: With dead ends: 84 [2024-10-11 18:15:54,635 INFO L226 Difference]: Without dead ends: 84 [2024-10-11 18:15:54,636 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2024-10-11 18:15:54,636 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 0 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 528 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 18:15:54,636 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 352 Invalid, 530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 528 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 18:15:54,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-10-11 18:15:54,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-10-11 18:15:54,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 44 states have (on average 1.9090909090909092) internal successors, (84), 79 states have internal predecessors, (84), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:15:54,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 90 transitions. [2024-10-11 18:15:54,646 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 90 transitions. Word has length 21 [2024-10-11 18:15:54,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:15:54,646 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 90 transitions. [2024-10-11 18:15:54,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 18:15:54,647 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 90 transitions. [2024-10-11 18:15:54,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-11 18:15:54,647 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:15:54,647 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:15:54,665 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 18:15:54,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:15:54,848 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-10-11 18:15:54,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:15:54,849 INFO L85 PathProgramCache]: Analyzing trace with hash -1666672876, now seen corresponding path program 1 times [2024-10-11 18:15:54,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:15:54,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362179712] [2024-10-11 18:15:54,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:15:54,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:15:54,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:54,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:15:54,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:54,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 18:15:54,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:54,961 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:15:54,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:15:54,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362179712] [2024-10-11 18:15:54,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362179712] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:15:54,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [219874936] [2024-10-11 18:15:54,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:15:54,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:15:54,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:15:54,967 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:15:54,969 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 18:15:55,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:55,064 INFO L255 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 18:15:55,066 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:15:55,087 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:15:55,087 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:15:55,110 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:15:55,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [219874936] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:15:55,111 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 18:15:55,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 7 [2024-10-11 18:15:55,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062242987] [2024-10-11 18:15:55,111 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 18:15:55,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 18:15:55,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:15:55,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 18:15:55,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 18:15:55,112 INFO L87 Difference]: Start difference. First operand 84 states and 90 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 18:15:55,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:15:55,221 INFO L93 Difference]: Finished difference Result 84 states and 89 transitions. [2024-10-11 18:15:55,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 18:15:55,221 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 23 [2024-10-11 18:15:55,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:15:55,222 INFO L225 Difference]: With dead ends: 84 [2024-10-11 18:15:55,222 INFO L226 Difference]: Without dead ends: 84 [2024-10-11 18:15:55,222 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 18:15:55,223 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 1 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:15:55,223 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 338 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:15:55,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-10-11 18:15:55,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-10-11 18:15:55,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 44 states have (on average 1.8863636363636365) internal successors, (83), 79 states have internal predecessors, (83), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:15:55,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 89 transitions. [2024-10-11 18:15:55,226 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 89 transitions. Word has length 23 [2024-10-11 18:15:55,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:15:55,227 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 89 transitions. [2024-10-11 18:15:55,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 18:15:55,227 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 89 transitions. [2024-10-11 18:15:55,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-11 18:15:55,227 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:15:55,228 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:15:55,245 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 18:15:55,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:15:55,429 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-10-11 18:15:55,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:15:55,429 INFO L85 PathProgramCache]: Analyzing trace with hash -132032267, now seen corresponding path program 1 times [2024-10-11 18:15:55,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:15:55,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799854124] [2024-10-11 18:15:55,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:15:55,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:15:55,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:55,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:15:55,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:55,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 18:15:55,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:55,508 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 18:15:55,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:15:55,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799854124] [2024-10-11 18:15:55,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799854124] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:15:55,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1329347199] [2024-10-11 18:15:55,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:15:55,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:15:55,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:15:55,510 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:15:55,511 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 18:15:55,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:55,610 INFO L255 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-11 18:15:55,611 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:15:55,614 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-10-11 18:15:55,654 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2024-10-11 18:15:55,682 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-10-11 18:15:55,682 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 19 treesize of output 16 [2024-10-11 18:15:55,691 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 5 not checked. [2024-10-11 18:15:55,691 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:15:55,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1329347199] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:15:55,743 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:15:55,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7] total 10 [2024-10-11 18:15:55,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909920974] [2024-10-11 18:15:55,743 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 18:15:55,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 18:15:55,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:15:55,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 18:15:55,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=89, Unknown=1, NotChecked=18, Total=132 [2024-10-11 18:15:55,744 INFO L87 Difference]: Start difference. First operand 84 states and 89 transitions. Second operand has 11 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 8 states have internal predecessors, (31), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-11 18:15:55,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:15:55,940 INFO L93 Difference]: Finished difference Result 83 states and 88 transitions. [2024-10-11 18:15:55,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 18:15:55,941 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 8 states have internal predecessors, (31), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 24 [2024-10-11 18:15:55,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:15:55,941 INFO L225 Difference]: With dead ends: 83 [2024-10-11 18:15:55,941 INFO L226 Difference]: Without dead ends: 83 [2024-10-11 18:15:55,942 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=149, Unknown=1, NotChecked=24, Total=210 [2024-10-11 18:15:55,942 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 9 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 83 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:15:55,942 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 245 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 298 Invalid, 0 Unknown, 83 Unchecked, 0.2s Time] [2024-10-11 18:15:55,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-10-11 18:15:55,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2024-10-11 18:15:55,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 44 states have (on average 1.8636363636363635) internal successors, (82), 78 states have internal predecessors, (82), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:15:55,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 88 transitions. [2024-10-11 18:15:55,947 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 88 transitions. Word has length 24 [2024-10-11 18:15:55,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:15:55,948 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 88 transitions. [2024-10-11 18:15:55,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 8 states have internal predecessors, (31), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-11 18:15:55,948 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 88 transitions. [2024-10-11 18:15:55,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-11 18:15:55,949 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:15:55,949 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:15:55,964 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-11 18:15:56,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-10-11 18:15:56,150 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-10-11 18:15:56,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:15:56,150 INFO L85 PathProgramCache]: Analyzing trace with hash -132032266, now seen corresponding path program 1 times [2024-10-11 18:15:56,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:15:56,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867949070] [2024-10-11 18:15:56,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:15:56,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:15:56,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:56,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:15:56,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:56,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 18:15:56,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:56,326 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:15:56,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:15:56,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867949070] [2024-10-11 18:15:56,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867949070] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:15:56,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [899358369] [2024-10-11 18:15:56,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:15:56,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:15:56,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:15:56,328 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:15:56,329 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 18:15:56,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:56,438 INFO L255 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-10-11 18:15:56,440 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:15:56,446 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-10-11 18:15:56,453 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-10-11 18:15:56,554 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2024-10-11 18:15:56,581 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:15:56,582 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-10-11 18:15:56,589 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 18:15:56,589 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 11 treesize of output 11 [2024-10-11 18:15:56,617 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2024-10-11 18:15:56,617 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:15:56,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [899358369] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:15:56,740 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:15:56,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2024-10-11 18:15:56,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089131100] [2024-10-11 18:15:56,740 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 18:15:56,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-11 18:15:56,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:15:56,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-11 18:15:56,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=230, Unknown=1, NotChecked=30, Total=306 [2024-10-11 18:15:56,741 INFO L87 Difference]: Start difference. First operand 83 states and 88 transitions. Second operand has 16 states, 13 states have (on average 3.0) internal successors, (39), 12 states have internal predecessors, (39), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-11 18:15:57,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:15:57,006 INFO L93 Difference]: Finished difference Result 100 states and 110 transitions. [2024-10-11 18:15:57,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 18:15:57,007 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 3.0) internal successors, (39), 12 states have internal predecessors, (39), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 24 [2024-10-11 18:15:57,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:15:57,008 INFO L225 Difference]: With dead ends: 100 [2024-10-11 18:15:57,008 INFO L226 Difference]: Without dead ends: 100 [2024-10-11 18:15:57,009 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=353, Unknown=1, NotChecked=38, Total=462 [2024-10-11 18:15:57,009 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 16 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 105 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:15:57,009 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 414 Invalid, 509 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 394 Invalid, 0 Unknown, 105 Unchecked, 0.2s Time] [2024-10-11 18:15:57,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-10-11 18:15:57,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 93. [2024-10-11 18:15:57,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 53 states have (on average 1.8113207547169812) internal successors, (96), 87 states have internal predecessors, (96), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-11 18:15:57,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 104 transitions. [2024-10-11 18:15:57,013 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 104 transitions. Word has length 24 [2024-10-11 18:15:57,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:15:57,013 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 104 transitions. [2024-10-11 18:15:57,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 13 states have (on average 3.0) internal successors, (39), 12 states have internal predecessors, (39), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-11 18:15:57,013 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 104 transitions. [2024-10-11 18:15:57,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-11 18:15:57,014 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:15:57,014 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:15:57,028 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-11 18:15:57,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-11 18:15:57,215 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-10-11 18:15:57,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:15:57,215 INFO L85 PathProgramCache]: Analyzing trace with hash 201967024, now seen corresponding path program 1 times [2024-10-11 18:15:57,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:15:57,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212107190] [2024-10-11 18:15:57,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:15:57,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:15:57,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:57,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:15:57,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:57,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 18:15:57,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:57,329 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 18:15:57,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:15:57,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212107190] [2024-10-11 18:15:57,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212107190] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:15:57,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:15:57,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 18:15:57,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046263335] [2024-10-11 18:15:57,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:15:57,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 18:15:57,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:15:57,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 18:15:57,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 18:15:57,332 INFO L87 Difference]: Start difference. First operand 93 states and 104 transitions. Second operand has 8 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 18:15:57,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:15:57,482 INFO L93 Difference]: Finished difference Result 92 states and 103 transitions. [2024-10-11 18:15:57,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 18:15:57,482 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2024-10-11 18:15:57,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:15:57,483 INFO L225 Difference]: With dead ends: 92 [2024-10-11 18:15:57,483 INFO L226 Difference]: Without dead ends: 92 [2024-10-11 18:15:57,483 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 18:15:57,484 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 6 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:15:57,484 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 248 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 311 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:15:57,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-10-11 18:15:57,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-10-11 18:15:57,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 53 states have (on average 1.7924528301886793) internal successors, (95), 86 states have internal predecessors, (95), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-11 18:15:57,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 103 transitions. [2024-10-11 18:15:57,487 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 103 transitions. Word has length 25 [2024-10-11 18:15:57,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:15:57,487 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 103 transitions. [2024-10-11 18:15:57,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 18:15:57,487 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 103 transitions. [2024-10-11 18:15:57,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-11 18:15:57,488 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:15:57,488 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:15:57,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 18:15:57,488 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-10-11 18:15:57,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:15:57,488 INFO L85 PathProgramCache]: Analyzing trace with hash 201967025, now seen corresponding path program 1 times [2024-10-11 18:15:57,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:15:57,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683033329] [2024-10-11 18:15:57,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:15:57,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:15:57,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:57,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:15:57,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:57,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 18:15:57,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:57,699 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:15:57,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:15:57,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683033329] [2024-10-11 18:15:57,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683033329] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:15:57,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:15:57,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 18:15:57,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476133613] [2024-10-11 18:15:57,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:15:57,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 18:15:57,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:15:57,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 18:15:57,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 18:15:57,701 INFO L87 Difference]: Start difference. First operand 92 states and 103 transitions. Second operand has 8 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 18:15:57,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:15:57,855 INFO L93 Difference]: Finished difference Result 91 states and 102 transitions. [2024-10-11 18:15:57,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 18:15:57,856 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2024-10-11 18:15:57,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:15:57,856 INFO L225 Difference]: With dead ends: 91 [2024-10-11 18:15:57,856 INFO L226 Difference]: Without dead ends: 91 [2024-10-11 18:15:57,856 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 18:15:57,857 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 5 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:15:57,857 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 273 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:15:57,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-10-11 18:15:57,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-10-11 18:15:57,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 53 states have (on average 1.7735849056603774) internal successors, (94), 85 states have internal predecessors, (94), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-11 18:15:57,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 102 transitions. [2024-10-11 18:15:57,860 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 102 transitions. Word has length 25 [2024-10-11 18:15:57,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:15:57,860 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 102 transitions. [2024-10-11 18:15:57,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 18:15:57,860 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 102 transitions. [2024-10-11 18:15:57,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-11 18:15:57,861 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:15:57,861 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:15:57,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 18:15:57,861 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-10-11 18:15:57,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:15:57,861 INFO L85 PathProgramCache]: Analyzing trace with hash 816901485, now seen corresponding path program 1 times [2024-10-11 18:15:57,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:15:57,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844467796] [2024-10-11 18:15:57,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:15:57,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:15:57,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:58,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:15:58,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:58,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 18:15:58,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:58,144 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 18:15:58,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:15:58,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844467796] [2024-10-11 18:15:58,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844467796] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:15:58,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [162522325] [2024-10-11 18:15:58,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:15:58,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:15:58,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:15:58,146 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:15:58,147 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-11 18:15:58,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:58,281 INFO L255 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-11 18:15:58,283 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:15:58,289 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-10-11 18:15:58,303 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 5 treesize of output 3 [2024-10-11 18:15:58,340 WARN L851 $PredicateComparison]: unable to prove that (and (or (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_10| |c_#valid|))) (and (= |c_ULTIMATE.start_dll_circular_create_#t~ret4#1.base| .cse0) (= (select |v_#valid_BEFORE_CALL_10| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_10| .cse0 (select |c_#valid| .cse0))))))) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|)) is different from false [2024-10-11 18:15:58,342 WARN L873 $PredicateComparison]: unable to prove that (and (or (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_10| |c_#valid|))) (and (= |c_ULTIMATE.start_dll_circular_create_#t~ret4#1.base| .cse0) (= (select |v_#valid_BEFORE_CALL_10| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_10| .cse0 (select |c_#valid| .cse0))))))) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|)) is different from true [2024-10-11 18:15:58,356 WARN L851 $PredicateComparison]: unable to prove that (and (or (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_10| |c_#valid|))) (and (= (select |v_#valid_BEFORE_CALL_10| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_10| .cse0 (select |c_#valid| .cse0))))))) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|)) is different from false [2024-10-11 18:15:58,358 WARN L873 $PredicateComparison]: unable to prove that (and (or (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_10| |c_#valid|))) (and (= (select |v_#valid_BEFORE_CALL_10| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_10| .cse0 (select |c_#valid| .cse0))))))) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|)) is different from true [2024-10-11 18:15:58,381 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 5 treesize of output 3 [2024-10-11 18:15:58,389 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))))) is different from true [2024-10-11 18:15:58,413 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:15:58,414 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-10-11 18:15:58,443 WARN L851 $PredicateComparison]: unable to prove that (or (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (and (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_10| |v_old(#valid)_AFTER_CALL_12|))) (and (= (select |v_#valid_BEFORE_CALL_10| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (store |v_#valid_BEFORE_CALL_10| .cse0 (select |v_old(#valid)_AFTER_CALL_12| .cse0)) |v_old(#valid)_AFTER_CALL_12|) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse0)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))))) (<= (+ |node_create_~temp~0#1.base| 2) |c_ULTIMATE.start_main_~#s~0#1.base|)))) is different from false [2024-10-11 18:15:58,445 WARN L873 $PredicateComparison]: unable to prove that (or (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (and (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_10| |v_old(#valid)_AFTER_CALL_12|))) (and (= (select |v_#valid_BEFORE_CALL_10| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (store |v_#valid_BEFORE_CALL_10| .cse0 (select |v_old(#valid)_AFTER_CALL_12| .cse0)) |v_old(#valid)_AFTER_CALL_12|) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse0)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))))) (<= (+ |node_create_~temp~0#1.base| 2) |c_ULTIMATE.start_main_~#s~0#1.base|)))) is different from true [2024-10-11 18:15:58,590 WARN L851 $PredicateComparison]: unable to prove that (or (and (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (exists ((|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1))) (exists ((|node_create_~temp~0#1.base| Int) (|v_#valid_BEFORE_CALL_10| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_10| |v_old(#valid)_AFTER_CALL_12|))) (and (= (select |v_#valid_BEFORE_CALL_10| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |c_#valid| .cse0) 1) (= (store |v_#valid_BEFORE_CALL_10| .cse0 (select |v_old(#valid)_AFTER_CALL_12| .cse0)) |v_old(#valid)_AFTER_CALL_12|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (<= (+ |node_create_~temp~0#1.base| 2) |c_ULTIMATE.start_main_~#s~0#1.base|))))) is different from false [2024-10-11 18:15:58,591 WARN L873 $PredicateComparison]: unable to prove that (or (and (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (exists ((|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1))) (exists ((|node_create_~temp~0#1.base| Int) (|v_#valid_BEFORE_CALL_10| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_10| |v_old(#valid)_AFTER_CALL_12|))) (and (= (select |v_#valid_BEFORE_CALL_10| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |c_#valid| .cse0) 1) (= (store |v_#valid_BEFORE_CALL_10| .cse0 (select |v_old(#valid)_AFTER_CALL_12| .cse0)) |v_old(#valid)_AFTER_CALL_12|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (<= (+ |node_create_~temp~0#1.base| 2) |c_ULTIMATE.start_main_~#s~0#1.base|))))) is different from true [2024-10-11 18:15:58,625 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((|node_create_~temp~0#1.base| Int) (|v_#valid_BEFORE_CALL_10| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_10| |v_old(#valid)_AFTER_CALL_12|))) (and (= (select |c_#valid| .cse0) 1) (= (store |v_#valid_BEFORE_CALL_10| .cse0 (select |v_old(#valid)_AFTER_CALL_12| .cse0)) |v_old(#valid)_AFTER_CALL_12|) (= (select |v_#valid_BEFORE_CALL_10| |c_ULTIMATE.start_dll_circular_remove_last_~head#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (<= (+ |node_create_~temp~0#1.base| 2) |c_ULTIMATE.start_dll_circular_remove_last_~head#1.base|)))) (and (exists ((|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1)) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_remove_last_~head#1.base|) 1))) is different from false [2024-10-11 18:15:58,627 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|node_create_~temp~0#1.base| Int) (|v_#valid_BEFORE_CALL_10| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_10| |v_old(#valid)_AFTER_CALL_12|))) (and (= (select |c_#valid| .cse0) 1) (= (store |v_#valid_BEFORE_CALL_10| .cse0 (select |v_old(#valid)_AFTER_CALL_12| .cse0)) |v_old(#valid)_AFTER_CALL_12|) (= (select |v_#valid_BEFORE_CALL_10| |c_ULTIMATE.start_dll_circular_remove_last_~head#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (<= (+ |node_create_~temp~0#1.base| 2) |c_ULTIMATE.start_dll_circular_remove_last_~head#1.base|)))) (and (exists ((|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1)) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_remove_last_~head#1.base|) 1))) is different from true [2024-10-11 18:15:58,628 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2024-10-11 18:15:58,628 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:15:58,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [162522325] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:15:58,717 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:15:58,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 17 [2024-10-11 18:15:58,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269664287] [2024-10-11 18:15:58,718 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 18:15:58,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-11 18:15:58,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:15:58,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-11 18:15:58,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=165, Unknown=11, NotChecked=186, Total=420 [2024-10-11 18:15:58,719 INFO L87 Difference]: Start difference. First operand 91 states and 102 transitions. Second operand has 19 states, 15 states have (on average 2.8) internal successors, (42), 14 states have internal predecessors, (42), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-11 18:15:58,790 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and .cse0 (or .cse0 (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_10| |c_#valid|))) (and (= |c_ULTIMATE.start_dll_circular_create_#t~ret4#1.base| .cse1) (= (select |v_#valid_BEFORE_CALL_10| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_10| .cse1 (select |c_#valid| .cse1))))))) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|))) is different from false [2024-10-11 18:15:58,792 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and .cse0 (or .cse0 (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_10| |c_#valid|))) (and (= |c_ULTIMATE.start_dll_circular_create_#t~ret4#1.base| .cse1) (= (select |v_#valid_BEFORE_CALL_10| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_10| .cse1 (select |c_#valid| .cse1))))))) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|))) is different from true [2024-10-11 18:15:58,794 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and (or .cse0 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (or .cse0 (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_10| |c_#valid|))) (and (= (select |v_#valid_BEFORE_CALL_10| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_10| .cse1 (select |c_#valid| .cse1))))))) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|))) is different from false [2024-10-11 18:15:58,796 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and (or .cse0 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (or .cse0 (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_10| |c_#valid|))) (and (= (select |v_#valid_BEFORE_CALL_10| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_10| .cse1 (select |c_#valid| .cse1))))))) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|))) is different from true [2024-10-11 18:15:58,800 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and (or .cse0 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (or .cse0 (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (and (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_10| |v_old(#valid)_AFTER_CALL_12|))) (and (= (select |v_#valid_BEFORE_CALL_10| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (store |v_#valid_BEFORE_CALL_10| .cse1 (select |v_old(#valid)_AFTER_CALL_12| .cse1)) |v_old(#valid)_AFTER_CALL_12|) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse1)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))))) (<= (+ |node_create_~temp~0#1.base| 2) |c_ULTIMATE.start_main_~#s~0#1.base|)))))) is different from false [2024-10-11 18:15:58,802 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and (or .cse0 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (or .cse0 (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (and (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_10| |v_old(#valid)_AFTER_CALL_12|))) (and (= (select |v_#valid_BEFORE_CALL_10| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (store |v_#valid_BEFORE_CALL_10| .cse1 (select |v_old(#valid)_AFTER_CALL_12| .cse1)) |v_old(#valid)_AFTER_CALL_12|) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse1)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))))) (<= (+ |node_create_~temp~0#1.base| 2) |c_ULTIMATE.start_main_~#s~0#1.base|)))))) is different from true [2024-10-11 18:15:58,806 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and .cse0 (or (and .cse0 (exists ((|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1))) (exists ((|node_create_~temp~0#1.base| Int) (|v_#valid_BEFORE_CALL_10| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_10| |v_old(#valid)_AFTER_CALL_12|))) (and (= (select |v_#valid_BEFORE_CALL_10| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |c_#valid| .cse1) 1) (= (store |v_#valid_BEFORE_CALL_10| .cse1 (select |v_old(#valid)_AFTER_CALL_12| .cse1)) |v_old(#valid)_AFTER_CALL_12|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (<= (+ |node_create_~temp~0#1.base| 2) |c_ULTIMATE.start_main_~#s~0#1.base|))))))) is different from false [2024-10-11 18:15:58,808 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and .cse0 (or (and .cse0 (exists ((|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1))) (exists ((|node_create_~temp~0#1.base| Int) (|v_#valid_BEFORE_CALL_10| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_10| |v_old(#valid)_AFTER_CALL_12|))) (and (= (select |v_#valid_BEFORE_CALL_10| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |c_#valid| .cse1) 1) (= (store |v_#valid_BEFORE_CALL_10| .cse1 (select |v_old(#valid)_AFTER_CALL_12| .cse1)) |v_old(#valid)_AFTER_CALL_12|) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (<= (+ |node_create_~temp~0#1.base| 2) |c_ULTIMATE.start_main_~#s~0#1.base|))))))) is different from true [2024-10-11 18:15:58,813 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_remove_last_~head#1.base|) 1))) (and (or (exists ((|node_create_~temp~0#1.base| Int) (|v_#valid_BEFORE_CALL_10| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_10| |v_old(#valid)_AFTER_CALL_12|))) (and (= (select |c_#valid| .cse0) 1) (= (store |v_#valid_BEFORE_CALL_10| .cse0 (select |v_old(#valid)_AFTER_CALL_12| .cse0)) |v_old(#valid)_AFTER_CALL_12|) (= (select |v_#valid_BEFORE_CALL_10| |c_ULTIMATE.start_dll_circular_remove_last_~head#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (<= (+ |node_create_~temp~0#1.base| 2) |c_ULTIMATE.start_dll_circular_remove_last_~head#1.base|)))) (and (exists ((|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1)) .cse1)) .cse1)) is different from false [2024-10-11 18:15:58,815 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_remove_last_~head#1.base|) 1))) (and (or (exists ((|node_create_~temp~0#1.base| Int) (|v_#valid_BEFORE_CALL_10| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_10| |v_old(#valid)_AFTER_CALL_12|))) (and (= (select |c_#valid| .cse0) 1) (= (store |v_#valid_BEFORE_CALL_10| .cse0 (select |v_old(#valid)_AFTER_CALL_12| .cse0)) |v_old(#valid)_AFTER_CALL_12|) (= (select |v_#valid_BEFORE_CALL_10| |c_ULTIMATE.start_dll_circular_remove_last_~head#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (<= (+ |node_create_~temp~0#1.base| 2) |c_ULTIMATE.start_dll_circular_remove_last_~head#1.base|)))) (and (exists ((|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1)) .cse1)) .cse1)) is different from true [2024-10-11 18:15:59,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:15:59,049 INFO L93 Difference]: Finished difference Result 124 states and 141 transitions. [2024-10-11 18:15:59,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 18:15:59,050 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 15 states have (on average 2.8) internal successors, (42), 14 states have internal predecessors, (42), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 27 [2024-10-11 18:15:59,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:15:59,050 INFO L225 Difference]: With dead ends: 124 [2024-10-11 18:15:59,051 INFO L226 Difference]: Without dead ends: 124 [2024-10-11 18:15:59,051 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=243, Unknown=21, NotChecked=462, Total=812 [2024-10-11 18:15:59,051 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 83 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 1363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 939 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:15:59,052 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 270 Invalid, 1363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 412 Invalid, 0 Unknown, 939 Unchecked, 0.2s Time] [2024-10-11 18:15:59,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-10-11 18:15:59,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 98. [2024-10-11 18:15:59,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 62 states have (on average 1.7580645161290323) internal successors, (109), 92 states have internal predecessors, (109), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-11 18:15:59,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 117 transitions. [2024-10-11 18:15:59,055 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 117 transitions. Word has length 27 [2024-10-11 18:15:59,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:15:59,056 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 117 transitions. [2024-10-11 18:15:59,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 15 states have (on average 2.8) internal successors, (42), 14 states have internal predecessors, (42), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-11 18:15:59,056 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 117 transitions. [2024-10-11 18:15:59,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-11 18:15:59,057 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:15:59,057 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:15:59,076 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-11 18:15:59,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-10-11 18:15:59,259 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-10-11 18:15:59,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:15:59,260 INFO L85 PathProgramCache]: Analyzing trace with hash 816901486, now seen corresponding path program 1 times [2024-10-11 18:15:59,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:15:59,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640835657] [2024-10-11 18:15:59,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:15:59,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:15:59,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:59,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:15:59,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:59,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 18:15:59,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:59,654 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:15:59,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:15:59,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640835657] [2024-10-11 18:15:59,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640835657] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:15:59,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1005735210] [2024-10-11 18:15:59,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:15:59,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:15:59,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:15:59,656 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:15:59,657 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-11 18:15:59,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:59,785 INFO L255 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-11 18:15:59,790 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:15:59,802 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-10-11 18:15:59,827 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 5 treesize of output 3 [2024-10-11 18:15:59,848 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|))) is different from true [2024-10-11 18:15:59,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:15:59,875 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-10-11 18:15:59,893 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 5 treesize of output 3 [2024-10-11 18:15:59,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:15:59,920 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-10-11 18:15:59,971 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 18:15:59,971 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:16:00,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1005735210] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:16:00,089 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:16:00,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 5] total 16 [2024-10-11 18:16:00,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706480959] [2024-10-11 18:16:00,090 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 18:16:00,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-11 18:16:00,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:16:00,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-11 18:16:00,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=317, Unknown=1, NotChecked=36, Total=420 [2024-10-11 18:16:00,092 INFO L87 Difference]: Start difference. First operand 98 states and 117 transitions. Second operand has 18 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 14 states have internal predecessors, (41), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-11 18:16:00,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:16:00,456 INFO L93 Difference]: Finished difference Result 91 states and 106 transitions. [2024-10-11 18:16:00,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 18:16:00,456 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 14 states have internal predecessors, (41), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 27 [2024-10-11 18:16:00,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:16:00,457 INFO L225 Difference]: With dead ends: 91 [2024-10-11 18:16:00,457 INFO L226 Difference]: Without dead ends: 91 [2024-10-11 18:16:00,458 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=125, Invalid=580, Unknown=1, NotChecked=50, Total=756 [2024-10-11 18:16:00,459 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 245 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 65 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:16:00,459 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 185 Invalid, 461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 388 Invalid, 0 Unknown, 65 Unchecked, 0.2s Time] [2024-10-11 18:16:00,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-10-11 18:16:00,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-10-11 18:16:00,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 62 states have (on average 1.5806451612903225) internal successors, (98), 85 states have internal predecessors, (98), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-11 18:16:00,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 106 transitions. [2024-10-11 18:16:00,461 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 106 transitions. Word has length 27 [2024-10-11 18:16:00,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:16:00,462 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 106 transitions. [2024-10-11 18:16:00,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 14 states have internal predecessors, (41), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-11 18:16:00,462 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 106 transitions. [2024-10-11 18:16:00,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-11 18:16:00,463 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:16:00,463 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:16:00,476 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-10-11 18:16:00,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:16:00,664 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-10-11 18:16:00,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:16:00,664 INFO L85 PathProgramCache]: Analyzing trace with hash 816901481, now seen corresponding path program 1 times [2024-10-11 18:16:00,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:16:00,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696565275] [2024-10-11 18:16:00,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:16:00,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:16:00,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:00,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:16:00,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:00,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 18:16:00,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:00,749 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-11 18:16:00,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:16:00,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696565275] [2024-10-11 18:16:00,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696565275] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:16:00,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:16:00,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 18:16:00,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584204167] [2024-10-11 18:16:00,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:16:00,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 18:16:00,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:16:00,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 18:16:00,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 18:16:00,750 INFO L87 Difference]: Start difference. First operand 91 states and 106 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 18:16:00,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:16:00,815 INFO L93 Difference]: Finished difference Result 123 states and 137 transitions. [2024-10-11 18:16:00,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 18:16:00,816 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 27 [2024-10-11 18:16:00,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:16:00,816 INFO L225 Difference]: With dead ends: 123 [2024-10-11 18:16:00,817 INFO L226 Difference]: Without dead ends: 123 [2024-10-11 18:16:00,817 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 18:16:00,818 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 78 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:16:00,818 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 146 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:16:00,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-10-11 18:16:00,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 90. [2024-10-11 18:16:00,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 61 states have (on average 1.5573770491803278) internal successors, (95), 84 states have internal predecessors, (95), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-11 18:16:00,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 103 transitions. [2024-10-11 18:16:00,820 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 103 transitions. Word has length 27 [2024-10-11 18:16:00,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:16:00,820 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 103 transitions. [2024-10-11 18:16:00,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 18:16:00,820 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 103 transitions. [2024-10-11 18:16:00,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-11 18:16:00,821 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:16:00,821 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:16:00,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 18:16:00,821 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-10-11 18:16:00,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:16:00,823 INFO L85 PathProgramCache]: Analyzing trace with hash -445857719, now seen corresponding path program 1 times [2024-10-11 18:16:00,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:16:00,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535095519] [2024-10-11 18:16:00,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:16:00,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:16:00,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:00,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:16:00,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:00,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 18:16:00,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:00,987 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 18:16:00,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:16:00,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535095519] [2024-10-11 18:16:00,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535095519] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:16:00,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:16:00,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 18:16:00,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360816288] [2024-10-11 18:16:00,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:16:00,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 18:16:00,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:16:00,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 18:16:00,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-10-11 18:16:00,989 INFO L87 Difference]: Start difference. First operand 90 states and 103 transitions. Second operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 18:16:01,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:16:01,197 INFO L93 Difference]: Finished difference Result 110 states and 123 transitions. [2024-10-11 18:16:01,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 18:16:01,197 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 28 [2024-10-11 18:16:01,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:16:01,198 INFO L225 Difference]: With dead ends: 110 [2024-10-11 18:16:01,198 INFO L226 Difference]: Without dead ends: 110 [2024-10-11 18:16:01,198 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2024-10-11 18:16:01,199 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 48 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 444 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:16:01,199 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 262 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 444 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 18:16:01,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-10-11 18:16:01,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 91. [2024-10-11 18:16:01,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 62 states have (on average 1.5483870967741935) internal successors, (96), 85 states have internal predecessors, (96), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-11 18:16:01,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 104 transitions. [2024-10-11 18:16:01,201 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 104 transitions. Word has length 28 [2024-10-11 18:16:01,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:16:01,202 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 104 transitions. [2024-10-11 18:16:01,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 18:16:01,202 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 104 transitions. [2024-10-11 18:16:01,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-11 18:16:01,203 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:16:01,203 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:16:01,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 18:16:01,203 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-10-11 18:16:01,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:16:01,204 INFO L85 PathProgramCache]: Analyzing trace with hash -445857718, now seen corresponding path program 1 times [2024-10-11 18:16:01,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:16:01,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088456523] [2024-10-11 18:16:01,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:16:01,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:16:01,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:01,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:16:01,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:01,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 18:16:01,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:01,469 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:16:01,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:16:01,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088456523] [2024-10-11 18:16:01,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088456523] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:16:01,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:16:01,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 18:16:01,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666802380] [2024-10-11 18:16:01,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:16:01,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 18:16:01,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:16:01,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 18:16:01,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-10-11 18:16:01,471 INFO L87 Difference]: Start difference. First operand 91 states and 104 transitions. Second operand has 11 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 18:16:01,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:16:01,700 INFO L93 Difference]: Finished difference Result 127 states and 141 transitions. [2024-10-11 18:16:01,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 18:16:01,700 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 28 [2024-10-11 18:16:01,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:16:01,701 INFO L225 Difference]: With dead ends: 127 [2024-10-11 18:16:01,701 INFO L226 Difference]: Without dead ends: 127 [2024-10-11 18:16:01,701 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2024-10-11 18:16:01,702 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 68 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:16:01,702 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 329 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 432 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 18:16:01,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-10-11 18:16:01,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 105. [2024-10-11 18:16:01,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 76 states have (on average 1.605263157894737) internal successors, (122), 99 states have internal predecessors, (122), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-11 18:16:01,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 130 transitions. [2024-10-11 18:16:01,706 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 130 transitions. Word has length 28 [2024-10-11 18:16:01,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:16:01,706 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 130 transitions. [2024-10-11 18:16:01,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 18:16:01,706 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 130 transitions. [2024-10-11 18:16:01,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-11 18:16:01,707 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:16:01,707 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:16:01,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 18:16:01,707 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-10-11 18:16:01,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:16:01,708 INFO L85 PathProgramCache]: Analyzing trace with hash -936683965, now seen corresponding path program 1 times [2024-10-11 18:16:01,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:16:01,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453149977] [2024-10-11 18:16:01,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:16:01,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:16:01,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:01,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:16:01,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:01,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 18:16:01,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:01,759 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-11 18:16:01,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:16:01,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453149977] [2024-10-11 18:16:01,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453149977] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:16:01,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:16:01,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 18:16:01,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117408802] [2024-10-11 18:16:01,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:16:01,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 18:16:01,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:16:01,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 18:16:01,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 18:16:01,760 INFO L87 Difference]: Start difference. First operand 105 states and 130 transitions. Second operand has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 18:16:01,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:16:01,823 INFO L93 Difference]: Finished difference Result 104 states and 129 transitions. [2024-10-11 18:16:01,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 18:16:01,823 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 29 [2024-10-11 18:16:01,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:16:01,824 INFO L225 Difference]: With dead ends: 104 [2024-10-11 18:16:01,824 INFO L226 Difference]: Without dead ends: 104 [2024-10-11 18:16:01,824 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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-10-11 18:16:01,825 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 22 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:16:01,825 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 91 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:16:01,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-10-11 18:16:01,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 98. [2024-10-11 18:16:01,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 70 states have (on average 1.6428571428571428) internal successors, (115), 92 states have internal predecessors, (115), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-11 18:16:01,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 123 transitions. [2024-10-11 18:16:01,829 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 123 transitions. Word has length 29 [2024-10-11 18:16:01,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:16:01,829 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 123 transitions. [2024-10-11 18:16:01,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 18:16:01,830 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 123 transitions. [2024-10-11 18:16:01,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-11 18:16:01,830 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:16:01,830 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:16:01,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-11 18:16:01,830 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-10-11 18:16:01,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:16:01,831 INFO L85 PathProgramCache]: Analyzing trace with hash 1789843236, now seen corresponding path program 1 times [2024-10-11 18:16:01,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:16:01,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812304759] [2024-10-11 18:16:01,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:16:01,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:16:01,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:02,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:16:02,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:02,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 18:16:02,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:02,225 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:16:02,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:16:02,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812304759] [2024-10-11 18:16:02,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812304759] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:16:02,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:16:02,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-11 18:16:02,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058537429] [2024-10-11 18:16:02,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:16:02,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-11 18:16:02,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:16:02,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-11 18:16:02,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2024-10-11 18:16:02,227 INFO L87 Difference]: Start difference. First operand 98 states and 123 transitions. Second operand has 13 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 18:16:02,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:16:02,519 INFO L93 Difference]: Finished difference Result 113 states and 138 transitions. [2024-10-11 18:16:02,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 18:16:02,520 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 31 [2024-10-11 18:16:02,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:16:02,521 INFO L225 Difference]: With dead ends: 113 [2024-10-11 18:16:02,521 INFO L226 Difference]: Without dead ends: 113 [2024-10-11 18:16:02,521 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2024-10-11 18:16:02,521 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 51 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 504 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 504 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:16:02,522 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 359 Invalid, 507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 504 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 18:16:02,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-10-11 18:16:02,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 100. [2024-10-11 18:16:02,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 73 states have (on average 1.6164383561643836) internal successors, (118), 94 states have internal predecessors, (118), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-11 18:16:02,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 126 transitions. [2024-10-11 18:16:02,525 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 126 transitions. Word has length 31 [2024-10-11 18:16:02,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:16:02,525 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 126 transitions. [2024-10-11 18:16:02,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 18:16:02,525 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 126 transitions. [2024-10-11 18:16:02,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-11 18:16:02,525 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:16:02,525 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:16:02,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-11 18:16:02,526 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-10-11 18:16:02,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:16:02,526 INFO L85 PathProgramCache]: Analyzing trace with hash 1789843237, now seen corresponding path program 1 times [2024-10-11 18:16:02,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:16:02,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073588773] [2024-10-11 18:16:02,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:16:02,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:16:02,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:02,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:16:02,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:03,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 18:16:03,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:03,032 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 18:16:03,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:16:03,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073588773] [2024-10-11 18:16:03,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073588773] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:16:03,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [51379382] [2024-10-11 18:16:03,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:16:03,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:16:03,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:16:03,034 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:16:03,035 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-11 18:16:03,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:03,276 INFO L255 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 77 conjuncts are in the unsatisfiable core [2024-10-11 18:16:03,281 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:16:03,298 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-10-11 18:16:03,302 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-10-11 18:16:03,497 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-11 18:16:03,497 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-10-11 18:16:03,506 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 18:16:03,507 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 11 treesize of output 11 [2024-10-11 18:16:03,640 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 27 treesize of output 1 [2024-10-11 18:16:03,642 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-10-11 18:16:03,720 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 48 treesize of output 28 [2024-10-11 18:16:03,750 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-10-11 18:16:03,755 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2024-10-11 18:16:03,781 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:16:03,781 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:16:03,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:16:03,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:16:03,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:16:03,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:16:03,904 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 8 treesize of output 4 [2024-10-11 18:16:03,907 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 8 treesize of output 4 [2024-10-11 18:16:04,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [51379382] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:16:04,040 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:16:04,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16] total 29 [2024-10-11 18:16:04,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146648517] [2024-10-11 18:16:04,040 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 18:16:04,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-10-11 18:16:04,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:16:04,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-10-11 18:16:04,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=1159, Unknown=0, NotChecked=0, Total=1260 [2024-10-11 18:16:04,042 INFO L87 Difference]: Start difference. First operand 100 states and 126 transitions. Second operand has 30 states, 25 states have (on average 1.96) internal successors, (49), 24 states have internal predecessors, (49), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-11 18:16:04,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:16:04,845 INFO L93 Difference]: Finished difference Result 134 states and 162 transitions. [2024-10-11 18:16:04,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-11 18:16:04,845 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 25 states have (on average 1.96) internal successors, (49), 24 states have internal predecessors, (49), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 31 [2024-10-11 18:16:04,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:16:04,846 INFO L225 Difference]: With dead ends: 134 [2024-10-11 18:16:04,846 INFO L226 Difference]: Without dead ends: 134 [2024-10-11 18:16:04,847 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 392 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=224, Invalid=2226, Unknown=0, NotChecked=0, Total=2450 [2024-10-11 18:16:04,848 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 186 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 944 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 958 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 944 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 18:16:04,848 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 495 Invalid, 958 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 944 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 18:16:04,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2024-10-11 18:16:04,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 108. [2024-10-11 18:16:04,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 81 states have (on average 1.5679012345679013) internal successors, (127), 102 states have internal predecessors, (127), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-11 18:16:04,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 135 transitions. [2024-10-11 18:16:04,854 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 135 transitions. Word has length 31 [2024-10-11 18:16:04,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:16:04,854 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 135 transitions. [2024-10-11 18:16:04,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 25 states have (on average 1.96) internal successors, (49), 24 states have internal predecessors, (49), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-11 18:16:04,855 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 135 transitions. [2024-10-11 18:16:04,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-11 18:16:04,855 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:16:04,855 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:16:04,872 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-10-11 18:16:05,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:16:05,056 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-10-11 18:16:05,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:16:05,057 INFO L85 PathProgramCache]: Analyzing trace with hash -349448386, now seen corresponding path program 1 times [2024-10-11 18:16:05,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:16:05,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125443357] [2024-10-11 18:16:05,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:16:05,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:16:05,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:05,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:16:05,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:05,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 18:16:05,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:05,213 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:16:05,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:16:05,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125443357] [2024-10-11 18:16:05,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125443357] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:16:05,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:16:05,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 18:16:05,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414740259] [2024-10-11 18:16:05,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:16:05,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 18:16:05,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:16:05,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 18:16:05,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-10-11 18:16:05,215 INFO L87 Difference]: Start difference. First operand 108 states and 135 transitions. Second operand has 11 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 18:16:05,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:16:05,442 INFO L93 Difference]: Finished difference Result 107 states and 134 transitions. [2024-10-11 18:16:05,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 18:16:05,442 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 32 [2024-10-11 18:16:05,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:16:05,443 INFO L225 Difference]: With dead ends: 107 [2024-10-11 18:16:05,443 INFO L226 Difference]: Without dead ends: 107 [2024-10-11 18:16:05,443 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2024-10-11 18:16:05,443 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 65 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:16:05,443 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 302 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 18:16:05,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-10-11 18:16:05,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2024-10-11 18:16:05,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 81 states have (on average 1.5555555555555556) internal successors, (126), 101 states have internal predecessors, (126), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-11 18:16:05,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 134 transitions. [2024-10-11 18:16:05,448 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 134 transitions. Word has length 32 [2024-10-11 18:16:05,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:16:05,448 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 134 transitions. [2024-10-11 18:16:05,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 18:16:05,449 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 134 transitions. [2024-10-11 18:16:05,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-11 18:16:05,449 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:16:05,449 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:16:05,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-11 18:16:05,449 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-10-11 18:16:05,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:16:05,449 INFO L85 PathProgramCache]: Analyzing trace with hash 2052509908, now seen corresponding path program 1 times [2024-10-11 18:16:05,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:16:05,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432029081] [2024-10-11 18:16:05,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:16:05,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:16:05,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:05,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:16:05,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:05,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 18:16:05,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:05,881 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:16:05,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:16:05,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432029081] [2024-10-11 18:16:05,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432029081] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:16:05,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1997756618] [2024-10-11 18:16:05,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:16:05,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:16:05,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:16:05,883 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:16:05,885 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-11 18:16:06,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:06,112 INFO L255 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-10-11 18:16:06,114 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:16:06,293 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 1 [2024-10-11 18:16:06,353 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 21 treesize of output 13 [2024-10-11 18:16:06,391 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-10-11 18:16:06,423 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:16:06,423 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:16:06,524 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 22 treesize of output 18 [2024-10-11 18:16:06,527 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 18 treesize of output 16 [2024-10-11 18:16:06,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:16:06,531 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 8 treesize of output 4 [2024-10-11 18:16:06,609 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 18:16:06,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1997756618] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:16:06,610 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 18:16:06,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 9] total 28 [2024-10-11 18:16:06,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786046601] [2024-10-11 18:16:06,611 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 18:16:06,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-10-11 18:16:06,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:16:06,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-10-11 18:16:06,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=727, Unknown=0, NotChecked=0, Total=812 [2024-10-11 18:16:06,613 INFO L87 Difference]: Start difference. First operand 107 states and 134 transitions. Second operand has 29 states, 25 states have (on average 2.48) internal successors, (62), 24 states have internal predecessors, (62), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-10-11 18:16:07,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:16:07,093 INFO L93 Difference]: Finished difference Result 125 states and 151 transitions. [2024-10-11 18:16:07,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-11 18:16:07,095 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 25 states have (on average 2.48) internal successors, (62), 24 states have internal predecessors, (62), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 33 [2024-10-11 18:16:07,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:16:07,096 INFO L225 Difference]: With dead ends: 125 [2024-10-11 18:16:07,096 INFO L226 Difference]: Without dead ends: 125 [2024-10-11 18:16:07,097 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 42 SyntacticMatches, 11 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 323 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=150, Invalid=1182, Unknown=0, NotChecked=0, Total=1332 [2024-10-11 18:16:07,097 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 120 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 886 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 500 SdHoareTripleChecker+Invalid, 887 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 886 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 18:16:07,097 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 500 Invalid, 887 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 886 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 18:16:07,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-10-11 18:16:07,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 109. [2024-10-11 18:16:07,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 83 states have (on average 1.5542168674698795) internal successors, (129), 103 states have internal predecessors, (129), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-11 18:16:07,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 137 transitions. [2024-10-11 18:16:07,101 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 137 transitions. Word has length 33 [2024-10-11 18:16:07,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:16:07,101 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 137 transitions. [2024-10-11 18:16:07,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 25 states have (on average 2.48) internal successors, (62), 24 states have internal predecessors, (62), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-10-11 18:16:07,101 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 137 transitions. [2024-10-11 18:16:07,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-11 18:16:07,102 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:16:07,102 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:16:07,117 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-10-11 18:16:07,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,10 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:16:07,302 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-10-11 18:16:07,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:16:07,303 INFO L85 PathProgramCache]: Analyzing trace with hash 2052002020, now seen corresponding path program 1 times [2024-10-11 18:16:07,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:16:07,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455363156] [2024-10-11 18:16:07,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:16:07,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:16:07,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:07,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:16:07,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:07,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 18:16:07,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:07,479 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:16:07,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:16:07,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455363156] [2024-10-11 18:16:07,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455363156] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:16:07,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:16:07,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 18:16:07,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50729038] [2024-10-11 18:16:07,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:16:07,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 18:16:07,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:16:07,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 18:16:07,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-10-11 18:16:07,481 INFO L87 Difference]: Start difference. First operand 109 states and 137 transitions. Second operand has 11 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 18:16:07,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:16:07,766 INFO L93 Difference]: Finished difference Result 128 states and 146 transitions. [2024-10-11 18:16:07,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 18:16:07,767 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 33 [2024-10-11 18:16:07,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:16:07,767 INFO L225 Difference]: With dead ends: 128 [2024-10-11 18:16:07,767 INFO L226 Difference]: Without dead ends: 128 [2024-10-11 18:16:07,768 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2024-10-11 18:16:07,768 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 61 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 474 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 474 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:16:07,768 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 321 Invalid, 475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 474 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 18:16:07,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-10-11 18:16:07,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 112. [2024-10-11 18:16:07,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 86 states have (on average 1.5348837209302326) internal successors, (132), 106 states have internal predecessors, (132), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-11 18:16:07,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 140 transitions. [2024-10-11 18:16:07,772 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 140 transitions. Word has length 33 [2024-10-11 18:16:07,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:16:07,772 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 140 transitions. [2024-10-11 18:16:07,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 18:16:07,772 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 140 transitions. [2024-10-11 18:16:07,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-11 18:16:07,773 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:16:07,773 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:16:07,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-11 18:16:07,773 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-10-11 18:16:07,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:16:07,774 INFO L85 PathProgramCache]: Analyzing trace with hash 2059322698, now seen corresponding path program 1 times [2024-10-11 18:16:07,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:16:07,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728002735] [2024-10-11 18:16:07,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:16:07,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:16:07,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:07,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:16:07,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:07,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 18:16:07,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:07,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 18:16:07,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:07,877 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-11 18:16:07,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:16:07,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728002735] [2024-10-11 18:16:07,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728002735] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:16:07,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:16:07,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 18:16:07,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993126789] [2024-10-11 18:16:07,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:16:07,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 18:16:07,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:16:07,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 18:16:07,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 18:16:07,880 INFO L87 Difference]: Start difference. First operand 112 states and 140 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 18:16:07,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:16:07,944 INFO L93 Difference]: Finished difference Result 86 states and 102 transitions. [2024-10-11 18:16:07,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 18:16:07,944 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 34 [2024-10-11 18:16:07,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:16:07,945 INFO L225 Difference]: With dead ends: 86 [2024-10-11 18:16:07,945 INFO L226 Difference]: Without dead ends: 86 [2024-10-11 18:16:07,945 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 18:16:07,946 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 0 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:16:07,946 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 160 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:16:07,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-10-11 18:16:07,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-10-11 18:16:07,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 65 states have (on average 1.5076923076923077) internal successors, (98), 82 states have internal predecessors, (98), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 18:16:07,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 102 transitions. [2024-10-11 18:16:07,949 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 102 transitions. Word has length 34 [2024-10-11 18:16:07,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:16:07,949 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 102 transitions. [2024-10-11 18:16:07,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 18:16:07,950 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 102 transitions. [2024-10-11 18:16:07,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-11 18:16:07,953 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:16:07,953 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:16:07,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-11 18:16:07,953 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-10-11 18:16:07,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:16:07,954 INFO L85 PathProgramCache]: Analyzing trace with hash -812446720, now seen corresponding path program 1 times [2024-10-11 18:16:07,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:16:07,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174764806] [2024-10-11 18:16:07,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:16:07,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:16:07,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:08,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:16:08,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:08,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 18:16:08,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:08,042 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-11 18:16:08,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:16:08,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174764806] [2024-10-11 18:16:08,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174764806] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:16:08,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:16:08,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 18:16:08,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276528892] [2024-10-11 18:16:08,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:16:08,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 18:16:08,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:16:08,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 18:16:08,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 18:16:08,045 INFO L87 Difference]: Start difference. First operand 86 states and 102 transitions. Second operand has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 18:16:08,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:16:08,127 INFO L93 Difference]: Finished difference Result 85 states and 101 transitions. [2024-10-11 18:16:08,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 18:16:08,127 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 34 [2024-10-11 18:16:08,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:16:08,128 INFO L225 Difference]: With dead ends: 85 [2024-10-11 18:16:08,128 INFO L226 Difference]: Without dead ends: 85 [2024-10-11 18:16:08,128 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 18:16:08,129 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 12 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:16:08,129 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 136 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:16:08,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-10-11 18:16:08,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2024-10-11 18:16:08,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 65 states have (on average 1.4923076923076923) internal successors, (97), 81 states have internal predecessors, (97), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 18:16:08,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 101 transitions. [2024-10-11 18:16:08,132 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 101 transitions. Word has length 34 [2024-10-11 18:16:08,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:16:08,132 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 101 transitions. [2024-10-11 18:16:08,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 18:16:08,133 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 101 transitions. [2024-10-11 18:16:08,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-11 18:16:08,133 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:16:08,133 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:16:08,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-11 18:16:08,133 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-10-11 18:16:08,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:16:08,134 INFO L85 PathProgramCache]: Analyzing trace with hash 1072036407, now seen corresponding path program 1 times [2024-10-11 18:16:08,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:16:08,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855988011] [2024-10-11 18:16:08,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:16:08,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:16:08,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:08,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:16:08,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:08,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 18:16:08,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:08,265 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-11 18:16:08,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:16:08,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855988011] [2024-10-11 18:16:08,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855988011] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:16:08,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:16:08,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 18:16:08,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191144477] [2024-10-11 18:16:08,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:16:08,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 18:16:08,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:16:08,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 18:16:08,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-10-11 18:16:08,268 INFO L87 Difference]: Start difference. First operand 85 states and 101 transitions. Second operand has 9 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 18:16:08,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:16:08,376 INFO L93 Difference]: Finished difference Result 84 states and 99 transitions. [2024-10-11 18:16:08,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 18:16:08,376 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 35 [2024-10-11 18:16:08,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:16:08,377 INFO L225 Difference]: With dead ends: 84 [2024-10-11 18:16:08,377 INFO L226 Difference]: Without dead ends: 84 [2024-10-11 18:16:08,377 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2024-10-11 18:16:08,377 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 82 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:16:08,378 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 100 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:16:08,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-10-11 18:16:08,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-10-11 18:16:08,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 65 states have (on average 1.4615384615384615) internal successors, (95), 80 states have internal predecessors, (95), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 18:16:08,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 99 transitions. [2024-10-11 18:16:08,380 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 99 transitions. Word has length 35 [2024-10-11 18:16:08,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:16:08,380 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 99 transitions. [2024-10-11 18:16:08,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 18:16:08,380 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 99 transitions. [2024-10-11 18:16:08,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-11 18:16:08,380 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:16:08,381 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:16:08,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-11 18:16:08,381 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-10-11 18:16:08,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:16:08,381 INFO L85 PathProgramCache]: Analyzing trace with hash 583955559, now seen corresponding path program 1 times [2024-10-11 18:16:08,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:16:08,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033338898] [2024-10-11 18:16:08,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:16:08,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:16:08,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:08,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:16:08,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:08,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 18:16:08,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:08,639 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:16:08,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:16:08,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033338898] [2024-10-11 18:16:08,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033338898] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:16:08,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2013246702] [2024-10-11 18:16:08,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:16:08,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:16:08,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:16:08,642 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:16:08,643 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-10-11 18:16:08,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:08,836 INFO L255 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 18:16:08,838 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:16:08,915 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:16:08,916 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-10-11 18:16:08,918 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-11 18:16:08,918 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:16:08,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2013246702] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:16:08,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 18:16:08,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [13] total 16 [2024-10-11 18:16:08,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743587634] [2024-10-11 18:16:08,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:16:08,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 18:16:08,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:16:08,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 18:16:08,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2024-10-11 18:16:08,920 INFO L87 Difference]: Start difference. First operand 84 states and 99 transitions. Second operand has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 7 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 18:16:09,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:16:09,005 INFO L93 Difference]: Finished difference Result 83 states and 98 transitions. [2024-10-11 18:16:09,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 18:16:09,006 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 7 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 35 [2024-10-11 18:16:09,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:16:09,006 INFO L225 Difference]: With dead ends: 83 [2024-10-11 18:16:09,006 INFO L226 Difference]: Without dead ends: 83 [2024-10-11 18:16:09,006 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2024-10-11 18:16:09,007 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 70 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:16:09,007 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 91 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:16:09,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-10-11 18:16:09,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2024-10-11 18:16:09,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 65 states have (on average 1.4461538461538461) internal successors, (94), 79 states have internal predecessors, (94), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 18:16:09,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 98 transitions. [2024-10-11 18:16:09,009 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 98 transitions. Word has length 35 [2024-10-11 18:16:09,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:16:09,009 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 98 transitions. [2024-10-11 18:16:09,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 7 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 18:16:09,009 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 98 transitions. [2024-10-11 18:16:09,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-11 18:16:09,010 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:16:09,010 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:16:09,024 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-10-11 18:16:09,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-10-11 18:16:09,215 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-10-11 18:16:09,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:16:09,215 INFO L85 PathProgramCache]: Analyzing trace with hash -1126609692, now seen corresponding path program 1 times [2024-10-11 18:16:09,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:16:09,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868252182] [2024-10-11 18:16:09,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:16:09,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:16:09,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:09,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:16:09,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:09,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 18:16:09,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:09,584 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:16:09,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:16:09,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868252182] [2024-10-11 18:16:09,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868252182] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:16:09,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:16:09,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-10-11 18:16:09,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799427904] [2024-10-11 18:16:09,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:16:09,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-11 18:16:09,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:16:09,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-11 18:16:09,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2024-10-11 18:16:09,586 INFO L87 Difference]: Start difference. First operand 83 states and 98 transitions. Second operand has 17 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 18:16:09,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:16:09,948 INFO L93 Difference]: Finished difference Result 92 states and 107 transitions. [2024-10-11 18:16:09,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 18:16:09,948 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 36 [2024-10-11 18:16:09,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:16:09,949 INFO L225 Difference]: With dead ends: 92 [2024-10-11 18:16:09,949 INFO L226 Difference]: Without dead ends: 92 [2024-10-11 18:16:09,949 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=388, Unknown=0, NotChecked=0, Total=462 [2024-10-11 18:16:09,950 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 26 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 648 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 650 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 648 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 18:16:09,951 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 292 Invalid, 650 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 648 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 18:16:09,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-10-11 18:16:09,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 86. [2024-10-11 18:16:09,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 68 states have (on average 1.4411764705882353) internal successors, (98), 82 states have internal predecessors, (98), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 18:16:09,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 102 transitions. [2024-10-11 18:16:09,960 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 102 transitions. Word has length 36 [2024-10-11 18:16:09,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:16:09,960 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 102 transitions. [2024-10-11 18:16:09,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 18:16:09,960 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 102 transitions. [2024-10-11 18:16:09,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-11 18:16:09,960 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:16:09,960 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:16:09,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-10-11 18:16:09,961 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-10-11 18:16:09,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:16:09,961 INFO L85 PathProgramCache]: Analyzing trace with hash -1126609691, now seen corresponding path program 1 times [2024-10-11 18:16:09,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:16:09,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878925847] [2024-10-11 18:16:09,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:16:09,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:16:09,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:10,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:16:10,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:10,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 18:16:10,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:10,255 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:16:10,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:16:10,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878925847] [2024-10-11 18:16:10,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878925847] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:16:10,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:16:10,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 18:16:10,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167207248] [2024-10-11 18:16:10,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:16:10,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 18:16:10,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:16:10,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 18:16:10,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2024-10-11 18:16:10,256 INFO L87 Difference]: Start difference. First operand 86 states and 102 transitions. Second operand has 12 states, 10 states have (on average 3.2) internal successors, (32), 10 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 18:16:10,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:16:10,461 INFO L93 Difference]: Finished difference Result 98 states and 104 transitions. [2024-10-11 18:16:10,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 18:16:10,461 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 3.2) internal successors, (32), 10 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 36 [2024-10-11 18:16:10,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:16:10,462 INFO L225 Difference]: With dead ends: 98 [2024-10-11 18:16:10,462 INFO L226 Difference]: Without dead ends: 98 [2024-10-11 18:16:10,462 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2024-10-11 18:16:10,463 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 42 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:16:10,463 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 336 Invalid, 413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 413 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 18:16:10,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-10-11 18:16:10,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 86. [2024-10-11 18:16:10,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 68 states have (on average 1.411764705882353) internal successors, (96), 82 states have internal predecessors, (96), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 18:16:10,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 100 transitions. [2024-10-11 18:16:10,464 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 100 transitions. Word has length 36 [2024-10-11 18:16:10,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:16:10,465 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 100 transitions. [2024-10-11 18:16:10,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 3.2) internal successors, (32), 10 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 18:16:10,465 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 100 transitions. [2024-10-11 18:16:10,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-11 18:16:10,465 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:16:10,466 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:16:10,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-10-11 18:16:10,466 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-10-11 18:16:10,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:16:10,467 INFO L85 PathProgramCache]: Analyzing trace with hash -340088053, now seen corresponding path program 1 times [2024-10-11 18:16:10,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:16:10,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565428077] [2024-10-11 18:16:10,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:16:10,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:16:10,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:11,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:16:11,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:11,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 18:16:11,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:11,142 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 18:16:11,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:16:11,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565428077] [2024-10-11 18:16:11,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565428077] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:16:11,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [481558876] [2024-10-11 18:16:11,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:16:11,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:16:11,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:16:11,145 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:16:11,147 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-10-11 18:16:11,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:11,348 INFO L255 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 65 conjuncts are in the unsatisfiable core [2024-10-11 18:16:11,351 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:16:11,455 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-11 18:16:11,511 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:16:11,511 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 23 treesize of output 11 [2024-10-11 18:16:11,545 INFO L349 Elim1Store]: treesize reduction 97, result has 17.8 percent of original size [2024-10-11 18:16:11,545 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 29 [2024-10-11 18:16:11,603 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 33 treesize of output 25 [2024-10-11 18:16:11,703 INFO L349 Elim1Store]: treesize reduction 20, result has 55.6 percent of original size [2024-10-11 18:16:11,704 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 41 [2024-10-11 18:16:11,755 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-10-11 18:16:11,789 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-10-11 18:16:11,844 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:16:11,844 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:16:11,896 INFO L349 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2024-10-11 18:16:11,896 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 28 treesize of output 27 [2024-10-11 18:16:12,091 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 89 treesize of output 69 [2024-10-11 18:16:12,092 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 77 treesize of output 57 [2024-10-11 18:16:12,200 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:16:12,200 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 1 case distinctions, treesize of input 20 treesize of output 21 [2024-10-11 18:16:12,204 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:16:12,204 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 1 case distinctions, treesize of input 21 treesize of output 25 [2024-10-11 18:16:12,209 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 18 treesize of output 16 [2024-10-11 18:16:12,219 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:16:12,219 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 31 treesize of output 33 [2024-10-11 18:16:12,320 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:16:12,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [481558876] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:16:12,320 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 18:16:12,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 18, 19] total 49 [2024-10-11 18:16:12,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831031513] [2024-10-11 18:16:12,320 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 18:16:12,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-10-11 18:16:12,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:16:12,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-10-11 18:16:12,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=2271, Unknown=0, NotChecked=0, Total=2450 [2024-10-11 18:16:12,322 INFO L87 Difference]: Start difference. First operand 86 states and 100 transitions. Second operand has 50 states, 47 states have (on average 1.6595744680851063) internal successors, (78), 45 states have internal predecessors, (78), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-10-11 18:16:13,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:16:13,111 INFO L93 Difference]: Finished difference Result 93 states and 108 transitions. [2024-10-11 18:16:13,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-11 18:16:13,112 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 47 states have (on average 1.6595744680851063) internal successors, (78), 45 states have internal predecessors, (78), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 38 [2024-10-11 18:16:13,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:16:13,112 INFO L225 Difference]: With dead ends: 93 [2024-10-11 18:16:13,112 INFO L226 Difference]: Without dead ends: 93 [2024-10-11 18:16:13,113 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 759 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=374, Invalid=3658, Unknown=0, NotChecked=0, Total=4032 [2024-10-11 18:16:13,113 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 122 mSDsluCounter, 705 mSDsCounter, 0 mSdLazyCounter, 1099 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 731 SdHoareTripleChecker+Invalid, 1104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1099 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 18:16:13,114 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 731 Invalid, 1104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1099 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 18:16:13,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-10-11 18:16:13,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 88. [2024-10-11 18:16:13,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 70 states have (on average 1.4142857142857144) internal successors, (99), 84 states have internal predecessors, (99), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 18:16:13,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 103 transitions. [2024-10-11 18:16:13,115 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 103 transitions. Word has length 38 [2024-10-11 18:16:13,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:16:13,116 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 103 transitions. [2024-10-11 18:16:13,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 47 states have (on average 1.6595744680851063) internal successors, (78), 45 states have internal predecessors, (78), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-10-11 18:16:13,116 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 103 transitions. [2024-10-11 18:16:13,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-11 18:16:13,116 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:16:13,116 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:16:13,130 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-10-11 18:16:13,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,12 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:16:13,317 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-10-11 18:16:13,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:16:13,317 INFO L85 PathProgramCache]: Analyzing trace with hash -340088052, now seen corresponding path program 1 times [2024-10-11 18:16:13,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:16:13,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867594586] [2024-10-11 18:16:13,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:16:13,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:16:13,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:14,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:16:14,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:14,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 18:16:14,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:14,611 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:16:14,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:16:14,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867594586] [2024-10-11 18:16:14,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867594586] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:16:14,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2082604290] [2024-10-11 18:16:14,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:16:14,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:16:14,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:16:14,613 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:16:14,614 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-10-11 18:16:14,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:14,905 INFO L255 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 97 conjuncts are in the unsatisfiable core [2024-10-11 18:16:14,908 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:16:14,931 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-10-11 18:16:15,157 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 18:16:15,157 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 11 treesize of output 11 [2024-10-11 18:16:15,162 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 1 [2024-10-11 18:16:15,270 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-10-11 18:16:15,275 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-10-11 18:16:15,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:16:15,395 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 23 treesize of output 11 [2024-10-11 18:16:15,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:16:15,398 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 40 treesize of output 20 [2024-10-11 18:16:15,452 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 47 treesize of output 23 [2024-10-11 18:16:15,458 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 32 treesize of output 19 [2024-10-11 18:16:15,710 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 7 treesize of output 3 [2024-10-11 18:16:15,778 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:16:15,779 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 1 case distinctions, treesize of input 25 treesize of output 15 [2024-10-11 18:16:15,789 INFO L349 Elim1Store]: treesize reduction 33, result has 19.5 percent of original size [2024-10-11 18:16:15,789 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 33 [2024-10-11 18:16:15,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2024-10-11 18:16:15,948 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 32 treesize of output 16 [2024-10-11 18:16:15,995 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 7 [2024-10-11 18:16:16,024 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:16:16,024 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:16:16,136 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 18 treesize of output 12 [2024-10-11 18:16:16,435 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 151 treesize of output 127 [2024-10-11 18:16:16,442 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 111 treesize of output 91 [2024-10-11 18:16:16,450 WARN L851 $PredicateComparison]: unable to prove that (or (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (and (forall ((v_prenex_4 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (forall ((v_ArrVal_3723 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_3723) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4) 4) (select |c_#length| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4)))))) is different from false [2024-10-11 18:16:16,462 WARN L851 $PredicateComparison]: unable to prove that (or (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (let ((.cse0 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (and (forall ((v_ArrVal_3721 Int) (v_ArrVal_3723 (Array Int Int)) (v_ArrVal_3719 Int)) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| v_ArrVal_3719)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_3723) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4) 4) (select |c_#length| (select (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| v_ArrVal_3721) 4)))) (forall ((v_ArrVal_3719 Int) (v_prenex_4 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| v_ArrVal_3719)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4)))))) is different from false [2024-10-11 18:16:16,479 WARN L851 $PredicateComparison]: unable to prove that (or (let ((.cse0 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (and (forall ((v_ArrVal_3719 Int) (v_prenex_4 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| v_ArrVal_3719)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (forall ((v_ArrVal_3721 Int) (v_ArrVal_3723 (Array Int Int)) (v_ArrVal_3719 Int)) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| v_ArrVal_3719)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3723) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4) 4) (select |c_#length| (select (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| v_ArrVal_3721) 4)))))) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) is different from false [2024-10-11 18:16:16,504 INFO L349 Elim1Store]: treesize reduction 19, result has 62.0 percent of original size [2024-10-11 18:16:16,505 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 38 treesize of output 41 [2024-10-11 18:16:16,507 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:16:16,514 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:16:16,514 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 1 case distinctions, treesize of input 32 treesize of output 33 [2024-10-11 18:16:16,536 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:16:16,536 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 46 [2024-10-11 18:16:16,549 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:16:16,549 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 1 case distinctions, treesize of input 29 treesize of output 30 [2024-10-11 18:16:16,552 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2024-10-11 18:16:16,554 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:16:16,555 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2024-10-11 18:16:16,557 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:16:16,559 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 16 treesize of output 12 [2024-10-11 18:16:16,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2082604290] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:16:16,772 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:16:16,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 24] total 46 [2024-10-11 18:16:16,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405296459] [2024-10-11 18:16:16,772 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 18:16:16,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2024-10-11 18:16:16,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:16:16,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2024-10-11 18:16:16,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=3226, Unknown=3, NotChecked=348, Total=3782 [2024-10-11 18:16:16,774 INFO L87 Difference]: Start difference. First operand 88 states and 103 transitions. Second operand has 47 states, 41 states have (on average 1.6585365853658536) internal successors, (68), 41 states have internal predecessors, (68), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-11 18:16:19,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:16:19,068 INFO L93 Difference]: Finished difference Result 120 states and 138 transitions. [2024-10-11 18:16:19,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-10-11 18:16:19,069 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 41 states have (on average 1.6585365853658536) internal successors, (68), 41 states have internal predecessors, (68), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 38 [2024-10-11 18:16:19,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:16:19,070 INFO L225 Difference]: With dead ends: 120 [2024-10-11 18:16:19,070 INFO L226 Difference]: Without dead ends: 120 [2024-10-11 18:16:19,071 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1373 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=629, Invalid=7212, Unknown=3, NotChecked=528, Total=8372 [2024-10-11 18:16:19,072 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 181 mSDsluCounter, 707 mSDsCounter, 0 mSdLazyCounter, 1759 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 735 SdHoareTripleChecker+Invalid, 1771 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1759 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 18:16:19,072 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 735 Invalid, 1771 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1759 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 18:16:19,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-10-11 18:16:19,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 102. [2024-10-11 18:16:19,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 84 states have (on average 1.4523809523809523) internal successors, (122), 98 states have internal predecessors, (122), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 18:16:19,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 126 transitions. [2024-10-11 18:16:19,074 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 126 transitions. Word has length 38 [2024-10-11 18:16:19,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:16:19,074 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 126 transitions. [2024-10-11 18:16:19,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 41 states have (on average 1.6585365853658536) internal successors, (68), 41 states have internal predecessors, (68), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-11 18:16:19,074 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 126 transitions. [2024-10-11 18:16:19,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-11 18:16:19,075 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:16:19,075 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-10-11 18:16:19,096 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-10-11 18:16:19,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,13 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:16:19,276 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-10-11 18:16:19,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:16:19,276 INFO L85 PathProgramCache]: Analyzing trace with hash 2002632954, now seen corresponding path program 1 times [2024-10-11 18:16:19,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:16:19,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489161417] [2024-10-11 18:16:19,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:16:19,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:16:19,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:19,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:16:19,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:19,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 18:16:19,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:19,362 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-11 18:16:19,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:16:19,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489161417] [2024-10-11 18:16:19,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489161417] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:16:19,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1700304213] [2024-10-11 18:16:19,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:16:19,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:16:19,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:16:19,364 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:16:19,365 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-10-11 18:16:19,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:19,598 INFO L255 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-11 18:16:19,601 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:16:19,608 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-10-11 18:16:19,621 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 5 treesize of output 3 [2024-10-11 18:16:19,636 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))))) is different from true [2024-10-11 18:16:19,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:16:19,656 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-10-11 18:16:19,668 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 5 treesize of output 3 [2024-10-11 18:16:19,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:16:19,693 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-10-11 18:16:19,746 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:16:19,747 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-10-11 18:16:19,752 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-11 18:16:19,752 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:16:19,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1700304213] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:16:19,904 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:16:19,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 9 [2024-10-11 18:16:19,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509864918] [2024-10-11 18:16:19,904 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 18:16:19,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 18:16:19,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:16:19,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 18:16:19,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=85, Unknown=1, NotChecked=18, Total=132 [2024-10-11 18:16:19,905 INFO L87 Difference]: Start difference. First operand 102 states and 126 transitions. Second operand has 10 states, 9 states have (on average 6.111111111111111) internal successors, (55), 8 states have internal predecessors, (55), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 18:16:20,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:16:20,022 INFO L93 Difference]: Finished difference Result 130 states and 154 transitions. [2024-10-11 18:16:20,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 18:16:20,022 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.111111111111111) internal successors, (55), 8 states have internal predecessors, (55), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 38 [2024-10-11 18:16:20,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:16:20,023 INFO L225 Difference]: With dead ends: 130 [2024-10-11 18:16:20,023 INFO L226 Difference]: Without dead ends: 130 [2024-10-11 18:16:20,023 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=133, Unknown=1, NotChecked=24, Total=210 [2024-10-11 18:16:20,023 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 133 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 125 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:16:20,023 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 107 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 189 Invalid, 0 Unknown, 125 Unchecked, 0.1s Time] [2024-10-11 18:16:20,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-10-11 18:16:20,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 100. [2024-10-11 18:16:20,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 84 states have (on average 1.4047619047619047) internal successors, (118), 96 states have internal predecessors, (118), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 18:16:20,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 122 transitions. [2024-10-11 18:16:20,025 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 122 transitions. Word has length 38 [2024-10-11 18:16:20,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:16:20,026 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 122 transitions. [2024-10-11 18:16:20,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.111111111111111) internal successors, (55), 8 states have internal predecessors, (55), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 18:16:20,026 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 122 transitions. [2024-10-11 18:16:20,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-11 18:16:20,026 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:16:20,026 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, 1, 1, 1, 1, 1, 1] [2024-10-11 18:16:20,041 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-10-11 18:16:20,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,14 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:16:20,227 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-10-11 18:16:20,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:16:20,227 INFO L85 PathProgramCache]: Analyzing trace with hash 1952079452, now seen corresponding path program 1 times [2024-10-11 18:16:20,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:16:20,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720150935] [2024-10-11 18:16:20,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:16:20,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:16:20,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:21,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:16:21,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:21,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 18:16:21,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:21,242 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:16:21,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:16:21,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720150935] [2024-10-11 18:16:21,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720150935] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:16:21,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [316806320] [2024-10-11 18:16:21,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:16:21,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:16:21,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:16:21,244 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:16:21,245 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-10-11 18:16:21,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:21,458 INFO L255 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 69 conjuncts are in the unsatisfiable core [2024-10-11 18:16:21,460 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:16:21,462 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-10-11 18:16:21,610 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 18:16:21,610 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 11 treesize of output 11 [2024-10-11 18:16:21,688 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 27 treesize of output 1 [2024-10-11 18:16:21,784 INFO L349 Elim1Store]: treesize reduction 12, result has 50.0 percent of original size [2024-10-11 18:16:21,784 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 34 treesize of output 24 [2024-10-11 18:16:21,899 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-10-11 18:16:21,922 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:16:21,922 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:16:22,037 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 8 treesize of output 4 [2024-10-11 18:16:22,076 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:16:22,078 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-10-11 18:16:22,079 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 35 treesize of output 23 [2024-10-11 18:16:22,389 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:16:22,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [316806320] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:16:22,390 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 18:16:22,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 19, 19] total 56 [2024-10-11 18:16:22,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101207952] [2024-10-11 18:16:22,390 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 18:16:22,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2024-10-11 18:16:22,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:16:22,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2024-10-11 18:16:22,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=2910, Unknown=0, NotChecked=0, Total=3080 [2024-10-11 18:16:22,392 INFO L87 Difference]: Start difference. First operand 100 states and 122 transitions. Second operand has 56 states, 49 states have (on average 1.7959183673469388) internal successors, (88), 48 states have internal predecessors, (88), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2024-10-11 18:16:23,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:16:23,410 INFO L93 Difference]: Finished difference Result 102 states and 123 transitions. [2024-10-11 18:16:23,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-11 18:16:23,413 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 49 states have (on average 1.7959183673469388) internal successors, (88), 48 states have internal predecessors, (88), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 39 [2024-10-11 18:16:23,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:16:23,413 INFO L225 Difference]: With dead ends: 102 [2024-10-11 18:16:23,413 INFO L226 Difference]: Without dead ends: 100 [2024-10-11 18:16:23,414 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 838 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=330, Invalid=4640, Unknown=0, NotChecked=0, Total=4970 [2024-10-11 18:16:23,415 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 105 mSDsluCounter, 582 mSDsCounter, 0 mSdLazyCounter, 1507 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 1518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1507 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 18:16:23,415 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 601 Invalid, 1518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1507 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 18:16:23,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-10-11 18:16:23,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2024-10-11 18:16:23,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 84 states have (on average 1.3928571428571428) internal successors, (117), 96 states have internal predecessors, (117), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 18:16:23,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 121 transitions. [2024-10-11 18:16:23,417 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 121 transitions. Word has length 39 [2024-10-11 18:16:23,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:16:23,417 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 121 transitions. [2024-10-11 18:16:23,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 49 states have (on average 1.7959183673469388) internal successors, (88), 48 states have internal predecessors, (88), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2024-10-11 18:16:23,417 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 121 transitions. [2024-10-11 18:16:23,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-11 18:16:23,417 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:16:23,417 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:16:23,433 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2024-10-11 18:16:23,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2024-10-11 18:16:23,618 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-10-11 18:16:23,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:16:23,618 INFO L85 PathProgramCache]: Analyzing trace with hash -322403520, now seen corresponding path program 1 times [2024-10-11 18:16:23,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:16:23,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510044426] [2024-10-11 18:16:23,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:16:23,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:16:23,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:23,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:16:23,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:23,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 18:16:23,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:23,763 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-11 18:16:23,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:16:23,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510044426] [2024-10-11 18:16:23,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510044426] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:16:23,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [565294204] [2024-10-11 18:16:23,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:16:23,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:16:23,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:16:23,765 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:16:23,767 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-10-11 18:16:24,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:24,035 INFO L255 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-10-11 18:16:24,038 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:16:24,120 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-10-11 18:16:24,122 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-11 18:16:24,122 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:16:24,131 INFO L349 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2024-10-11 18:16:24,132 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 16 treesize of output 15 [2024-10-11 18:16:24,161 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-11 18:16:24,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [565294204] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:16:24,161 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 18:16:24,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 6] total 15 [2024-10-11 18:16:24,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820066015] [2024-10-11 18:16:24,161 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 18:16:24,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-11 18:16:24,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:16:24,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-11 18:16:24,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2024-10-11 18:16:24,162 INFO L87 Difference]: Start difference. First operand 100 states and 121 transitions. Second operand has 16 states, 15 states have (on average 4.866666666666666) internal successors, (73), 15 states have internal predecessors, (73), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 18:16:24,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:16:24,345 INFO L93 Difference]: Finished difference Result 121 states and 142 transitions. [2024-10-11 18:16:24,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 18:16:24,346 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 4.866666666666666) internal successors, (73), 15 states have internal predecessors, (73), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 42 [2024-10-11 18:16:24,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:16:24,346 INFO L225 Difference]: With dead ends: 121 [2024-10-11 18:16:24,346 INFO L226 Difference]: Without dead ends: 121 [2024-10-11 18:16:24,347 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2024-10-11 18:16:24,347 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 112 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:16:24,347 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 311 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:16:24,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-10-11 18:16:24,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 104. [2024-10-11 18:16:24,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 88 states have (on average 1.375) internal successors, (121), 100 states have internal predecessors, (121), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 18:16:24,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 125 transitions. [2024-10-11 18:16:24,349 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 125 transitions. Word has length 42 [2024-10-11 18:16:24,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:16:24,350 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 125 transitions. [2024-10-11 18:16:24,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 4.866666666666666) internal successors, (73), 15 states have internal predecessors, (73), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 18:16:24,350 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 125 transitions. [2024-10-11 18:16:24,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-11 18:16:24,350 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:16:24,350 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:16:24,365 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-10-11 18:16:24,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,16 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:16:24,551 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-10-11 18:16:24,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:16:24,551 INFO L85 PathProgramCache]: Analyzing trace with hash -1404576354, now seen corresponding path program 1 times [2024-10-11 18:16:24,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:16:24,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081558259] [2024-10-11 18:16:24,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:16:24,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:16:24,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:24,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:16:24,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:24,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 18:16:24,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:24,680 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 18:16:24,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:16:24,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081558259] [2024-10-11 18:16:24,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081558259] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:16:24,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:16:24,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 18:16:24,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678733654] [2024-10-11 18:16:24,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:16:24,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 18:16:24,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:16:24,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 18:16:24,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-11 18:16:24,683 INFO L87 Difference]: Start difference. First operand 104 states and 125 transitions. Second operand has 10 states, 9 states have (on average 4.333333333333333) internal successors, (39), 8 states have internal predecessors, (39), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 18:16:24,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:16:24,789 INFO L93 Difference]: Finished difference Result 115 states and 129 transitions. [2024-10-11 18:16:24,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 18:16:24,790 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.333333333333333) internal successors, (39), 8 states have internal predecessors, (39), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 43 [2024-10-11 18:16:24,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:16:24,790 INFO L225 Difference]: With dead ends: 115 [2024-10-11 18:16:24,790 INFO L226 Difference]: Without dead ends: 115 [2024-10-11 18:16:24,790 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-11 18:16:24,791 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 12 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:16:24,791 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 274 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:16:24,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-10-11 18:16:24,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 106. [2024-10-11 18:16:24,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 90 states have (on average 1.3666666666666667) internal successors, (123), 102 states have internal predecessors, (123), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 18:16:24,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 127 transitions. [2024-10-11 18:16:24,793 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 127 transitions. Word has length 43 [2024-10-11 18:16:24,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:16:24,793 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 127 transitions. [2024-10-11 18:16:24,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.333333333333333) internal successors, (39), 8 states have internal predecessors, (39), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 18:16:24,793 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 127 transitions. [2024-10-11 18:16:24,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-11 18:16:24,793 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:16:24,794 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:16:24,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-10-11 18:16:24,794 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-10-11 18:16:24,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:16:24,794 INFO L85 PathProgramCache]: Analyzing trace with hash -592146989, now seen corresponding path program 1 times [2024-10-11 18:16:24,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:16:24,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349962771] [2024-10-11 18:16:24,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:16:24,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:16:24,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:24,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:16:24,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:24,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 18:16:24,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:24,880 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-11 18:16:24,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:16:24,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349962771] [2024-10-11 18:16:24,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349962771] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:16:24,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [856560661] [2024-10-11 18:16:24,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:16:24,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:16:24,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:16:24,884 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:16:24,886 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-10-11 18:16:25,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:25,108 INFO L255 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 18:16:25,109 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:16:25,152 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-11 18:16:25,153 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:16:25,191 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-11 18:16:25,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [856560661] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:16:25,191 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 18:16:25,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2024-10-11 18:16:25,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50673337] [2024-10-11 18:16:25,191 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 18:16:25,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 18:16:25,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:16:25,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 18:16:25,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-10-11 18:16:25,193 INFO L87 Difference]: Start difference. First operand 106 states and 127 transitions. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 8 states have internal predecessors, (67), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 18:16:25,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:16:25,253 INFO L93 Difference]: Finished difference Result 119 states and 133 transitions. [2024-10-11 18:16:25,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 18:16:25,256 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 8 states have internal predecessors, (67), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 44 [2024-10-11 18:16:25,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:16:25,257 INFO L225 Difference]: With dead ends: 119 [2024-10-11 18:16:25,257 INFO L226 Difference]: Without dead ends: 119 [2024-10-11 18:16:25,257 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 85 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2024-10-11 18:16:25,258 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 136 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:16:25,258 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 198 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:16:25,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-10-11 18:16:25,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 106. [2024-10-11 18:16:25,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 90 states have (on average 1.3555555555555556) internal successors, (122), 102 states have internal predecessors, (122), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 18:16:25,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 126 transitions. [2024-10-11 18:16:25,260 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 126 transitions. Word has length 44 [2024-10-11 18:16:25,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:16:25,260 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 126 transitions. [2024-10-11 18:16:25,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 8 states have internal predecessors, (67), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 18:16:25,260 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 126 transitions. [2024-10-11 18:16:25,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-11 18:16:25,260 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:16:25,260 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 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, 1, 1, 1, 1, 1, 1] [2024-10-11 18:16:25,275 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2024-10-11 18:16:25,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2024-10-11 18:16:25,461 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-10-11 18:16:25,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:16:25,461 INFO L85 PathProgramCache]: Analyzing trace with hash -1173087027, now seen corresponding path program 1 times [2024-10-11 18:16:25,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:16:25,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147764357] [2024-10-11 18:16:25,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:16:25,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:16:25,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:27,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:16:27,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:27,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 18:16:27,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:28,175 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:16:28,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:16:28,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147764357] [2024-10-11 18:16:28,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147764357] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:16:28,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1315382634] [2024-10-11 18:16:28,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:16:28,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:16:28,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:16:28,177 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:16:28,178 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-10-11 18:16:28,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:28,496 INFO L255 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 175 conjuncts are in the unsatisfiable core [2024-10-11 18:16:28,501 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:16:28,525 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-10-11 18:16:28,551 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-11 18:16:28,582 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 19 treesize of output 18 [2024-10-11 18:16:28,616 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 0 case distinctions, treesize of input 30 treesize of output 21 [2024-10-11 18:16:28,846 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-11 18:16:28,899 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 23 treesize of output 11 [2024-10-11 18:16:28,958 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 18:16:28,958 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 11 treesize of output 11 [2024-10-11 18:16:28,962 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 35 [2024-10-11 18:16:29,086 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-10-11 18:16:29,093 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 41 [2024-10-11 18:16:29,184 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-10-11 18:16:29,191 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 41 [2024-10-11 18:16:29,331 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-10-11 18:16:29,331 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 45 [2024-10-11 18:16:29,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:16:29,338 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 49 [2024-10-11 18:16:29,430 INFO L349 Elim1Store]: treesize reduction 99, result has 22.0 percent of original size [2024-10-11 18:16:29,430 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 123 treesize of output 77 [2024-10-11 18:16:29,438 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 65 [2024-10-11 18:16:30,211 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:16:30,212 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:16:30,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:16:30,225 INFO L349 Elim1Store]: treesize reduction 84, result has 11.6 percent of original size [2024-10-11 18:16:30,225 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 11 case distinctions, treesize of input 164 treesize of output 91 [2024-10-11 18:16:30,237 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:16:30,238 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:16:30,238 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:16:30,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 55 [2024-10-11 18:16:30,493 INFO L349 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2024-10-11 18:16:30,494 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 96 treesize of output 72 [2024-10-11 18:16:30,501 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 53 [2024-10-11 18:16:30,898 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-10-11 18:16:30,898 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 83 treesize of output 42 [2024-10-11 18:16:30,905 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 13 [2024-10-11 18:16:30,956 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-10-11 18:16:30,995 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:16:30,995 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:16:31,962 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 624 treesize of output 532 [2024-10-11 18:16:31,964 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 426 treesize of output 350 [2024-10-11 18:16:36,342 INFO L349 Elim1Store]: treesize reduction 106, result has 39.4 percent of original size [2024-10-11 18:16:36,343 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 4 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 8 new quantified variables, introduced 11 case distinctions, treesize of input 10574 treesize of output 7831 [2024-10-11 18:16:36,608 INFO L349 Elim1Store]: treesize reduction 73, result has 45.5 percent of original size [2024-10-11 18:16:36,608 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 3958 treesize of output 3601 [2024-10-11 18:16:37,079 INFO L349 Elim1Store]: treesize reduction 307, result has 36.6 percent of original size [2024-10-11 18:16:37,080 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 22 case distinctions, treesize of input 67756 treesize of output 67647 [2024-10-11 18:16:37,411 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:16:37,411 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 11818 treesize of output 12046 [2024-10-11 18:16:38,657 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:16:38,657 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 40 [2024-10-11 18:16:38,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:16:38,736 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 32 treesize of output 11