./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-simple/sll2c_insert_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-simple/sll2c_insert_unequal.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b7b415e0519ab150e9247d3d9d0133f92cfd07c34f9918f9ebd19cf8109bf4e7 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 08:03:47,069 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 08:03:47,159 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-09 08:03:47,162 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 08:03:47,162 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 08:03:47,191 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 08:03:47,192 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 08:03:47,192 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 08:03:47,192 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 08:03:47,193 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 08:03:47,193 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 08:03:47,193 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 08:03:47,194 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 08:03:47,194 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 08:03:47,194 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 08:03:47,194 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 08:03:47,195 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 08:03:47,195 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 08:03:47,195 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 08:03:47,195 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 08:03:47,196 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 08:03:47,196 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 08:03:47,196 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 08:03:47,197 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 08:03:47,197 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 08:03:47,197 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 08:03:47,197 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 08:03:47,198 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 08:03:47,198 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 08:03:47,198 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 08:03:47,198 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 08:03:47,199 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 08:03:47,199 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 08:03:47,199 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 08:03:47,199 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 08:03:47,200 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 08:03:47,200 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 08:03:47,200 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 08:03:47,200 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 08:03:47,201 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 08:03:47,201 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 08:03:47,205 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 08:03:47,206 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 -> b7b415e0519ab150e9247d3d9d0133f92cfd07c34f9918f9ebd19cf8109bf4e7 [2024-11-09 08:03:47,452 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 08:03:47,478 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 08:03:47,481 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 08:03:47,482 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 08:03:47,482 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 08:03:47,483 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2c_insert_unequal.i [2024-11-09 08:03:49,267 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 08:03:49,579 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 08:03:49,580 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_insert_unequal.i [2024-11-09 08:03:49,597 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36898b578/05f8d869a8d443ccb192688c81467766/FLAGb03e0d45f [2024-11-09 08:03:49,610 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36898b578/05f8d869a8d443ccb192688c81467766 [2024-11-09 08:03:49,612 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 08:03:49,613 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 08:03:49,614 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 08:03:49,615 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 08:03:49,620 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 08:03:49,620 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 08:03:49" (1/1) ... [2024-11-09 08:03:49,621 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e3b0e10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:03:49, skipping insertion in model container [2024-11-09 08:03:49,621 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 08:03:49" (1/1) ... [2024-11-09 08:03:49,659 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 08:03:49,974 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 08:03:49,986 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 08:03:50,040 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 08:03:50,069 INFO L204 MainTranslator]: Completed translation [2024-11-09 08:03:50,070 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:03:50 WrapperNode [2024-11-09 08:03:50,070 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 08:03:50,071 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 08:03:50,071 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 08:03:50,072 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 08:03:50,078 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:03:50" (1/1) ... [2024-11-09 08:03:50,092 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:03:50" (1/1) ... [2024-11-09 08:03:50,118 INFO L138 Inliner]: procedures = 127, calls = 49, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 182 [2024-11-09 08:03:50,118 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 08:03:50,119 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 08:03:50,119 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 08:03:50,119 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 08:03:50,130 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:03:50" (1/1) ... [2024-11-09 08:03:50,130 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:03:50" (1/1) ... [2024-11-09 08:03:50,140 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:03:50" (1/1) ... [2024-11-09 08:03:50,167 INFO L175 MemorySlicer]: Split 30 memory accesses to 3 slices as follows [2, 10, 18]. 60 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 10 writes are split as follows [0, 1, 9]. [2024-11-09 08:03:50,167 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:03:50" (1/1) ... [2024-11-09 08:03:50,167 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:03:50" (1/1) ... [2024-11-09 08:03:50,176 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:03:50" (1/1) ... [2024-11-09 08:03:50,179 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:03:50" (1/1) ... [2024-11-09 08:03:50,181 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:03:50" (1/1) ... [2024-11-09 08:03:50,183 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:03:50" (1/1) ... [2024-11-09 08:03:50,186 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 08:03:50,187 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 08:03:50,187 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 08:03:50,187 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 08:03:50,188 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:03:50" (1/1) ... [2024-11-09 08:03:50,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 08:03:50,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:03:50,244 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 08:03:50,247 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 08:03:50,294 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 08:03:50,295 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 08:03:50,295 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-09 08:03:50,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 08:03:50,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 08:03:50,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-09 08:03:50,296 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-11-09 08:03:50,296 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-11-09 08:03:50,296 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 08:03:50,297 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 08:03:50,297 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 08:03:50,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-09 08:03:50,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-09 08:03:50,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-09 08:03:50,298 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-09 08:03:50,298 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-09 08:03:50,299 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-09 08:03:50,299 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 08:03:50,299 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-09 08:03:50,299 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-09 08:03:50,299 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-09 08:03:50,299 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 08:03:50,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 08:03:50,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-09 08:03:50,300 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 08:03:50,300 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 08:03:50,431 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 08:03:50,433 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 08:03:50,752 INFO L? ?]: Removed 161 outVars from TransFormulas that were not future-live. [2024-11-09 08:03:50,752 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 08:03:50,765 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 08:03:50,765 INFO L316 CfgBuilder]: Removed 5 assume(true) statements. [2024-11-09 08:03:50,765 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 08:03:50 BoogieIcfgContainer [2024-11-09 08:03:50,765 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 08:03:50,767 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 08:03:50,767 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 08:03:50,770 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 08:03:50,770 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 08:03:49" (1/3) ... [2024-11-09 08:03:50,771 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61beda5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 08:03:50, skipping insertion in model container [2024-11-09 08:03:50,771 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:03:50" (2/3) ... [2024-11-09 08:03:50,771 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61beda5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 08:03:50, skipping insertion in model container [2024-11-09 08:03:50,771 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 08:03:50" (3/3) ... [2024-11-09 08:03:50,772 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_insert_unequal.i [2024-11-09 08:03:50,786 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 08:03:50,786 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 62 error locations. [2024-11-09 08:03:50,822 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 08:03:50,827 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;@689f974d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 08:03:50,827 INFO L334 AbstractCegarLoop]: Starting to check reachability of 62 error locations. [2024-11-09 08:03:50,831 INFO L276 IsEmpty]: Start isEmpty. Operand has 144 states, 77 states have (on average 2.051948051948052) internal successors, (158), 139 states have internal predecessors, (158), 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-11-09 08:03:50,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-09 08:03:50,836 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:03:50,837 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-09 08:03:50,837 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-11-09 08:03:50,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:03:50,863 INFO L85 PathProgramCache]: Analyzing trace with hash 896814549, now seen corresponding path program 1 times [2024-11-09 08:03:50,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:03:50,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975176261] [2024-11-09 08:03:50,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:03:50,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:03:50,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:03:51,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 08:03:51,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:03:51,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975176261] [2024-11-09 08:03:51,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975176261] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:03:51,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:03:51,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 08:03:51,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383215263] [2024-11-09 08:03:51,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:03:51,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 08:03:51,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:03:51,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 08:03:51,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:03:51,101 INFO L87 Difference]: Start difference. First operand has 144 states, 77 states have (on average 2.051948051948052) internal successors, (158), 139 states have internal predecessors, (158), 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.5) internal successors, (5), 3 states have internal predecessors, (5), 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-11-09 08:03:51,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:03:51,205 INFO L93 Difference]: Finished difference Result 141 states and 154 transitions. [2024-11-09 08:03:51,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 08:03:51,207 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 6 [2024-11-09 08:03:51,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:03:51,214 INFO L225 Difference]: With dead ends: 141 [2024-11-09 08:03:51,214 INFO L226 Difference]: Without dead ends: 138 [2024-11-09 08:03:51,215 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:03:51,218 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 2 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 08:03:51,219 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 234 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 08:03:51,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-11-09 08:03:51,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2024-11-09 08:03:51,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 74 states have (on average 1.945945945945946) internal successors, (144), 133 states have internal predecessors, (144), 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-11-09 08:03:51,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 150 transitions. [2024-11-09 08:03:51,252 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 150 transitions. Word has length 6 [2024-11-09 08:03:51,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:03:51,252 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 150 transitions. [2024-11-09 08:03:51,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-11-09 08:03:51,252 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 150 transitions. [2024-11-09 08:03:51,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-09 08:03:51,253 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:03:51,253 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-09 08:03:51,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 08:03:51,254 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-11-09 08:03:51,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:03:51,254 INFO L85 PathProgramCache]: Analyzing trace with hash 896814550, now seen corresponding path program 1 times [2024-11-09 08:03:51,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:03:51,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552635670] [2024-11-09 08:03:51,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:03:51,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:03:51,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:03:51,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 08:03:51,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:03:51,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552635670] [2024-11-09 08:03:51,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552635670] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:03:51,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:03:51,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 08:03:51,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594247562] [2024-11-09 08:03:51,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:03:51,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 08:03:51,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:03:51,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 08:03:51,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:03:51,365 INFO L87 Difference]: Start difference. First operand 138 states and 150 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-11-09 08:03:51,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:03:51,468 INFO L93 Difference]: Finished difference Result 136 states and 148 transitions. [2024-11-09 08:03:51,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 08:03:51,468 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 6 [2024-11-09 08:03:51,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:03:51,469 INFO L225 Difference]: With dead ends: 136 [2024-11-09 08:03:51,470 INFO L226 Difference]: Without dead ends: 136 [2024-11-09 08:03:51,470 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:03:51,471 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 2 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 08:03:51,472 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 235 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 08:03:51,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-11-09 08:03:51,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2024-11-09 08:03:51,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 74 states have (on average 1.9189189189189189) internal successors, (142), 131 states have internal predecessors, (142), 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-11-09 08:03:51,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 148 transitions. [2024-11-09 08:03:51,483 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 148 transitions. Word has length 6 [2024-11-09 08:03:51,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:03:51,483 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 148 transitions. [2024-11-09 08:03:51,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-11-09 08:03:51,483 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 148 transitions. [2024-11-09 08:03:51,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-09 08:03:51,484 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:03:51,484 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:03:51,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 08:03:51,485 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-11-09 08:03:51,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:03:51,486 INFO L85 PathProgramCache]: Analyzing trace with hash -513325225, now seen corresponding path program 1 times [2024-11-09 08:03:51,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:03:51,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135813740] [2024-11-09 08:03:51,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:03:51,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:03:51,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:03:51,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 08:03:51,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:03:51,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 08:03:51,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:03:51,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135813740] [2024-11-09 08:03:51,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135813740] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:03:51,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:03:51,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 08:03:51,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911214476] [2024-11-09 08:03:51,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:03:51,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 08:03:51,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:03:51,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 08:03:51,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 08:03:51,598 INFO L87 Difference]: Start difference. First operand 136 states and 148 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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-11-09 08:03:51,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:03:51,724 INFO L93 Difference]: Finished difference Result 143 states and 156 transitions. [2024-11-09 08:03:51,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 08:03:51,725 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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 13 [2024-11-09 08:03:51,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:03:51,726 INFO L225 Difference]: With dead ends: 143 [2024-11-09 08:03:51,726 INFO L226 Difference]: Without dead ends: 143 [2024-11-09 08:03:51,727 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 08:03:51,728 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 5 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 08:03:51,728 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 342 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 08:03:51,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-11-09 08:03:51,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 137. [2024-11-09 08:03:51,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 75 states have (on average 1.9066666666666667) internal successors, (143), 132 states have internal predecessors, (143), 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-11-09 08:03:51,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 149 transitions. [2024-11-09 08:03:51,739 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 149 transitions. Word has length 13 [2024-11-09 08:03:51,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:03:51,739 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 149 transitions. [2024-11-09 08:03:51,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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-11-09 08:03:51,740 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 149 transitions. [2024-11-09 08:03:51,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-09 08:03:51,740 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:03:51,741 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:03:51,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 08:03:51,741 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-11-09 08:03:51,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:03:51,742 INFO L85 PathProgramCache]: Analyzing trace with hash 939436316, now seen corresponding path program 1 times [2024-11-09 08:03:51,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:03:51,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465176790] [2024-11-09 08:03:51,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:03:51,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:03:51,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:03:51,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 08:03:51,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:03:51,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 08:03:51,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:03:51,941 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 08:03:51,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:03:51,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465176790] [2024-11-09 08:03:51,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465176790] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:03:51,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:03:51,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 08:03:51,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743021991] [2024-11-09 08:03:51,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:03:51,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 08:03:51,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:03:51,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 08:03:51,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 08:03:51,944 INFO L87 Difference]: Start difference. First operand 137 states and 149 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 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-11-09 08:03:52,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:03:52,169 INFO L93 Difference]: Finished difference Result 136 states and 148 transitions. [2024-11-09 08:03:52,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 08:03:52,170 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 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 22 [2024-11-09 08:03:52,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:03:52,171 INFO L225 Difference]: With dead ends: 136 [2024-11-09 08:03:52,171 INFO L226 Difference]: Without dead ends: 136 [2024-11-09 08:03:52,172 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-11-09 08:03:52,173 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 2 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 08:03:52,174 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 503 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 367 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 08:03:52,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-11-09 08:03:52,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2024-11-09 08:03:52,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 75 states have (on average 1.8933333333333333) internal successors, (142), 131 states have internal predecessors, (142), 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-11-09 08:03:52,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 148 transitions. [2024-11-09 08:03:52,180 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 148 transitions. Word has length 22 [2024-11-09 08:03:52,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:03:52,180 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 148 transitions. [2024-11-09 08:03:52,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 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-11-09 08:03:52,181 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 148 transitions. [2024-11-09 08:03:52,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-09 08:03:52,181 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:03:52,181 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:03:52,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 08:03:52,182 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-11-09 08:03:52,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:03:52,182 INFO L85 PathProgramCache]: Analyzing trace with hash 939436317, now seen corresponding path program 1 times [2024-11-09 08:03:52,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:03:52,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643642684] [2024-11-09 08:03:52,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:03:52,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:03:52,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:03:52,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 08:03:52,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:03:52,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 08:03:52,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:03:52,541 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 08:03:52,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:03:52,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643642684] [2024-11-09 08:03:52,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643642684] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:03:52,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:03:52,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 08:03:52,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013279311] [2024-11-09 08:03:52,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:03:52,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 08:03:52,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:03:52,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 08:03:52,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 08:03:52,545 INFO L87 Difference]: Start difference. First operand 136 states and 148 transitions. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 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-11-09 08:03:52,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:03:52,805 INFO L93 Difference]: Finished difference Result 135 states and 147 transitions. [2024-11-09 08:03:52,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 08:03:52,806 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 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 22 [2024-11-09 08:03:52,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:03:52,807 INFO L225 Difference]: With dead ends: 135 [2024-11-09 08:03:52,808 INFO L226 Difference]: Without dead ends: 135 [2024-11-09 08:03:52,808 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-11-09 08:03:52,809 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 1 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 08:03:52,810 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 527 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 08:03:52,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-11-09 08:03:52,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2024-11-09 08:03:52,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 75 states have (on average 1.88) internal successors, (141), 130 states have internal predecessors, (141), 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-11-09 08:03:52,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 147 transitions. [2024-11-09 08:03:52,817 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 147 transitions. Word has length 22 [2024-11-09 08:03:52,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:03:52,818 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 147 transitions. [2024-11-09 08:03:52,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 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-11-09 08:03:52,818 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 147 transitions. [2024-11-09 08:03:52,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-09 08:03:52,819 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:03:52,819 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:03:52,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 08:03:52,820 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-11-09 08:03:52,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:03:52,820 INFO L85 PathProgramCache]: Analyzing trace with hash 740378053, now seen corresponding path program 1 times [2024-11-09 08:03:52,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:03:52,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805523237] [2024-11-09 08:03:52,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:03:52,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:03:52,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:03:52,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 08:03:52,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:03:53,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 08:03:53,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:03:53,108 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 08:03:53,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:03:53,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805523237] [2024-11-09 08:03:53,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805523237] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:03:53,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [744535486] [2024-11-09 08:03:53,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:03:53,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:03:53,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:03:53,112 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 08:03:53,114 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 08:03:53,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:03:53,232 INFO L255 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-09 08:03:53,237 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:03:53,277 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 08:03:53,384 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-09 08:03:53,384 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-11-09 08:03:53,450 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 08:03:53,450 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 08:03:53,749 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 08:03:53,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [744535486] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 08:03:53,750 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 08:03:53,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 18 [2024-11-09 08:03:53,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986722410] [2024-11-09 08:03:53,750 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 08:03:53,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-09 08:03:53,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:03:53,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-09 08:03:53,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2024-11-09 08:03:53,752 INFO L87 Difference]: Start difference. First operand 135 states and 147 transitions. Second operand has 19 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 13 states have internal predecessors, (40), 2 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 08:03:54,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:03:54,167 INFO L93 Difference]: Finished difference Result 134 states and 146 transitions. [2024-11-09 08:03:54,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 08:03:54,167 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 13 states have internal predecessors, (40), 2 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) Word has length 25 [2024-11-09 08:03:54,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:03:54,168 INFO L225 Difference]: With dead ends: 134 [2024-11-09 08:03:54,168 INFO L226 Difference]: Without dead ends: 134 [2024-11-09 08:03:54,169 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=83, Invalid=337, Unknown=0, NotChecked=0, Total=420 [2024-11-09 08:03:54,169 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 0 mSDsluCounter, 902 mSDsCounter, 0 mSdLazyCounter, 785 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1037 SdHoareTripleChecker+Invalid, 788 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 785 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 08:03:54,170 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1037 Invalid, 788 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 785 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 08:03:54,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2024-11-09 08:03:54,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2024-11-09 08:03:54,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 75 states have (on average 1.8666666666666667) internal successors, (140), 129 states have internal predecessors, (140), 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-11-09 08:03:54,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 146 transitions. [2024-11-09 08:03:54,177 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 146 transitions. Word has length 25 [2024-11-09 08:03:54,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:03:54,177 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 146 transitions. [2024-11-09 08:03:54,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 13 states have internal predecessors, (40), 2 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 08:03:54,178 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 146 transitions. [2024-11-09 08:03:54,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-09 08:03:54,178 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:03:54,178 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:03:54,193 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 08:03:54,382 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-11-09 08:03:54,383 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-11-09 08:03:54,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:03:54,383 INFO L85 PathProgramCache]: Analyzing trace with hash 740378054, now seen corresponding path program 1 times [2024-11-09 08:03:54,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:03:54,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804580757] [2024-11-09 08:03:54,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:03:54,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:03:54,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:03:54,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 08:03:54,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:03:54,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 08:03:54,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:03:54,775 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 08:03:54,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:03:54,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804580757] [2024-11-09 08:03:54,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804580757] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:03:54,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [465810312] [2024-11-09 08:03:54,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:03:54,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:03:54,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:03:54,778 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 08:03:54,780 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 08:03:54,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:03:54,890 INFO L255 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-09 08:03:54,892 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:03:54,906 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-09 08:03:54,908 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 08:03:55,098 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 08:03:55,099 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-11-09 08:03:55,102 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-09 08:03:55,151 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 08:03:55,151 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 08:03:55,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [465810312] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:03:55,277 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 08:03:55,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 17 [2024-11-09 08:03:55,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167735830] [2024-11-09 08:03:55,278 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 08:03:55,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-09 08:03:55,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:03:55,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-09 08:03:55,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=331, Unknown=0, NotChecked=0, Total=380 [2024-11-09 08:03:55,279 INFO L87 Difference]: Start difference. First operand 134 states and 146 transitions. Second operand has 18 states, 17 states have (on average 2.3529411764705883) internal successors, (40), 13 states have internal predecessors, (40), 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-11-09 08:03:55,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:03:55,941 INFO L93 Difference]: Finished difference Result 135 states and 148 transitions. [2024-11-09 08:03:55,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 08:03:55,941 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.3529411764705883) internal successors, (40), 13 states have internal predecessors, (40), 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 25 [2024-11-09 08:03:55,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:03:55,942 INFO L225 Difference]: With dead ends: 135 [2024-11-09 08:03:55,942 INFO L226 Difference]: Without dead ends: 135 [2024-11-09 08:03:55,942 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=79, Invalid=521, Unknown=0, NotChecked=0, Total=600 [2024-11-09 08:03:55,944 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 0 mSDsluCounter, 943 mSDsCounter, 0 mSdLazyCounter, 906 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1077 SdHoareTripleChecker+Invalid, 909 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 906 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 08:03:55,944 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1077 Invalid, 909 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 906 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 08:03:55,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-11-09 08:03:55,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 133. [2024-11-09 08:03:55,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 75 states have (on average 1.8533333333333333) internal successors, (139), 128 states have internal predecessors, (139), 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-11-09 08:03:55,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 145 transitions. [2024-11-09 08:03:55,955 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 145 transitions. Word has length 25 [2024-11-09 08:03:55,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:03:55,955 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 145 transitions. [2024-11-09 08:03:55,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.3529411764705883) internal successors, (40), 13 states have internal predecessors, (40), 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-11-09 08:03:55,955 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 145 transitions. [2024-11-09 08:03:55,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-09 08:03:55,956 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:03:55,956 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:03:55,986 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 08:03:56,160 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-11-09 08:03:56,161 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-11-09 08:03:56,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:03:56,162 INFO L85 PathProgramCache]: Analyzing trace with hash -1197615073, now seen corresponding path program 1 times [2024-11-09 08:03:56,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:03:56,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204120263] [2024-11-09 08:03:56,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:03:56,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:03:56,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:03:56,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 08:03:56,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:03:56,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 08:03:56,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:03:56,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 08:03:56,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:03:56,756 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-09 08:03:56,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:03:56,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204120263] [2024-11-09 08:03:56,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204120263] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:03:56,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1013233349] [2024-11-09 08:03:56,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:03:56,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:03:56,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:03:56,761 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 08:03:56,762 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 08:03:56,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:03:56,868 INFO L255 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-09 08:03:56,873 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:03:56,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 08:03:56,897 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-11-09 08:03:56,924 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-09 08:03:56,924 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-11-09 08:03:56,971 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-09 08:03:56,972 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-11-09 08:03:57,020 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-11-09 08:03:57,038 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-09 08:03:57,039 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-11-09 08:03:57,058 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 18 not checked. [2024-11-09 08:03:57,058 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 08:03:57,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1013233349] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:03:57,445 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 08:03:57,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 16 [2024-11-09 08:03:57,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696883581] [2024-11-09 08:03:57,446 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 08:03:57,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-09 08:03:57,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:03:57,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-09 08:03:57,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=340, Unknown=2, NotChecked=78, Total=506 [2024-11-09 08:03:57,449 INFO L87 Difference]: Start difference. First operand 133 states and 145 transitions. Second operand has 17 states, 16 states have (on average 3.0) internal successors, (48), 14 states have internal predecessors, (48), 3 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-09 08:03:57,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:03:57,901 INFO L93 Difference]: Finished difference Result 143 states and 156 transitions. [2024-11-09 08:03:57,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 08:03:57,902 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.0) internal successors, (48), 14 states have internal predecessors, (48), 3 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 37 [2024-11-09 08:03:57,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:03:57,904 INFO L225 Difference]: With dead ends: 143 [2024-11-09 08:03:57,904 INFO L226 Difference]: Without dead ends: 143 [2024-11-09 08:03:57,905 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 53 SyntacticMatches, 5 SemanticMatches, 24 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=114, Invalid=444, Unknown=2, NotChecked=90, Total=650 [2024-11-09 08:03:57,905 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 356 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 499 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 356 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 809 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 298 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 08:03:57,906 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [356 Valid, 452 Invalid, 809 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 499 Invalid, 0 Unknown, 298 Unchecked, 0.4s Time] [2024-11-09 08:03:57,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-11-09 08:03:57,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 124. [2024-11-09 08:03:57,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 75 states have (on average 1.7333333333333334) internal successors, (130), 119 states have internal predecessors, (130), 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-11-09 08:03:57,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 136 transitions. [2024-11-09 08:03:57,916 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 136 transitions. Word has length 37 [2024-11-09 08:03:57,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:03:57,916 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 136 transitions. [2024-11-09 08:03:57,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.0) internal successors, (48), 14 states have internal predecessors, (48), 3 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-09 08:03:57,917 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 136 transitions. [2024-11-09 08:03:57,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-09 08:03:57,917 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:03:57,917 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:03:57,940 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-09 08:03:58,118 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-11-09 08:03:58,119 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-11-09 08:03:58,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:03:58,119 INFO L85 PathProgramCache]: Analyzing trace with hash -1197615072, now seen corresponding path program 1 times [2024-11-09 08:03:58,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:03:58,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16050228] [2024-11-09 08:03:58,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:03:58,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:03:58,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:03:58,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 08:03:58,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:03:58,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 08:03:58,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:03:58,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 08:03:58,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:03:58,620 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-09 08:03:58,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:03:58,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16050228] [2024-11-09 08:03:58,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16050228] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:03:58,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1193105276] [2024-11-09 08:03:58,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:03:58,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:03:58,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:03:58,623 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 08:03:58,624 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 08:03:58,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:03:58,769 INFO L255 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-09 08:03:58,772 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:03:58,777 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-09 08:03:58,785 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-11-09 08:03:58,798 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|))) is different from true [2024-11-09 08:03:58,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 08:03:58,826 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-09 08:03:58,841 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-11-09 08:03:58,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 08:03:58,870 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-09 08:03:58,913 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-11-09 08:03:58,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 08:03:58,948 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-09 08:03:58,955 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-09 08:03:58,955 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 08:03:58,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1193105276] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:03:58,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 08:03:58,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 12 [2024-11-09 08:03:58,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633347] [2024-11-09 08:03:58,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:03:58,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 08:03:58,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:03:58,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 08:03:58,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=103, Unknown=1, NotChecked=20, Total=156 [2024-11-09 08:03:58,958 INFO L87 Difference]: Start difference. First operand 124 states and 136 transitions. Second operand has 7 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 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-11-09 08:03:59,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:03:59,124 INFO L93 Difference]: Finished difference Result 120 states and 132 transitions. [2024-11-09 08:03:59,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 08:03:59,126 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 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 37 [2024-11-09 08:03:59,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:03:59,126 INFO L225 Difference]: With dead ends: 120 [2024-11-09 08:03:59,127 INFO L226 Difference]: Without dead ends: 120 [2024-11-09 08:03:59,127 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=122, Unknown=1, NotChecked=22, Total=182 [2024-11-09 08:03:59,127 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 33 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 159 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 08:03:59,128 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 358 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 207 Invalid, 0 Unknown, 159 Unchecked, 0.1s Time] [2024-11-09 08:03:59,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-11-09 08:03:59,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 119. [2024-11-09 08:03:59,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 75 states have (on average 1.6666666666666667) internal successors, (125), 114 states have internal predecessors, (125), 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-11-09 08:03:59,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 131 transitions. [2024-11-09 08:03:59,138 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 131 transitions. Word has length 37 [2024-11-09 08:03:59,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:03:59,139 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 131 transitions. [2024-11-09 08:03:59,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 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-11-09 08:03:59,139 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 131 transitions. [2024-11-09 08:03:59,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-09 08:03:59,140 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:03:59,140 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 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-11-09 08:03:59,162 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-09 08:03:59,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:03:59,342 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-11-09 08:03:59,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:03:59,342 INFO L85 PathProgramCache]: Analyzing trace with hash 142692390, now seen corresponding path program 1 times [2024-11-09 08:03:59,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:03:59,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709281483] [2024-11-09 08:03:59,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:03:59,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:03:59,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:03:59,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 08:03:59,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:03:59,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 08:03:59,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:03:59,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 08:03:59,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:03:59,693 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-09 08:03:59,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:03:59,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709281483] [2024-11-09 08:03:59,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709281483] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:03:59,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1087195240] [2024-11-09 08:03:59,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:03:59,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:03:59,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:03:59,696 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 08:03:59,699 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-09 08:03:59,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:03:59,883 INFO L255 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-09 08:03:59,885 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:03:59,980 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-11-09 08:03:59,998 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-11-09 08:04:00,025 INFO L349 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2024-11-09 08:04:00,025 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 24 [2024-11-09 08:04:00,032 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-09 08:04:00,036 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-09 08:04:00,036 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 08:04:00,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1087195240] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:04:00,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 08:04:00,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [13] total 20 [2024-11-09 08:04:00,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377273788] [2024-11-09 08:04:00,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:04:00,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 08:04:00,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:04:00,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 08:04:00,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=333, Unknown=1, NotChecked=36, Total=420 [2024-11-09 08:04:00,037 INFO L87 Difference]: Start difference. First operand 119 states and 131 transitions. Second operand has 11 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 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-11-09 08:04:00,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:04:00,202 INFO L93 Difference]: Finished difference Result 147 states and 164 transitions. [2024-11-09 08:04:00,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 08:04:00,203 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 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 40 [2024-11-09 08:04:00,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:04:00,206 INFO L225 Difference]: With dead ends: 147 [2024-11-09 08:04:00,206 INFO L226 Difference]: Without dead ends: 147 [2024-11-09 08:04:00,207 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=444, Unknown=1, NotChecked=42, Total=552 [2024-11-09 08:04:00,207 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 87 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 230 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 08:04:00,207 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 453 Invalid, 510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 278 Invalid, 0 Unknown, 230 Unchecked, 0.1s Time] [2024-11-09 08:04:00,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-11-09 08:04:00,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 121. [2024-11-09 08:04:00,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 77 states have (on average 1.6753246753246753) internal successors, (129), 116 states have internal predecessors, (129), 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-11-09 08:04:00,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 135 transitions. [2024-11-09 08:04:00,213 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 135 transitions. Word has length 40 [2024-11-09 08:04:00,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:04:00,213 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 135 transitions. [2024-11-09 08:04:00,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 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-11-09 08:04:00,214 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 135 transitions. [2024-11-09 08:04:00,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-09 08:04:00,214 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:04:00,214 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 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-11-09 08:04:00,233 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-09 08:04:00,417 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,SelfDestructingSolverStorable9 [2024-11-09 08:04:00,418 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-11-09 08:04:00,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:04:00,418 INFO L85 PathProgramCache]: Analyzing trace with hash 142692391, now seen corresponding path program 1 times [2024-11-09 08:04:00,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:04:00,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801313810] [2024-11-09 08:04:00,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:04:00,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:04:00,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:04:00,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 08:04:00,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:04:00,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 08:04:00,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:04:00,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 08:04:00,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:04:00,960 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 08:04:00,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:04:00,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801313810] [2024-11-09 08:04:00,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801313810] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:04:00,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1535863322] [2024-11-09 08:04:00,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:04:00,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:04:00,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:04:00,963 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 08:04:00,967 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-09 08:04:01,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:04:01,171 INFO L255 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-11-09 08:04:01,174 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:04:01,195 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-09 08:04:01,425 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-11-09 08:04:01,430 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-11-09 08:04:01,465 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_insert_~head#1.base_BEFORE_CALL_5| Int)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_5|) 0) 0))) is different from true [2024-11-09 08:04:01,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 08:04:01,533 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-09 08:04:01,546 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-09 08:04:01,546 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2024-11-09 08:04:01,589 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-09 08:04:01,602 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2024-11-09 08:04:01,602 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 08:04:01,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1535863322] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:04:01,769 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 08:04:01,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 27 [2024-11-09 08:04:01,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033126153] [2024-11-09 08:04:01,769 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 08:04:01,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-09 08:04:01,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:04:01,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-09 08:04:01,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=843, Unknown=1, NotChecked=58, Total=992 [2024-11-09 08:04:01,772 INFO L87 Difference]: Start difference. First operand 121 states and 135 transitions. Second operand has 28 states, 25 states have (on average 2.36) internal successors, (59), 24 states have internal predecessors, (59), 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-11-09 08:04:02,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:04:02,688 INFO L93 Difference]: Finished difference Result 154 states and 169 transitions. [2024-11-09 08:04:02,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-09 08:04:02,689 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 25 states have (on average 2.36) internal successors, (59), 24 states have internal predecessors, (59), 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 40 [2024-11-09 08:04:02,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:04:02,690 INFO L225 Difference]: With dead ends: 154 [2024-11-09 08:04:02,690 INFO L226 Difference]: Without dead ends: 154 [2024-11-09 08:04:02,691 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 271 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=166, Invalid=1559, Unknown=1, NotChecked=80, Total=1806 [2024-11-09 08:04:02,691 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 193 mSDsluCounter, 1080 mSDsCounter, 0 mSdLazyCounter, 1316 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 1175 SdHoareTripleChecker+Invalid, 1482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 163 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 08:04:02,691 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 1175 Invalid, 1482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1316 Invalid, 0 Unknown, 163 Unchecked, 0.6s Time] [2024-11-09 08:04:02,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2024-11-09 08:04:02,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 128. [2024-11-09 08:04:02,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 83 states have (on average 1.6144578313253013) internal successors, (134), 122 states have internal predecessors, (134), 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-11-09 08:04:02,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 140 transitions. [2024-11-09 08:04:02,696 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 140 transitions. Word has length 40 [2024-11-09 08:04:02,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:04:02,696 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 140 transitions. [2024-11-09 08:04:02,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 25 states have (on average 2.36) internal successors, (59), 24 states have internal predecessors, (59), 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-11-09 08:04:02,696 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 140 transitions. [2024-11-09 08:04:02,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-09 08:04:02,697 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:04:02,697 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 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] [2024-11-09 08:04:02,715 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-09 08:04:02,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:04:02,903 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-11-09 08:04:02,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:04:02,904 INFO L85 PathProgramCache]: Analyzing trace with hash 128495175, now seen corresponding path program 1 times [2024-11-09 08:04:02,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:04:02,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880887997] [2024-11-09 08:04:02,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:04:02,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:04:02,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:04:02,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 08:04:02,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:04:02,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 08:04:02,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:04:02,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 08:04:03,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:04:03,005 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-09 08:04:03,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:04:03,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880887997] [2024-11-09 08:04:03,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880887997] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:04:03,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:04:03,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 08:04:03,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271745958] [2024-11-09 08:04:03,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:04:03,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 08:04:03,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:04:03,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 08:04:03,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 08:04:03,007 INFO L87 Difference]: Start difference. First operand 128 states and 140 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 08:04:03,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:04:03,106 INFO L93 Difference]: Finished difference Result 129 states and 141 transitions. [2024-11-09 08:04:03,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 08:04:03,107 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 41 [2024-11-09 08:04:03,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:04:03,108 INFO L225 Difference]: With dead ends: 129 [2024-11-09 08:04:03,108 INFO L226 Difference]: Without dead ends: 129 [2024-11-09 08:04:03,108 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 08:04:03,109 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 0 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 08:04:03,109 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 304 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 08:04:03,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2024-11-09 08:04:03,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2024-11-09 08:04:03,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 84 states have (on average 1.6071428571428572) internal successors, (135), 123 states have internal predecessors, (135), 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-11-09 08:04:03,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 141 transitions. [2024-11-09 08:04:03,112 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 141 transitions. Word has length 41 [2024-11-09 08:04:03,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:04:03,113 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 141 transitions. [2024-11-09 08:04:03,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 08:04:03,113 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 141 transitions. [2024-11-09 08:04:03,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-09 08:04:03,113 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:04:03,114 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 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-11-09 08:04:03,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 08:04:03,114 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-11-09 08:04:03,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:04:03,114 INFO L85 PathProgramCache]: Analyzing trace with hash -1069940696, now seen corresponding path program 1 times [2024-11-09 08:04:03,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:04:03,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115101781] [2024-11-09 08:04:03,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:04:03,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:04:03,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:04:03,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 08:04:03,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:04:03,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 08:04:03,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:04:03,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 08:04:03,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:04:03,296 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-09 08:04:03,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:04:03,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115101781] [2024-11-09 08:04:03,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115101781] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:04:03,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:04:03,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 08:04:03,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575236630] [2024-11-09 08:04:03,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:04:03,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 08:04:03,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:04:03,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 08:04:03,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 08:04:03,300 INFO L87 Difference]: Start difference. First operand 129 states and 141 transitions. Second operand has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 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-11-09 08:04:03,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:04:03,508 INFO L93 Difference]: Finished difference Result 126 states and 138 transitions. [2024-11-09 08:04:03,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 08:04:03,509 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 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 43 [2024-11-09 08:04:03,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:04:03,510 INFO L225 Difference]: With dead ends: 126 [2024-11-09 08:04:03,510 INFO L226 Difference]: Without dead ends: 126 [2024-11-09 08:04:03,511 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-11-09 08:04:03,511 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 20 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 08:04:03,511 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 423 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 08:04:03,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-11-09 08:04:03,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2024-11-09 08:04:03,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 84 states have (on average 1.5714285714285714) internal successors, (132), 120 states have internal predecessors, (132), 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-11-09 08:04:03,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 138 transitions. [2024-11-09 08:04:03,517 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 138 transitions. Word has length 43 [2024-11-09 08:04:03,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:04:03,517 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 138 transitions. [2024-11-09 08:04:03,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 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-11-09 08:04:03,518 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 138 transitions. [2024-11-09 08:04:03,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-09 08:04:03,520 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:04:03,520 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 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-11-09 08:04:03,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 08:04:03,520 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-11-09 08:04:03,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:04:03,521 INFO L85 PathProgramCache]: Analyzing trace with hash -1069940695, now seen corresponding path program 1 times [2024-11-09 08:04:03,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:04:03,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669200798] [2024-11-09 08:04:03,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:04:03,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:04:03,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:04:03,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 08:04:03,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:04:03,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 08:04:03,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:04:03,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 08:04:03,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:04:03,795 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-09 08:04:03,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:04:03,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669200798] [2024-11-09 08:04:03,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669200798] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:04:03,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1211645510] [2024-11-09 08:04:03,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:04:03,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:04:03,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:04:03,798 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 08:04:03,800 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-09 08:04:03,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:04:03,982 INFO L255 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 08:04:03,984 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:04:04,034 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-09 08:04:04,034 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 08:04:04,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1211645510] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:04:04,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 08:04:04,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [11] total 13 [2024-11-09 08:04:04,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630118436] [2024-11-09 08:04:04,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:04:04,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 08:04:04,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:04:04,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 08:04:04,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2024-11-09 08:04:04,036 INFO L87 Difference]: Start difference. First operand 126 states and 138 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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-11-09 08:04:04,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:04:04,058 INFO L93 Difference]: Finished difference Result 129 states and 139 transitions. [2024-11-09 08:04:04,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 08:04:04,059 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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 43 [2024-11-09 08:04:04,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:04:04,060 INFO L225 Difference]: With dead ends: 129 [2024-11-09 08:04:04,060 INFO L226 Difference]: Without dead ends: 129 [2024-11-09 08:04:04,060 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2024-11-09 08:04:04,060 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 79 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 08:04:04,061 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 277 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 08:04:04,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2024-11-09 08:04:04,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 125. [2024-11-09 08:04:04,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 83 states have (on average 1.5662650602409638) internal successors, (130), 119 states have internal predecessors, (130), 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-11-09 08:04:04,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 136 transitions. [2024-11-09 08:04:04,064 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 136 transitions. Word has length 43 [2024-11-09 08:04:04,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:04:04,065 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 136 transitions. [2024-11-09 08:04:04,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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-11-09 08:04:04,065 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 136 transitions. [2024-11-09 08:04:04,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-09 08:04:04,065 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:04:04,065 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:04:04,085 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-09 08:04:04,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:04:04,266 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-11-09 08:04:04,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:04:04,267 INFO L85 PathProgramCache]: Analyzing trace with hash -1068615796, now seen corresponding path program 1 times [2024-11-09 08:04:04,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:04:04,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954576037] [2024-11-09 08:04:04,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:04:04,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:04:04,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:04:04,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 08:04:04,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:04:04,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 08:04:04,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:04:04,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 08:04:04,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:04:04,414 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-09 08:04:04,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:04:04,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954576037] [2024-11-09 08:04:04,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954576037] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:04:04,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:04:04,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 08:04:04,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54109319] [2024-11-09 08:04:04,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:04:04,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 08:04:04,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:04:04,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 08:04:04,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 08:04:04,417 INFO L87 Difference]: Start difference. First operand 125 states and 136 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 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-11-09 08:04:04,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:04:04,522 INFO L93 Difference]: Finished difference Result 126 states and 135 transitions. [2024-11-09 08:04:04,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 08:04:04,522 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 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 43 [2024-11-09 08:04:04,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:04:04,523 INFO L225 Difference]: With dead ends: 126 [2024-11-09 08:04:04,523 INFO L226 Difference]: Without dead ends: 126 [2024-11-09 08:04:04,524 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-09 08:04:04,524 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 72 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 08:04:04,527 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 328 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 08:04:04,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-11-09 08:04:04,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 122. [2024-11-09 08:04:04,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 82 states have (on average 1.5365853658536586) internal successors, (126), 116 states have internal predecessors, (126), 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-11-09 08:04:04,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 132 transitions. [2024-11-09 08:04:04,549 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 132 transitions. Word has length 43 [2024-11-09 08:04:04,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:04:04,549 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 132 transitions. [2024-11-09 08:04:04,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 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-11-09 08:04:04,549 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 132 transitions. [2024-11-09 08:04:04,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-09 08:04:04,550 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:04:04,550 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 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-11-09 08:04:04,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 08:04:04,550 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-11-09 08:04:04,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:04:04,551 INFO L85 PathProgramCache]: Analyzing trace with hash 1232647073, now seen corresponding path program 1 times [2024-11-09 08:04:04,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:04:04,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373292338] [2024-11-09 08:04:04,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:04:04,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:04:04,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:04:04,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 08:04:04,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:04:04,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 08:04:04,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:04:04,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 08:04:04,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:04:04,640 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-09 08:04:04,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:04:04,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373292338] [2024-11-09 08:04:04,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373292338] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:04:04,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:04:04,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 08:04:04,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558284309] [2024-11-09 08:04:04,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:04:04,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 08:04:04,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:04:04,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 08:04:04,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 08:04:04,643 INFO L87 Difference]: Start difference. First operand 122 states and 132 transitions. Second operand has 5 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 08:04:04,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:04:04,771 INFO L93 Difference]: Finished difference Result 121 states and 131 transitions. [2024-11-09 08:04:04,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 08:04:04,771 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 44 [2024-11-09 08:04:04,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:04:04,772 INFO L225 Difference]: With dead ends: 121 [2024-11-09 08:04:04,772 INFO L226 Difference]: Without dead ends: 121 [2024-11-09 08:04:04,773 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 08:04:04,773 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 0 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 08:04:04,773 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 315 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 08:04:04,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-11-09 08:04:04,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2024-11-09 08:04:04,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 82 states have (on average 1.524390243902439) internal successors, (125), 115 states have internal predecessors, (125), 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-11-09 08:04:04,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 131 transitions. [2024-11-09 08:04:04,779 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 131 transitions. Word has length 44 [2024-11-09 08:04:04,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:04:04,779 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 131 transitions. [2024-11-09 08:04:04,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 08:04:04,779 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 131 transitions. [2024-11-09 08:04:04,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-09 08:04:04,780 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:04:04,780 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 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-11-09 08:04:04,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-09 08:04:04,781 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-11-09 08:04:04,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:04:04,782 INFO L85 PathProgramCache]: Analyzing trace with hash 1232647074, now seen corresponding path program 1 times [2024-11-09 08:04:04,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:04:04,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105606014] [2024-11-09 08:04:04,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:04:04,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:04:04,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:04:04,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 08:04:04,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:04:04,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 08:04:04,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:04:04,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 08:04:04,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:04:04,880 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-09 08:04:04,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:04:04,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105606014] [2024-11-09 08:04:04,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105606014] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:04:04,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:04:04,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 08:04:04,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89784405] [2024-11-09 08:04:04,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:04:04,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 08:04:04,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:04:04,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 08:04:04,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 08:04:04,882 INFO L87 Difference]: Start difference. First operand 121 states and 131 transitions. Second operand has 5 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 08:04:04,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:04:04,980 INFO L93 Difference]: Finished difference Result 120 states and 130 transitions. [2024-11-09 08:04:04,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 08:04:04,981 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 44 [2024-11-09 08:04:04,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:04:04,982 INFO L225 Difference]: With dead ends: 120 [2024-11-09 08:04:04,982 INFO L226 Difference]: Without dead ends: 120 [2024-11-09 08:04:04,982 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 08:04:04,983 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 0 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 08:04:04,983 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 313 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 08:04:04,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-11-09 08:04:04,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2024-11-09 08:04:04,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 82 states have (on average 1.5121951219512195) internal successors, (124), 114 states have internal predecessors, (124), 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-11-09 08:04:04,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 130 transitions. [2024-11-09 08:04:04,986 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 130 transitions. Word has length 44 [2024-11-09 08:04:04,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:04:04,986 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 130 transitions. [2024-11-09 08:04:04,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 08:04:04,986 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 130 transitions. [2024-11-09 08:04:04,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-09 08:04:04,987 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:04:04,987 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 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] [2024-11-09 08:04:04,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-09 08:04:04,987 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-11-09 08:04:04,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:04:04,987 INFO L85 PathProgramCache]: Analyzing trace with hash -442646373, now seen corresponding path program 1 times [2024-11-09 08:04:04,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:04:04,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202035010] [2024-11-09 08:04:04,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:04:04,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:04:05,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:04:05,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 08:04:05,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:04:05,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 08:04:05,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:04:05,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 08:04:05,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:04:05,144 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-09 08:04:05,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:04:05,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202035010] [2024-11-09 08:04:05,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202035010] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:04:05,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:04:05,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 08:04:05,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033338898] [2024-11-09 08:04:05,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:04:05,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 08:04:05,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:04:05,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 08:04:05,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 08:04:05,146 INFO L87 Difference]: Start difference. First operand 120 states and 130 transitions. Second operand has 7 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 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-11-09 08:04:05,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:04:05,282 INFO L93 Difference]: Finished difference Result 117 states and 127 transitions. [2024-11-09 08:04:05,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 08:04:05,282 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 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 45 [2024-11-09 08:04:05,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:04:05,283 INFO L225 Difference]: With dead ends: 117 [2024-11-09 08:04:05,283 INFO L226 Difference]: Without dead ends: 117 [2024-11-09 08:04:05,283 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 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-11-09 08:04:05,284 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 13 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 08:04:05,284 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 423 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 08:04:05,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-11-09 08:04:05,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2024-11-09 08:04:05,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 82 states have (on average 1.475609756097561) internal successors, (121), 111 states have internal predecessors, (121), 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-11-09 08:04:05,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 127 transitions. [2024-11-09 08:04:05,286 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 127 transitions. Word has length 45 [2024-11-09 08:04:05,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:04:05,286 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 127 transitions. [2024-11-09 08:04:05,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 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-11-09 08:04:05,287 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 127 transitions. [2024-11-09 08:04:05,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-09 08:04:05,287 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:04:05,287 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 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-11-09 08:04:05,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-09 08:04:05,287 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-11-09 08:04:05,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:04:05,288 INFO L85 PathProgramCache]: Analyzing trace with hash -181401124, now seen corresponding path program 1 times [2024-11-09 08:04:05,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:04:05,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114847262] [2024-11-09 08:04:05,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:04:05,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:04:05,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:04:05,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 08:04:05,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:04:05,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 08:04:05,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:04:05,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 08:04:05,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:04:05,470 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-09 08:04:05,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:04:05,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114847262] [2024-11-09 08:04:05,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114847262] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:04:05,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:04:05,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 08:04:05,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675583779] [2024-11-09 08:04:05,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:04:05,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 08:04:05,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:04:05,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 08:04:05,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-09 08:04:05,475 INFO L87 Difference]: Start difference. First operand 117 states and 127 transitions. Second operand has 7 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 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-11-09 08:04:05,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:04:05,588 INFO L93 Difference]: Finished difference Result 114 states and 124 transitions. [2024-11-09 08:04:05,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 08:04:05,589 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 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 47 [2024-11-09 08:04:05,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:04:05,590 INFO L225 Difference]: With dead ends: 114 [2024-11-09 08:04:05,590 INFO L226 Difference]: Without dead ends: 114 [2024-11-09 08:04:05,591 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-11-09 08:04:05,591 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 140 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 08:04:05,591 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 244 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 08:04:05,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-09 08:04:05,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2024-11-09 08:04:05,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 82 states have (on average 1.4268292682926829) internal successors, (117), 107 states have internal predecessors, (117), 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-11-09 08:04:05,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 123 transitions. [2024-11-09 08:04:05,598 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 123 transitions. Word has length 47 [2024-11-09 08:04:05,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:04:05,598 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 123 transitions. [2024-11-09 08:04:05,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 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-11-09 08:04:05,598 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 123 transitions. [2024-11-09 08:04:05,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-09 08:04:05,599 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:04:05,599 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 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, 1] [2024-11-09 08:04:05,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-09 08:04:05,599 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-11-09 08:04:05,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:04:05,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1767180127, now seen corresponding path program 1 times [2024-11-09 08:04:05,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:04:05,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101623045] [2024-11-09 08:04:05,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:04:05,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:04:05,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:04:05,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 08:04:05,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:04:05,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 08:04:05,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:04:05,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 08:04:05,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:04:05,782 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-09 08:04:05,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:04:05,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101623045] [2024-11-09 08:04:05,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101623045] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:04:05,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1289938738] [2024-11-09 08:04:05,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:04:05,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:04:05,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:04:05,785 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 08:04:05,787 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-09 08:04:05,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:04:05,982 INFO L255 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-09 08:04:05,985 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:04:05,988 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 08:04:06,051 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-11-09 08:04:06,102 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-09 08:04:06,102 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-11-09 08:04:06,178 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-09 08:04:06,181 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 08:04:06,181 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 08:04:06,425 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2024-11-09 08:04:06,449 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 08:04:06,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1289938738] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 08:04:06,450 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 08:04:06,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 15, 15] total 24 [2024-11-09 08:04:06,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644636009] [2024-11-09 08:04:06,450 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 08:04:06,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-09 08:04:06,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:04:06,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-09 08:04:06,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=532, Unknown=0, NotChecked=0, Total=600 [2024-11-09 08:04:06,451 INFO L87 Difference]: Start difference. First operand 113 states and 123 transitions. Second operand has 25 states, 24 states have (on average 3.2083333333333335) internal successors, (77), 19 states have internal predecessors, (77), 3 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-09 08:04:07,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:04:07,102 INFO L93 Difference]: Finished difference Result 156 states and 171 transitions. [2024-11-09 08:04:07,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-09 08:04:07,102 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 3.2083333333333335) internal successors, (77), 19 states have internal predecessors, (77), 3 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) Word has length 49 [2024-11-09 08:04:07,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:04:07,104 INFO L225 Difference]: With dead ends: 156 [2024-11-09 08:04:07,104 INFO L226 Difference]: Without dead ends: 156 [2024-11-09 08:04:07,104 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 85 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=134, Invalid=988, Unknown=0, NotChecked=0, Total=1122 [2024-11-09 08:04:07,105 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 335 mSDsluCounter, 917 mSDsCounter, 0 mSdLazyCounter, 1017 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 335 SdHoareTripleChecker+Valid, 989 SdHoareTripleChecker+Invalid, 1033 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1017 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 08:04:07,105 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [335 Valid, 989 Invalid, 1033 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1017 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 08:04:07,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2024-11-09 08:04:07,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 114. [2024-11-09 08:04:07,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 86 states have (on average 1.3837209302325582) internal successors, (119), 108 states have internal predecessors, (119), 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-11-09 08:04:07,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 125 transitions. [2024-11-09 08:04:07,109 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 125 transitions. Word has length 49 [2024-11-09 08:04:07,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:04:07,109 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 125 transitions. [2024-11-09 08:04:07,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 3.2083333333333335) internal successors, (77), 19 states have internal predecessors, (77), 3 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-09 08:04:07,109 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 125 transitions. [2024-11-09 08:04:07,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-09 08:04:07,109 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:04:07,110 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 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, 1] [2024-11-09 08:04:07,124 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-09 08:04:07,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:04:07,314 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-11-09 08:04:07,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:04:07,315 INFO L85 PathProgramCache]: Analyzing trace with hash 1767180128, now seen corresponding path program 1 times [2024-11-09 08:04:07,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:04:07,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253104980] [2024-11-09 08:04:07,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:04:07,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:04:07,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:04:07,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 08:04:07,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:04:07,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 08:04:07,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:04:08,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 08:04:08,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:04:08,147 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 13 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 08:04:08,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:04:08,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253104980] [2024-11-09 08:04:08,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253104980] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:04:08,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [179548956] [2024-11-09 08:04:08,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:04:08,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:04:08,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:04:08,149 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 08:04:08,151 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-09 08:04:08,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:04:08,330 INFO L255 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 53 conjuncts are in the unsatisfiable core [2024-11-09 08:04:08,332 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:04:08,337 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-09 08:04:08,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-11-09 08:04:08,581 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-11-09 08:04:08,584 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-11-09 08:04:08,711 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-09 08:04:08,711 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2024-11-09 08:04:08,717 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-09 08:04:08,812 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-09 08:04:08,821 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 08:04:08,821 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 08:04:09,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [179548956] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:04:09,036 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 08:04:09,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 15] total 30 [2024-11-09 08:04:09,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829810386] [2024-11-09 08:04:09,037 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 08:04:09,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-11-09 08:04:09,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:04:09,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-11-09 08:04:09,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=1089, Unknown=0, NotChecked=0, Total=1190 [2024-11-09 08:04:09,038 INFO L87 Difference]: Start difference. First operand 114 states and 125 transitions. Second operand has 31 states, 28 states have (on average 2.5714285714285716) internal successors, (72), 26 states have internal predecessors, (72), 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-11-09 08:04:09,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:04:09,772 INFO L93 Difference]: Finished difference Result 152 states and 168 transitions. [2024-11-09 08:04:09,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-09 08:04:09,773 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 28 states have (on average 2.5714285714285716) internal successors, (72), 26 states have internal predecessors, (72), 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 49 [2024-11-09 08:04:09,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:04:09,774 INFO L225 Difference]: With dead ends: 152 [2024-11-09 08:04:09,774 INFO L226 Difference]: Without dead ends: 152 [2024-11-09 08:04:09,774 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 302 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=185, Invalid=1977, Unknown=0, NotChecked=0, Total=2162 [2024-11-09 08:04:09,775 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 170 mSDsluCounter, 817 mSDsCounter, 0 mSdLazyCounter, 1254 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 886 SdHoareTripleChecker+Invalid, 1258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 08:04:09,775 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 886 Invalid, 1258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1254 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 08:04:09,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2024-11-09 08:04:09,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 116. [2024-11-09 08:04:09,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 88 states have (on average 1.375) internal successors, (121), 110 states have internal predecessors, (121), 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-11-09 08:04:09,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 127 transitions. [2024-11-09 08:04:09,777 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 127 transitions. Word has length 49 [2024-11-09 08:04:09,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:04:09,777 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 127 transitions. [2024-11-09 08:04:09,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 28 states have (on average 2.5714285714285716) internal successors, (72), 26 states have internal predecessors, (72), 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-11-09 08:04:09,778 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 127 transitions. [2024-11-09 08:04:09,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-09 08:04:09,778 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:04:09,778 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 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, 1, 1] [2024-11-09 08:04:09,799 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-11-09 08:04:09,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:04:09,983 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-11-09 08:04:09,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:04:09,984 INFO L85 PathProgramCache]: Analyzing trace with hash -1220865527, now seen corresponding path program 1 times [2024-11-09 08:04:09,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:04:09,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505516073] [2024-11-09 08:04:09,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:04:09,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:04:10,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:04:10,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 08:04:10,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:04:10,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 08:04:10,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:04:10,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 08:04:10,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:04:10,120 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-09 08:04:10,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:04:10,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505516073] [2024-11-09 08:04:10,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505516073] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:04:10,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1625159312] [2024-11-09 08:04:10,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:04:10,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:04:10,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:04:10,122 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 08:04:10,124 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-09 08:04:10,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:04:10,331 INFO L255 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-09 08:04:10,332 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:04:10,385 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-09 08:04:10,397 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-09 08:04:10,397 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 08:04:10,501 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-09 08:04:10,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1625159312] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 08:04:10,501 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 08:04:10,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2024-11-09 08:04:10,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551043978] [2024-11-09 08:04:10,501 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 08:04:10,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-09 08:04:10,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:04:10,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-09 08:04:10,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2024-11-09 08:04:10,502 INFO L87 Difference]: Start difference. First operand 116 states and 127 transitions. Second operand has 15 states, 15 states have (on average 3.1333333333333333) internal successors, (47), 14 states have internal predecessors, (47), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 08:04:10,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:04:10,626 INFO L93 Difference]: Finished difference Result 108 states and 118 transitions. [2024-11-09 08:04:10,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 08:04:10,626 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.1333333333333333) internal successors, (47), 14 states have internal predecessors, (47), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 50 [2024-11-09 08:04:10,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:04:10,627 INFO L225 Difference]: With dead ends: 108 [2024-11-09 08:04:10,627 INFO L226 Difference]: Without dead ends: 108 [2024-11-09 08:04:10,627 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2024-11-09 08:04:10,628 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 14 mSDsluCounter, 735 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 829 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 08:04:10,628 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 829 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 08:04:10,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-09 08:04:10,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2024-11-09 08:04:10,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 82 states have (on average 1.3658536585365855) internal successors, (112), 102 states have internal predecessors, (112), 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-11-09 08:04:10,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 118 transitions. [2024-11-09 08:04:10,630 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 118 transitions. Word has length 50 [2024-11-09 08:04:10,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:04:10,630 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 118 transitions. [2024-11-09 08:04:10,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.1333333333333333) internal successors, (47), 14 states have internal predecessors, (47), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 08:04:10,631 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 118 transitions. [2024-11-09 08:04:10,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-09 08:04:10,631 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:04:10,631 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1] [2024-11-09 08:04:10,643 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-11-09 08:04:10,831 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,SelfDestructingSolverStorable21 [2024-11-09 08:04:10,832 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-11-09 08:04:10,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:04:10,832 INFO L85 PathProgramCache]: Analyzing trace with hash -1697615555, now seen corresponding path program 1 times [2024-11-09 08:04:10,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:04:10,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060702538] [2024-11-09 08:04:10,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:04:10,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:04:10,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:04:11,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 08:04:11,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:04:11,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 08:04:11,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:04:11,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 08:04:11,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:04:11,089 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-09 08:04:11,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:04:11,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060702538] [2024-11-09 08:04:11,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060702538] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:04:11,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1091190703] [2024-11-09 08:04:11,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:04:11,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:04:11,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:04:11,091 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 08:04:11,092 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-09 08:04:11,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:04:11,272 INFO L255 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-09 08:04:11,273 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:04:11,445 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 08:04:11,447 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 08:04:11,447 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 16 treesize of output 11 [2024-11-09 08:04:11,490 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 08:04:11,490 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 08:04:11,535 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 08:04:11,535 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 17 treesize of output 17 [2024-11-09 08:04:11,668 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-09 08:04:11,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1091190703] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 08:04:11,669 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 08:04:11,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 13] total 28 [2024-11-09 08:04:11,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904949786] [2024-11-09 08:04:11,669 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 08:04:11,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-09 08:04:11,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:04:11,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-09 08:04:11,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=681, Unknown=0, NotChecked=0, Total=756 [2024-11-09 08:04:11,670 INFO L87 Difference]: Start difference. First operand 108 states and 118 transitions. Second operand has 28 states, 28 states have (on average 2.642857142857143) internal successors, (74), 24 states have internal predecessors, (74), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (8), 8 states have call predecessors, (8), 5 states have call successors, (8) [2024-11-09 08:04:15,695 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-11-09 08:04:19,720 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-11-09 08:04:23,736 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-11-09 08:04:27,787 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-11-09 08:04:31,813 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-11-09 08:04:36,184 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-11-09 08:04:36,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:04:36,187 INFO L93 Difference]: Finished difference Result 104 states and 114 transitions. [2024-11-09 08:04:36,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-09 08:04:36,187 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.642857142857143) internal successors, (74), 24 states have internal predecessors, (74), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (8), 8 states have call predecessors, (8), 5 states have call successors, (8) Word has length 51 [2024-11-09 08:04:36,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:04:36,188 INFO L225 Difference]: With dead ends: 104 [2024-11-09 08:04:36,188 INFO L226 Difference]: Without dead ends: 104 [2024-11-09 08:04:36,188 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 90 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=165, Invalid=1317, Unknown=0, NotChecked=0, Total=1482 [2024-11-09 08:04:36,189 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 149 mSDsluCounter, 1296 mSDsCounter, 0 mSdLazyCounter, 562 mSolverCounterSat, 2 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 1377 SdHoareTripleChecker+Invalid, 570 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 562 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.3s IncrementalHoareTripleChecker+Time [2024-11-09 08:04:36,189 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 1377 Invalid, 570 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 562 Invalid, 6 Unknown, 0 Unchecked, 24.3s Time] [2024-11-09 08:04:36,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-09 08:04:36,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 101. [2024-11-09 08:04:36,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 75 states have (on average 1.3866666666666667) internal successors, (104), 95 states have internal predecessors, (104), 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-11-09 08:04:36,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 110 transitions. [2024-11-09 08:04:36,191 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 110 transitions. Word has length 51 [2024-11-09 08:04:36,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:04:36,191 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 110 transitions. [2024-11-09 08:04:36,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.642857142857143) internal successors, (74), 24 states have internal predecessors, (74), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (8), 8 states have call predecessors, (8), 5 states have call successors, (8) [2024-11-09 08:04:36,192 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 110 transitions. [2024-11-09 08:04:36,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-09 08:04:36,192 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:04:36,192 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1] [2024-11-09 08:04:36,206 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-11-09 08:04:36,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-11-09 08:04:36,397 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-11-09 08:04:36,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:04:36,397 INFO L85 PathProgramCache]: Analyzing trace with hash 517544522, now seen corresponding path program 1 times [2024-11-09 08:04:36,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:04:36,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135040304] [2024-11-09 08:04:36,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:04:36,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:04:36,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:04:37,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 08:04:37,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:04:37,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 08:04:37,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:04:37,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 08:04:37,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:04:38,023 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 08:04:38,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:04:38,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135040304] [2024-11-09 08:04:38,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135040304] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:04:38,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1180814826] [2024-11-09 08:04:38,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:04:38,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:04:38,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:04:38,025 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 08:04:38,033 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-09 08:04:38,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:04:38,361 INFO L255 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 103 conjuncts are in the unsatisfiable core [2024-11-09 08:04:38,364 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:04:38,398 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 08:04:38,592 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-11-09 08:04:38,672 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 08:04:38,672 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-11-09 08:04:38,772 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-11-09 08:04:38,878 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 18 treesize of output 13 [2024-11-09 08:04:39,029 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-11-09 08:04:39,032 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-11-09 08:04:39,138 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-09 08:04:39,139 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2024-11-09 08:04:43,144 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (and (let ((.cse2 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 4))) (or (exists ((|v_old(#memory_int#2)_AFTER_CALL_34| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int#2)_AFTER_CALL_34| |c_#memory_int#2|))) (and (= (store |v_old(#memory_int#2)_AFTER_CALL_34| .cse0 (select |c_#memory_int#2| .cse0)) |c_#memory_int#2|) (= (select (select |v_old(#memory_int#2)_AFTER_CALL_34| .cse1) .cse2) 1) (= .cse0 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|)))) (= (select (select |c_#memory_int#2| .cse1) .cse2) 1))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_insert_~head#1.offset| 0) (not (= .cse1 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|)))) is different from false [2024-11-09 08:04:43,146 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (and (let ((.cse2 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 4))) (or (exists ((|v_old(#memory_int#2)_AFTER_CALL_34| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int#2)_AFTER_CALL_34| |c_#memory_int#2|))) (and (= (store |v_old(#memory_int#2)_AFTER_CALL_34| .cse0 (select |c_#memory_int#2| .cse0)) |c_#memory_int#2|) (= (select (select |v_old(#memory_int#2)_AFTER_CALL_34| .cse1) .cse2) 1) (= .cse0 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|)))) (= (select (select |c_#memory_int#2| .cse1) .cse2) 1))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_insert_~head#1.offset| 0) (not (= .cse1 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|)))) is different from true [2024-11-09 08:04:43,450 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 08:04:43,450 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 45 treesize of output 21 [2024-11-09 08:04:43,530 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-11-09 08:04:43,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 25 treesize of output 17 [2024-11-09 08:04:43,588 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-11-09 08:04:43,719 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 08:04:43,720 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 08:04:43,855 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2760 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2760) (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-11-09 08:04:43,863 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2759 (Array Int Int)) (v_ArrVal_2760 (Array Int Int))) (or (not (= (store (select |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| (select v_ArrVal_2759 |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset|)) v_ArrVal_2759)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_2759) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2760) (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-11-09 08:04:43,891 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2759 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_28| Int) (v_ArrVal_2760 (Array Int Int))) (or (not (= v_ArrVal_2759 (store (select |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_28| (select v_ArrVal_2759 |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_28|)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_2759) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2760) (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))) (< |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_28|))) is different from false [2024-11-09 08:04:43,901 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2759 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_28| Int) (v_ArrVal_2760 (Array Int Int))) (or (< |c_ULTIMATE.start_sll_circular_insert_#t~mem10#1.offset| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_28|) (not (= (store (select |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_insert_#t~mem10#1.base|) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_28| (select v_ArrVal_2759 |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_28|)) v_ArrVal_2759)) (= (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_insert_#t~mem10#1.base| v_ArrVal_2759) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2760) (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)) |c_ULTIMATE.start_main_~data~0#1|))) is different from false [2024-11-09 08:04:43,912 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2759 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_28| Int) (v_ArrVal_2760 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| .cse0 v_ArrVal_2759) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2760) (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))) (< (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_28|) (not (= (store (select |c_#memory_int#2| .cse0) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_28| (select v_ArrVal_2759 |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_28|)) v_ArrVal_2759))))) is different from false [2024-11-09 08:04:43,922 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2759 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_28| Int) (v_ArrVal_2760 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| .cse0 v_ArrVal_2759) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_2760) (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))) (< (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_28|) (not (= (store (select |c_#memory_int#2| .cse0) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_28| (select v_ArrVal_2759 |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_28|)) v_ArrVal_2759))))) is different from false [2024-11-09 08:04:44,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1180814826] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:04:44,045 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 08:04:44,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 59 [2024-11-09 08:04:44,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134830063] [2024-11-09 08:04:44,046 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 08:04:44,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2024-11-09 08:04:44,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:04:44,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2024-11-09 08:04:44,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=3592, Unknown=8, NotChecked=882, Total=4692 [2024-11-09 08:04:44,048 INFO L87 Difference]: Start difference. First operand 101 states and 110 transitions. Second operand has 59 states, 55 states have (on average 1.5454545454545454) internal successors, (85), 50 states have internal predecessors, (85), 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-11-09 08:04:48,768 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse3 (+ (select .cse5 0) 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse4 (= (select (select |c_#memory_int#2| .cse2) .cse3) 1))) (and (not (= .cse0 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|)) (= |c_ULTIMATE.start_sll_circular_insert_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (or (exists ((|v_old(#memory_int#2)_AFTER_CALL_34| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_old(#memory_int#2)_AFTER_CALL_34| |c_#memory_int#2|))) (and (= (store |v_old(#memory_int#2)_AFTER_CALL_34| .cse1 (select |c_#memory_int#2| .cse1)) |c_#memory_int#2|) (= (select (select |v_old(#memory_int#2)_AFTER_CALL_34| .cse2) .cse3) 1) (= .cse1 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|)))) .cse4) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_insert_~head#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#2| .cse0) 4)) (not (= .cse2 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|)) .cse4 (= (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))) is different from false [2024-11-09 08:04:48,771 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse3 (+ (select .cse5 0) 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse4 (= (select (select |c_#memory_int#2| .cse2) .cse3) 1))) (and (not (= .cse0 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|)) (= |c_ULTIMATE.start_sll_circular_insert_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (or (exists ((|v_old(#memory_int#2)_AFTER_CALL_34| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_old(#memory_int#2)_AFTER_CALL_34| |c_#memory_int#2|))) (and (= (store |v_old(#memory_int#2)_AFTER_CALL_34| .cse1 (select |c_#memory_int#2| .cse1)) |c_#memory_int#2|) (= (select (select |v_old(#memory_int#2)_AFTER_CALL_34| .cse2) .cse3) 1) (= .cse1 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|)))) .cse4) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_insert_~head#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#2| .cse0) 4)) (not (= .cse2 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|)) .cse4 (= (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))) is different from true [2024-11-09 08:04:49,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:04:49,825 INFO L93 Difference]: Finished difference Result 158 states and 176 transitions. [2024-11-09 08:04:49,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-09 08:04:49,825 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 55 states have (on average 1.5454545454545454) internal successors, (85), 50 states have internal predecessors, (85), 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 53 [2024-11-09 08:04:49,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:04:49,829 INFO L225 Difference]: With dead ends: 158 [2024-11-09 08:04:49,829 INFO L226 Difference]: Without dead ends: 158 [2024-11-09 08:04:49,831 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 89 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 1215 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=416, Invalid=6412, Unknown=10, NotChecked=1352, Total=8190 [2024-11-09 08:04:49,832 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 122 mSDsluCounter, 1877 mSDsCounter, 0 mSdLazyCounter, 1621 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 1943 SdHoareTripleChecker+Invalid, 1858 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1621 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 220 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 08:04:49,832 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 1943 Invalid, 1858 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1621 Invalid, 0 Unknown, 220 Unchecked, 0.8s Time] [2024-11-09 08:04:49,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2024-11-09 08:04:49,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 125. [2024-11-09 08:04:49,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 97 states have (on average 1.309278350515464) internal successors, (127), 117 states have internal predecessors, (127), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 08:04:49,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 137 transitions. [2024-11-09 08:04:49,835 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 137 transitions. Word has length 53 [2024-11-09 08:04:49,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:04:49,835 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 137 transitions. [2024-11-09 08:04:49,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 55 states have (on average 1.5454545454545454) internal successors, (85), 50 states have internal predecessors, (85), 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-11-09 08:04:49,835 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 137 transitions. [2024-11-09 08:04:49,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-09 08:04:49,836 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:04:49,836 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:04:49,852 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-11-09 08:04:50,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-11-09 08:04:50,041 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-11-09 08:04:50,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:04:50,041 INFO L85 PathProgramCache]: Analyzing trace with hash -897963544, now seen corresponding path program 1 times [2024-11-09 08:04:50,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:04:50,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635625150] [2024-11-09 08:04:50,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:04:50,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:04:50,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:04:50,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 08:04:50,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:04:50,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 08:04:50,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:04:50,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 08:04:50,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:04:50,706 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 17 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-09 08:04:50,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:04:50,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635625150] [2024-11-09 08:04:50,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635625150] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:04:50,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1870136304] [2024-11-09 08:04:50,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:04:50,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:04:50,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:04:50,708 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 08:04:50,709 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-09 08:04:50,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:04:50,915 INFO L255 TraceCheckSpWp]: Trace formula consists of 446 conjuncts, 73 conjuncts are in the unsatisfiable core [2024-11-09 08:04:50,917 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:04:50,920 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 08:04:51,014 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 08:04:51,014 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-11-09 08:04:51,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 08:04:51,132 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 08:04:51,133 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2024-11-09 08:04:51,231 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-11-09 08:04:51,233 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-11-09 08:04:51,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 08:04:51,377 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-11-09 08:04:51,399 INFO L349 Elim1Store]: treesize reduction 88, result has 36.7 percent of original size [2024-11-09 08:04:51,399 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-11-09 08:04:51,602 INFO L349 Elim1Store]: treesize reduction 33, result has 48.4 percent of original size [2024-11-09 08:04:51,603 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-11-09 08:04:51,757 INFO L349 Elim1Store]: treesize reduction 25, result has 26.5 percent of original size [2024-11-09 08:04:51,758 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-11-09 08:04:51,796 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-11-09 08:04:51,994 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-11-09 08:04:51,998 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-11-09 08:04:52,278 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-11-09 08:04:52,568 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 08:04:52,568 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 08:04:53,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1870136304] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:04:53,021 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 08:04:53,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 27] total 46 [2024-11-09 08:04:53,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058817232] [2024-11-09 08:04:53,021 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 08:04:53,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2024-11-09 08:04:53,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:04:53,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2024-11-09 08:04:53,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=2407, Unknown=1, NotChecked=0, Total=2550 [2024-11-09 08:04:53,023 INFO L87 Difference]: Start difference. First operand 125 states and 137 transitions. Second operand has 47 states, 44 states have (on average 2.0454545454545454) internal successors, (90), 39 states have internal predecessors, (90), 4 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-09 08:04:55,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:04:55,543 INFO L93 Difference]: Finished difference Result 182 states and 203 transitions. [2024-11-09 08:04:55,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2024-11-09 08:04:55,548 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 44 states have (on average 2.0454545454545454) internal successors, (90), 39 states have internal predecessors, (90), 4 states have call successors, (6), 4 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 55 [2024-11-09 08:04:55,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:04:55,549 INFO L225 Difference]: With dead ends: 182 [2024-11-09 08:04:55,549 INFO L226 Difference]: Without dead ends: 182 [2024-11-09 08:04:55,550 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1514 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=457, Invalid=6682, Unknown=1, NotChecked=0, Total=7140 [2024-11-09 08:04:55,551 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 363 mSDsluCounter, 1529 mSDsCounter, 0 mSdLazyCounter, 2089 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 363 SdHoareTripleChecker+Valid, 1590 SdHoareTripleChecker+Invalid, 2113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 2089 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-09 08:04:55,551 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [363 Valid, 1590 Invalid, 2113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 2089 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-09 08:04:55,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2024-11-09 08:04:55,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 130. [2024-11-09 08:04:55,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 102 states have (on average 1.3235294117647058) internal successors, (135), 122 states have internal predecessors, (135), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 08:04:55,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 145 transitions. [2024-11-09 08:04:55,556 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 145 transitions. Word has length 55 [2024-11-09 08:04:55,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:04:55,556 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 145 transitions. [2024-11-09 08:04:55,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 44 states have (on average 2.0454545454545454) internal successors, (90), 39 states have internal predecessors, (90), 4 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-09 08:04:55,556 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 145 transitions. [2024-11-09 08:04:55,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-09 08:04:55,557 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:04:55,557 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:04:55,573 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-11-09 08:04:55,760 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,SelfDestructingSolverStorable24 [2024-11-09 08:04:55,761 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-11-09 08:04:55,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:04:55,761 INFO L85 PathProgramCache]: Analyzing trace with hash -897963543, now seen corresponding path program 1 times [2024-11-09 08:04:55,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:04:55,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680999368] [2024-11-09 08:04:55,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:04:55,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:04:55,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:04:56,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 08:04:56,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:04:56,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 08:04:56,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:04:56,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 08:04:56,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:04:56,969 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 08:04:56,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:04:56,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680999368] [2024-11-09 08:04:56,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680999368] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:04:56,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [608970614] [2024-11-09 08:04:56,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:04:56,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:04:56,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:04:56,972 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 08:04:56,973 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-09 08:04:57,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:04:57,233 INFO L255 TraceCheckSpWp]: Trace formula consists of 446 conjuncts, 122 conjuncts are in the unsatisfiable core [2024-11-09 08:04:57,236 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:04:57,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 08:04:57,245 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-09 08:04:57,456 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 08:04:57,457 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-11-09 08:04:57,461 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-09 08:04:57,530 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 08:04:57,538 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 08:04:57,644 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 08:04:57,644 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 59 treesize of output 52 [2024-11-09 08:04:57,652 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 24 treesize of output 11 [2024-11-09 08:04:57,872 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-11-09 08:04:57,876 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-11-09 08:04:57,880 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-11-09 08:04:57,884 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-11-09 08:04:58,255 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-09 08:04:58,255 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 20 treesize of output 23 [2024-11-09 08:04:58,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 08:04:58,268 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-11-09 08:04:58,287 INFO L349 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2024-11-09 08:04:58,287 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 29 [2024-11-09 08:04:58,326 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-11-09 08:04:58,327 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2024-11-09 08:04:58,642 INFO L349 Elim1Store]: treesize reduction 25, result has 47.9 percent of original size [2024-11-09 08:04:58,642 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 48 [2024-11-09 08:04:58,659 INFO L349 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2024-11-09 08:04:58,659 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-11-09 08:04:58,853 INFO L349 Elim1Store]: treesize reduction 25, result has 26.5 percent of original size [2024-11-09 08:04:58,854 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 98 treesize of output 82 [2024-11-09 08:04:58,869 INFO L349 Elim1Store]: treesize reduction 25, result has 26.5 percent of original size [2024-11-09 08:04:58,869 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 107 treesize of output 109 [2024-11-09 08:04:58,921 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-11-09 08:04:58,970 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-11-09 08:04:59,143 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 130 treesize of output 82 [2024-11-09 08:04:59,533 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-11-09 08:04:59,538 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-09 08:04:59,784 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 08:04:59,784 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 08:05:09,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [608970614] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:05:09,378 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 08:05:09,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 27] total 51 [2024-11-09 08:05:09,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084443433] [2024-11-09 08:05:09,378 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 08:05:09,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-11-09 08:05:09,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:05:09,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-11-09 08:05:09,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=3425, Unknown=79, NotChecked=0, Total=3660 [2024-11-09 08:05:09,380 INFO L87 Difference]: Start difference. First operand 130 states and 145 transitions. Second operand has 52 states, 49 states have (on average 1.9591836734693877) internal successors, (96), 44 states have internal predecessors, (96), 4 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-09 08:05:13,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:05:13,112 INFO L93 Difference]: Finished difference Result 188 states and 209 transitions. [2024-11-09 08:05:13,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2024-11-09 08:05:13,113 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 49 states have (on average 1.9591836734693877) internal successors, (96), 44 states have internal predecessors, (96), 4 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 55 [2024-11-09 08:05:13,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:05:13,114 INFO L225 Difference]: With dead ends: 188 [2024-11-09 08:05:13,114 INFO L226 Difference]: Without dead ends: 188 [2024-11-09 08:05:13,116 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1408 ImplicationChecksByTransitivity, 13.3s TimeCoverageRelationStatistics Valid=449, Invalid=8778, Unknown=85, NotChecked=0, Total=9312 [2024-11-09 08:05:13,117 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 236 mSDsluCounter, 1955 mSDsCounter, 0 mSdLazyCounter, 2655 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 2019 SdHoareTripleChecker+Invalid, 2668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 2655 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-09 08:05:13,118 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 2019 Invalid, 2668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 2655 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-09 08:05:13,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2024-11-09 08:05:13,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 134. [2024-11-09 08:05:13,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 106 states have (on average 1.3113207547169812) internal successors, (139), 126 states have internal predecessors, (139), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 08:05:13,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 149 transitions. [2024-11-09 08:05:13,122 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 149 transitions. Word has length 55 [2024-11-09 08:05:13,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:05:13,122 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 149 transitions. [2024-11-09 08:05:13,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 49 states have (on average 1.9591836734693877) internal successors, (96), 44 states have internal predecessors, (96), 4 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-09 08:05:13,122 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 149 transitions. [2024-11-09 08:05:13,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-09 08:05:13,123 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:05:13,123 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:05:13,141 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-11-09 08:05:13,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:05:13,324 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-11-09 08:05:13,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:05:13,324 INFO L85 PathProgramCache]: Analyzing trace with hash 1278392635, now seen corresponding path program 1 times [2024-11-09 08:05:13,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:05:13,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562337078] [2024-11-09 08:05:13,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:05:13,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:05:13,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:05:14,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 08:05:14,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:05:14,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 08:05:14,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:05:14,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 08:05:14,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:05:14,354 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 13 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-09 08:05:14,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:05:14,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562337078] [2024-11-09 08:05:14,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562337078] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:05:14,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [434798044] [2024-11-09 08:05:14,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:05:14,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:05:14,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:05:14,360 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 08:05:14,363 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-09 08:05:14,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:05:14,674 INFO L255 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 143 conjuncts are in the unsatisfiable core [2024-11-09 08:05:14,682 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:05:14,713 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 08:05:14,992 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-09 08:05:14,992 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-09 08:05:15,100 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 08:05:15,224 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 16 treesize of output 11 [2024-11-09 08:05:15,396 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-11-09 08:05:15,399 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-11-09 08:05:15,540 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-11-09 08:05:15,683 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-09 08:05:15,684 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 20 treesize of output 23 [2024-11-09 08:05:15,704 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2024-11-09 08:05:15,704 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 20 treesize of output 22 [2024-11-09 08:05:16,074 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2024-11-09 08:05:16,078 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-09 08:05:16,085 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 19 treesize of output 11 [2024-11-09 08:05:16,158 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2024-11-09 08:05:16,158 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 119 treesize of output 76 [2024-11-09 08:05:16,161 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-11-09 08:05:16,164 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 55 treesize of output 19 [2024-11-09 08:05:16,390 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-11-09 08:05:16,391 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 19 [2024-11-09 08:05:16,536 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-11-09 08:05:16,546 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-09 08:05:16,551 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 10 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 08:05:16,551 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 08:05:16,745 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3355 (Array Int Int)) (v_ArrVal_3356 (Array Int Int)) (v_ArrVal_3357 (Array Int Int))) (or (not (= v_ArrVal_3356 (store (select |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_3356 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_3356) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_3355) .cse0) .cse1)) (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_3357) .cse0) .cse1) 4)))))) is different from false [2024-11-09 08:05:16,759 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 08:05:16,760 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 62 [2024-11-09 08:05:16,785 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 08:05:16,785 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 120 treesize of output 123 [2024-11-09 08:05:16,790 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 52 treesize of output 46 [2024-11-09 08:05:17,809 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse5 (= .cse2 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|))) (let ((.cse4 (not .cse5)) (.cse1 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|)) (.cse3 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (or (forall ((v_ArrVal_3352 (Array Int Int)) (v_ArrVal_3356 (Array Int Int)) (v_ArrVal_3357 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_40| Int) (v_arrayElimCell_117 Int)) (let ((.cse0 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_3352))) (or (not (= (store (select .cse0 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_3356 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_3356)) (< |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_40| 0) (< |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_40|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store .cse0 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_3356) v_arrayElimCell_117) (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| (store .cse1 |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_40| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_3357) .cse2) .cse3) 4)))))) .cse4) (or (= .cse2 |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|) (and (or .cse4 (forall ((v_ArrVal_3352 (Array Int Int)) (v_ArrVal_3356 (Array Int Int)) (v_ArrVal_3357 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_40| Int) (v_arrayElimCell_117 Int)) (or (< |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_40| 0) (not (= v_ArrVal_3356 (store (select |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_3356 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))) (< |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_40|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_3352) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_3356) v_arrayElimCell_117) (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| (store .cse1 |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_40| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_3357) .cse2) .cse3) 4)))))) (or .cse5 (forall ((v_ArrVal_3352 (Array Int Int)) (v_ArrVal_3356 (Array Int Int)) (v_ArrVal_3357 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_40| Int) (v_arrayElimCell_115 Int)) (let ((.cse6 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_3352))) (or (not (= (store (select .cse6 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_3356 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_3356)) (< |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_40| 0) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store .cse6 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_3356) v_arrayElimCell_115) (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| (store .cse1 |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_40| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_3357) .cse2) .cse3) 4))) (< |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_40|))))) (forall ((|v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_40| Int)) (or (< |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_40| 0) (< |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_40|) (forall ((v_ArrVal_3352 (Array Int Int)) (v_ArrVal_3356 (Array Int Int)) (v_arrayElimCell_115 Int)) (let ((.cse7 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_3352))) (or (not (= (store (select .cse7 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_3356 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_3356)) (forall ((v_ArrVal_3357 (Array Int Int)) (v_arrayElimCell_117 Int)) (let ((.cse8 (store .cse7 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_3356)) (.cse9 (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| (store .cse1 |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_40| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_3357) .cse2) .cse3) 4))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse8 v_arrayElimCell_115) .cse9)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse8 v_arrayElimCell_117) .cse9)))))))))))) (forall ((|v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_40| Int)) (or (< |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_40| 0) (< |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_40|) (= .cse3 |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_40|) (forall ((v_ArrVal_3352 (Array Int Int)) (v_ArrVal_3356 (Array Int Int)) (v_arrayElimCell_115 Int)) (let ((.cse10 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_3352))) (or (not (= (store (select .cse10 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_3356 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_3356)) (forall ((v_ArrVal_3357 (Array Int Int)) (v_arrayElimCell_117 Int)) (let ((.cse11 (store .cse10 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_3356)) (.cse12 (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| (store .cse1 |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_40| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_3357) .cse2) .cse3) 4))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse11 v_arrayElimCell_115) .cse12)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse11 v_arrayElimCell_117) .cse12)))))))))) (or .cse5 (forall ((v_ArrVal_3352 (Array Int Int)) (v_ArrVal_3356 (Array Int Int)) (v_ArrVal_3357 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_40| Int) (v_arrayElimCell_115 Int)) (let ((.cse13 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_3352))) (or (not (= (store (select .cse13 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_3356 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_3356)) (< |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_40| 0) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store .cse13 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_3356) v_arrayElimCell_115) (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| (store .cse1 |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_40| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_3357) .cse2) .cse3) 4))) (< |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_40|) (= .cse3 |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_40|))))) (or (forall ((v_ArrVal_3352 (Array Int Int)) (v_ArrVal_3357 (Array Int Int)) (v_DerPreprocessor_6 Int) (|v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_40| Int)) (or (< |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_40| 0) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (store (select (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_3352) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_DerPreprocessor_6) (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| (store .cse1 |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_40| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_3357) .cse2) .cse3) 4))) (< |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_40|))) .cse5) (forall ((|v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_40| Int)) (or (< |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_40| 0) (forall ((v_ArrVal_3352 (Array Int Int)) (v_ArrVal_3356 (Array Int Int))) (let ((.cse14 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_3352))) (or (not (= (store (select .cse14 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_3356 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_3356)) (forall ((v_ArrVal_3357 (Array Int Int)) (v_arrayElimCell_117 Int)) (let ((.cse15 (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| (store .cse1 |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_40| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_3357) .cse2) .cse3) 4))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select v_ArrVal_3356 .cse15)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store .cse14 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_3356) v_arrayElimCell_117) .cse15)))))))) (< |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_40|))))))) is different from false [2024-11-09 08:05:17,995 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (= .cse3 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|))) (let ((.cse2 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_insert_#t~mem10#1.base|)) (.cse4 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse8 (not .cse0))) (and (or .cse0 (forall ((v_ArrVal_3352 (Array Int Int)) (v_ArrVal_3356 (Array Int Int)) (v_ArrVal_3357 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_40| Int) (v_arrayElimCell_115 Int)) (let ((.cse1 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_insert_#t~mem10#1.base| v_ArrVal_3352))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store .cse1 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_3356) v_arrayElimCell_115) (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_insert_#t~mem10#1.base| (store .cse2 |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_40| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_3357) .cse3) .cse4) 4))) (not (= v_ArrVal_3356 (store (select .cse1 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_3356 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))) (< |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_40| 0) (< |c_ULTIMATE.start_sll_circular_insert_#t~mem10#1.offset| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_40|) (= .cse4 |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_40|))))) (or (forall ((v_ArrVal_3352 (Array Int Int)) (v_ArrVal_3357 (Array Int Int)) (v_DerPreprocessor_6 Int) (|v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_40| Int)) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (store (select (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_insert_#t~mem10#1.base| v_ArrVal_3352) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_DerPreprocessor_6) (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_insert_#t~mem10#1.base| (store .cse2 |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_40| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_3357) .cse3) .cse4) 4))) (< |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_40| 0) (< |c_ULTIMATE.start_sll_circular_insert_#t~mem10#1.offset| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_40|))) .cse0) (forall ((v_ArrVal_3352 (Array Int Int)) (v_ArrVal_3356 (Array Int Int)) (v_ArrVal_3357 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_40| Int) (v_arrayElimCell_117 Int)) (let ((.cse5 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_insert_#t~mem10#1.base| v_ArrVal_3352)) (.cse6 (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_insert_#t~mem10#1.base| (store .cse2 |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_40| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_3357) .cse3) .cse4) 4))) (or (not (= v_ArrVal_3356 (store (select .cse5 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_3356 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))) (< |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_40| 0) (< |c_ULTIMATE.start_sll_circular_insert_#t~mem10#1.offset| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_40|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select v_ArrVal_3356 .cse6)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store .cse5 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_3356) v_arrayElimCell_117) .cse6))))) (or (forall ((v_ArrVal_3352 (Array Int Int)) (v_ArrVal_3356 (Array Int Int)) (v_ArrVal_3357 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_40| Int) (v_arrayElimCell_117 Int)) (let ((.cse7 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_insert_#t~mem10#1.base| v_ArrVal_3352))) (or (not (= v_ArrVal_3356 (store (select .cse7 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_3356 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))) (< |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_40| 0) (< |c_ULTIMATE.start_sll_circular_insert_#t~mem10#1.offset| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_40|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store .cse7 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_3356) v_arrayElimCell_117) (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_insert_#t~mem10#1.base| (store .cse2 |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_40| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_3357) .cse3) .cse4) 4)))))) .cse8) (forall ((v_ArrVal_3352 (Array Int Int)) (v_ArrVal_3356 (Array Int Int)) (v_ArrVal_3357 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_40| Int) (v_arrayElimCell_115 Int) (v_arrayElimCell_117 Int)) (let ((.cse11 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_insert_#t~mem10#1.base| v_ArrVal_3352))) (let ((.cse9 (store .cse11 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_3356)) (.cse10 (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_insert_#t~mem10#1.base| (store .cse2 |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_40| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_3357) .cse3) .cse4) 4))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse9 v_arrayElimCell_115) .cse10)) (not (= v_ArrVal_3356 (store (select .cse11 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_3356 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))) (< |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_40| 0) (< |c_ULTIMATE.start_sll_circular_insert_#t~mem10#1.offset| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_40|) (= .cse4 |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_40|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse9 v_arrayElimCell_117) .cse10)))))) (or (and (forall ((v_ArrVal_3352 (Array Int Int)) (v_ArrVal_3356 (Array Int Int)) (v_ArrVal_3357 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_40| Int) (v_arrayElimCell_115 Int) (v_arrayElimCell_117 Int)) (let ((.cse14 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_insert_#t~mem10#1.base| v_ArrVal_3352))) (let ((.cse12 (store .cse14 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_3356)) (.cse13 (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_insert_#t~mem10#1.base| (store .cse2 |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_40| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_3357) .cse3) .cse4) 4))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse12 v_arrayElimCell_115) .cse13)) (not (= v_ArrVal_3356 (store (select .cse14 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_3356 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))) (< |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_40| 0) (< |c_ULTIMATE.start_sll_circular_insert_#t~mem10#1.offset| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_40|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse12 v_arrayElimCell_117) .cse13)))))) (or .cse0 (forall ((v_ArrVal_3352 (Array Int Int)) (v_ArrVal_3356 (Array Int Int)) (v_ArrVal_3357 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_40| Int) (v_arrayElimCell_115 Int)) (let ((.cse15 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_insert_#t~mem10#1.base| v_ArrVal_3352))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store .cse15 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_3356) v_arrayElimCell_115) (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_insert_#t~mem10#1.base| (store .cse2 |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_40| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_3357) .cse3) .cse4) 4))) (not (= v_ArrVal_3356 (store (select .cse15 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_3356 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))) (< |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_40| 0) (< |c_ULTIMATE.start_sll_circular_insert_#t~mem10#1.offset| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_40|))))) (or (forall ((v_ArrVal_3352 (Array Int Int)) (v_ArrVal_3356 (Array Int Int)) (v_ArrVal_3357 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_40| Int) (v_arrayElimCell_117 Int)) (or (< |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_40| 0) (< |c_ULTIMATE.start_sll_circular_insert_#t~mem10#1.offset| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_40|) (not (= v_ArrVal_3356 (store (select |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_3356 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_insert_#t~mem10#1.base| v_ArrVal_3352) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_3356) v_arrayElimCell_117) (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_insert_#t~mem10#1.base| (store .cse2 |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_40| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_3357) .cse3) .cse4) 4))))) .cse8)) (= |c_ULTIMATE.start_sll_circular_insert_#t~mem10#1.base| .cse3)))))) is different from false [2024-11-09 08:05:18,190 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse0 (= .cse4 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|))) (let ((.cse7 (not .cse0)) (.cse6 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse3 (select |c_#memory_$Pointer$#2.offset| .cse2)) (.cse5 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (or (and (or .cse0 (forall ((v_ArrVal_3352 (Array Int Int)) (v_ArrVal_3356 (Array Int Int)) (v_ArrVal_3357 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_40| Int) (v_arrayElimCell_115 Int)) (let ((.cse1 (store |c_#memory_int#2| .cse2 v_ArrVal_3352))) (or (not (= (store (select .cse1 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_3356 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_3356)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store .cse1 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_3356) v_arrayElimCell_115) (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse2 (store .cse3 |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_40| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_3357) .cse4) .cse5) 4))) (< |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_40| 0) (< .cse6 |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_40|))))) (or (forall ((v_ArrVal_3352 (Array Int Int)) (v_ArrVal_3356 (Array Int Int)) (v_ArrVal_3357 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_40| Int) (v_arrayElimCell_117 Int)) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store |c_#memory_int#2| .cse2 v_ArrVal_3352) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_3356) v_arrayElimCell_117) (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse2 (store .cse3 |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_40| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_3357) .cse4) .cse5) 4))) (< |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_40| 0) (< .cse6 |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_40|) (not (= v_ArrVal_3356 (store (select |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_3356 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))))) .cse7) (forall ((v_ArrVal_3352 (Array Int Int)) (v_ArrVal_3356 (Array Int Int)) (v_ArrVal_3357 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_40| Int) (v_arrayElimCell_115 Int) (v_arrayElimCell_117 Int)) (let ((.cse8 (store |c_#memory_int#2| .cse2 v_ArrVal_3352))) (let ((.cse9 (store .cse8 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_3356)) (.cse10 (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse2 (store .cse3 |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_40| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_3357) .cse4) .cse5) 4))) (or (not (= (store (select .cse8 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_3356 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_3356)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse9 v_arrayElimCell_117) .cse10)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse9 v_arrayElimCell_115) .cse10)) (< |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_40| 0) (< .cse6 |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_40|)))))) (= .cse4 .cse2)) (forall ((v_ArrVal_3352 (Array Int Int)) (v_ArrVal_3356 (Array Int Int)) (v_ArrVal_3357 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_40| Int) (v_arrayElimCell_117 Int)) (let ((.cse12 (store |c_#memory_int#2| .cse2 v_ArrVal_3352)) (.cse11 (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse2 (store .cse3 |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_40| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_3357) .cse4) .cse5) 4))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select v_ArrVal_3356 .cse11)) (not (= (store (select .cse12 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_3356 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_3356)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store .cse12 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_3356) v_arrayElimCell_117) .cse11)) (< |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_40| 0) (< .cse6 |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_40|)))) (or (forall ((v_ArrVal_3352 (Array Int Int)) (v_ArrVal_3356 (Array Int Int)) (v_ArrVal_3357 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_40| Int) (v_arrayElimCell_115 Int)) (let ((.cse13 (store |c_#memory_int#2| .cse2 v_ArrVal_3352))) (or (not (= (store (select .cse13 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_3356 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_3356)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store .cse13 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_3356) v_arrayElimCell_115) (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse2 (store .cse3 |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_40| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_3357) .cse4) .cse5) 4))) (< |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_40| 0) (< .cse6 |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_40|) (= .cse5 |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_40|)))) .cse0) (forall ((v_ArrVal_3352 (Array Int Int)) (v_ArrVal_3356 (Array Int Int)) (v_ArrVal_3357 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_40| Int) (v_arrayElimCell_115 Int) (v_arrayElimCell_117 Int)) (let ((.cse14 (store |c_#memory_int#2| .cse2 v_ArrVal_3352))) (let ((.cse15 (store .cse14 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_3356)) (.cse16 (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse2 (store .cse3 |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_40| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_3357) .cse4) .cse5) 4))) (or (not (= (store (select .cse14 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_3356 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_3356)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse15 v_arrayElimCell_117) .cse16)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse15 v_arrayElimCell_115) .cse16)) (< |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_40| 0) (< .cse6 |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_40|) (= .cse5 |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_40|))))) (or (forall ((v_ArrVal_3352 (Array Int Int)) (v_ArrVal_3356 (Array Int Int)) (v_ArrVal_3357 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_40| Int) (v_arrayElimCell_117 Int)) (let ((.cse17 (store |c_#memory_int#2| .cse2 v_ArrVal_3352))) (or (not (= (store (select .cse17 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_3356 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_3356)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store .cse17 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_3356) v_arrayElimCell_117) (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse2 (store .cse3 |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_40| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_3357) .cse4) .cse5) 4))) (< |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_40| 0) (< .cse6 |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_40|)))) .cse7) (or (forall ((v_ArrVal_3352 (Array Int Int)) (v_ArrVal_3357 (Array Int Int)) (v_DerPreprocessor_6 Int) (|v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_40| Int)) (or (< |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_40| 0) (< .cse6 |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_40|) (= (select (store (select (store |c_#memory_int#2| .cse2 v_ArrVal_3352) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_DerPreprocessor_6) (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse2 (store .cse3 |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_40| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_3357) .cse4) .cse5) 4)) |c_ULTIMATE.start_main_~uneq~0#1|))) .cse0))))) is different from false [2024-11-09 08:05:18,358 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse8 (= .cse5 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|))) (let ((.cse15 (not .cse8)) (.cse1 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse4 (select |c_#memory_$Pointer$#2.offset| .cse3)) (.cse6 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (forall ((v_ArrVal_3352 (Array Int Int)) (v_ArrVal_3356 (Array Int Int)) (v_ArrVal_3357 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_40| Int) (v_arrayElimCell_117 Int)) (let ((.cse0 (store |c_#memory_int#2| .cse3 v_ArrVal_3352)) (.cse2 (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse3 (store .cse4 |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_40| |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset|)) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_3357) .cse5) .cse6) 4))) (or (not (= v_ArrVal_3356 (store (select .cse0 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| (select v_ArrVal_3356 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset|)))) (< |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_40| 0) (< .cse1 |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_40|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store .cse0 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_3356) v_arrayElimCell_117) .cse2)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select v_ArrVal_3356 .cse2))))) (or (forall ((v_ArrVal_3352 (Array Int Int)) (v_ArrVal_3356 (Array Int Int)) (v_ArrVal_3357 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_40| Int) (v_arrayElimCell_115 Int)) (let ((.cse7 (store |c_#memory_int#2| .cse3 v_ArrVal_3352))) (or (not (= v_ArrVal_3356 (store (select .cse7 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| (select v_ArrVal_3356 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset|)))) (< |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_40| 0) (= (select (select (store .cse7 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_3356) v_arrayElimCell_115) (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse3 (store .cse4 |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_40| |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset|)) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_3357) .cse5) .cse6) 4)) |c_ULTIMATE.start_main_~uneq~0#1|) (< .cse1 |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_40|) (= .cse6 |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_40|)))) .cse8) (forall ((v_ArrVal_3352 (Array Int Int)) (v_ArrVal_3356 (Array Int Int)) (v_ArrVal_3357 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_40| Int) (v_arrayElimCell_115 Int) (v_arrayElimCell_117 Int)) (let ((.cse9 (store |c_#memory_int#2| .cse3 v_ArrVal_3352))) (let ((.cse10 (store .cse9 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_3356)) (.cse11 (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse3 (store .cse4 |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_40| |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset|)) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_3357) .cse5) .cse6) 4))) (or (not (= v_ArrVal_3356 (store (select .cse9 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| (select v_ArrVal_3356 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset|)))) (< |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_40| 0) (= (select (select .cse10 v_arrayElimCell_115) .cse11) |c_ULTIMATE.start_main_~uneq~0#1|) (< .cse1 |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_40|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse10 v_arrayElimCell_117) .cse11)) (= .cse6 |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_40|))))) (or (forall ((v_ArrVal_3352 (Array Int Int)) (v_ArrVal_3357 (Array Int Int)) (v_DerPreprocessor_6 Int) (|v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_40| Int)) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (store (select (store |c_#memory_int#2| .cse3 v_ArrVal_3352) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| v_DerPreprocessor_6) (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse3 (store .cse4 |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_40| |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset|)) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_3357) .cse5) .cse6) 4))) (< |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_40| 0) (< .cse1 |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_40|))) .cse8) (or (and (forall ((v_ArrVal_3352 (Array Int Int)) (v_ArrVal_3356 (Array Int Int)) (v_ArrVal_3357 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_40| Int) (v_arrayElimCell_115 Int) (v_arrayElimCell_117 Int)) (let ((.cse12 (store |c_#memory_int#2| .cse3 v_ArrVal_3352))) (let ((.cse13 (store .cse12 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_3356)) (.cse14 (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse3 (store .cse4 |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_40| |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset|)) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_3357) .cse5) .cse6) 4))) (or (not (= v_ArrVal_3356 (store (select .cse12 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| (select v_ArrVal_3356 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset|)))) (< |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_40| 0) (= (select (select .cse13 v_arrayElimCell_115) .cse14) |c_ULTIMATE.start_main_~uneq~0#1|) (< .cse1 |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_40|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse13 v_arrayElimCell_117) .cse14)))))) (or .cse15 (forall ((v_ArrVal_3352 (Array Int Int)) (v_ArrVal_3356 (Array Int Int)) (v_ArrVal_3357 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_40| Int) (v_arrayElimCell_117 Int)) (or (< |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_40| 0) (< .cse1 |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_40|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store |c_#memory_int#2| .cse3 v_ArrVal_3352) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_3356) v_arrayElimCell_117) (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse3 (store .cse4 |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_40| |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset|)) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_3357) .cse5) .cse6) 4))) (not (= (store (select |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| (select v_ArrVal_3356 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset|)) v_ArrVal_3356))))) (or (forall ((v_ArrVal_3352 (Array Int Int)) (v_ArrVal_3356 (Array Int Int)) (v_ArrVal_3357 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_40| Int) (v_arrayElimCell_115 Int)) (let ((.cse16 (store |c_#memory_int#2| .cse3 v_ArrVal_3352))) (or (not (= v_ArrVal_3356 (store (select .cse16 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| (select v_ArrVal_3356 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset|)))) (< |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_40| 0) (= (select (select (store .cse16 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_3356) v_arrayElimCell_115) (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse3 (store .cse4 |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_40| |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset|)) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_3357) .cse5) .cse6) 4)) |c_ULTIMATE.start_main_~uneq~0#1|) (< .cse1 |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_40|)))) .cse8)) (= .cse5 .cse3)) (or .cse15 (forall ((v_ArrVal_3352 (Array Int Int)) (v_ArrVal_3356 (Array Int Int)) (v_ArrVal_3357 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_40| Int) (v_arrayElimCell_117 Int)) (let ((.cse17 (store |c_#memory_int#2| .cse3 v_ArrVal_3352))) (or (not (= v_ArrVal_3356 (store (select .cse17 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| (select v_ArrVal_3356 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset|)))) (< |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_40| 0) (< .cse1 |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_40|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store .cse17 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_3356) v_arrayElimCell_117) (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse3 (store .cse4 |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_40| |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset|)) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_3357) .cse5) .cse6) 4))))))))))) is different from false