./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/sll2c_append_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_append_equal.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b335af75f55d322161e6a270bf4669ab290ae0e9da4bc480724c7d5e3b79fdab --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 18:14:56,762 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 18:14:56,846 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-14 18:14:56,851 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 18:14:56,853 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 18:14:56,886 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 18:14:56,886 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 18:14:56,887 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 18:14:56,887 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 18:14:56,888 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 18:14:56,888 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 18:14:56,892 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 18:14:56,893 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 18:14:56,893 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 18:14:56,894 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 18:14:56,894 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 18:14:56,894 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 18:14:56,895 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 18:14:56,898 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 18:14:56,898 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 18:14:56,899 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-14 18:14:56,899 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-14 18:14:56,900 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-14 18:14:56,900 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 18:14:56,900 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 18:14:56,900 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 18:14:56,900 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 18:14:56,900 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 18:14:56,901 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 18:14:56,901 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 18:14:56,901 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 18:14:56,901 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 18:14:56,901 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 18:14:56,902 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 18:14:56,902 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 18:14:56,903 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 18:14:56,904 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 18:14:56,904 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 18:14:56,904 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 18:14:56,904 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 18:14:56,905 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 18:14:56,905 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 18:14:56,905 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b335af75f55d322161e6a270bf4669ab290ae0e9da4bc480724c7d5e3b79fdab [2024-10-14 18:14:57,189 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 18:14:57,219 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 18:14:57,222 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 18:14:57,223 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 18:14:57,223 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 18:14:57,225 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_append_equal.i [2024-10-14 18:14:58,925 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 18:14:59,172 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 18:14:59,172 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_append_equal.i [2024-10-14 18:14:59,189 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/122f8d13d/b721dfc2c90d43139c5519f05d6c3015/FLAGd778c977f [2024-10-14 18:14:59,489 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/122f8d13d/b721dfc2c90d43139c5519f05d6c3015 [2024-10-14 18:14:59,491 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 18:14:59,493 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 18:14:59,494 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 18:14:59,494 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 18:14:59,499 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 18:14:59,500 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 06:14:59" (1/1) ... [2024-10-14 18:14:59,501 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28e19862 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:14:59, skipping insertion in model container [2024-10-14 18:14:59,501 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 06:14:59" (1/1) ... [2024-10-14 18:14:59,533 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 18:15:00,069 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 18:15:00,080 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 18:15:00,141 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 18:15:00,176 INFO L204 MainTranslator]: Completed translation [2024-10-14 18:15:00,177 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:15:00 WrapperNode [2024-10-14 18:15:00,177 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 18:15:00,178 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 18:15:00,178 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 18:15:00,178 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 18:15:00,186 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:15:00" (1/1) ... [2024-10-14 18:15:00,204 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:15:00" (1/1) ... [2024-10-14 18:15:00,239 INFO L138 Inliner]: procedures = 127, calls = 43, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 147 [2024-10-14 18:15:00,242 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 18:15:00,243 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 18:15:00,243 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 18:15:00,243 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 18:15:00,255 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:15:00" (1/1) ... [2024-10-14 18:15:00,255 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:15:00" (1/1) ... [2024-10-14 18:15:00,262 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:15:00" (1/1) ... [2024-10-14 18:15:00,295 INFO L175 MemorySlicer]: Split 24 memory accesses to 3 slices as follows [2, 9, 13]. 54 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 8 writes are split as follows [0, 1, 7]. [2024-10-14 18:15:00,296 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:15:00" (1/1) ... [2024-10-14 18:15:00,296 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:15:00" (1/1) ... [2024-10-14 18:15:00,309 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:15:00" (1/1) ... [2024-10-14 18:15:00,317 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:15:00" (1/1) ... [2024-10-14 18:15:00,323 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:15:00" (1/1) ... [2024-10-14 18:15:00,328 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:15:00" (1/1) ... [2024-10-14 18:15:00,331 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 18:15:00,333 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 18:15:00,333 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 18:15:00,333 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 18:15:00,334 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:15:00" (1/1) ... [2024-10-14 18:15:00,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 18:15:00,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:15:00,381 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 18:15:00,384 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 18:15:00,424 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-14 18:15:00,424 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-14 18:15:00,425 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-14 18:15:00,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-14 18:15:00,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-14 18:15:00,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-14 18:15:00,425 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-10-14 18:15:00,425 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-10-14 18:15:00,426 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-14 18:15:00,426 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 18:15:00,426 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-14 18:15:00,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-14 18:15:00,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-14 18:15:00,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-14 18:15:00,427 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-14 18:15:00,427 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-14 18:15:00,427 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-14 18:15:00,427 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-14 18:15:00,427 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-14 18:15:00,427 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-14 18:15:00,427 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-10-14 18:15:00,428 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 18:15:00,428 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-14 18:15:00,428 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-14 18:15:00,428 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 18:15:00,428 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 18:15:00,547 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 18:15:00,549 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 18:15:00,824 INFO L? ?]: Removed 129 outVars from TransFormulas that were not future-live. [2024-10-14 18:15:00,825 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 18:15:00,863 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 18:15:00,863 INFO L314 CfgBuilder]: Removed 4 assume(true) statements. [2024-10-14 18:15:00,863 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 06:15:00 BoogieIcfgContainer [2024-10-14 18:15:00,864 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 18:15:00,866 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 18:15:00,866 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 18:15:00,869 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 18:15:00,869 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 06:14:59" (1/3) ... [2024-10-14 18:15:00,870 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@333f380 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 06:15:00, skipping insertion in model container [2024-10-14 18:15:00,870 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:15:00" (2/3) ... [2024-10-14 18:15:00,870 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@333f380 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 06:15:00, skipping insertion in model container [2024-10-14 18:15:00,870 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 06:15:00" (3/3) ... [2024-10-14 18:15:00,872 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_append_equal.i [2024-10-14 18:15:00,886 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 18:15:00,887 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 50 error locations. [2024-10-14 18:15:00,933 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 18:15:00,941 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;@1bbd97c1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 18:15:00,941 INFO L334 AbstractCegarLoop]: Starting to check reachability of 50 error locations. [2024-10-14 18:15:00,945 INFO L276 IsEmpty]: Start isEmpty. Operand has 104 states, 49 states have (on average 2.306122448979592) internal successors, (113), 99 states have internal predecessors, (113), 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-14 18:15:00,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-14 18:15:00,953 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:15:00,954 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-14 18:15:00,954 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-10-14 18:15:00,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:15:00,960 INFO L85 PathProgramCache]: Analyzing trace with hash 227600450, now seen corresponding path program 1 times [2024-10-14 18:15:00,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:15:00,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121605934] [2024-10-14 18:15:00,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:15:00,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:15:01,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:01,206 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-14 18:15:01,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:15:01,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121605934] [2024-10-14 18:15:01,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121605934] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:15:01,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:15:01,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 18:15:01,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715101989] [2024-10-14 18:15:01,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:15:01,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 18:15:01,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:15:01,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 18:15:01,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 18:15:01,248 INFO L87 Difference]: Start difference. First operand has 104 states, 49 states have (on average 2.306122448979592) internal successors, (113), 99 states have internal predecessors, (113), 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) 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-14 18:15:01,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:15:01,379 INFO L93 Difference]: Finished difference Result 101 states and 110 transitions. [2024-10-14 18:15:01,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 18:15:01,382 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-14 18:15:01,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:15:01,390 INFO L225 Difference]: With dead ends: 101 [2024-10-14 18:15:01,390 INFO L226 Difference]: Without dead ends: 99 [2024-10-14 18:15:01,392 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-14 18:15:01,396 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 1 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 18:15:01,399 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 149 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 18:15:01,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-10-14 18:15:01,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2024-10-14 18:15:01,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 47 states have (on average 2.148936170212766) internal successors, (101), 94 states have internal predecessors, (101), 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-14 18:15:01,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 107 transitions. [2024-10-14 18:15:01,445 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 107 transitions. Word has length 5 [2024-10-14 18:15:01,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:15:01,445 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 107 transitions. [2024-10-14 18:15:01,445 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-14 18:15:01,445 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 107 transitions. [2024-10-14 18:15:01,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-14 18:15:01,446 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:15:01,446 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-14 18:15:01,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 18:15:01,446 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-10-14 18:15:01,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:15:01,447 INFO L85 PathProgramCache]: Analyzing trace with hash 227600451, now seen corresponding path program 1 times [2024-10-14 18:15:01,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:15:01,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767214261] [2024-10-14 18:15:01,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:15:01,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:15:01,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:01,634 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-14 18:15:01,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:15:01,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767214261] [2024-10-14 18:15:01,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767214261] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:15:01,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:15:01,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 18:15:01,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401827396] [2024-10-14 18:15:01,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:15:01,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 18:15:01,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:15:01,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 18:15:01,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 18:15:01,637 INFO L87 Difference]: Start difference. First operand 99 states and 107 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-14 18:15:01,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:15:01,720 INFO L93 Difference]: Finished difference Result 97 states and 105 transitions. [2024-10-14 18:15:01,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 18:15:01,721 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-14 18:15:01,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:15:01,748 INFO L225 Difference]: With dead ends: 97 [2024-10-14 18:15:01,749 INFO L226 Difference]: Without dead ends: 97 [2024-10-14 18:15:01,749 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-14 18:15:01,750 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 1 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 18:15:01,752 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 153 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 18:15:01,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-10-14 18:15:01,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2024-10-14 18:15:01,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 47 states have (on average 2.106382978723404) internal successors, (99), 92 states have internal predecessors, (99), 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-14 18:15:01,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 105 transitions. [2024-10-14 18:15:01,764 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 105 transitions. Word has length 5 [2024-10-14 18:15:01,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:15:01,765 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 105 transitions. [2024-10-14 18:15:01,765 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-14 18:15:01,765 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 105 transitions. [2024-10-14 18:15:01,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-14 18:15:01,766 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:15:01,766 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:15:01,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 18:15:01,766 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-10-14 18:15:01,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:15:01,767 INFO L85 PathProgramCache]: Analyzing trace with hash 1271624451, now seen corresponding path program 1 times [2024-10-14 18:15:01,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:15:01,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266635163] [2024-10-14 18:15:01,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:15:01,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:15:01,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:01,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 18:15:01,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:01,851 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-14 18:15:01,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:15:01,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266635163] [2024-10-14 18:15:01,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266635163] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:15:01,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:15:01,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 18:15:01,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675832626] [2024-10-14 18:15:01,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:15:01,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 18:15:01,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:15:01,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 18:15:01,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 18:15:01,854 INFO L87 Difference]: Start difference. First operand 97 states and 105 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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-14 18:15:01,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:15:01,988 INFO L93 Difference]: Finished difference Result 98 states and 106 transitions. [2024-10-14 18:15:01,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 18:15:01,989 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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 10 [2024-10-14 18:15:01,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:15:01,990 INFO L225 Difference]: With dead ends: 98 [2024-10-14 18:15:01,990 INFO L226 Difference]: Without dead ends: 98 [2024-10-14 18:15:01,991 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-14 18:15:01,992 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 4 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 18:15:01,992 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 209 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 18:15:01,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-10-14 18:15:01,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2024-10-14 18:15:01,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 48 states have (on average 2.0833333333333335) internal successors, (100), 93 states have internal predecessors, (100), 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-14 18:15:01,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 106 transitions. [2024-10-14 18:15:01,999 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 106 transitions. Word has length 10 [2024-10-14 18:15:02,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:15:02,001 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 106 transitions. [2024-10-14 18:15:02,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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-14 18:15:02,001 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 106 transitions. [2024-10-14 18:15:02,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-14 18:15:02,002 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:15:02,002 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:15:02,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 18:15:02,002 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-10-14 18:15:02,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:15:02,003 INFO L85 PathProgramCache]: Analyzing trace with hash 310161943, now seen corresponding path program 1 times [2024-10-14 18:15:02,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:15:02,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470327967] [2024-10-14 18:15:02,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:15:02,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:15:02,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:02,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 18:15:02,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:02,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 18:15:02,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:02,191 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-14 18:15:02,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:15:02,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470327967] [2024-10-14 18:15:02,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470327967] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:15:02,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:15:02,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 18:15:02,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588723782] [2024-10-14 18:15:02,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:15:02,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 18:15:02,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:15:02,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 18:15:02,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 18:15:02,195 INFO L87 Difference]: Start difference. First operand 98 states and 106 transitions. Second operand has 7 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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-14 18:15:02,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:15:02,403 INFO L93 Difference]: Finished difference Result 97 states and 105 transitions. [2024-10-14 18:15:02,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 18:15:02,404 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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 17 [2024-10-14 18:15:02,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:15:02,405 INFO L225 Difference]: With dead ends: 97 [2024-10-14 18:15:02,405 INFO L226 Difference]: Without dead ends: 97 [2024-10-14 18:15:02,406 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-14 18:15:02,407 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 1 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 18:15:02,407 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 321 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 18:15:02,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-10-14 18:15:02,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2024-10-14 18:15:02,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 48 states have (on average 2.0625) internal successors, (99), 92 states have internal predecessors, (99), 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-14 18:15:02,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 105 transitions. [2024-10-14 18:15:02,414 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 105 transitions. Word has length 17 [2024-10-14 18:15:02,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:15:02,415 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 105 transitions. [2024-10-14 18:15:02,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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-14 18:15:02,415 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 105 transitions. [2024-10-14 18:15:02,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-14 18:15:02,416 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:15:02,416 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:15:02,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 18:15:02,416 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-10-14 18:15:02,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:15:02,417 INFO L85 PathProgramCache]: Analyzing trace with hash 310161944, now seen corresponding path program 1 times [2024-10-14 18:15:02,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:15:02,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772199052] [2024-10-14 18:15:02,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:15:02,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:15:02,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:02,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 18:15:02,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:02,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 18:15:02,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:02,692 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 18:15:02,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:15:02,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772199052] [2024-10-14 18:15:02,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772199052] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:15:02,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:15:02,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 18:15:02,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370559244] [2024-10-14 18:15:02,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:15:02,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 18:15:02,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:15:02,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 18:15:02,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 18:15:02,696 INFO L87 Difference]: Start difference. First operand 97 states and 105 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-14 18:15:02,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:15:02,892 INFO L93 Difference]: Finished difference Result 96 states and 104 transitions. [2024-10-14 18:15:02,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 18:15:02,893 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 17 [2024-10-14 18:15:02,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:15:02,895 INFO L225 Difference]: With dead ends: 96 [2024-10-14 18:15:02,895 INFO L226 Difference]: Without dead ends: 96 [2024-10-14 18:15:02,896 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-14 18:15:02,897 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 0 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 18:15:02,897 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 345 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 18:15:02,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-10-14 18:15:02,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-10-14 18:15:02,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 48 states have (on average 2.0416666666666665) internal successors, (98), 91 states have internal predecessors, (98), 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-14 18:15:02,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 104 transitions. [2024-10-14 18:15:02,904 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 104 transitions. Word has length 17 [2024-10-14 18:15:02,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:15:02,905 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 104 transitions. [2024-10-14 18:15:02,905 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-14 18:15:02,905 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 104 transitions. [2024-10-14 18:15:02,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-14 18:15:02,906 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:15:02,906 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:15:02,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 18:15:02,907 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-10-14 18:15:02,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:15:02,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1713071559, now seen corresponding path program 1 times [2024-10-14 18:15:02,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:15:02,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905424129] [2024-10-14 18:15:02,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:15:02,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:15:02,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:03,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 18:15:03,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:03,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 18:15:03,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:03,151 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 18:15:03,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:15:03,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905424129] [2024-10-14 18:15:03,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905424129] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:15:03,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [448093453] [2024-10-14 18:15:03,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:15:03,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:15:03,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:15:03,154 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 18:15:03,158 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-14 18:15:03,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:03,296 INFO L255 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-14 18:15:03,301 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:15:03,342 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-14 18:15:03,383 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-14 18:15:03,424 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-10-14 18:15:03,424 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-14 18:15:03,435 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2024-10-14 18:15:03,435 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 18:15:03,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [448093453] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:15:03,491 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 18:15:03,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 10 [2024-10-14 18:15:03,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272265823] [2024-10-14 18:15:03,492 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 18:15:03,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-14 18:15:03,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:15:03,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-14 18:15:03,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=87, Unknown=1, NotChecked=18, Total=132 [2024-10-14 18:15:03,493 INFO L87 Difference]: Start difference. First operand 96 states and 104 transitions. Second operand has 11 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 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-14 18:15:03,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:15:03,819 INFO L93 Difference]: Finished difference Result 95 states and 103 transitions. [2024-10-14 18:15:03,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 18:15:03,820 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 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 19 [2024-10-14 18:15:03,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:15:03,820 INFO L225 Difference]: With dead ends: 95 [2024-10-14 18:15:03,821 INFO L226 Difference]: Without dead ends: 95 [2024-10-14 18:15:03,821 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 25 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-14 18:15:03,822 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 0 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 443 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 98 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 18:15:03,822 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 448 Invalid, 542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 443 Invalid, 0 Unknown, 98 Unchecked, 0.3s Time] [2024-10-14 18:15:03,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-10-14 18:15:03,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2024-10-14 18:15:03,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 48 states have (on average 2.0208333333333335) internal successors, (97), 90 states have internal predecessors, (97), 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-14 18:15:03,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 103 transitions. [2024-10-14 18:15:03,828 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 103 transitions. Word has length 19 [2024-10-14 18:15:03,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:15:03,828 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 103 transitions. [2024-10-14 18:15:03,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 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-14 18:15:03,829 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 103 transitions. [2024-10-14 18:15:03,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-14 18:15:03,829 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:15:03,830 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:15:03,851 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-14 18:15:04,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-10-14 18:15:04,032 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-10-14 18:15:04,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:15:04,032 INFO L85 PathProgramCache]: Analyzing trace with hash 1713071560, now seen corresponding path program 1 times [2024-10-14 18:15:04,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:15:04,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382324413] [2024-10-14 18:15:04,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:15:04,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:15:04,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:04,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 18:15:04,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:04,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 18:15:04,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:04,381 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 18:15:04,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:15:04,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382324413] [2024-10-14 18:15:04,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382324413] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:15:04,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1028075512] [2024-10-14 18:15:04,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:15:04,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:15:04,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:15:04,385 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 18:15:04,389 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-14 18:15:04,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:04,515 INFO L255 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-14 18:15:04,517 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:15:04,524 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-14 18:15:04,718 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-14 18:15:04,719 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-14 18:15:04,743 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 18:15:04,744 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 18:15:04,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1028075512] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:15:04,859 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 18:15:04,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2024-10-14 18:15:04,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594999212] [2024-10-14 18:15:04,859 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 18:15:04,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-14 18:15:04,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:15:04,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-14 18:15:04,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2024-10-14 18:15:04,862 INFO L87 Difference]: Start difference. First operand 95 states and 103 transitions. Second operand has 16 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 12 states have internal predecessors, (29), 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-14 18:15:05,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:15:05,293 INFO L93 Difference]: Finished difference Result 95 states and 103 transitions. [2024-10-14 18:15:05,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 18:15:05,293 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 12 states have internal predecessors, (29), 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 19 [2024-10-14 18:15:05,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:15:05,294 INFO L225 Difference]: With dead ends: 95 [2024-10-14 18:15:05,294 INFO L226 Difference]: Without dead ends: 95 [2024-10-14 18:15:05,295 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=67, Invalid=353, Unknown=0, NotChecked=0, Total=420 [2024-10-14 18:15:05,296 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 0 mSDsluCounter, 516 mSDsCounter, 0 mSdLazyCounter, 494 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 600 SdHoareTripleChecker+Invalid, 496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 18:15:05,296 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 600 Invalid, 496 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 494 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 18:15:05,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-10-14 18:15:05,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2024-10-14 18:15:05,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 48 states have (on average 2.0) internal successors, (96), 89 states have internal predecessors, (96), 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-14 18:15:05,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 102 transitions. [2024-10-14 18:15:05,301 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 102 transitions. Word has length 19 [2024-10-14 18:15:05,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:15:05,301 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 102 transitions. [2024-10-14 18:15:05,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 12 states have internal predecessors, (29), 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-14 18:15:05,302 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 102 transitions. [2024-10-14 18:15:05,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-14 18:15:05,302 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:15:05,302 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:15:05,324 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-14 18:15:05,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-10-14 18:15:05,504 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-10-14 18:15:05,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:15:05,505 INFO L85 PathProgramCache]: Analyzing trace with hash -219065859, now seen corresponding path program 1 times [2024-10-14 18:15:05,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:15:05,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259396471] [2024-10-14 18:15:05,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:15:05,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:15:05,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:05,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 18:15:05,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:05,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 18:15:05,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:05,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 18:15:05,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:05,908 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-14 18:15:05,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:15:05,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259396471] [2024-10-14 18:15:05,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259396471] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:15:05,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [994858279] [2024-10-14 18:15:05,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:15:05,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:15:05,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:15:05,911 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 18:15:05,913 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-14 18:15:06,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:06,047 INFO L255 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-10-14 18:15:06,050 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:15:06,053 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-14 18:15:06,112 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-14 18:15:06,113 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-14 18:15:06,181 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-14 18:15:06,181 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 18 treesize of output 17 [2024-10-14 18:15:06,313 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1))) is different from true [2024-10-14 18:15:06,336 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-10-14 18:15:06,337 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-10-14 18:15:06,346 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 8 not checked. [2024-10-14 18:15:06,346 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 18:15:06,943 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-14 18:15:06,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [994858279] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 18:15:06,944 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 18:15:06,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11, 12] total 25 [2024-10-14 18:15:06,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267822656] [2024-10-14 18:15:06,944 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 18:15:06,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-10-14 18:15:06,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:15:06,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-10-14 18:15:06,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=525, Unknown=1, NotChecked=48, Total=702 [2024-10-14 18:15:06,946 INFO L87 Difference]: Start difference. First operand 94 states and 102 transitions. Second operand has 27 states, 21 states have (on average 2.2857142857142856) internal successors, (48), 21 states have internal predecessors, (48), 4 states have call successors, (9), 3 states have call predecessors, (9), 7 states have return successors, (9), 6 states have call predecessors, (9), 4 states have call successors, (9) [2024-10-14 18:15:07,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:15:07,406 INFO L93 Difference]: Finished difference Result 103 states and 112 transitions. [2024-10-14 18:15:07,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 18:15:07,407 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 21 states have (on average 2.2857142857142856) internal successors, (48), 21 states have internal predecessors, (48), 4 states have call successors, (9), 3 states have call predecessors, (9), 7 states have return successors, (9), 6 states have call predecessors, (9), 4 states have call successors, (9) Word has length 27 [2024-10-14 18:15:07,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:15:07,408 INFO L225 Difference]: With dead ends: 103 [2024-10-14 18:15:07,408 INFO L226 Difference]: Without dead ends: 103 [2024-10-14 18:15:07,408 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 33 SyntacticMatches, 8 SemanticMatches, 28 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=163, Invalid=652, Unknown=1, NotChecked=54, Total=870 [2024-10-14 18:15:07,409 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 302 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 514 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 107 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 18:15:07,409 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [302 Valid, 328 Invalid, 633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 514 Invalid, 0 Unknown, 107 Unchecked, 0.4s Time] [2024-10-14 18:15:07,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-10-14 18:15:07,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 86. [2024-10-14 18:15:07,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 48 states have (on average 1.8333333333333333) internal successors, (88), 81 states have internal predecessors, (88), 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-14 18:15:07,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 94 transitions. [2024-10-14 18:15:07,414 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 94 transitions. Word has length 27 [2024-10-14 18:15:07,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:15:07,415 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 94 transitions. [2024-10-14 18:15:07,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 21 states have (on average 2.2857142857142856) internal successors, (48), 21 states have internal predecessors, (48), 4 states have call successors, (9), 3 states have call predecessors, (9), 7 states have return successors, (9), 6 states have call predecessors, (9), 4 states have call successors, (9) [2024-10-14 18:15:07,415 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 94 transitions. [2024-10-14 18:15:07,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-14 18:15:07,416 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:15:07,416 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:15:07,434 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-14 18:15:07,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:15:07,618 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-10-14 18:15:07,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:15:07,618 INFO L85 PathProgramCache]: Analyzing trace with hash -219065858, now seen corresponding path program 1 times [2024-10-14 18:15:07,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:15:07,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037330493] [2024-10-14 18:15:07,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:15:07,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:15:07,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:07,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 18:15:07,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:08,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 18:15:08,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:08,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 18:15:08,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:08,112 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-14 18:15:08,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:15:08,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037330493] [2024-10-14 18:15:08,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037330493] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:15:08,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:15:08,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 18:15:08,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509485430] [2024-10-14 18:15:08,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:15:08,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 18:15:08,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:15:08,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 18:15:08,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-10-14 18:15:08,115 INFO L87 Difference]: Start difference. First operand 86 states and 94 transitions. Second operand has 9 states, 5 states have (on average 2.6) internal successors, (13), 7 states have internal predecessors, (13), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 18:15:08,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:15:08,306 INFO L93 Difference]: Finished difference Result 78 states and 86 transitions. [2024-10-14 18:15:08,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 18:15:08,307 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 5 states have (on average 2.6) internal successors, (13), 7 states have internal predecessors, (13), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 27 [2024-10-14 18:15:08,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:15:08,307 INFO L225 Difference]: With dead ends: 78 [2024-10-14 18:15:08,308 INFO L226 Difference]: Without dead ends: 78 [2024-10-14 18:15:08,308 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-10-14 18:15:08,308 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 80 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 18:15:08,309 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 218 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 18:15:08,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-10-14 18:15:08,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-10-14 18:15:08,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 48 states have (on average 1.6666666666666667) internal successors, (80), 73 states have internal predecessors, (80), 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-14 18:15:08,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 86 transitions. [2024-10-14 18:15:08,313 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 86 transitions. Word has length 27 [2024-10-14 18:15:08,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:15:08,313 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 86 transitions. [2024-10-14 18:15:08,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 5 states have (on average 2.6) internal successors, (13), 7 states have internal predecessors, (13), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 18:15:08,313 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 86 transitions. [2024-10-14 18:15:08,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-14 18:15:08,314 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:15:08,314 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:15:08,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 18:15:08,314 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-10-14 18:15:08,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:15:08,315 INFO L85 PathProgramCache]: Analyzing trace with hash -68892802, now seen corresponding path program 1 times [2024-10-14 18:15:08,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:15:08,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369458463] [2024-10-14 18:15:08,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:15:08,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:15:08,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:08,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 18:15:08,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:08,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 18:15:08,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:08,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 18:15:08,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:08,432 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-14 18:15:08,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:15:08,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369458463] [2024-10-14 18:15:08,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369458463] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:15:08,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:15:08,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 18:15:08,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803097133] [2024-10-14 18:15:08,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:15:08,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 18:15:08,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:15:08,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 18:15:08,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 18:15:08,435 INFO L87 Difference]: Start difference. First operand 78 states and 86 transitions. Second operand has 7 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-14 18:15:08,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:15:08,574 INFO L93 Difference]: Finished difference Result 76 states and 84 transitions. [2024-10-14 18:15:08,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 18:15:08,575 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 29 [2024-10-14 18:15:08,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:15:08,575 INFO L225 Difference]: With dead ends: 76 [2024-10-14 18:15:08,575 INFO L226 Difference]: Without dead ends: 76 [2024-10-14 18:15:08,576 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 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-14 18:15:08,576 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 17 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 18:15:08,577 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 236 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 18:15:08,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-10-14 18:15:08,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2024-10-14 18:15:08,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 48 states have (on average 1.625) internal successors, (78), 71 states have internal predecessors, (78), 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-14 18:15:08,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 84 transitions. [2024-10-14 18:15:08,580 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 84 transitions. Word has length 29 [2024-10-14 18:15:08,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:15:08,581 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 84 transitions. [2024-10-14 18:15:08,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-14 18:15:08,581 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 84 transitions. [2024-10-14 18:15:08,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-14 18:15:08,582 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:15:08,582 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:15:08,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 18:15:08,582 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-10-14 18:15:08,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:15:08,583 INFO L85 PathProgramCache]: Analyzing trace with hash -68892801, now seen corresponding path program 1 times [2024-10-14 18:15:08,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:15:08,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92449057] [2024-10-14 18:15:08,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:15:08,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:15:08,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:08,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 18:15:08,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:08,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 18:15:08,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:08,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 18:15:08,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:08,759 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-14 18:15:08,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:15:08,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92449057] [2024-10-14 18:15:08,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92449057] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:15:08,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1336621510] [2024-10-14 18:15:08,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:15:08,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:15:08,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:15:08,762 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 18:15:08,763 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-14 18:15:08,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:08,900 INFO L255 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-14 18:15:08,902 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:15:08,974 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-14 18:15:08,974 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 18:15:08,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1336621510] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:15:08,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 18:15:08,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 14 [2024-10-14 18:15:08,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277425249] [2024-10-14 18:15:08,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:15:08,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 18:15:08,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:15:08,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 18:15:08,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2024-10-14 18:15:08,976 INFO L87 Difference]: Start difference. First operand 76 states and 84 transitions. Second operand has 6 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-14 18:15:09,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:15:09,072 INFO L93 Difference]: Finished difference Result 74 states and 82 transitions. [2024-10-14 18:15:09,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 18:15:09,072 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 29 [2024-10-14 18:15:09,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:15:09,073 INFO L225 Difference]: With dead ends: 74 [2024-10-14 18:15:09,073 INFO L226 Difference]: Without dead ends: 74 [2024-10-14 18:15:09,073 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2024-10-14 18:15:09,074 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 16 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 18:15:09,074 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 240 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 18:15:09,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-10-14 18:15:09,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2024-10-14 18:15:09,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 48 states have (on average 1.5833333333333333) internal successors, (76), 69 states have internal predecessors, (76), 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-14 18:15:09,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 82 transitions. [2024-10-14 18:15:09,078 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 82 transitions. Word has length 29 [2024-10-14 18:15:09,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:15:09,078 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 82 transitions. [2024-10-14 18:15:09,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-14 18:15:09,078 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 82 transitions. [2024-10-14 18:15:09,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-10-14 18:15:09,079 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:15:09,079 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:15:09,099 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-14 18:15:09,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:15:09,284 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-10-14 18:15:09,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:15:09,285 INFO L85 PathProgramCache]: Analyzing trace with hash -2135663788, now seen corresponding path program 1 times [2024-10-14 18:15:09,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:15:09,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972087602] [2024-10-14 18:15:09,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:15:09,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:15:09,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:09,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 18:15:09,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:09,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 18:15:09,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:09,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 18:15:09,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:09,589 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-14 18:15:09,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:15:09,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972087602] [2024-10-14 18:15:09,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972087602] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:15:09,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [16937162] [2024-10-14 18:15:09,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:15:09,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:15:09,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:15:09,592 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 18:15:09,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-14 18:15:09,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:09,837 INFO L255 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-10-14 18:15:09,839 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:15:09,902 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-10-14 18:15:09,921 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-14 18:15:09,949 INFO L349 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2024-10-14 18:15:09,950 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 24 [2024-10-14 18:15:09,966 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-14 18:15:09,968 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-14 18:15:09,968 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 18:15:09,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [16937162] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:15:09,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 18:15:09,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [11] total 16 [2024-10-14 18:15:09,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263861348] [2024-10-14 18:15:09,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:15:09,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 18:15:09,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:15:09,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 18:15:09,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=205, Unknown=1, NotChecked=28, Total=272 [2024-10-14 18:15:09,970 INFO L87 Difference]: Start difference. First operand 74 states and 82 transitions. Second operand has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-14 18:15:10,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:15:10,100 INFO L93 Difference]: Finished difference Result 74 states and 84 transitions. [2024-10-14 18:15:10,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 18:15:10,101 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 30 [2024-10-14 18:15:10,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:15:10,103 INFO L225 Difference]: With dead ends: 74 [2024-10-14 18:15:10,103 INFO L226 Difference]: Without dead ends: 74 [2024-10-14 18:15:10,104 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=261, Unknown=1, NotChecked=32, Total=342 [2024-10-14 18:15:10,105 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 21 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 115 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 18:15:10,105 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 238 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 178 Invalid, 0 Unknown, 115 Unchecked, 0.1s Time] [2024-10-14 18:15:10,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-10-14 18:15:10,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2024-10-14 18:15:10,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 49 states have (on average 1.5510204081632653) internal successors, (76), 68 states have internal predecessors, (76), 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-14 18:15:10,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 82 transitions. [2024-10-14 18:15:10,112 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 82 transitions. Word has length 30 [2024-10-14 18:15:10,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:15:10,113 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 82 transitions. [2024-10-14 18:15:10,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-14 18:15:10,113 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 82 transitions. [2024-10-14 18:15:10,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-10-14 18:15:10,113 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:15:10,113 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:15:10,136 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-14 18:15:10,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-10-14 18:15:10,314 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-10-14 18:15:10,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:15:10,315 INFO L85 PathProgramCache]: Analyzing trace with hash -2135663787, now seen corresponding path program 1 times [2024-10-14 18:15:10,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:15:10,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684666] [2024-10-14 18:15:10,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:15:10,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:15:10,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:10,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 18:15:10,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:10,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 18:15:10,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:10,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 18:15:10,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:10,835 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-14 18:15:10,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:15:10,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684666] [2024-10-14 18:15:10,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684666] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:15:10,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [765843034] [2024-10-14 18:15:10,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:15:10,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:15:10,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:15:10,838 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 18:15:10,840 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-14 18:15:11,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:11,070 INFO L255 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-10-14 18:15:11,072 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:15:11,095 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-14 18:15:11,264 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-10-14 18:15:11,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-10-14 18:15:11,304 WARN L873 $PredicateComparison]: unable to prove that (and (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|)))) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4| Int)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0))) is different from true [2024-10-14 18:15:11,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 18:15:11,333 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-10-14 18:15:11,342 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-10-14 18:15:11,343 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2024-10-14 18:15:11,401 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-14 18:15:11,427 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2024-10-14 18:15:11,427 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 18:15:11,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [765843034] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:15:11,627 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 18:15:11,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 24 [2024-10-14 18:15:11,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496288238] [2024-10-14 18:15:11,627 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 18:15:11,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-10-14 18:15:11,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:15:11,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-10-14 18:15:11,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=631, Unknown=1, NotChecked=50, Total=756 [2024-10-14 18:15:11,629 INFO L87 Difference]: Start difference. First operand 73 states and 82 transitions. Second operand has 25 states, 19 states have (on average 2.3684210526315788) internal successors, (45), 21 states have internal predecessors, (45), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-10-14 18:15:12,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:15:12,454 INFO L93 Difference]: Finished difference Result 83 states and 92 transitions. [2024-10-14 18:15:12,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-14 18:15:12,455 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 19 states have (on average 2.3684210526315788) internal successors, (45), 21 states have internal predecessors, (45), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 30 [2024-10-14 18:15:12,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:15:12,456 INFO L225 Difference]: With dead ends: 83 [2024-10-14 18:15:12,456 INFO L226 Difference]: Without dead ends: 83 [2024-10-14 18:15:12,457 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=146, Invalid=1263, Unknown=1, NotChecked=72, Total=1482 [2024-10-14 18:15:12,457 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 89 mSDsluCounter, 659 mSDsCounter, 0 mSdLazyCounter, 824 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 712 SdHoareTripleChecker+Invalid, 916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 824 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 88 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 18:15:12,457 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 712 Invalid, 916 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 824 Invalid, 0 Unknown, 88 Unchecked, 0.5s Time] [2024-10-14 18:15:12,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-10-14 18:15:12,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 82. [2024-10-14 18:15:12,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 57 states have (on average 1.4736842105263157) internal successors, (84), 76 states have internal predecessors, (84), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 18:15:12,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 90 transitions. [2024-10-14 18:15:12,460 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 90 transitions. Word has length 30 [2024-10-14 18:15:12,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:15:12,460 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 90 transitions. [2024-10-14 18:15:12,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 19 states have (on average 2.3684210526315788) internal successors, (45), 21 states have internal predecessors, (45), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-10-14 18:15:12,461 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 90 transitions. [2024-10-14 18:15:12,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-14 18:15:12,461 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:15:12,461 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:15:12,480 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-14 18:15:12,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:15:12,664 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-10-14 18:15:12,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:15:12,665 INFO L85 PathProgramCache]: Analyzing trace with hash 1696480531, now seen corresponding path program 1 times [2024-10-14 18:15:12,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:15:12,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107306405] [2024-10-14 18:15:12,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:15:12,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:15:12,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:13,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 18:15:13,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:13,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 18:15:13,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:13,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 18:15:13,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:13,094 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-14 18:15:13,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:15:13,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107306405] [2024-10-14 18:15:13,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107306405] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:15:13,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:15:13,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 18:15:13,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436643968] [2024-10-14 18:15:13,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:15:13,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 18:15:13,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:15:13,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 18:15:13,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-14 18:15:13,096 INFO L87 Difference]: Start difference. First operand 82 states and 90 transitions. Second operand has 10 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-14 18:15:13,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:15:13,359 INFO L93 Difference]: Finished difference Result 106 states and 115 transitions. [2024-10-14 18:15:13,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-14 18:15:13,360 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 33 [2024-10-14 18:15:13,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:15:13,361 INFO L225 Difference]: With dead ends: 106 [2024-10-14 18:15:13,361 INFO L226 Difference]: Without dead ends: 106 [2024-10-14 18:15:13,361 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-10-14 18:15:13,361 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 45 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 18:15:13,362 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 304 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 18:15:13,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-10-14 18:15:13,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 84. [2024-10-14 18:15:13,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 60 states have (on average 1.45) internal successors, (87), 78 states have internal predecessors, (87), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 18:15:13,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 93 transitions. [2024-10-14 18:15:13,372 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 93 transitions. Word has length 33 [2024-10-14 18:15:13,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:15:13,372 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 93 transitions. [2024-10-14 18:15:13,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-14 18:15:13,373 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 93 transitions. [2024-10-14 18:15:13,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-14 18:15:13,374 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:15:13,374 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:15:13,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-14 18:15:13,374 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-10-14 18:15:13,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:15:13,375 INFO L85 PathProgramCache]: Analyzing trace with hash 1696480532, now seen corresponding path program 1 times [2024-10-14 18:15:13,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:15:13,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129556185] [2024-10-14 18:15:13,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:15:13,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:15:13,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:13,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 18:15:13,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:13,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 18:15:13,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:13,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 18:15:13,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:13,857 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-14 18:15:13,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:15:13,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129556185] [2024-10-14 18:15:13,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129556185] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:15:13,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1559828502] [2024-10-14 18:15:13,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:15:13,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:15:13,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:15:13,863 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 18:15:13,867 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-14 18:15:14,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:14,157 INFO L255 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-10-14 18:15:14,163 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:15:14,197 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-14 18:15:14,379 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-14 18:15:14,389 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 15 treesize of output 1 [2024-10-14 18:15:14,415 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-14 18:15:14,435 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-14 18:15:14,435 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 18:15:14,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1559828502] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:15:14,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 18:15:14,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 17 [2024-10-14 18:15:14,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639725042] [2024-10-14 18:15:14,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:15:14,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 18:15:14,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:15:14,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 18:15:14,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2024-10-14 18:15:14,437 INFO L87 Difference]: Start difference. First operand 84 states and 93 transitions. Second operand has 9 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 8 states have internal predecessors, (23), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-14 18:15:14,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:15:14,581 INFO L93 Difference]: Finished difference Result 104 states and 114 transitions. [2024-10-14 18:15:14,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 18:15:14,582 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 8 states have internal predecessors, (23), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 33 [2024-10-14 18:15:14,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:15:14,582 INFO L225 Difference]: With dead ends: 104 [2024-10-14 18:15:14,582 INFO L226 Difference]: Without dead ends: 104 [2024-10-14 18:15:14,583 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2024-10-14 18:15:14,583 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 53 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 18:15:14,584 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 263 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 18:15:14,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-10-14 18:15:14,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 86. [2024-10-14 18:15:14,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 62 states have (on average 1.435483870967742) internal successors, (89), 80 states have internal predecessors, (89), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 18:15:14,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 95 transitions. [2024-10-14 18:15:14,586 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 95 transitions. Word has length 33 [2024-10-14 18:15:14,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:15:14,587 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 95 transitions. [2024-10-14 18:15:14,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 8 states have internal predecessors, (23), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-14 18:15:14,587 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 95 transitions. [2024-10-14 18:15:14,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-14 18:15:14,587 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:15:14,587 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:15:14,604 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-10-14 18:15:14,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:15:14,789 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-10-14 18:15:14,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:15:14,790 INFO L85 PathProgramCache]: Analyzing trace with hash 230355910, now seen corresponding path program 1 times [2024-10-14 18:15:14,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:15:14,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402454786] [2024-10-14 18:15:14,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:15:14,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:15:14,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:15,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 18:15:15,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:15,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 18:15:15,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:15,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 18:15:15,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:15,592 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-14 18:15:15,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:15:15,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402454786] [2024-10-14 18:15:15,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402454786] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:15:15,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1574111619] [2024-10-14 18:15:15,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:15:15,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:15:15,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:15:15,596 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 18:15:15,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-14 18:15:15,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:15,809 INFO L255 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 80 conjuncts are in the unsatisfiable core [2024-10-14 18:15:15,814 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:15:15,836 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-14 18:15:15,977 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-14 18:15:15,978 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-14 18:15:16,047 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-14 18:15:16,119 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2024-10-14 18:15:16,119 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 41 [2024-10-14 18:15:16,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2024-10-14 18:15:16,174 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 15 treesize of output 7 [2024-10-14 18:15:16,376 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_node_create_~temp~0#1.base_56| Int)) (and (= (select |c_old(#valid)| |v_node_create_~temp~0#1.base_56|) 0) (= (store |c_old(#memory_$Pointer$#2.base)| |v_node_create_~temp~0#1.base_56| (select |c_#memory_$Pointer$#2.base| |v_node_create_~temp~0#1.base_56|)) |c_#memory_$Pointer$#2.base|) (= |c_#valid| (store |c_old(#valid)| |v_node_create_~temp~0#1.base_56| 1)))) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6| Int)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6|) 0) 0))) is different from true [2024-10-14 18:15:16,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 18:15:16,389 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 38 treesize of output 27 [2024-10-14 18:15:16,417 INFO L349 Elim1Store]: treesize reduction 72, result has 37.4 percent of original size [2024-10-14 18:15:16,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 34 treesize of output 57 [2024-10-14 18:15:16,699 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 66 treesize of output 38 [2024-10-14 18:15:16,781 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 33 treesize of output 17 [2024-10-14 18:15:16,836 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-10-14 18:15:16,836 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 18:15:16,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1574111619] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:15:16,937 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 18:15:16,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 21] total 37 [2024-10-14 18:15:16,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871298455] [2024-10-14 18:15:16,938 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 18:15:16,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-10-14 18:15:16,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:15:16,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-10-14 18:15:16,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=1279, Unknown=1, NotChecked=72, Total=1482 [2024-10-14 18:15:16,939 INFO L87 Difference]: Start difference. First operand 86 states and 95 transitions. Second operand has 38 states, 29 states have (on average 1.896551724137931) internal successors, (55), 31 states have internal predecessors, (55), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-14 18:15:18,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:15:18,112 INFO L93 Difference]: Finished difference Result 121 states and 137 transitions. [2024-10-14 18:15:18,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-14 18:15:18,113 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 29 states have (on average 1.896551724137931) internal successors, (55), 31 states have internal predecessors, (55), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 34 [2024-10-14 18:15:18,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:15:18,114 INFO L225 Difference]: With dead ends: 121 [2024-10-14 18:15:18,114 INFO L226 Difference]: Without dead ends: 121 [2024-10-14 18:15:18,115 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 579 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=265, Invalid=2494, Unknown=1, NotChecked=102, Total=2862 [2024-10-14 18:15:18,116 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 132 mSDsluCounter, 830 mSDsCounter, 0 mSdLazyCounter, 1116 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 881 SdHoareTripleChecker+Invalid, 1249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 120 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-14 18:15:18,116 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 881 Invalid, 1249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1116 Invalid, 0 Unknown, 120 Unchecked, 0.7s Time] [2024-10-14 18:15:18,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-10-14 18:15:18,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 106. [2024-10-14 18:15:18,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 79 states have (on average 1.3924050632911393) internal successors, (110), 97 states have internal predecessors, (110), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-14 18:15:18,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 120 transitions. [2024-10-14 18:15:18,120 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 120 transitions. Word has length 34 [2024-10-14 18:15:18,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:15:18,121 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 120 transitions. [2024-10-14 18:15:18,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 29 states have (on average 1.896551724137931) internal successors, (55), 31 states have internal predecessors, (55), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-14 18:15:18,121 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 120 transitions. [2024-10-14 18:15:18,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-14 18:15:18,122 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:15:18,122 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:15:18,140 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-10-14 18:15:18,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-10-14 18:15:18,323 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-10-14 18:15:18,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:15:18,324 INFO L85 PathProgramCache]: Analyzing trace with hash 230355911, now seen corresponding path program 1 times [2024-10-14 18:15:18,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:15:18,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890130831] [2024-10-14 18:15:18,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:15:18,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:15:18,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:19,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 18:15:19,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:19,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 18:15:19,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:19,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 18:15:19,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:19,943 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-14 18:15:19,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:15:19,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890130831] [2024-10-14 18:15:19,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890130831] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:15:19,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1630290870] [2024-10-14 18:15:19,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:15:19,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:15:19,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:15:19,946 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 18:15:19,948 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-14 18:15:20,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:20,144 INFO L255 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 105 conjuncts are in the unsatisfiable core [2024-10-14 18:15:20,148 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:15:20,175 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-14 18:15:20,178 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-14 18:15:20,451 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-14 18:15:20,452 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-14 18:15:20,460 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-14 18:15:20,593 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-14 18:15:20,601 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-14 18:15:20,677 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2024-10-14 18:15:20,678 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 60 [2024-10-14 18:15:20,689 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 36 treesize of output 15 [2024-10-14 18:15:20,769 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 19 [2024-10-14 18:15:20,775 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 15 treesize of output 7 [2024-10-14 18:15:20,786 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2024-10-14 18:15:20,791 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 11 treesize of output 3 [2024-10-14 18:15:20,995 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_7| Int)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_7|) 0) 0)) (exists ((|v_node_create_~temp~0#1.base_65| Int)) (and (= (select |c_old(#valid)| |v_node_create_~temp~0#1.base_65|) 0) (= (store |c_old(#memory_$Pointer$#2.offset)| |v_node_create_~temp~0#1.base_65| (select |c_#memory_$Pointer$#2.offset| |v_node_create_~temp~0#1.base_65|)) |c_#memory_$Pointer$#2.offset|) (= (store |c_old(#length)| |v_node_create_~temp~0#1.base_65| (select |c_#length| |v_node_create_~temp~0#1.base_65|)) |c_#length|) (= (store |c_old(#memory_$Pointer$#2.base)| |v_node_create_~temp~0#1.base_65| (select |c_#memory_$Pointer$#2.base| |v_node_create_~temp~0#1.base_65|)) |c_#memory_$Pointer$#2.base|)))) is different from true [2024-10-14 18:15:21,015 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 18:15:21,016 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 51 treesize of output 34 [2024-10-14 18:15:21,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 18:15:21,024 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 22 treesize of output 17 [2024-10-14 18:15:21,042 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-10-14 18:15:21,043 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2024-10-14 18:15:21,047 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 20 treesize of output 15 [2024-10-14 18:15:21,239 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-14 18:15:21,298 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-14 18:15:21,301 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-14 18:15:21,304 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-10-14 18:15:21,304 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 18:15:21,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1630290870] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:15:21,684 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 18:15:21,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 21] total 39 [2024-10-14 18:15:21,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336341838] [2024-10-14 18:15:21,684 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 18:15:21,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2024-10-14 18:15:21,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:15:21,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2024-10-14 18:15:21,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=1771, Unknown=1, NotChecked=84, Total=1980 [2024-10-14 18:15:21,686 INFO L87 Difference]: Start difference. First operand 106 states and 120 transitions. Second operand has 40 states, 30 states have (on average 1.8333333333333333) internal successors, (55), 33 states have internal predecessors, (55), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-14 18:15:23,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:15:23,876 INFO L93 Difference]: Finished difference Result 123 states and 139 transitions. [2024-10-14 18:15:23,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-10-14 18:15:23,877 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 30 states have (on average 1.8333333333333333) internal successors, (55), 33 states have internal predecessors, (55), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 34 [2024-10-14 18:15:23,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:15:23,877 INFO L225 Difference]: With dead ends: 123 [2024-10-14 18:15:23,877 INFO L226 Difference]: Without dead ends: 123 [2024-10-14 18:15:23,879 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 637 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=299, Invalid=3610, Unknown=1, NotChecked=122, Total=4032 [2024-10-14 18:15:23,879 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 127 mSDsluCounter, 1014 mSDsCounter, 0 mSdLazyCounter, 1456 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 1064 SdHoareTripleChecker+Invalid, 1590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 122 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-14 18:15:23,879 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 1064 Invalid, 1590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1456 Invalid, 0 Unknown, 122 Unchecked, 1.1s Time] [2024-10-14 18:15:23,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-10-14 18:15:23,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 105. [2024-10-14 18:15:23,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 78 states have (on average 1.3846153846153846) internal successors, (108), 96 states have internal predecessors, (108), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-14 18:15:23,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 118 transitions. [2024-10-14 18:15:23,883 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 118 transitions. Word has length 34 [2024-10-14 18:15:23,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:15:23,883 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 118 transitions. [2024-10-14 18:15:23,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 30 states have (on average 1.8333333333333333) internal successors, (55), 33 states have internal predecessors, (55), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-14 18:15:23,883 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 118 transitions. [2024-10-14 18:15:23,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-14 18:15:23,884 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:15:23,884 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 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-14 18:15:23,902 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-10-14 18:15:24,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-10-14 18:15:24,085 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-10-14 18:15:24,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:15:24,085 INFO L85 PathProgramCache]: Analyzing trace with hash 48434231, now seen corresponding path program 1 times [2024-10-14 18:15:24,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:15:24,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175745957] [2024-10-14 18:15:24,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:15:24,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:15:24,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:24,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 18:15:24,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:24,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 18:15:24,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:24,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 18:15:24,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:24,354 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-14 18:15:24,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:15:24,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175745957] [2024-10-14 18:15:24,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175745957] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:15:24,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [932431758] [2024-10-14 18:15:24,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:15:24,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:15:24,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:15:24,361 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 18:15:24,369 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-10-14 18:15:24,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:24,593 INFO L255 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-10-14 18:15:24,596 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:15:24,654 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 13 treesize of output 9 [2024-10-14 18:15:24,745 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 0 case distinctions, treesize of input 25 treesize of output 13 [2024-10-14 18:15:24,762 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 15 treesize of output 1 [2024-10-14 18:15:24,765 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 15 treesize of output 1 [2024-10-14 18:15:24,795 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 17 [2024-10-14 18:15:24,798 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-14 18:15:24,880 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-14 18:15:24,881 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 18:15:24,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [932431758] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:15:24,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 18:15:24,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [10] total 19 [2024-10-14 18:15:24,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764852510] [2024-10-14 18:15:24,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:15:24,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-14 18:15:24,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:15:24,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-14 18:15:24,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=301, Unknown=0, NotChecked=0, Total=342 [2024-10-14 18:15:24,883 INFO L87 Difference]: Start difference. First operand 105 states and 118 transitions. Second operand has 11 states, 9 states have (on average 3.0) internal successors, (27), 10 states have internal predecessors, (27), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-14 18:15:25,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:15:25,113 INFO L93 Difference]: Finished difference Result 123 states and 136 transitions. [2024-10-14 18:15:25,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-14 18:15:25,113 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 3.0) internal successors, (27), 10 states have internal predecessors, (27), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 37 [2024-10-14 18:15:25,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:15:25,114 INFO L225 Difference]: With dead ends: 123 [2024-10-14 18:15:25,114 INFO L226 Difference]: Without dead ends: 123 [2024-10-14 18:15:25,115 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2024-10-14 18:15:25,115 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 119 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 18:15:25,115 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 400 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 18:15:25,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-10-14 18:15:25,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 105. [2024-10-14 18:15:25,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 78 states have (on average 1.3717948717948718) internal successors, (107), 96 states have internal predecessors, (107), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-14 18:15:25,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 117 transitions. [2024-10-14 18:15:25,119 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 117 transitions. Word has length 37 [2024-10-14 18:15:25,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:15:25,119 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 117 transitions. [2024-10-14 18:15:25,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 3.0) internal successors, (27), 10 states have internal predecessors, (27), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-14 18:15:25,122 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 117 transitions. [2024-10-14 18:15:25,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-14 18:15:25,124 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:15:25,124 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 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-14 18:15:25,140 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-10-14 18:15:25,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-10-14 18:15:25,328 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-10-14 18:15:25,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:15:25,328 INFO L85 PathProgramCache]: Analyzing trace with hash 1504465431, now seen corresponding path program 1 times [2024-10-14 18:15:25,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:15:25,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646784761] [2024-10-14 18:15:25,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:15:25,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:15:25,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:25,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 18:15:25,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:25,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 18:15:25,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:25,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 18:15:25,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:25,717 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-14 18:15:25,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:15:25,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646784761] [2024-10-14 18:15:25,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646784761] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:15:25,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1258979327] [2024-10-14 18:15:25,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:15:25,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:15:25,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:15:25,721 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 18:15:25,723 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-10-14 18:15:25,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:25,922 INFO L255 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-10-14 18:15:25,925 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:15:25,932 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-14 18:15:25,963 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-14 18:15:25,989 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 15 treesize of output 1 [2024-10-14 18:15:25,994 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 15 treesize of output 1 [2024-10-14 18:15:26,020 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 27 treesize of output 19 [2024-10-14 18:15:26,054 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 27 treesize of output 11 [2024-10-14 18:15:26,077 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-14 18:15:26,081 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-14 18:15:26,081 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 18:15:26,097 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 60 [2024-10-14 18:15:26,099 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 98 treesize of output 90 [2024-10-14 18:15:26,196 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 28 [2024-10-14 18:15:26,212 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 28 [2024-10-14 18:15:26,232 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:15:26,232 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 55 treesize of output 55 [2024-10-14 18:15:26,428 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-14 18:15:26,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1258979327] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 18:15:26,429 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 18:15:26,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 10] total 18 [2024-10-14 18:15:26,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124827377] [2024-10-14 18:15:26,430 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 18:15:26,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-14 18:15:26,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:15:26,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-14 18:15:26,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2024-10-14 18:15:26,431 INFO L87 Difference]: Start difference. First operand 105 states and 117 transitions. Second operand has 19 states, 16 states have (on average 2.6875) internal successors, (43), 16 states have internal predecessors, (43), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-14 18:15:26,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:15:26,841 INFO L93 Difference]: Finished difference Result 136 states and 151 transitions. [2024-10-14 18:15:26,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 18:15:26,841 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 2.6875) internal successors, (43), 16 states have internal predecessors, (43), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 38 [2024-10-14 18:15:26,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:15:26,842 INFO L225 Difference]: With dead ends: 136 [2024-10-14 18:15:26,842 INFO L226 Difference]: Without dead ends: 136 [2024-10-14 18:15:26,842 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=389, Unknown=0, NotChecked=0, Total=462 [2024-10-14 18:15:26,843 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 53 mSDsluCounter, 567 mSDsCounter, 0 mSdLazyCounter, 641 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 618 SdHoareTripleChecker+Invalid, 642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 641 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 18:15:26,843 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 618 Invalid, 642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 641 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 18:15:26,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-10-14 18:15:26,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 108. [2024-10-14 18:15:26,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 81 states have (on average 1.382716049382716) internal successors, (112), 99 states have internal predecessors, (112), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-14 18:15:26,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 122 transitions. [2024-10-14 18:15:26,846 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 122 transitions. Word has length 38 [2024-10-14 18:15:26,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:15:26,847 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 122 transitions. [2024-10-14 18:15:26,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 2.6875) internal successors, (43), 16 states have internal predecessors, (43), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-14 18:15:26,847 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 122 transitions. [2024-10-14 18:15:26,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-14 18:15:26,847 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:15:26,847 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 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-14 18:15:26,866 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-10-14 18:15:27,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:15:27,052 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-10-14 18:15:27,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:15:27,052 INFO L85 PathProgramCache]: Analyzing trace with hash 1504465432, now seen corresponding path program 1 times [2024-10-14 18:15:27,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:15:27,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778849156] [2024-10-14 18:15:27,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:15:27,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:15:27,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:27,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 18:15:27,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:27,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 18:15:27,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:27,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 18:15:27,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:27,301 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-14 18:15:27,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:15:27,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778849156] [2024-10-14 18:15:27,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778849156] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:15:27,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1966111760] [2024-10-14 18:15:27,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:15:27,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:15:27,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:15:27,303 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 18:15:27,305 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-10-14 18:15:27,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:27,512 INFO L255 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-10-14 18:15:27,515 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:15:27,604 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-14 18:15:27,611 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-14 18:15:27,641 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-14 18:15:27,647 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 15 treesize of output 1 [2024-10-14 18:15:27,727 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 11 treesize of output 3 [2024-10-14 18:15:27,730 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 27 treesize of output 11 [2024-10-14 18:15:27,761 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-14 18:15:27,782 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-14 18:15:27,782 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 18:15:27,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1966111760] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:15:27,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 18:15:27,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [10] total 20 [2024-10-14 18:15:27,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289140387] [2024-10-14 18:15:27,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:15:27,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-14 18:15:27,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:15:27,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-14 18:15:27,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=337, Unknown=0, NotChecked=0, Total=380 [2024-10-14 18:15:27,784 INFO L87 Difference]: Start difference. First operand 108 states and 122 transitions. Second operand has 12 states, 10 states have (on average 2.8) internal successors, (28), 11 states have internal predecessors, (28), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-14 18:15:27,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:15:27,932 INFO L93 Difference]: Finished difference Result 113 states and 125 transitions. [2024-10-14 18:15:27,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-14 18:15:27,933 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 2.8) internal successors, (28), 11 states have internal predecessors, (28), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 38 [2024-10-14 18:15:27,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:15:27,933 INFO L225 Difference]: With dead ends: 113 [2024-10-14 18:15:27,933 INFO L226 Difference]: Without dead ends: 113 [2024-10-14 18:15:27,934 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=371, Unknown=0, NotChecked=0, Total=420 [2024-10-14 18:15:27,934 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 22 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 18:15:27,934 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 455 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 18:15:27,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-10-14 18:15:27,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 107. [2024-10-14 18:15:27,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 80 states have (on average 1.3625) internal successors, (109), 98 states have internal predecessors, (109), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-14 18:15:27,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 119 transitions. [2024-10-14 18:15:27,937 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 119 transitions. Word has length 38 [2024-10-14 18:15:27,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:15:27,938 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 119 transitions. [2024-10-14 18:15:27,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 2.8) internal successors, (28), 11 states have internal predecessors, (28), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-14 18:15:27,938 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 119 transitions. [2024-10-14 18:15:27,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-14 18:15:27,938 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:15:27,938 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 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-14 18:15:27,955 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-10-14 18:15:28,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:15:28,143 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-10-14 18:15:28,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:15:28,143 INFO L85 PathProgramCache]: Analyzing trace with hash -1005452951, now seen corresponding path program 1 times [2024-10-14 18:15:28,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:15:28,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543923788] [2024-10-14 18:15:28,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:15:28,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:15:28,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:28,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 18:15:28,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:28,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 18:15:28,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:28,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 18:15:28,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:28,323 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-14 18:15:28,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:15:28,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543923788] [2024-10-14 18:15:28,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543923788] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:15:28,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:15:28,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 18:15:28,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850108879] [2024-10-14 18:15:28,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:15:28,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 18:15:28,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:15:28,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 18:15:28,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-14 18:15:28,326 INFO L87 Difference]: Start difference. First operand 107 states and 119 transitions. Second operand has 9 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 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-14 18:15:28,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:15:28,458 INFO L93 Difference]: Finished difference Result 123 states and 136 transitions. [2024-10-14 18:15:28,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 18:15:28,458 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 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 38 [2024-10-14 18:15:28,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:15:28,459 INFO L225 Difference]: With dead ends: 123 [2024-10-14 18:15:28,459 INFO L226 Difference]: Without dead ends: 123 [2024-10-14 18:15:28,460 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-10-14 18:15:28,460 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 64 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 18:15:28,460 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 287 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 18:15:28,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-10-14 18:15:28,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 108. [2024-10-14 18:15:28,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 81 states have (on average 1.3703703703703705) internal successors, (111), 99 states have internal predecessors, (111), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-14 18:15:28,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 121 transitions. [2024-10-14 18:15:28,463 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 121 transitions. Word has length 38 [2024-10-14 18:15:28,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:15:28,464 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 121 transitions. [2024-10-14 18:15:28,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 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-14 18:15:28,464 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 121 transitions. [2024-10-14 18:15:28,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-14 18:15:28,464 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:15:28,465 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 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-14 18:15:28,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-14 18:15:28,465 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-10-14 18:15:28,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:15:28,465 INFO L85 PathProgramCache]: Analyzing trace with hash -1005452950, now seen corresponding path program 1 times [2024-10-14 18:15:28,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:15:28,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562120312] [2024-10-14 18:15:28,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:15:28,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:15:28,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:28,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 18:15:28,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:28,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 18:15:28,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:28,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 18:15:28,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:29,086 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-14 18:15:29,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:15:29,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562120312] [2024-10-14 18:15:29,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562120312] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:15:29,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [880314051] [2024-10-14 18:15:29,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:15:29,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:15:29,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:15:29,091 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 18:15:29,095 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-10-14 18:15:29,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:29,311 INFO L255 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-10-14 18:15:29,313 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:15:29,320 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-14 18:15:29,434 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-10-14 18:15:29,523 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-10-14 18:15:29,524 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 18 treesize of output 21 [2024-10-14 18:15:29,579 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-14 18:15:29,582 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 18:15:29,583 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 18:15:29,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [880314051] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:15:29,760 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 18:15:29,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 10] total 23 [2024-10-14 18:15:29,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284381262] [2024-10-14 18:15:29,761 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 18:15:29,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-10-14 18:15:29,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:15:29,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-10-14 18:15:29,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=628, Unknown=0, NotChecked=0, Total=702 [2024-10-14 18:15:29,762 INFO L87 Difference]: Start difference. First operand 108 states and 121 transitions. Second operand has 24 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 20 states have internal predecessors, (54), 3 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-14 18:15:30,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:15:30,555 INFO L93 Difference]: Finished difference Result 125 states and 138 transitions. [2024-10-14 18:15:30,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-14 18:15:30,556 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 20 states have internal predecessors, (54), 3 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 38 [2024-10-14 18:15:30,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:15:30,557 INFO L225 Difference]: With dead ends: 125 [2024-10-14 18:15:30,557 INFO L226 Difference]: Without dead ends: 125 [2024-10-14 18:15:30,557 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=135, Invalid=1125, Unknown=0, NotChecked=0, Total=1260 [2024-10-14 18:15:30,558 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 54 mSDsluCounter, 738 mSDsCounter, 0 mSdLazyCounter, 837 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 796 SdHoareTripleChecker+Invalid, 843 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 837 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 18:15:30,558 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 796 Invalid, 843 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 837 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 18:15:30,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-10-14 18:15:30,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 110. [2024-10-14 18:15:30,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 83 states have (on average 1.3614457831325302) internal successors, (113), 101 states have internal predecessors, (113), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-14 18:15:30,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 123 transitions. [2024-10-14 18:15:30,561 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 123 transitions. Word has length 38 [2024-10-14 18:15:30,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:15:30,562 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 123 transitions. [2024-10-14 18:15:30,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 20 states have internal predecessors, (54), 3 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-14 18:15:30,562 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 123 transitions. [2024-10-14 18:15:30,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-14 18:15:30,562 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:15:30,562 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:15:30,580 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-10-14 18:15:30,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-10-14 18:15:30,763 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-10-14 18:15:30,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:15:30,764 INFO L85 PathProgramCache]: Analyzing trace with hash 201065272, now seen corresponding path program 2 times [2024-10-14 18:15:30,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:15:30,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767290658] [2024-10-14 18:15:30,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:15:30,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:15:30,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:31,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 18:15:31,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:31,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 18:15:31,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:31,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 18:15:31,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:31,644 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-14 18:15:31,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:15:31,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767290658] [2024-10-14 18:15:31,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767290658] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:15:31,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2109868628] [2024-10-14 18:15:31,645 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 18:15:31,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:15:31,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:15:31,647 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 18:15:31,649 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-10-14 18:15:31,880 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-14 18:15:31,880 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 18:15:31,884 INFO L255 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 91 conjuncts are in the unsatisfiable core [2024-10-14 18:15:31,887 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:15:31,910 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-14 18:15:32,135 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-14 18:15:32,136 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-14 18:15:32,247 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-14 18:15:32,254 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-14 18:15:32,344 INFO L349 Elim1Store]: treesize reduction 77, result has 16.3 percent of original size [2024-10-14 18:15:32,345 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 140 treesize of output 82 [2024-10-14 18:15:32,350 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 68 [2024-10-14 18:15:32,435 INFO L349 Elim1Store]: treesize reduction 31, result has 3.1 percent of original size [2024-10-14 18:15:32,435 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 108 treesize of output 47 [2024-10-14 18:15:32,441 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 14 [2024-10-14 18:15:32,446 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 15 treesize of output 7 [2024-10-14 18:15:32,509 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_node_create_~temp~0#1.base_91| Int)) (and (= (store |c_old(#memory_$Pointer$#2.base)| |v_node_create_~temp~0#1.base_91| (select |c_#memory_$Pointer$#2.base| |v_node_create_~temp~0#1.base_91|)) |c_#memory_$Pointer$#2.base|) (= |c_#memory_$Pointer$#2.offset| (store |c_old(#memory_$Pointer$#2.offset)| |v_node_create_~temp~0#1.base_91| (select |c_#memory_$Pointer$#2.offset| |v_node_create_~temp~0#1.base_91|))) (= (select |c_old(#valid)| |v_node_create_~temp~0#1.base_91|) 0))) is different from true [2024-10-14 18:15:32,528 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 18:15:32,538 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2024-10-14 18:15:32,539 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 116 treesize of output 99 [2024-10-14 18:15:32,559 INFO L349 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2024-10-14 18:15:32,559 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 34 [2024-10-14 18:15:32,565 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 94 treesize of output 80 [2024-10-14 18:15:32,888 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 18:15:32,897 INFO L349 Elim1Store]: treesize reduction 53, result has 5.4 percent of original size [2024-10-14 18:15:32,898 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 129 treesize of output 55 [2024-10-14 18:15:32,909 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-10-14 18:15:32,910 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 23 [2024-10-14 18:15:32,952 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-14 18:15:32,955 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-14 18:15:32,987 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 5 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-10-14 18:15:32,987 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 18:15:33,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2109868628] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:15:33,562 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 18:15:33,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 23] total 41 [2024-10-14 18:15:33,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53632479] [2024-10-14 18:15:33,562 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 18:15:33,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-10-14 18:15:33,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:15:33,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-10-14 18:15:33,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=1851, Unknown=1, NotChecked=86, Total=2070 [2024-10-14 18:15:33,564 INFO L87 Difference]: Start difference. First operand 110 states and 123 transitions. Second operand has 41 states, 32 states have (on average 1.9375) internal successors, (62), 34 states have internal predecessors, (62), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-14 18:15:34,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:15:34,852 INFO L93 Difference]: Finished difference Result 117 states and 131 transitions. [2024-10-14 18:15:34,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-14 18:15:34,852 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 32 states have (on average 1.9375) internal successors, (62), 34 states have internal predecessors, (62), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 38 [2024-10-14 18:15:34,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:15:34,853 INFO L225 Difference]: With dead ends: 117 [2024-10-14 18:15:34,853 INFO L226 Difference]: Without dead ends: 117 [2024-10-14 18:15:34,854 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 727 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=289, Invalid=3136, Unknown=1, NotChecked=114, Total=3540 [2024-10-14 18:15:34,855 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 82 mSDsluCounter, 1078 mSDsCounter, 0 mSdLazyCounter, 1158 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 1131 SdHoareTripleChecker+Invalid, 1273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 105 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 18:15:34,855 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 1131 Invalid, 1273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1158 Invalid, 0 Unknown, 105 Unchecked, 0.6s Time] [2024-10-14 18:15:34,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-10-14 18:15:34,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 113. [2024-10-14 18:15:34,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 86 states have (on average 1.3488372093023255) internal successors, (116), 104 states have internal predecessors, (116), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-14 18:15:34,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 126 transitions. [2024-10-14 18:15:34,858 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 126 transitions. Word has length 38 [2024-10-14 18:15:34,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:15:34,859 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 126 transitions. [2024-10-14 18:15:34,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 32 states have (on average 1.9375) internal successors, (62), 34 states have internal predecessors, (62), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-14 18:15:34,859 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 126 transitions. [2024-10-14 18:15:34,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-10-14 18:15:34,860 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:15:34,860 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 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-14 18:15:34,876 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-10-14 18:15:35,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:15:35,061 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-10-14 18:15:35,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:15:35,061 INFO L85 PathProgramCache]: Analyzing trace with hash 1544980914, now seen corresponding path program 1 times [2024-10-14 18:15:35,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:15:35,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7350846] [2024-10-14 18:15:35,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:15:35,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:15:35,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:35,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 18:15:35,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:35,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 18:15:35,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:35,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 18:15:35,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:35,270 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-14 18:15:35,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:15:35,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7350846] [2024-10-14 18:15:35,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7350846] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:15:35,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [682363030] [2024-10-14 18:15:35,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:15:35,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:15:35,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:15:35,273 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 18:15:35,275 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-10-14 18:15:35,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:35,507 INFO L255 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-14 18:15:35,508 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:15:35,572 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-14 18:15:35,584 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 18:15:35,584 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 18:15:35,614 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-14 18:15:35,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [682363030] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 18:15:35,615 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 18:15:35,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 13 [2024-10-14 18:15:35,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338959817] [2024-10-14 18:15:35,615 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 18:15:35,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-14 18:15:35,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:15:35,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-14 18:15:35,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-10-14 18:15:35,617 INFO L87 Difference]: Start difference. First operand 113 states and 126 transitions. Second operand has 13 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 11 states have internal predecessors, (41), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-14 18:15:39,625 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-14 18:15:43,642 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-14 18:15:47,659 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-14 18:15:51,666 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-14 18:15:55,684 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-14 18:15:59,866 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-14 18:15:59,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:15:59,874 INFO L93 Difference]: Finished difference Result 104 states and 115 transitions. [2024-10-14 18:15:59,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-14 18:15:59,874 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 11 states have internal predecessors, (41), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 41 [2024-10-14 18:15:59,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:15:59,875 INFO L225 Difference]: With dead ends: 104 [2024-10-14 18:15:59,875 INFO L226 Difference]: Without dead ends: 104 [2024-10-14 18:15:59,875 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 83 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2024-10-14 18:15:59,876 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 72 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 0 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.2s IncrementalHoareTripleChecker+Time [2024-10-14 18:15:59,876 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 472 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 258 Invalid, 6 Unknown, 0 Unchecked, 24.2s Time] [2024-10-14 18:15:59,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-10-14 18:15:59,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2024-10-14 18:15:59,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 77 states have (on average 1.3636363636363635) internal successors, (105), 95 states have internal predecessors, (105), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-14 18:15:59,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 115 transitions. [2024-10-14 18:15:59,879 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 115 transitions. Word has length 41 [2024-10-14 18:15:59,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:15:59,879 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 115 transitions. [2024-10-14 18:15:59,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 11 states have internal predecessors, (41), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-14 18:15:59,879 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 115 transitions. [2024-10-14 18:15:59,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-14 18:15:59,880 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:15:59,880 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 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-14 18:15:59,898 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-10-14 18:16:00,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:16:00,081 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-10-14 18:16:00,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:16:00,081 INFO L85 PathProgramCache]: Analyzing trace with hash 2131801485, now seen corresponding path program 1 times [2024-10-14 18:16:00,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:16:00,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635473891] [2024-10-14 18:16:00,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:16:00,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:16:00,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:16:00,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 18:16:00,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:16:00,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 18:16:00,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:16:00,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 18:16:00,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:16:00,955 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-14 18:16:00,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:16:00,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635473891] [2024-10-14 18:16:00,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635473891] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:16:00,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1005477215] [2024-10-14 18:16:00,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:16:00,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:16:00,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:16:00,958 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 18:16:00,959 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-10-14 18:16:01,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:16:01,361 INFO L255 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 83 conjuncts are in the unsatisfiable core [2024-10-14 18:16:01,363 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:16:01,390 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-14 18:16:01,515 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 13 treesize of output 9 [2024-10-14 18:16:01,552 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-14 18:16:01,552 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-14 18:16:01,630 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 25 treesize of output 13 [2024-10-14 18:16:01,695 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 26 treesize of output 21 [2024-10-14 18:16:01,743 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 3 [2024-10-14 18:16:01,745 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-10-14 18:16:01,896 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-10-14 18:16:01,897 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 26 treesize of output 29 [2024-10-14 18:16:01,901 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 11 treesize of output 3 [2024-10-14 18:16:01,915 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-10-14 18:16:01,915 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2024-10-14 18:16:02,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 18:16:02,144 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 33 treesize of output 21 [2024-10-14 18:16:02,204 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 26 treesize of output 21 [2024-10-14 18:16:02,259 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 17 [2024-10-14 18:16:02,262 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-14 18:16:02,337 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:16:02,338 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 18:16:02,521 WARN L851 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_sll_circular_append_~last~1#1.base| Int) (v_ArrVal_3220 (Array Int Int)) (v_ArrVal_3219 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_3219) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3220) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (not (= v_ArrVal_3219 (store (select |c_#memory_int#2| |ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| (select v_ArrVal_3219 |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)))))) is different from false [2024-10-14 18:16:02,551 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_45| Int)) (or (< (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_45|) (forall ((|ULTIMATE.start_sll_circular_append_~last~1#1.base| Int) (v_ArrVal_3220 (Array Int Int)) (v_ArrVal_3219 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_3219) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3220) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (not (= v_ArrVal_3219 (store (select |c_#memory_int#2| |ULTIMATE.start_sll_circular_append_~last~1#1.base|) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_45| (select v_ArrVal_3219 |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_45|)))))))) is different from false [2024-10-14 18:16:02,584 WARN L851 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_sll_circular_append_~last~1#1.base| Int) (v_ArrVal_3220 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_45| Int) (v_ArrVal_3219 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_3219) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_3220) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (not (= v_ArrVal_3219 (store (select |c_#memory_int#2| |ULTIMATE.start_sll_circular_append_~last~1#1.base|) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_45| (select v_ArrVal_3219 |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_45|)))) (< (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_45|))) is different from false [2024-10-14 18:16:02,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1005477215] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:16:02,704 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 18:16:02,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 25] total 42 [2024-10-14 18:16:02,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680270888] [2024-10-14 18:16:02,705 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 18:16:02,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2024-10-14 18:16:02,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:16:02,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-10-14 18:16:02,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=2027, Unknown=11, NotChecked=276, Total=2450 [2024-10-14 18:16:02,706 INFO L87 Difference]: Start difference. First operand 104 states and 115 transitions. Second operand has 42 states, 34 states have (on average 2.0) internal successors, (68), 34 states have internal predecessors, (68), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-14 18:16:04,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:16:04,019 INFO L93 Difference]: Finished difference Result 107 states and 118 transitions. [2024-10-14 18:16:04,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-14 18:16:04,020 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 34 states have (on average 2.0) internal successors, (68), 34 states have internal predecessors, (68), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 42 [2024-10-14 18:16:04,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:16:04,021 INFO L225 Difference]: With dead ends: 107 [2024-10-14 18:16:04,021 INFO L226 Difference]: Without dead ends: 107 [2024-10-14 18:16:04,022 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 562 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=245, Invalid=3296, Unknown=11, NotChecked=354, Total=3906 [2024-10-14 18:16:04,022 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 32 mSDsluCounter, 1331 mSDsCounter, 0 mSdLazyCounter, 1244 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 1381 SdHoareTripleChecker+Invalid, 1251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-14 18:16:04,023 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 1381 Invalid, 1251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1244 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-14 18:16:04,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-10-14 18:16:04,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 104. [2024-10-14 18:16:04,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 77 states have (on average 1.3506493506493507) internal successors, (104), 95 states have internal predecessors, (104), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-14 18:16:04,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 114 transitions. [2024-10-14 18:16:04,026 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 114 transitions. Word has length 42 [2024-10-14 18:16:04,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:16:04,027 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 114 transitions. [2024-10-14 18:16:04,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 34 states have (on average 2.0) internal successors, (68), 34 states have internal predecessors, (68), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-14 18:16:04,027 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 114 transitions. [2024-10-14 18:16:04,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-14 18:16:04,027 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:16:04,027 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:16:04,050 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2024-10-14 18:16:04,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-10-14 18:16:04,232 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-10-14 18:16:04,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:16:04,232 INFO L85 PathProgramCache]: Analyzing trace with hash -925902198, now seen corresponding path program 3 times [2024-10-14 18:16:04,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:16:04,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260697870] [2024-10-14 18:16:04,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:16:04,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:16:04,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:16:04,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 18:16:04,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:16:04,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 18:16:04,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:16:04,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 18:16:04,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:16:04,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-14 18:16:04,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:16:04,319 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-10-14 18:16:04,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:16:04,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260697870] [2024-10-14 18:16:04,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260697870] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:16:04,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:16:04,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 18:16:04,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879770707] [2024-10-14 18:16:04,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:16:04,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 18:16:04,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:16:04,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 18:16:04,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-14 18:16:04,321 INFO L87 Difference]: Start difference. First operand 104 states and 114 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-14 18:16:04,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:16:04,378 INFO L93 Difference]: Finished difference Result 76 states and 81 transitions. [2024-10-14 18:16:04,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 18:16:04,378 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 43 [2024-10-14 18:16:04,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:16:04,379 INFO L225 Difference]: With dead ends: 76 [2024-10-14 18:16:04,379 INFO L226 Difference]: Without dead ends: 76 [2024-10-14 18:16:04,379 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 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-14 18:16:04,380 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 0 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 18:16:04,380 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 142 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 18:16:04,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-10-14 18:16:04,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2024-10-14 18:16:04,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 56 states have (on average 1.3392857142857142) internal successors, (75), 70 states have internal predecessors, (75), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 18:16:04,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 81 transitions. [2024-10-14 18:16:04,383 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 81 transitions. Word has length 43 [2024-10-14 18:16:04,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:16:04,383 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 81 transitions. [2024-10-14 18:16:04,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-14 18:16:04,384 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 81 transitions. [2024-10-14 18:16:04,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-14 18:16:04,384 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:16:04,384 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:16:04,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-14 18:16:04,384 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-10-14 18:16:04,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:16:04,385 INFO L85 PathProgramCache]: Analyzing trace with hash -1253297409, now seen corresponding path program 1 times [2024-10-14 18:16:04,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:16:04,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942458709] [2024-10-14 18:16:04,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:16:04,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:16:04,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:16:05,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 18:16:05,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:16:05,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 18:16:05,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:16:05,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 18:16:05,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:16:05,969 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-14 18:16:05,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:16:05,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942458709] [2024-10-14 18:16:05,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942458709] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:16:05,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1054123052] [2024-10-14 18:16:05,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:16:05,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:16:05,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:16:05,973 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 18:16:05,985 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-10-14 18:16:06,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:16:06,299 INFO L255 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 130 conjuncts are in the unsatisfiable core [2024-10-14 18:16:06,303 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:16:06,341 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-14 18:16:06,581 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-14 18:16:06,629 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-14 18:16:06,635 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-14 18:16:06,703 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-14 18:16:06,704 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 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-14 18:16:06,837 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 11 [2024-10-14 18:16:06,845 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-14 18:16:06,857 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-14 18:16:06,961 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2024-10-14 18:16:06,961 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 58 [2024-10-14 18:16:06,969 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 36 treesize of output 15 [2024-10-14 18:16:06,976 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 36 treesize of output 15 [2024-10-14 18:16:07,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 9 treesize of output 3 [2024-10-14 18:16:07,065 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 11 treesize of output 3 [2024-10-14 18:16:07,071 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 16 treesize of output 8 [2024-10-14 18:16:07,075 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 11 treesize of output 3 [2024-10-14 18:16:07,447 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-10-14 18:16:07,448 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 23 [2024-10-14 18:16:07,462 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-10-14 18:16:07,462 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 1 case distinctions, treesize of input 15 treesize of output 15 [2024-10-14 18:16:07,476 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 20 treesize of output 15 [2024-10-14 18:16:07,485 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 25 treesize of output 20 [2024-10-14 18:16:08,066 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 11 treesize of output 3 [2024-10-14 18:16:08,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 28 treesize of output 12 [2024-10-14 18:16:08,246 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-10-14 18:16:08,355 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 20 treesize of output 15 [2024-10-14 18:16:08,458 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:16:08,458 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 35 treesize of output 27 [2024-10-14 18:16:08,468 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-10-14 18:16:08,469 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 15 treesize of output 7 [2024-10-14 18:16:08,560 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:16:08,561 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 18:16:08,653 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3556 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3556) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) is different from false [2024-10-14 18:16:08,664 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3555 (Array Int Int)) (v_ArrVal_3556 (Array Int Int))) (or (not (= v_ArrVal_3555 (store (select |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| (select v_ArrVal_3555 |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_3555) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3556) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))))) is different from false [2024-10-14 18:16:08,692 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3555 (Array Int Int)) (v_ArrVal_3556 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| .cse0 v_ArrVal_3555) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3556) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (not (= v_ArrVal_3555 (let ((.cse1 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|))) (store (select |c_#memory_int#2| .cse0) .cse1 (select v_ArrVal_3555 .cse1)))))))) is different from false [2024-10-14 18:16:08,724 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3555 (Array Int Int)) (v_ArrVal_3556 (Array Int Int))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse2) .cse3))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| .cse0 v_ArrVal_3555) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3556) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (not (= (let ((.cse1 (select (select |c_#memory_$Pointer$#2.offset| .cse2) .cse3))) (store (select |c_#memory_int#2| .cse0) .cse1 (select v_ArrVal_3555 .cse1))) v_ArrVal_3555)))))) is different from false [2024-10-14 18:16:08,749 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3555 (Array Int Int)) (v_ArrVal_3556 (Array Int Int))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse2) .cse3))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| .cse0 v_ArrVal_3555) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_3556) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (not (= (let ((.cse1 (select (select |c_#memory_$Pointer$#2.offset| .cse2) .cse3))) (store (select |c_#memory_int#2| .cse0) .cse1 (select v_ArrVal_3555 .cse1))) v_ArrVal_3555)))))) is different from false [2024-10-14 18:16:08,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1054123052] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:16:08,936 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 18:16:08,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 28] total 52 [2024-10-14 18:16:08,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961085785] [2024-10-14 18:16:08,937 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 18:16:08,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-10-14 18:16:08,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:16:08,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-10-14 18:16:08,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=2778, Unknown=5, NotChecked=550, Total=3540 [2024-10-14 18:16:08,939 INFO L87 Difference]: Start difference. First operand 76 states and 81 transitions. Second operand has 52 states, 42 states have (on average 1.8333333333333333) internal successors, (77), 43 states have internal predecessors, (77), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-14 18:16:10,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:16:10,373 INFO L93 Difference]: Finished difference Result 80 states and 83 transitions. [2024-10-14 18:16:10,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-10-14 18:16:10,373 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 42 states have (on average 1.8333333333333333) internal successors, (77), 43 states have internal predecessors, (77), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 46 [2024-10-14 18:16:10,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:16:10,374 INFO L225 Difference]: With dead ends: 80 [2024-10-14 18:16:10,374 INFO L226 Difference]: Without dead ends: 80 [2024-10-14 18:16:10,375 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1141 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=349, Invalid=4496, Unknown=5, NotChecked=700, Total=5550 [2024-10-14 18:16:10,376 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 59 mSDsluCounter, 850 mSDsCounter, 0 mSdLazyCounter, 1038 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 891 SdHoareTripleChecker+Invalid, 1044 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1038 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-14 18:16:10,377 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 891 Invalid, 1044 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1038 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-14 18:16:10,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-10-14 18:16:10,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 76. [2024-10-14 18:16:10,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 56 states have (on average 1.3214285714285714) internal successors, (74), 70 states have internal predecessors, (74), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 18:16:10,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 80 transitions. [2024-10-14 18:16:10,379 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 80 transitions. Word has length 46 [2024-10-14 18:16:10,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:16:10,380 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 80 transitions. [2024-10-14 18:16:10,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 42 states have (on average 1.8333333333333333) internal successors, (77), 43 states have internal predecessors, (77), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-14 18:16:10,380 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 80 transitions. [2024-10-14 18:16:10,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-10-14 18:16:10,381 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:16:10,381 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2024-10-14 18:16:10,401 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2024-10-14 18:16:10,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-10-14 18:16:10,581 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-10-14 18:16:10,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:16:10,582 INFO L85 PathProgramCache]: Analyzing trace with hash -194509745, now seen corresponding path program 1 times [2024-10-14 18:16:10,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:16:10,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085942905] [2024-10-14 18:16:10,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:16:10,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:16:10,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:16:11,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 18:16:11,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:16:11,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 18:16:11,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:16:11,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 18:16:12,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:16:12,058 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-14 18:16:12,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:16:12,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085942905] [2024-10-14 18:16:12,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085942905] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:16:12,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [169483188] [2024-10-14 18:16:12,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:16:12,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:16:12,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:16:12,061 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 18:16:12,063 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-10-14 18:16:12,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:16:12,341 INFO L255 TraceCheckSpWp]: Trace formula consists of 446 conjuncts, 65 conjuncts are in the unsatisfiable core [2024-10-14 18:16:12,344 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:16:12,348 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-14 18:16:12,432 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-14 18:16:12,433 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-14 18:16:12,485 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-14 18:16:12,544 INFO L349 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2024-10-14 18:16:12,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 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 57 [2024-10-14 18:16:12,586 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 38 treesize of output 14 [2024-10-14 18:16:12,590 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 15 treesize of output 7 [2024-10-14 18:16:12,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 18:16:12,745 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 35 [2024-10-14 18:16:12,772 INFO L349 Elim1Store]: treesize reduction 88, result has 36.7 percent of original size [2024-10-14 18:16:12,773 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 40 treesize of output 60 [2024-10-14 18:16:12,990 INFO L349 Elim1Store]: treesize reduction 33, result has 48.4 percent of original size [2024-10-14 18:16:12,990 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 56 [2024-10-14 18:16:13,146 INFO L349 Elim1Store]: treesize reduction 25, result has 26.5 percent of original size [2024-10-14 18:16:13,146 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 104 treesize of output 88 [2024-10-14 18:16:13,186 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-14 18:16:13,367 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 152 treesize of output 104 [2024-10-14 18:16:13,374 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 103 treesize of output 75 [2024-10-14 18:16:13,503 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 79 treesize of output 51 [2024-10-14 18:16:13,643 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-14 18:16:13,643 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 18:16:13,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [169483188] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:16:13,965 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 18:16:13,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22] total 40 [2024-10-14 18:16:13,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349063260] [2024-10-14 18:16:13,965 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 18:16:13,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-10-14 18:16:13,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:16:13,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-10-14 18:16:13,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=1834, Unknown=1, NotChecked=0, Total=1980 [2024-10-14 18:16:13,967 INFO L87 Difference]: Start difference. First operand 76 states and 80 transitions. Second operand has 41 states, 35 states have (on average 2.085714285714286) internal successors, (73), 33 states have internal predecessors, (73), 4 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-10-14 18:16:15,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:16:15,471 INFO L93 Difference]: Finished difference Result 83 states and 88 transitions. [2024-10-14 18:16:15,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-10-14 18:16:15,471 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 35 states have (on average 2.085714285714286) internal successors, (73), 33 states have internal predecessors, (73), 4 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 47 [2024-10-14 18:16:15,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:16:15,472 INFO L225 Difference]: With dead ends: 83 [2024-10-14 18:16:15,472 INFO L226 Difference]: Without dead ends: 83 [2024-10-14 18:16:15,473 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 814 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=326, Invalid=3333, Unknown=1, NotChecked=0, Total=3660 [2024-10-14 18:16:15,474 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 67 mSDsluCounter, 741 mSDsCounter, 0 mSdLazyCounter, 1024 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 782 SdHoareTripleChecker+Invalid, 1035 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1024 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 18:16:15,474 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 782 Invalid, 1035 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1024 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 18:16:15,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-10-14 18:16:15,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 79. [2024-10-14 18:16:15,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 59 states have (on average 1.3389830508474576) internal successors, (79), 73 states have internal predecessors, (79), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 18:16:15,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 85 transitions. [2024-10-14 18:16:15,477 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 85 transitions. Word has length 47 [2024-10-14 18:16:15,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:16:15,477 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 85 transitions. [2024-10-14 18:16:15,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 35 states have (on average 2.085714285714286) internal successors, (73), 33 states have internal predecessors, (73), 4 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-10-14 18:16:15,478 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 85 transitions. [2024-10-14 18:16:15,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-10-14 18:16:15,478 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:16:15,478 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2024-10-14 18:16:15,498 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2024-10-14 18:16:15,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-10-14 18:16:15,683 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-10-14 18:16:15,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:16:15,684 INFO L85 PathProgramCache]: Analyzing trace with hash -194509744, now seen corresponding path program 1 times [2024-10-14 18:16:15,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:16:15,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812546650] [2024-10-14 18:16:15,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:16:15,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:16:15,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:16:18,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 18:16:18,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:16:18,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 18:16:18,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:16:18,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 18:16:18,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:16:18,620 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-14 18:16:18,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:16:18,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812546650] [2024-10-14 18:16:18,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812546650] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:16:18,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2007395569] [2024-10-14 18:16:18,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:16:18,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:16:18,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:16:18,622 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 18:16:18,624 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-10-14 18:16:18,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:16:18,905 INFO L255 TraceCheckSpWp]: Trace formula consists of 446 conjuncts, 114 conjuncts are in the unsatisfiable core [2024-10-14 18:16:18,909 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:16:18,914 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-14 18:16:18,918 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-14 18:16:19,239 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-14 18:16:19,239 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-14 18:16:19,246 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 12 treesize of output 14 [2024-10-14 18:16:19,396 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-14 18:16:19,406 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-14 18:16:19,492 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2024-10-14 18:16:19,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 60 [2024-10-14 18:16:19,497 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 36 treesize of output 15 [2024-10-14 18:16:19,579 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 19 [2024-10-14 18:16:19,584 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 15 treesize of output 7 [2024-10-14 18:16:19,589 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 11 treesize of output 3 [2024-10-14 18:16:19,593 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 15 treesize of output 7 [2024-10-14 18:16:19,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 18:16:19,944 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 51 treesize of output 34 [2024-10-14 18:16:19,965 INFO L349 Elim1Store]: treesize reduction 52, result has 40.2 percent of original size [2024-10-14 18:16:19,965 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 46 [2024-10-14 18:16:19,989 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-10-14 18:16:19,989 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2024-10-14 18:16:19,998 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 20 treesize of output 15 [2024-10-14 18:16:20,461 INFO L349 Elim1Store]: treesize reduction 25, result has 47.9 percent of original size [2024-10-14 18:16:20,462 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 48 [2024-10-14 18:16:20,478 INFO L349 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2024-10-14 18:16:20,478 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 1 case distinctions, treesize of input 23 treesize of output 22 [2024-10-14 18:16:20,721 INFO L349 Elim1Store]: treesize reduction 25, result has 26.5 percent of original size [2024-10-14 18:16:20,722 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 95 treesize of output 79 [2024-10-14 18:16:20,740 INFO L349 Elim1Store]: treesize reduction 25, result has 26.5 percent of original size [2024-10-14 18:16:20,740 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 104 treesize of output 106 [2024-10-14 18:16:20,789 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-14 18:16:20,879 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