./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/list-simple/sll2n_update_all_reverse.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version da043454 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/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.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../../../trunk/examples/svcomp/list-simple/sll2n_update_all_reverse.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 60a477b5dcc7be77af17ce3cc379f1876781ed95f896fb2ca2dbb7ba91ecb849 --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-30 10:41:48,719 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-30 10:41:48,769 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-04-30 10:41:48,772 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-30 10:41:48,772 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-30 10:41:48,789 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-30 10:41:48,790 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-30 10:41:48,790 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-30 10:41:48,790 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-30 10:41:48,790 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-30 10:41:48,790 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-30 10:41:48,790 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-30 10:41:48,790 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-30 10:41:48,791 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-30 10:41:48,791 INFO L153 SettingsManager]: * Use SBE=true [2025-04-30 10:41:48,791 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-30 10:41:48,792 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-30 10:41:48,792 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-30 10:41:48,792 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-30 10:41:48,792 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-30 10:41:48,792 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-04-30 10:41:48,792 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-04-30 10:41:48,792 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-04-30 10:41:48,792 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-30 10:41:48,793 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-04-30 10:41:48,793 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-30 10:41:48,793 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-30 10:41:48,793 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-30 10:41:48,793 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-30 10:41:48,793 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-30 10:41:48,793 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:41:48,793 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-30 10:41:48,793 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:41:48,793 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:41:48,793 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-30 10:41:48,793 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:41:48,793 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-30 10:41:48,794 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:41:48,794 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:41:48,794 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-30 10:41:48,794 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-30 10:41:48,794 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-30 10:41:48,794 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-30 10:41:48,795 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-30 10:41:48,795 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-30 10:41:48,795 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-30 10:41:48,795 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> 60a477b5dcc7be77af17ce3cc379f1876781ed95f896fb2ca2dbb7ba91ecb849 [2025-04-30 10:41:48,996 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-30 10:41:49,002 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-30 10:41:49,005 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-30 10:41:49,006 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-30 10:41:49,007 INFO L274 PluginConnector]: CDTParser initialized [2025-04-30 10:41:49,008 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/sll2n_update_all_reverse.i [2025-04-30 10:41:50,281 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b09058f8/4fef67be9ceb411cbb71c7fe252bf0d8/FLAG6e1ec05bf [2025-04-30 10:41:50,527 INFO L389 CDTParser]: Found 1 translation units. [2025-04-30 10:41:50,527 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/sll2n_update_all_reverse.i [2025-04-30 10:41:50,537 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b09058f8/4fef67be9ceb411cbb71c7fe252bf0d8/FLAG6e1ec05bf [2025-04-30 10:41:51,282 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b09058f8/4fef67be9ceb411cbb71c7fe252bf0d8 [2025-04-30 10:41:51,284 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-30 10:41:51,285 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-30 10:41:51,286 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-30 10:41:51,286 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-30 10:41:51,289 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-30 10:41:51,289 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:41:51" (1/1) ... [2025-04-30 10:41:51,290 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67bf8228 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:41:51, skipping insertion in model container [2025-04-30 10:41:51,290 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:41:51" (1/1) ... [2025-04-30 10:41:51,313 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-30 10:41:51,527 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:41:51,533 INFO L200 MainTranslator]: Completed pre-run [2025-04-30 10:41:51,588 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:41:51,607 INFO L204 MainTranslator]: Completed translation [2025-04-30 10:41:51,607 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:41:51 WrapperNode [2025-04-30 10:41:51,607 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-30 10:41:51,608 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-30 10:41:51,608 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-30 10:41:51,608 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-30 10:41:51,612 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:41:51" (1/1) ... [2025-04-30 10:41:51,625 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:41:51" (1/1) ... [2025-04-30 10:41:51,640 INFO L138 Inliner]: procedures = 126, calls = 23, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 109 [2025-04-30 10:41:51,641 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-30 10:41:51,641 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-30 10:41:51,641 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-30 10:41:51,641 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-30 10:41:51,647 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:41:51" (1/1) ... [2025-04-30 10:41:51,648 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:41:51" (1/1) ... [2025-04-30 10:41:51,651 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:41:51" (1/1) ... [2025-04-30 10:41:51,672 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 4 writes are split as follows [0, 4]. [2025-04-30 10:41:51,673 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:41:51" (1/1) ... [2025-04-30 10:41:51,673 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:41:51" (1/1) ... [2025-04-30 10:41:51,682 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:41:51" (1/1) ... [2025-04-30 10:41:51,687 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:41:51" (1/1) ... [2025-04-30 10:41:51,689 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:41:51" (1/1) ... [2025-04-30 10:41:51,690 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:41:51" (1/1) ... [2025-04-30 10:41:51,695 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:41:51" (1/1) ... [2025-04-30 10:41:51,699 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-30 10:41:51,703 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-30 10:41:51,703 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-30 10:41:51,703 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-30 10:41:51,704 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:41:51" (1/1) ... [2025-04-30 10:41:51,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:41:51,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:41:51,729 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) [2025-04-30 10:41:51,732 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 [2025-04-30 10:41:51,747 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-30 10:41:51,747 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-30 10:41:51,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-30 10:41:51,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-30 10:41:51,747 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-30 10:41:51,747 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-30 10:41:51,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-04-30 10:41:51,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-04-30 10:41:51,747 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-04-30 10:41:51,747 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-04-30 10:41:51,747 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-30 10:41:51,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-30 10:41:51,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-30 10:41:51,748 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-30 10:41:51,748 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-30 10:41:51,843 INFO L234 CfgBuilder]: Building ICFG [2025-04-30 10:41:51,845 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-30 10:41:52,065 INFO L? ?]: Removed 80 outVars from TransFormulas that were not future-live. [2025-04-30 10:41:52,066 INFO L283 CfgBuilder]: Performing block encoding [2025-04-30 10:41:52,074 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-30 10:41:52,074 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-30 10:41:52,075 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:41:52 BoogieIcfgContainer [2025-04-30 10:41:52,075 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-30 10:41:52,078 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-30 10:41:52,078 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-30 10:41:52,082 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-30 10:41:52,083 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.04 10:41:51" (1/3) ... [2025-04-30 10:41:52,084 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6dcd8e4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:41:52, skipping insertion in model container [2025-04-30 10:41:52,084 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:41:51" (2/3) ... [2025-04-30 10:41:52,085 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6dcd8e4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:41:52, skipping insertion in model container [2025-04-30 10:41:52,085 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:41:52" (3/3) ... [2025-04-30 10:41:52,086 INFO L128 eAbstractionObserver]: Analyzing ICFG sll2n_update_all_reverse.i [2025-04-30 10:41:52,097 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-30 10:41:52,099 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sll2n_update_all_reverse.i that has 1 procedures, 61 locations, 69 edges, 1 initial locations, 6 loop locations, and 21 error locations. [2025-04-30 10:41:52,132 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-30 10:41:52,140 INFO L340 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;@7ca0a9ce, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-30 10:41:52,140 INFO L341 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2025-04-30 10:41:52,143 INFO L278 IsEmpty]: Start isEmpty. Operand has 61 states, 39 states have (on average 1.7692307692307692) internal successors, (69), 60 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:41:52,146 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-04-30 10:41:52,146 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:41:52,146 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-04-30 10:41:52,146 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2025-04-30 10:41:52,149 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:41:52,150 INFO L85 PathProgramCache]: Analyzing trace with hash 28694887, now seen corresponding path program 1 times [2025-04-30 10:41:52,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:41:52,155 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290664238] [2025-04-30 10:41:52,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:41:52,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:41:52,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-30 10:41:52,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-30 10:41:52,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:41:52,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:41:52,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:41:52,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:41:52,362 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290664238] [2025-04-30 10:41:52,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290664238] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:41:52,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:41:52,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:41:52,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323741235] [2025-04-30 10:41:52,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:41:52,366 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:41:52,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:41:52,386 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:41:52,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:41:52,388 INFO L87 Difference]: Start difference. First operand has 61 states, 39 states have (on average 1.7692307692307692) internal successors, (69), 60 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:41:52,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:41:52,449 INFO L93 Difference]: Finished difference Result 58 states and 64 transitions. [2025-04-30 10:41:52,450 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:41:52,451 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-04-30 10:41:52,451 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:41:52,455 INFO L225 Difference]: With dead ends: 58 [2025-04-30 10:41:52,455 INFO L226 Difference]: Without dead ends: 55 [2025-04-30 10:41:52,457 INFO L436 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 [2025-04-30 10:41:52,460 INFO L437 NwaCegarLoop]: 57 mSDtfsCounter, 2 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:41:52,461 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 99 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:41:52,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-04-30 10:41:52,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2025-04-30 10:41:52,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 36 states have (on average 1.6666666666666667) internal successors, (60), 54 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:41:52,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 60 transitions. [2025-04-30 10:41:52,481 INFO L79 Accepts]: Start accepts. Automaton has 55 states and 60 transitions. Word has length 5 [2025-04-30 10:41:52,481 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:41:52,481 INFO L485 AbstractCegarLoop]: Abstraction has 55 states and 60 transitions. [2025-04-30 10:41:52,481 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:41:52,481 INFO L278 IsEmpty]: Start isEmpty. Operand 55 states and 60 transitions. [2025-04-30 10:41:52,481 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-04-30 10:41:52,481 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:41:52,482 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-04-30 10:41:52,482 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-30 10:41:52,482 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2025-04-30 10:41:52,482 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:41:52,482 INFO L85 PathProgramCache]: Analyzing trace with hash 28694886, now seen corresponding path program 1 times [2025-04-30 10:41:52,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:41:52,483 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536360091] [2025-04-30 10:41:52,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:41:52,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:41:52,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-30 10:41:52,493 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-30 10:41:52,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:41:52,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:41:52,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:41:52,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:41:52,542 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536360091] [2025-04-30 10:41:52,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536360091] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:41:52,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:41:52,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:41:52,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410980133] [2025-04-30 10:41:52,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:41:52,543 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:41:52,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:41:52,543 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:41:52,544 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:41:52,544 INFO L87 Difference]: Start difference. First operand 55 states and 60 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:41:52,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:41:52,576 INFO L93 Difference]: Finished difference Result 53 states and 58 transitions. [2025-04-30 10:41:52,576 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:41:52,576 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-04-30 10:41:52,576 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:41:52,577 INFO L225 Difference]: With dead ends: 53 [2025-04-30 10:41:52,577 INFO L226 Difference]: Without dead ends: 53 [2025-04-30 10:41:52,577 INFO L436 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 [2025-04-30 10:41:52,578 INFO L437 NwaCegarLoop]: 54 mSDtfsCounter, 2 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:41:52,578 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 89 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:41:52,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-04-30 10:41:52,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2025-04-30 10:41:52,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 36 states have (on average 1.6111111111111112) internal successors, (58), 52 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:41:52,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions. [2025-04-30 10:41:52,582 INFO L79 Accepts]: Start accepts. Automaton has 53 states and 58 transitions. Word has length 5 [2025-04-30 10:41:52,582 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:41:52,582 INFO L485 AbstractCegarLoop]: Abstraction has 53 states and 58 transitions. [2025-04-30 10:41:52,582 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:41:52,583 INFO L278 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2025-04-30 10:41:52,583 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-04-30 10:41:52,583 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:41:52,583 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:41:52,583 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-30 10:41:52,583 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2025-04-30 10:41:52,584 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:41:52,584 INFO L85 PathProgramCache]: Analyzing trace with hash 1826854847, now seen corresponding path program 1 times [2025-04-30 10:41:52,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:41:52,584 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827075473] [2025-04-30 10:41:52,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:41:52,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:41:52,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-30 10:41:52,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-30 10:41:52,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:41:52,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:41:52,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:41:52,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:41:52,622 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827075473] [2025-04-30 10:41:52,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827075473] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:41:52,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:41:52,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:41:52,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493955243] [2025-04-30 10:41:52,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:41:52,622 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:41:52,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:41:52,623 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:41:52,623 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:41:52,623 INFO L87 Difference]: Start difference. First operand 53 states and 58 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:41:52,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:41:52,634 INFO L93 Difference]: Finished difference Result 63 states and 68 transitions. [2025-04-30 10:41:52,635 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:41:52,635 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-04-30 10:41:52,636 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:41:52,636 INFO L225 Difference]: With dead ends: 63 [2025-04-30 10:41:52,636 INFO L226 Difference]: Without dead ends: 63 [2025-04-30 10:41:52,636 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:41:52,637 INFO L437 NwaCegarLoop]: 56 mSDtfsCounter, 9 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:41:52,637 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 109 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:41:52,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-04-30 10:41:52,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 54. [2025-04-30 10:41:52,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 37 states have (on average 1.5945945945945945) internal successors, (59), 53 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:41:52,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2025-04-30 10:41:52,641 INFO L79 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 7 [2025-04-30 10:41:52,641 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:41:52,641 INFO L485 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2025-04-30 10:41:52,641 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:41:52,641 INFO L278 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2025-04-30 10:41:52,641 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-04-30 10:41:52,641 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:41:52,641 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:41:52,641 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-30 10:41:52,641 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2025-04-30 10:41:52,641 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:41:52,642 INFO L85 PathProgramCache]: Analyzing trace with hash 381200138, now seen corresponding path program 1 times [2025-04-30 10:41:52,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:41:52,642 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928932709] [2025-04-30 10:41:52,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:41:52,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:41:52,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-30 10:41:52,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-30 10:41:52,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:41:52,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:41:52,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:41:52,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:41:52,744 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928932709] [2025-04-30 10:41:52,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928932709] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:41:52,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:41:52,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-30 10:41:52,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013982995] [2025-04-30 10:41:52,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:41:52,745 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:41:52,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:41:52,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:41:52,746 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:41:52,746 INFO L87 Difference]: Start difference. First operand 54 states and 59 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:41:52,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:41:52,816 INFO L93 Difference]: Finished difference Result 53 states and 58 transitions. [2025-04-30 10:41:52,816 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-30 10:41:52,816 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-04-30 10:41:52,816 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:41:52,816 INFO L225 Difference]: With dead ends: 53 [2025-04-30 10:41:52,816 INFO L226 Difference]: Without dead ends: 53 [2025-04-30 10:41:52,816 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:41:52,817 INFO L437 NwaCegarLoop]: 49 mSDtfsCounter, 2 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:41:52,817 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 147 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:41:52,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-04-30 10:41:52,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2025-04-30 10:41:52,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 37 states have (on average 1.5675675675675675) internal successors, (58), 52 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:41:52,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions. [2025-04-30 10:41:52,823 INFO L79 Accepts]: Start accepts. Automaton has 53 states and 58 transitions. Word has length 9 [2025-04-30 10:41:52,823 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:41:52,824 INFO L485 AbstractCegarLoop]: Abstraction has 53 states and 58 transitions. [2025-04-30 10:41:52,824 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:41:52,824 INFO L278 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2025-04-30 10:41:52,824 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-04-30 10:41:52,824 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:41:52,824 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:41:52,825 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-30 10:41:52,825 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2025-04-30 10:41:52,825 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:41:52,825 INFO L85 PathProgramCache]: Analyzing trace with hash 381200139, now seen corresponding path program 1 times [2025-04-30 10:41:52,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:41:52,826 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376740373] [2025-04-30 10:41:52,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:41:52,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:41:52,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-30 10:41:52,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-30 10:41:52,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:41:52,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:41:52,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:41:52,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:41:52,953 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376740373] [2025-04-30 10:41:52,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376740373] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:41:52,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:41:52,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-30 10:41:52,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588281552] [2025-04-30 10:41:52,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:41:52,953 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:41:52,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:41:52,954 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:41:52,954 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:41:52,954 INFO L87 Difference]: Start difference. First operand 53 states and 58 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:41:53,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:41:53,002 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions. [2025-04-30 10:41:53,002 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-30 10:41:53,002 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-04-30 10:41:53,003 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:41:53,003 INFO L225 Difference]: With dead ends: 52 [2025-04-30 10:41:53,003 INFO L226 Difference]: Without dead ends: 52 [2025-04-30 10:41:53,003 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:41:53,003 INFO L437 NwaCegarLoop]: 49 mSDtfsCounter, 1 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:41:53,004 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 158 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:41:53,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-04-30 10:41:53,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2025-04-30 10:41:53,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 37 states have (on average 1.5405405405405406) internal successors, (57), 51 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:41:53,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2025-04-30 10:41:53,009 INFO L79 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 9 [2025-04-30 10:41:53,009 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:41:53,011 INFO L485 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2025-04-30 10:41:53,011 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:41:53,011 INFO L278 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2025-04-30 10:41:53,011 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-04-30 10:41:53,011 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:41:53,011 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:41:53,012 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-30 10:41:53,012 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2025-04-30 10:41:53,012 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:41:53,012 INFO L85 PathProgramCache]: Analyzing trace with hash 1735276049, now seen corresponding path program 1 times [2025-04-30 10:41:53,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:41:53,012 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836223057] [2025-04-30 10:41:53,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:41:53,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:41:53,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-30 10:41:53,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-30 10:41:53,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:41:53,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:41:53,072 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:41:53,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:41:53,072 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836223057] [2025-04-30 10:41:53,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836223057] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:41:53,072 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [466617061] [2025-04-30 10:41:53,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:41:53,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:41:53,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:41:53,075 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) [2025-04-30 10:41:53,076 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-30 10:41:53,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-30 10:41:53,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-30 10:41:53,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:41:53,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:41:53,147 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-30 10:41:53,154 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:41:53,207 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:41:53,207 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:41:53,229 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:41:53,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [466617061] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:41:53,230 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:41:53,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2025-04-30 10:41:53,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698724656] [2025-04-30 10:41:53,230 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:41:53,231 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:41:53,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:41:53,231 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:41:53,232 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:41:53,232 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:41:53,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:41:53,242 INFO L93 Difference]: Finished difference Result 60 states and 65 transitions. [2025-04-30 10:41:53,245 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:41:53,245 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-04-30 10:41:53,246 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:41:53,246 INFO L225 Difference]: With dead ends: 60 [2025-04-30 10:41:53,246 INFO L226 Difference]: Without dead ends: 60 [2025-04-30 10:41:53,246 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:41:53,247 INFO L437 NwaCegarLoop]: 54 mSDtfsCounter, 7 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:41:53,247 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 105 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:41:53,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-04-30 10:41:53,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2025-04-30 10:41:53,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 45 states have (on average 1.4444444444444444) internal successors, (65), 59 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:41:53,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 65 transitions. [2025-04-30 10:41:53,251 INFO L79 Accepts]: Start accepts. Automaton has 60 states and 65 transitions. Word has length 15 [2025-04-30 10:41:53,251 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:41:53,251 INFO L485 AbstractCegarLoop]: Abstraction has 60 states and 65 transitions. [2025-04-30 10:41:53,251 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:41:53,251 INFO L278 IsEmpty]: Start isEmpty. Operand 60 states and 65 transitions. [2025-04-30 10:41:53,251 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-04-30 10:41:53,251 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:41:53,251 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:41:53,258 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-04-30 10:41:53,452 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-04-30 10:41:53,452 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2025-04-30 10:41:53,453 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:41:53,453 INFO L85 PathProgramCache]: Analyzing trace with hash -228171165, now seen corresponding path program 2 times [2025-04-30 10:41:53,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:41:53,453 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593145807] [2025-04-30 10:41:53,453 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:41:53,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:41:53,465 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-04-30 10:41:53,473 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-30 10:41:53,473 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:41:53,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:41:53,568 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-30 10:41:53,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:41:53,568 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593145807] [2025-04-30 10:41:53,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593145807] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:41:53,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:41:53,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-30 10:41:53,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997323237] [2025-04-30 10:41:53,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:41:53,569 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-30 10:41:53,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:41:53,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-30 10:41:53,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-04-30 10:41:53,570 INFO L87 Difference]: Start difference. First operand 60 states and 65 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:41:53,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:41:53,731 INFO L93 Difference]: Finished difference Result 63 states and 71 transitions. [2025-04-30 10:41:53,731 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-30 10:41:53,732 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-04-30 10:41:53,732 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:41:53,732 INFO L225 Difference]: With dead ends: 63 [2025-04-30 10:41:53,732 INFO L226 Difference]: Without dead ends: 63 [2025-04-30 10:41:53,733 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-04-30 10:41:53,734 INFO L437 NwaCegarLoop]: 34 mSDtfsCounter, 42 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:41:53,735 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 197 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:41:53,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-04-30 10:41:53,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2025-04-30 10:41:53,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 48 states have (on average 1.4791666666666667) internal successors, (71), 62 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:41:53,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 71 transitions. [2025-04-30 10:41:53,738 INFO L79 Accepts]: Start accepts. Automaton has 63 states and 71 transitions. Word has length 23 [2025-04-30 10:41:53,738 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:41:53,738 INFO L485 AbstractCegarLoop]: Abstraction has 63 states and 71 transitions. [2025-04-30 10:41:53,738 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:41:53,741 INFO L278 IsEmpty]: Start isEmpty. Operand 63 states and 71 transitions. [2025-04-30 10:41:53,741 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-04-30 10:41:53,742 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:41:53,742 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:41:53,743 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-30 10:41:53,743 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2025-04-30 10:41:53,743 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:41:53,743 INFO L85 PathProgramCache]: Analyzing trace with hash -228171164, now seen corresponding path program 1 times [2025-04-30 10:41:53,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:41:53,743 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983506220] [2025-04-30 10:41:53,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:41:53,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:41:53,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-30 10:41:53,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-30 10:41:53,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:41:53,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:41:53,979 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:41:53,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:41:53,979 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983506220] [2025-04-30 10:41:53,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983506220] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:41:53,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:41:53,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-30 10:41:53,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822699673] [2025-04-30 10:41:53,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:41:53,981 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-30 10:41:53,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:41:53,982 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-30 10:41:53,982 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-04-30 10:41:53,982 INFO L87 Difference]: Start difference. First operand 63 states and 71 transitions. Second operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:41:54,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:41:54,154 INFO L93 Difference]: Finished difference Result 63 states and 69 transitions. [2025-04-30 10:41:54,154 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-30 10:41:54,155 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-04-30 10:41:54,155 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:41:54,155 INFO L225 Difference]: With dead ends: 63 [2025-04-30 10:41:54,155 INFO L226 Difference]: Without dead ends: 63 [2025-04-30 10:41:54,155 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-04-30 10:41:54,156 INFO L437 NwaCegarLoop]: 36 mSDtfsCounter, 39 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:41:54,157 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 233 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:41:54,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-04-30 10:41:54,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2025-04-30 10:41:54,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 48 states have (on average 1.4375) internal successors, (69), 62 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:41:54,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 69 transitions. [2025-04-30 10:41:54,162 INFO L79 Accepts]: Start accepts. Automaton has 63 states and 69 transitions. Word has length 23 [2025-04-30 10:41:54,162 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:41:54,162 INFO L485 AbstractCegarLoop]: Abstraction has 63 states and 69 transitions. [2025-04-30 10:41:54,162 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:41:54,162 INFO L278 IsEmpty]: Start isEmpty. Operand 63 states and 69 transitions. [2025-04-30 10:41:54,163 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-04-30 10:41:54,165 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:41:54,165 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:41:54,165 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-30 10:41:54,165 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2025-04-30 10:41:54,165 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:41:54,166 INFO L85 PathProgramCache]: Analyzing trace with hash 1517152103, now seen corresponding path program 1 times [2025-04-30 10:41:54,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:41:54,166 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55114196] [2025-04-30 10:41:54,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:41:54,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:41:54,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-30 10:41:54,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-30 10:41:54,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:41:54,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:41:54,228 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-30 10:41:54,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:41:54,229 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55114196] [2025-04-30 10:41:54,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55114196] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:41:54,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:41:54,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-30 10:41:54,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426841369] [2025-04-30 10:41:54,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:41:54,229 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:41:54,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:41:54,230 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:41:54,230 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:41:54,230 INFO L87 Difference]: Start difference. First operand 63 states and 69 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:41:54,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:41:54,244 INFO L93 Difference]: Finished difference Result 92 states and 101 transitions. [2025-04-30 10:41:54,244 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:41:54,244 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-04-30 10:41:54,245 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:41:54,245 INFO L225 Difference]: With dead ends: 92 [2025-04-30 10:41:54,245 INFO L226 Difference]: Without dead ends: 92 [2025-04-30 10:41:54,245 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:41:54,246 INFO L437 NwaCegarLoop]: 50 mSDtfsCounter, 99 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 99 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 [2025-04-30 10:41:54,246 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 99 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:41:54,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-04-30 10:41:54,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 65. [2025-04-30 10:41:54,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 50 states have (on average 1.42) internal successors, (71), 64 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:41:54,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 71 transitions. [2025-04-30 10:41:54,249 INFO L79 Accepts]: Start accepts. Automaton has 65 states and 71 transitions. Word has length 24 [2025-04-30 10:41:54,249 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:41:54,249 INFO L485 AbstractCegarLoop]: Abstraction has 65 states and 71 transitions. [2025-04-30 10:41:54,249 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:41:54,249 INFO L278 IsEmpty]: Start isEmpty. Operand 65 states and 71 transitions. [2025-04-30 10:41:54,249 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-30 10:41:54,249 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:41:54,249 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:41:54,249 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-30 10:41:54,249 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2025-04-30 10:41:54,250 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:41:54,250 INFO L85 PathProgramCache]: Analyzing trace with hash 1486064842, now seen corresponding path program 1 times [2025-04-30 10:41:54,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:41:54,250 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570034075] [2025-04-30 10:41:54,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:41:54,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:41:54,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-30 10:41:54,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-30 10:41:54,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:41:54,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:41:54,371 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:41:54,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:41:54,371 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570034075] [2025-04-30 10:41:54,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570034075] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:41:54,372 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1912553642] [2025-04-30 10:41:54,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:41:54,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:41:54,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:41:54,373 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) [2025-04-30 10:41:54,375 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-30 10:41:54,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-30 10:41:54,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-30 10:41:54,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:41:54,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:41:54,451 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-30 10:41:54,452 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:41:54,482 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-30 10:41:54,482 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-30 10:41:54,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1912553642] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:41:54,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-30 10:41:54,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 7 [2025-04-30 10:41:54,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197919068] [2025-04-30 10:41:54,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:41:54,483 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:41:54,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:41:54,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:41:54,483 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:41:54,483 INFO L87 Difference]: Start difference. First operand 65 states and 71 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:41:54,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:41:54,516 INFO L93 Difference]: Finished difference Result 62 states and 67 transitions. [2025-04-30 10:41:54,516 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:41:54,517 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-04-30 10:41:54,517 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:41:54,517 INFO L225 Difference]: With dead ends: 62 [2025-04-30 10:41:54,517 INFO L226 Difference]: Without dead ends: 62 [2025-04-30 10:41:54,517 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2025-04-30 10:41:54,517 INFO L437 NwaCegarLoop]: 44 mSDtfsCounter, 67 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:41:54,518 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 113 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:41:54,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-04-30 10:41:54,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2025-04-30 10:41:54,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 49 states have (on average 1.3673469387755102) internal successors, (67), 61 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:41:54,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 67 transitions. [2025-04-30 10:41:54,520 INFO L79 Accepts]: Start accepts. Automaton has 62 states and 67 transitions. Word has length 26 [2025-04-30 10:41:54,520 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:41:54,520 INFO L485 AbstractCegarLoop]: Abstraction has 62 states and 67 transitions. [2025-04-30 10:41:54,520 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:41:54,520 INFO L278 IsEmpty]: Start isEmpty. Operand 62 states and 67 transitions. [2025-04-30 10:41:54,520 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-30 10:41:54,520 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:41:54,520 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:41:54,527 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-30 10:41:54,720 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-04-30 10:41:54,721 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2025-04-30 10:41:54,721 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:41:54,721 INFO L85 PathProgramCache]: Analyzing trace with hash 1486065034, now seen corresponding path program 1 times [2025-04-30 10:41:54,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:41:54,721 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736035991] [2025-04-30 10:41:54,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:41:54,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:41:54,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-30 10:41:54,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-30 10:41:54,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:41:54,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:41:55,244 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:41:55,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:41:55,245 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736035991] [2025-04-30 10:41:55,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736035991] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:41:55,245 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1994129396] [2025-04-30 10:41:55,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:41:55,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:41:55,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:41:55,247 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) [2025-04-30 10:41:55,249 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-30 10:41:55,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-30 10:41:55,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-30 10:41:55,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:41:55,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:41:55,338 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-04-30 10:41:55,340 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:41:55,359 INFO L354 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 [2025-04-30 10:41:55,404 INFO L325 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-04-30 10:41:55,405 INFO L354 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 [2025-04-30 10:41:55,487 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-04-30 10:41:55,628 INFO L354 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 31 treesize of output 13 [2025-04-30 10:41:55,639 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:41:55,639 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:41:55,935 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:41:55,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1994129396] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:41:55,936 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:41:55,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 15] total 34 [2025-04-30 10:41:55,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46150817] [2025-04-30 10:41:55,936 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:41:55,936 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-04-30 10:41:55,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:41:55,937 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-04-30 10:41:55,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1071, Unknown=0, NotChecked=0, Total=1190 [2025-04-30 10:41:55,937 INFO L87 Difference]: Start difference. First operand 62 states and 67 transitions. Second operand has 35 states, 34 states have (on average 1.6764705882352942) internal successors, (57), 35 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:41:56,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:41:56,467 INFO L93 Difference]: Finished difference Result 71 states and 77 transitions. [2025-04-30 10:41:56,467 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-30 10:41:56,467 INFO L79 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.6764705882352942) internal successors, (57), 35 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-04-30 10:41:56,468 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:41:56,469 INFO L225 Difference]: With dead ends: 71 [2025-04-30 10:41:56,469 INFO L226 Difference]: Without dead ends: 71 [2025-04-30 10:41:56,469 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 346 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=212, Invalid=1680, Unknown=0, NotChecked=0, Total=1892 [2025-04-30 10:41:56,470 INFO L437 NwaCegarLoop]: 41 mSDtfsCounter, 28 mSDsluCounter, 646 mSDsCounter, 0 mSdLazyCounter, 822 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 687 SdHoareTripleChecker+Invalid, 828 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 822 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-30 10:41:56,470 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 687 Invalid, 828 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 822 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-30 10:41:56,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-04-30 10:41:56,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 67. [2025-04-30 10:41:56,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 54 states have (on average 1.3703703703703705) internal successors, (74), 66 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:41:56,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 74 transitions. [2025-04-30 10:41:56,472 INFO L79 Accepts]: Start accepts. Automaton has 67 states and 74 transitions. Word has length 26 [2025-04-30 10:41:56,472 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:41:56,472 INFO L485 AbstractCegarLoop]: Abstraction has 67 states and 74 transitions. [2025-04-30 10:41:56,473 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.6764705882352942) internal successors, (57), 35 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:41:56,473 INFO L278 IsEmpty]: Start isEmpty. Operand 67 states and 74 transitions. [2025-04-30 10:41:56,473 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-30 10:41:56,473 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:41:56,473 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:41:56,480 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-30 10:41:56,678 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:41:56,678 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2025-04-30 10:41:56,678 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:41:56,678 INFO L85 PathProgramCache]: Analyzing trace with hash 1486065035, now seen corresponding path program 1 times [2025-04-30 10:41:56,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:41:56,678 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808899416] [2025-04-30 10:41:56,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:41:56,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:41:56,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-30 10:41:56,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-30 10:41:56,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:41:56,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:41:57,206 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:41:57,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:41:57,206 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808899416] [2025-04-30 10:41:57,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808899416] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:41:57,206 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1366801913] [2025-04-30 10:41:57,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:41:57,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:41:57,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:41:57,208 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) [2025-04-30 10:41:57,209 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-30 10:41:57,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-30 10:41:57,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-30 10:41:57,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:41:57,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:41:57,289 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 58 conjuncts are in the unsatisfiable core [2025-04-30 10:41:57,292 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:41:57,300 INFO L354 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 [2025-04-30 10:41:57,382 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-30 10:41:57,382 INFO L354 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 [2025-04-30 10:41:57,387 INFO L354 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 [2025-04-30 10:41:57,483 INFO L354 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 [2025-04-30 10:41:57,486 INFO L354 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 1 [2025-04-30 10:41:57,643 INFO L354 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 31 treesize of output 13 [2025-04-30 10:41:57,648 INFO L354 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 9 treesize of output 3 [2025-04-30 10:41:57,655 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:41:57,655 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:41:58,146 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:41:58,147 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 55 [2025-04-30 10:41:58,278 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:41:58,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1366801913] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:41:58,278 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:41:58,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 14] total 40 [2025-04-30 10:41:58,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216854018] [2025-04-30 10:41:58,278 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:41:58,278 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-04-30 10:41:58,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:41:58,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-04-30 10:41:58,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=1528, Unknown=0, NotChecked=0, Total=1640 [2025-04-30 10:41:58,279 INFO L87 Difference]: Start difference. First operand 67 states and 74 transitions. Second operand has 41 states, 40 states have (on average 1.75) internal successors, (70), 41 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:41:59,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:41:59,162 INFO L93 Difference]: Finished difference Result 72 states and 78 transitions. [2025-04-30 10:41:59,163 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-30 10:41:59,163 INFO L79 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 1.75) internal successors, (70), 41 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-04-30 10:41:59,163 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:41:59,163 INFO L225 Difference]: With dead ends: 72 [2025-04-30 10:41:59,163 INFO L226 Difference]: Without dead ends: 72 [2025-04-30 10:41:59,164 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 331 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=243, Invalid=2619, Unknown=0, NotChecked=0, Total=2862 [2025-04-30 10:41:59,165 INFO L437 NwaCegarLoop]: 34 mSDtfsCounter, 92 mSDsluCounter, 743 mSDsCounter, 0 mSdLazyCounter, 1010 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 777 SdHoareTripleChecker+Invalid, 1024 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1010 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-30 10:41:59,165 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 777 Invalid, 1024 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1010 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-30 10:41:59,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-04-30 10:41:59,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 65. [2025-04-30 10:41:59,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 53 states have (on average 1.3396226415094339) internal successors, (71), 64 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:41:59,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 71 transitions. [2025-04-30 10:41:59,167 INFO L79 Accepts]: Start accepts. Automaton has 65 states and 71 transitions. Word has length 26 [2025-04-30 10:41:59,167 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:41:59,167 INFO L485 AbstractCegarLoop]: Abstraction has 65 states and 71 transitions. [2025-04-30 10:41:59,167 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 1.75) internal successors, (70), 41 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:41:59,168 INFO L278 IsEmpty]: Start isEmpty. Operand 65 states and 71 transitions. [2025-04-30 10:41:59,168 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-30 10:41:59,168 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:41:59,168 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:41:59,174 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-04-30 10:41:59,372 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:41:59,372 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2025-04-30 10:41:59,372 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:41:59,372 INFO L85 PathProgramCache]: Analyzing trace with hash -907098283, now seen corresponding path program 1 times [2025-04-30 10:41:59,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:41:59,372 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777754540] [2025-04-30 10:41:59,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:41:59,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:41:59,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-30 10:41:59,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-30 10:41:59,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:41:59,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:41:59,463 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-30 10:41:59,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:41:59,464 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777754540] [2025-04-30 10:41:59,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777754540] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:41:59,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:41:59,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-30 10:41:59,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22178319] [2025-04-30 10:41:59,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:41:59,464 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-30 10:41:59,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:41:59,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-30 10:41:59,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-04-30 10:41:59,465 INFO L87 Difference]: Start difference. First operand 65 states and 71 transitions. Second operand has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:41:59,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:41:59,589 INFO L93 Difference]: Finished difference Result 68 states and 77 transitions. [2025-04-30 10:41:59,589 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-30 10:41:59,589 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-04-30 10:41:59,589 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:41:59,590 INFO L225 Difference]: With dead ends: 68 [2025-04-30 10:41:59,590 INFO L226 Difference]: Without dead ends: 68 [2025-04-30 10:41:59,590 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-04-30 10:41:59,590 INFO L437 NwaCegarLoop]: 32 mSDtfsCounter, 34 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:41:59,590 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 183 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:41:59,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-04-30 10:41:59,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2025-04-30 10:41:59,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 56 states have (on average 1.375) internal successors, (77), 67 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:41:59,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 77 transitions. [2025-04-30 10:41:59,592 INFO L79 Accepts]: Start accepts. Automaton has 68 states and 77 transitions. Word has length 28 [2025-04-30 10:41:59,592 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:41:59,592 INFO L485 AbstractCegarLoop]: Abstraction has 68 states and 77 transitions. [2025-04-30 10:41:59,592 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:41:59,592 INFO L278 IsEmpty]: Start isEmpty. Operand 68 states and 77 transitions. [2025-04-30 10:41:59,593 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-30 10:41:59,593 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:41:59,593 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:41:59,593 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-30 10:41:59,593 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2025-04-30 10:41:59,594 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:41:59,594 INFO L85 PathProgramCache]: Analyzing trace with hash -907098282, now seen corresponding path program 1 times [2025-04-30 10:41:59,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:41:59,594 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125235559] [2025-04-30 10:41:59,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:41:59,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:41:59,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-30 10:41:59,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-30 10:41:59,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:41:59,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:41:59,666 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:41:59,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:41:59,666 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125235559] [2025-04-30 10:41:59,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125235559] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:41:59,666 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1330594982] [2025-04-30 10:41:59,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:41:59,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:41:59,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:41:59,668 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) [2025-04-30 10:41:59,670 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-30 10:41:59,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-30 10:41:59,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-30 10:41:59,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:41:59,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:41:59,758 INFO L256 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-30 10:41:59,759 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:41:59,784 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-30 10:41:59,784 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-30 10:41:59,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1330594982] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:41:59,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-30 10:41:59,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2025-04-30 10:41:59,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393361630] [2025-04-30 10:41:59,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:41:59,785 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:41:59,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:41:59,785 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:41:59,785 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:41:59,785 INFO L87 Difference]: Start difference. First operand 68 states and 77 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:41:59,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:41:59,814 INFO L93 Difference]: Finished difference Result 88 states and 100 transitions. [2025-04-30 10:41:59,815 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:41:59,815 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-04-30 10:41:59,815 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:41:59,815 INFO L225 Difference]: With dead ends: 88 [2025-04-30 10:41:59,815 INFO L226 Difference]: Without dead ends: 88 [2025-04-30 10:41:59,815 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-04-30 10:41:59,816 INFO L437 NwaCegarLoop]: 45 mSDtfsCounter, 91 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:41:59,816 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 133 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:41:59,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-04-30 10:41:59,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 68. [2025-04-30 10:41:59,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 56 states have (on average 1.3571428571428572) internal successors, (76), 67 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:41:59,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 76 transitions. [2025-04-30 10:41:59,817 INFO L79 Accepts]: Start accepts. Automaton has 68 states and 76 transitions. Word has length 28 [2025-04-30 10:41:59,818 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:41:59,818 INFO L485 AbstractCegarLoop]: Abstraction has 68 states and 76 transitions. [2025-04-30 10:41:59,818 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:41:59,818 INFO L278 IsEmpty]: Start isEmpty. Operand 68 states and 76 transitions. [2025-04-30 10:41:59,818 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-04-30 10:41:59,818 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:41:59,818 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:41:59,824 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-04-30 10:42:00,023 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-04-30 10:42:00,023 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2025-04-30 10:42:00,024 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:42:00,024 INFO L85 PathProgramCache]: Analyzing trace with hash -1825634993, now seen corresponding path program 1 times [2025-04-30 10:42:00,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:42:00,024 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952632260] [2025-04-30 10:42:00,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:42:00,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:42:00,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-30 10:42:00,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-30 10:42:00,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:42:00,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:42:00,078 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-30 10:42:00,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:42:00,078 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952632260] [2025-04-30 10:42:00,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952632260] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:42:00,078 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1214264574] [2025-04-30 10:42:00,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:42:00,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:42:00,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:42:00,083 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) [2025-04-30 10:42:00,085 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-04-30 10:42:00,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-30 10:42:00,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-30 10:42:00,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:42:00,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:42:00,176 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-30 10:42:00,177 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:42:00,203 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-04-30 10:42:00,203 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:42:00,230 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-04-30 10:42:00,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1214264574] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:42:00,231 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:42:00,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2025-04-30 10:42:00,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392394443] [2025-04-30 10:42:00,231 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:42:00,231 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:42:00,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:42:00,232 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:42:00,232 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:42:00,232 INFO L87 Difference]: Start difference. First operand 68 states and 76 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:42:00,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:42:00,269 INFO L93 Difference]: Finished difference Result 90 states and 102 transitions. [2025-04-30 10:42:00,270 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-30 10:42:00,270 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2025-04-30 10:42:00,270 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:42:00,270 INFO L225 Difference]: With dead ends: 90 [2025-04-30 10:42:00,270 INFO L226 Difference]: Without dead ends: 90 [2025-04-30 10:42:00,271 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 60 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2025-04-30 10:42:00,271 INFO L437 NwaCegarLoop]: 44 mSDtfsCounter, 105 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:42:00,271 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 150 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:42:00,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-04-30 10:42:00,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 82. [2025-04-30 10:42:00,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 70 states have (on average 1.4142857142857144) internal successors, (99), 81 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:42:00,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 99 transitions. [2025-04-30 10:42:00,278 INFO L79 Accepts]: Start accepts. Automaton has 82 states and 99 transitions. Word has length 31 [2025-04-30 10:42:00,278 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:42:00,278 INFO L485 AbstractCegarLoop]: Abstraction has 82 states and 99 transitions. [2025-04-30 10:42:00,278 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:42:00,278 INFO L278 IsEmpty]: Start isEmpty. Operand 82 states and 99 transitions. [2025-04-30 10:42:00,279 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-30 10:42:00,279 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:42:00,279 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:42:00,285 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-04-30 10:42:00,479 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-04-30 10:42:00,479 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2025-04-30 10:42:00,480 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:42:00,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1703202225, now seen corresponding path program 1 times [2025-04-30 10:42:00,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:42:00,481 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865761288] [2025-04-30 10:42:00,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:42:00,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:42:00,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-30 10:42:00,493 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-30 10:42:00,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:42:00,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:42:00,560 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-04-30 10:42:00,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:42:00,560 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865761288] [2025-04-30 10:42:00,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865761288] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:42:00,561 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [140948096] [2025-04-30 10:42:00,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:42:00,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:42:00,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:42:00,562 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) [2025-04-30 10:42:00,564 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-04-30 10:42:00,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-30 10:42:00,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-30 10:42:00,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:42:00,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:42:00,664 INFO L256 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-30 10:42:00,665 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:42:00,700 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-04-30 10:42:00,701 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:42:00,736 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-04-30 10:42:00,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [140948096] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:42:00,737 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:42:00,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2025-04-30 10:42:00,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744299878] [2025-04-30 10:42:00,737 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:42:00,737 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-30 10:42:00,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:42:00,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-30 10:42:00,738 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-04-30 10:42:00,738 INFO L87 Difference]: Start difference. First operand 82 states and 99 transitions. Second operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:42:00,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:42:00,773 INFO L93 Difference]: Finished difference Result 85 states and 96 transitions. [2025-04-30 10:42:00,773 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:42:00,773 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-04-30 10:42:00,773 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:42:00,774 INFO L225 Difference]: With dead ends: 85 [2025-04-30 10:42:00,774 INFO L226 Difference]: Without dead ends: 85 [2025-04-30 10:42:00,774 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 61 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2025-04-30 10:42:00,774 INFO L437 NwaCegarLoop]: 61 mSDtfsCounter, 191 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:42:00,774 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 180 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:42:00,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-04-30 10:42:00,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 77. [2025-04-30 10:42:00,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 66 states have (on average 1.4090909090909092) internal successors, (93), 76 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:42:00,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 93 transitions. [2025-04-30 10:42:00,776 INFO L79 Accepts]: Start accepts. Automaton has 77 states and 93 transitions. Word has length 33 [2025-04-30 10:42:00,777 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:42:00,777 INFO L485 AbstractCegarLoop]: Abstraction has 77 states and 93 transitions. [2025-04-30 10:42:00,777 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:42:00,777 INFO L278 IsEmpty]: Start isEmpty. Operand 77 states and 93 transitions. [2025-04-30 10:42:00,777 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-04-30 10:42:00,777 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:42:00,777 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:42:00,784 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-04-30 10:42:00,978 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:42:00,978 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2025-04-30 10:42:00,978 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:42:00,978 INFO L85 PathProgramCache]: Analyzing trace with hash 1603312061, now seen corresponding path program 2 times [2025-04-30 10:42:00,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:42:00,978 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166651410] [2025-04-30 10:42:00,978 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:42:00,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:42:00,991 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-04-30 10:42:00,992 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 8 of 35 statements. [2025-04-30 10:42:00,992 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-30 10:42:00,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:42:01,009 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-04-30 10:42:01,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:42:01,010 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166651410] [2025-04-30 10:42:01,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166651410] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:42:01,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:42:01,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:42:01,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907937755] [2025-04-30 10:42:01,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:42:01,011 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:42:01,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:42:01,011 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:42:01,011 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:42:01,011 INFO L87 Difference]: Start difference. First operand 77 states and 93 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:42:01,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:42:01,039 INFO L93 Difference]: Finished difference Result 84 states and 93 transitions. [2025-04-30 10:42:01,040 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:42:01,040 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2025-04-30 10:42:01,040 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:42:01,040 INFO L225 Difference]: With dead ends: 84 [2025-04-30 10:42:01,040 INFO L226 Difference]: Without dead ends: 84 [2025-04-30 10:42:01,040 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-04-30 10:42:01,041 INFO L437 NwaCegarLoop]: 44 mSDtfsCounter, 81 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:42:01,041 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 124 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:42:01,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2025-04-30 10:42:01,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 76. [2025-04-30 10:42:01,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 65 states have (on average 1.3846153846153846) internal successors, (90), 75 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:42:01,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 90 transitions. [2025-04-30 10:42:01,044 INFO L79 Accepts]: Start accepts. Automaton has 76 states and 90 transitions. Word has length 35 [2025-04-30 10:42:01,044 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:42:01,044 INFO L485 AbstractCegarLoop]: Abstraction has 76 states and 90 transitions. [2025-04-30 10:42:01,044 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:42:01,044 INFO L278 IsEmpty]: Start isEmpty. Operand 76 states and 90 transitions. [2025-04-30 10:42:01,045 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-04-30 10:42:01,045 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:42:01,045 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:42:01,045 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-04-30 10:42:01,045 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2025-04-30 10:42:01,046 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:42:01,046 INFO L85 PathProgramCache]: Analyzing trace with hash 1603311869, now seen corresponding path program 1 times [2025-04-30 10:42:01,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:42:01,046 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798921311] [2025-04-30 10:42:01,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:42:01,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:42:01,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-30 10:42:01,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-30 10:42:01,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:42:01,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:42:01,200 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-04-30 10:42:01,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:42:01,200 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798921311] [2025-04-30 10:42:01,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798921311] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:42:01,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:42:01,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-30 10:42:01,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531127297] [2025-04-30 10:42:01,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:42:01,200 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-30 10:42:01,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:42:01,201 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-30 10:42:01,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-04-30 10:42:01,201 INFO L87 Difference]: Start difference. First operand 76 states and 90 transitions. Second operand has 9 states, 8 states have (on average 3.875) internal successors, (31), 9 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:42:01,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:42:01,327 INFO L93 Difference]: Finished difference Result 76 states and 87 transitions. [2025-04-30 10:42:01,328 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-30 10:42:01,328 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.875) internal successors, (31), 9 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2025-04-30 10:42:01,328 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:42:01,328 INFO L225 Difference]: With dead ends: 76 [2025-04-30 10:42:01,328 INFO L226 Difference]: Without dead ends: 76 [2025-04-30 10:42:01,328 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-04-30 10:42:01,329 INFO L437 NwaCegarLoop]: 35 mSDtfsCounter, 25 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:42:01,329 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 225 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:42:01,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-04-30 10:42:01,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2025-04-30 10:42:01,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 65 states have (on average 1.3384615384615384) internal successors, (87), 75 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:42:01,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 87 transitions. [2025-04-30 10:42:01,330 INFO L79 Accepts]: Start accepts. Automaton has 76 states and 87 transitions. Word has length 35 [2025-04-30 10:42:01,330 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:42:01,330 INFO L485 AbstractCegarLoop]: Abstraction has 76 states and 87 transitions. [2025-04-30 10:42:01,330 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.875) internal successors, (31), 9 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:42:01,330 INFO L278 IsEmpty]: Start isEmpty. Operand 76 states and 87 transitions. [2025-04-30 10:42:01,331 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-04-30 10:42:01,331 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:42:01,331 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:42:01,331 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-04-30 10:42:01,331 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2025-04-30 10:42:01,331 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:42:01,331 INFO L85 PathProgramCache]: Analyzing trace with hash -67406394, now seen corresponding path program 1 times [2025-04-30 10:42:01,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:42:01,331 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846580430] [2025-04-30 10:42:01,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:42:01,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:42:01,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-04-30 10:42:01,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-04-30 10:42:01,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:42:01,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:42:01,979 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-30 10:42:01,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:42:01,980 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846580430] [2025-04-30 10:42:01,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846580430] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:42:01,980 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1920862650] [2025-04-30 10:42:01,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:42:01,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:42:01,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:42:01,982 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) [2025-04-30 10:42:01,982 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-04-30 10:42:02,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-04-30 10:42:02,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-04-30 10:42:02,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:42:02,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:42:02,098 INFO L256 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 65 conjuncts are in the unsatisfiable core [2025-04-30 10:42:02,102 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:42:02,115 INFO L325 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-04-30 10:42:02,115 INFO L354 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 [2025-04-30 10:42:02,180 INFO L354 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 1 [2025-04-30 10:42:02,372 INFO L325 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-04-30 10:42:02,372 INFO L354 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 42 treesize of output 41 [2025-04-30 10:42:02,426 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:42:02,426 INFO L354 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 37 treesize of output 19 [2025-04-30 10:42:02,507 INFO L354 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 31 treesize of output 13 [2025-04-30 10:42:02,591 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:42:02,591 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:42:03,031 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:42:03,031 INFO L354 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 24 treesize of output 25 [2025-04-30 10:42:03,034 INFO L354 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 40 treesize of output 28 [2025-04-30 10:42:03,040 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2025-04-30 10:42:03,387 INFO L325 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2025-04-30 10:42:03,387 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 1 [2025-04-30 10:42:03,388 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 10 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:42:03,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1920862650] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:42:03,388 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:42:03,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 18, 20] total 53 [2025-04-30 10:42:03,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29397431] [2025-04-30 10:42:03,388 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:42:03,388 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2025-04-30 10:42:03,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:42:03,389 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2025-04-30 10:42:03,390 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=2671, Unknown=10, NotChecked=0, Total=2862 [2025-04-30 10:42:03,390 INFO L87 Difference]: Start difference. First operand 76 states and 87 transitions. Second operand has 54 states, 53 states have (on average 1.8679245283018868) internal successors, (99), 54 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:42:04,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:42:04,465 INFO L93 Difference]: Finished difference Result 90 states and 107 transitions. [2025-04-30 10:42:04,466 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-30 10:42:04,466 INFO L79 Accepts]: Start accepts. Automaton has has 54 states, 53 states have (on average 1.8679245283018868) internal successors, (99), 54 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2025-04-30 10:42:04,466 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:42:04,466 INFO L225 Difference]: With dead ends: 90 [2025-04-30 10:42:04,466 INFO L226 Difference]: Without dead ends: 90 [2025-04-30 10:42:04,468 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 1029 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=399, Invalid=4703, Unknown=10, NotChecked=0, Total=5112 [2025-04-30 10:42:04,469 INFO L437 NwaCegarLoop]: 32 mSDtfsCounter, 159 mSDsluCounter, 797 mSDsCounter, 0 mSdLazyCounter, 1459 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 829 SdHoareTripleChecker+Invalid, 1474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-30 10:42:04,469 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 829 Invalid, 1474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1459 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-30 10:42:04,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-04-30 10:42:04,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 84. [2025-04-30 10:42:04,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 73 states have (on average 1.3835616438356164) internal successors, (101), 83 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:42:04,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 101 transitions. [2025-04-30 10:42:04,471 INFO L79 Accepts]: Start accepts. Automaton has 84 states and 101 transitions. Word has length 38 [2025-04-30 10:42:04,471 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:42:04,471 INFO L485 AbstractCegarLoop]: Abstraction has 84 states and 101 transitions. [2025-04-30 10:42:04,471 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 53 states have (on average 1.8679245283018868) internal successors, (99), 54 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:42:04,471 INFO L278 IsEmpty]: Start isEmpty. Operand 84 states and 101 transitions. [2025-04-30 10:42:04,472 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-04-30 10:42:04,472 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:42:04,472 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:42:04,478 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-04-30 10:42:04,672 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:42:04,672 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2025-04-30 10:42:04,673 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:42:04,673 INFO L85 PathProgramCache]: Analyzing trace with hash -67406393, now seen corresponding path program 1 times [2025-04-30 10:42:04,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:42:04,673 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888418764] [2025-04-30 10:42:04,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:42:04,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:42:04,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-04-30 10:42:04,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-04-30 10:42:04,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:42:04,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:42:05,634 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-30 10:42:05,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:42:05,634 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888418764] [2025-04-30 10:42:05,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888418764] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:42:05,634 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [944805844] [2025-04-30 10:42:05,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:42:05,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:42:05,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:42:05,636 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) [2025-04-30 10:42:05,637 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-04-30 10:42:05,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-04-30 10:42:05,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-04-30 10:42:05,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:42:05,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:42:05,751 INFO L256 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 83 conjuncts are in the unsatisfiable core [2025-04-30 10:42:05,754 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:42:05,759 INFO L354 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 [2025-04-30 10:42:05,763 INFO L354 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 [2025-04-30 10:42:05,858 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-30 10:42:05,858 INFO L354 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 [2025-04-30 10:42:05,861 INFO L354 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 [2025-04-30 10:42:05,941 INFO L354 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 1 [2025-04-30 10:42:05,944 INFO L354 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 [2025-04-30 10:42:06,175 INFO L325 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-04-30 10:42:06,176 INFO L354 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 62 treesize of output 57 [2025-04-30 10:42:06,181 INFO L354 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 30 treesize of output 13 [2025-04-30 10:42:06,241 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:42:06,241 INFO L354 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 37 treesize of output 19 [2025-04-30 10:42:06,244 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:42:06,245 INFO L354 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 [2025-04-30 10:42:06,305 INFO L354 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 31 treesize of output 13 [2025-04-30 10:42:06,308 INFO L354 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 9 treesize of output 3 [2025-04-30 10:42:06,357 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-30 10:42:06,357 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:42:06,500 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (and (forall ((v_ArrVal_1088 (Array Int Int))) (or (not (= (store .cse0 |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select v_ArrVal_1088 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)) v_ArrVal_1088)) (< 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1088) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) 1)))) (forall ((v_ArrVal_1088 (Array Int Int))) (or (not (= (store .cse0 |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select v_ArrVal_1088 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)) v_ArrVal_1088)) (forall ((v_ArrVal_1086 Int)) (<= (+ 4 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1088) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_1086)) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1)))))))) is different from false [2025-04-30 10:42:06,663 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (and (forall ((v_ArrVal_1085 (Array Int Int)) (v_ArrVal_1084 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1084) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1085) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0)))) (forall ((v_ArrVal_1084 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1084) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0))))) is different from false [2025-04-30 10:42:06,818 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_#res#1.base|) .cse1))) (and (forall ((v_ArrVal_1084 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1084) |c_ULTIMATE.start_sll_create_#res#1.base|) .cse1))) (forall ((v_ArrVal_1085 (Array Int Int)) (v_ArrVal_1084 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1084) |c_ULTIMATE.start_sll_create_#res#1.base|) .cse1) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1085) |c_ULTIMATE.start_sll_create_#res#1.base|) .cse1))))))) is different from false [2025-04-30 10:42:06,896 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1084 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1084) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse1))) (forall ((v_ArrVal_1085 (Array Int Int)) (v_ArrVal_1084 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1084) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse1) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1085) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse1))))))) is different from false [2025-04-30 10:42:06,900 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:42:06,901 INFO L354 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 22 treesize of output 23 [2025-04-30 10:42:06,902 INFO L354 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 40 treesize of output 28 [2025-04-30 10:42:06,907 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:42:06,907 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 46 [2025-04-30 10:42:06,910 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:42:06,910 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2025-04-30 10:42:06,912 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:42:06,913 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2025-04-30 10:42:06,914 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:42:06,915 INFO L354 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 24 treesize of output 12 [2025-04-30 10:42:07,239 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 4 not checked. [2025-04-30 10:42:07,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [944805844] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:42:07,239 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:42:07,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19, 20] total 58 [2025-04-30 10:42:07,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674510892] [2025-04-30 10:42:07,239 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:42:07,240 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2025-04-30 10:42:07,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:42:07,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2025-04-30 10:42:07,241 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=2696, Unknown=97, NotChecked=436, Total=3422 [2025-04-30 10:42:07,241 INFO L87 Difference]: Start difference. First operand 84 states and 101 transitions. Second operand has 59 states, 58 states have (on average 1.8448275862068966) internal successors, (107), 59 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:42:08,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:42:08,211 INFO L93 Difference]: Finished difference Result 90 states and 103 transitions. [2025-04-30 10:42:08,211 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-30 10:42:08,212 INFO L79 Accepts]: Start accepts. Automaton has has 59 states, 58 states have (on average 1.8448275862068966) internal successors, (107), 59 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2025-04-30 10:42:08,212 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:42:08,212 INFO L225 Difference]: With dead ends: 90 [2025-04-30 10:42:08,212 INFO L226 Difference]: Without dead ends: 90 [2025-04-30 10:42:08,213 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 38 SyntacticMatches, 4 SemanticMatches, 69 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 976 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=333, Invalid=4002, Unknown=103, NotChecked=532, Total=4970 [2025-04-30 10:42:08,213 INFO L437 NwaCegarLoop]: 35 mSDtfsCounter, 69 mSDsluCounter, 925 mSDsCounter, 0 mSdLazyCounter, 1284 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 960 SdHoareTripleChecker+Invalid, 1553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 258 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-30 10:42:08,213 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 960 Invalid, 1553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1284 Invalid, 0 Unknown, 258 Unchecked, 0.5s Time] [2025-04-30 10:42:08,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-04-30 10:42:08,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 83. [2025-04-30 10:42:08,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 72 states have (on average 1.3333333333333333) internal successors, (96), 82 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:42:08,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 96 transitions. [2025-04-30 10:42:08,215 INFO L79 Accepts]: Start accepts. Automaton has 83 states and 96 transitions. Word has length 38 [2025-04-30 10:42:08,215 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:42:08,215 INFO L485 AbstractCegarLoop]: Abstraction has 83 states and 96 transitions. [2025-04-30 10:42:08,215 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 58 states have (on average 1.8448275862068966) internal successors, (107), 59 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:42:08,215 INFO L278 IsEmpty]: Start isEmpty. Operand 83 states and 96 transitions. [2025-04-30 10:42:08,216 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-04-30 10:42:08,216 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:42:08,216 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:42:08,225 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-04-30 10:42:08,420 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:42:08,420 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2025-04-30 10:42:08,421 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:42:08,421 INFO L85 PathProgramCache]: Analyzing trace with hash 1935123836, now seen corresponding path program 2 times [2025-04-30 10:42:08,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:42:08,421 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883074270] [2025-04-30 10:42:08,421 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:42:08,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:42:08,431 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 41 statements into 2 equivalence classes. [2025-04-30 10:42:08,438 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 41 of 41 statements. [2025-04-30 10:42:08,439 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:42:08,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:42:08,497 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-04-30 10:42:08,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:42:08,498 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883074270] [2025-04-30 10:42:08,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883074270] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:42:08,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:42:08,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-30 10:42:08,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712005352] [2025-04-30 10:42:08,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:42:08,498 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:42:08,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:42:08,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:42:08,499 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:42:08,499 INFO L87 Difference]: Start difference. First operand 83 states and 96 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:42:08,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:42:08,529 INFO L93 Difference]: Finished difference Result 69 states and 74 transitions. [2025-04-30 10:42:08,529 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:42:08,529 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2025-04-30 10:42:08,529 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:42:08,529 INFO L225 Difference]: With dead ends: 69 [2025-04-30 10:42:08,530 INFO L226 Difference]: Without dead ends: 69 [2025-04-30 10:42:08,530 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-04-30 10:42:08,530 INFO L437 NwaCegarLoop]: 38 mSDtfsCounter, 49 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:42:08,531 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 136 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:42:08,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-04-30 10:42:08,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2025-04-30 10:42:08,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 62 states have (on average 1.1935483870967742) internal successors, (74), 68 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:42:08,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 74 transitions. [2025-04-30 10:42:08,532 INFO L79 Accepts]: Start accepts. Automaton has 69 states and 74 transitions. Word has length 41 [2025-04-30 10:42:08,532 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:42:08,532 INFO L485 AbstractCegarLoop]: Abstraction has 69 states and 74 transitions. [2025-04-30 10:42:08,532 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:42:08,533 INFO L278 IsEmpty]: Start isEmpty. Operand 69 states and 74 transitions. [2025-04-30 10:42:08,534 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-04-30 10:42:08,534 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:42:08,534 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:42:08,534 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-04-30 10:42:08,534 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2025-04-30 10:42:08,535 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:42:08,535 INFO L85 PathProgramCache]: Analyzing trace with hash 1002788320, now seen corresponding path program 1 times [2025-04-30 10:42:08,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:42:08,535 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525728348] [2025-04-30 10:42:08,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:42:08,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:42:08,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-04-30 10:42:08,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-04-30 10:42:08,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:42:08,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:42:09,554 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:42:09,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:42:09,554 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525728348] [2025-04-30 10:42:09,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525728348] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:42:09,554 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1069974178] [2025-04-30 10:42:09,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:42:09,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:42:09,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:42:09,556 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) [2025-04-30 10:42:09,557 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-04-30 10:42:09,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-04-30 10:42:09,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-04-30 10:42:09,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:42:09,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:42:09,682 INFO L256 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 107 conjuncts are in the unsatisfiable core [2025-04-30 10:42:09,685 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:42:09,690 INFO L354 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 [2025-04-30 10:42:09,721 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-30 10:42:09,721 INFO L354 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 [2025-04-30 10:42:09,797 INFO L354 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 [2025-04-30 10:42:09,802 INFO L354 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 1 [2025-04-30 10:42:10,068 INFO L325 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-04-30 10:42:10,068 INFO L354 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 74 treesize of output 67 [2025-04-30 10:42:10,072 INFO L354 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 30 treesize of output 13 [2025-04-30 10:42:10,076 INFO L354 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 23 treesize of output 13 [2025-04-30 10:42:10,162 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:42:10,162 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 21 [2025-04-30 10:42:10,165 INFO L354 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 22 treesize of output 17 [2025-04-30 10:42:10,170 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:42:10,171 INFO L354 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 [2025-04-30 10:42:10,256 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2025-04-30 10:42:10,258 INFO L354 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 9 treesize of output 3 [2025-04-30 10:42:10,347 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-30 10:42:10,347 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:42:10,458 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1252 Int) (v_ArrVal_1254 (Array Int Int)) (v_ArrVal_1251 (Array Int Int))) (or (not (= v_ArrVal_1251 (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base|) |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select v_ArrVal_1251 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)))) (= (+ (let ((.cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1254) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_1252)) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0)) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1251) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0))) 1) (* |c_ULTIMATE.start_main_~len~0#1| 2)))) is different from false [2025-04-30 10:42:10,479 WARN L849 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_42| Int) (v_ArrVal_1254 (Array Int Int))) (or (= (* |c_ULTIMATE.start_main_~len~0#1| 2) (+ (let ((.cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_1254) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse0)) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base|) .cse0))) 1)) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_42|))) is different from false [2025-04-30 10:42:10,548 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:42:10,548 INFO L354 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 40 treesize of output 41 [2025-04-30 10:42:10,553 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:42:10,553 INFO L354 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 83 treesize of output 86 [2025-04-30 10:42:10,556 INFO L354 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 31 treesize of output 20 [2025-04-30 10:42:10,935 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:42:10,935 INFO L354 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 22 treesize of output 23 [2025-04-30 10:42:10,936 INFO L354 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 36 treesize of output 24 [2025-04-30 10:42:10,938 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-04-30 10:42:10,942 INFO L325 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2025-04-30 10:42:10,942 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 1 [2025-04-30 10:42:10,946 INFO L325 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2025-04-30 10:42:10,946 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 1 [2025-04-30 10:42:11,094 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2025-04-30 10:42:11,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1069974178] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:42:11,094 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:42:11,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 26, 27] total 70 [2025-04-30 10:42:11,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713304617] [2025-04-30 10:42:11,094 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:42:11,095 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2025-04-30 10:42:11,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:42:11,095 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2025-04-30 10:42:11,096 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=4278, Unknown=27, NotChecked=266, Total=4830 [2025-04-30 10:42:11,096 INFO L87 Difference]: Start difference. First operand 69 states and 74 transitions. Second operand has 70 states, 70 states have (on average 1.6285714285714286) internal successors, (114), 70 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:42:12,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:42:12,243 INFO L93 Difference]: Finished difference Result 75 states and 79 transitions. [2025-04-30 10:42:12,246 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-04-30 10:42:12,247 INFO L79 Accepts]: Start accepts. Automaton has has 70 states, 70 states have (on average 1.6285714285714286) internal successors, (114), 70 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2025-04-30 10:42:12,247 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:42:12,247 INFO L225 Difference]: With dead ends: 75 [2025-04-30 10:42:12,247 INFO L226 Difference]: Without dead ends: 75 [2025-04-30 10:42:12,249 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 83 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2171 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=467, Invalid=6319, Unknown=28, NotChecked=326, Total=7140 [2025-04-30 10:42:12,250 INFO L437 NwaCegarLoop]: 26 mSDtfsCounter, 130 mSDsluCounter, 946 mSDsCounter, 0 mSdLazyCounter, 1676 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 972 SdHoareTripleChecker+Invalid, 1828 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1676 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 146 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-30 10:42:12,250 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 972 Invalid, 1828 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1676 Invalid, 0 Unknown, 146 Unchecked, 0.6s Time] [2025-04-30 10:42:12,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-04-30 10:42:12,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 69. [2025-04-30 10:42:12,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 62 states have (on average 1.1774193548387097) internal successors, (73), 68 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:42:12,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2025-04-30 10:42:12,252 INFO L79 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 44 [2025-04-30 10:42:12,252 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:42:12,252 INFO L485 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2025-04-30 10:42:12,252 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 70 states, 70 states have (on average 1.6285714285714286) internal successors, (114), 70 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:42:12,252 INFO L278 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2025-04-30 10:42:12,252 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-04-30 10:42:12,252 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:42:12,252 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:42:12,263 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-04-30 10:42:12,453 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-04-30 10:42:12,453 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2025-04-30 10:42:12,454 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:42:12,454 INFO L85 PathProgramCache]: Analyzing trace with hash -2073412082, now seen corresponding path program 1 times [2025-04-30 10:42:12,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:42:12,454 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590701890] [2025-04-30 10:42:12,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:42:12,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:42:12,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-04-30 10:42:12,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-04-30 10:42:12,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:42:12,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:42:12,705 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-30 10:42:12,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:42:12,705 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590701890] [2025-04-30 10:42:12,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590701890] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:42:12,705 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [605183855] [2025-04-30 10:42:12,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:42:12,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:42:12,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:42:12,707 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) [2025-04-30 10:42:12,708 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-04-30 10:42:12,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-04-30 10:42:12,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-04-30 10:42:12,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:42:12,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:42:12,843 INFO L256 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 55 conjuncts are in the unsatisfiable core [2025-04-30 10:42:12,845 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:42:12,893 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2025-04-30 10:42:12,990 INFO L354 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 24 treesize of output 12 [2025-04-30 10:42:13,040 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-30 10:42:13,041 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:42:13,091 INFO L354 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 36 treesize of output 32 [2025-04-30 10:42:13,111 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-30 10:42:13,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [605183855] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:42:13,111 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:42:13,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 12] total 26 [2025-04-30 10:42:13,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84120647] [2025-04-30 10:42:13,112 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:42:13,112 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-04-30 10:42:13,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:42:13,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-04-30 10:42:13,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=570, Unknown=0, NotChecked=0, Total=650 [2025-04-30 10:42:13,113 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand has 26 states, 26 states have (on average 3.5) internal successors, (91), 26 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:42:13,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:42:13,339 INFO L93 Difference]: Finished difference Result 75 states and 79 transitions. [2025-04-30 10:42:13,339 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-30 10:42:13,339 INFO L79 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.5) internal successors, (91), 26 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2025-04-30 10:42:13,339 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:42:13,340 INFO L225 Difference]: With dead ends: 75 [2025-04-30 10:42:13,340 INFO L226 Difference]: Without dead ends: 75 [2025-04-30 10:42:13,340 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=179, Invalid=943, Unknown=0, NotChecked=0, Total=1122 [2025-04-30 10:42:13,341 INFO L437 NwaCegarLoop]: 45 mSDtfsCounter, 140 mSDsluCounter, 573 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 618 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:42:13,341 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 618 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:42:13,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-04-30 10:42:13,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73. [2025-04-30 10:42:13,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 66 states have (on average 1.1666666666666667) internal successors, (77), 72 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:42:13,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 77 transitions. [2025-04-30 10:42:13,343 INFO L79 Accepts]: Start accepts. Automaton has 73 states and 77 transitions. Word has length 50 [2025-04-30 10:42:13,343 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:42:13,343 INFO L485 AbstractCegarLoop]: Abstraction has 73 states and 77 transitions. [2025-04-30 10:42:13,343 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.5) internal successors, (91), 26 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:42:13,343 INFO L278 IsEmpty]: Start isEmpty. Operand 73 states and 77 transitions. [2025-04-30 10:42:13,343 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-04-30 10:42:13,343 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:42:13,343 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:42:13,351 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-04-30 10:42:13,545 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-04-30 10:42:13,545 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2025-04-30 10:42:13,546 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:42:13,546 INFO L85 PathProgramCache]: Analyzing trace with hash -2073372391, now seen corresponding path program 1 times [2025-04-30 10:42:13,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:42:13,546 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561707614] [2025-04-30 10:42:13,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:42:13,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:42:13,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-04-30 10:42:13,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-04-30 10:42:13,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:42:13,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:42:13,641 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-04-30 10:42:13,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:42:13,641 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561707614] [2025-04-30 10:42:13,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561707614] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:42:13,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:42:13,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-30 10:42:13,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888273733] [2025-04-30 10:42:13,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:42:13,642 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-30 10:42:13,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:42:13,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-30 10:42:13,642 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-04-30 10:42:13,642 INFO L87 Difference]: Start difference. First operand 73 states and 77 transitions. Second operand has 9 states, 8 states have (on average 4.75) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:42:13,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:42:13,754 INFO L93 Difference]: Finished difference Result 74 states and 80 transitions. [2025-04-30 10:42:13,754 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-30 10:42:13,754 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.75) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2025-04-30 10:42:13,754 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:42:13,755 INFO L225 Difference]: With dead ends: 74 [2025-04-30 10:42:13,755 INFO L226 Difference]: Without dead ends: 74 [2025-04-30 10:42:13,756 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-04-30 10:42:13,756 INFO L437 NwaCegarLoop]: 24 mSDtfsCounter, 15 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:42:13,756 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 138 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:42:13,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2025-04-30 10:42:13,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2025-04-30 10:42:13,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 68 states have (on average 1.1764705882352942) internal successors, (80), 73 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:42:13,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 80 transitions. [2025-04-30 10:42:13,757 INFO L79 Accepts]: Start accepts. Automaton has 74 states and 80 transitions. Word has length 50 [2025-04-30 10:42:13,757 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:42:13,757 INFO L485 AbstractCegarLoop]: Abstraction has 74 states and 80 transitions. [2025-04-30 10:42:13,757 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.75) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:42:13,757 INFO L278 IsEmpty]: Start isEmpty. Operand 74 states and 80 transitions. [2025-04-30 10:42:13,758 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-04-30 10:42:13,758 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:42:13,758 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:42:13,758 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-04-30 10:42:13,758 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2025-04-30 10:42:13,758 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:42:13,758 INFO L85 PathProgramCache]: Analyzing trace with hash -2073372390, now seen corresponding path program 1 times [2025-04-30 10:42:13,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:42:13,758 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384784873] [2025-04-30 10:42:13,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:42:13,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:42:13,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-04-30 10:42:13,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-04-30 10:42:13,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:42:13,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:42:13,900 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-04-30 10:42:13,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:42:13,900 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384784873] [2025-04-30 10:42:13,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384784873] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:42:13,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:42:13,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-30 10:42:13,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609758954] [2025-04-30 10:42:13,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:42:13,900 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-30 10:42:13,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:42:13,901 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-30 10:42:13,901 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-04-30 10:42:13,901 INFO L87 Difference]: Start difference. First operand 74 states and 80 transitions. Second operand has 9 states, 8 states have (on average 5.0) internal successors, (40), 9 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:42:14,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:42:14,018 INFO L93 Difference]: Finished difference Result 76 states and 81 transitions. [2025-04-30 10:42:14,018 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-30 10:42:14,018 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.0) internal successors, (40), 9 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2025-04-30 10:42:14,019 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:42:14,019 INFO L225 Difference]: With dead ends: 76 [2025-04-30 10:42:14,019 INFO L226 Difference]: Without dead ends: 76 [2025-04-30 10:42:14,019 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-04-30 10:42:14,019 INFO L437 NwaCegarLoop]: 27 mSDtfsCounter, 11 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:42:14,019 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 170 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:42:14,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-04-30 10:42:14,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2025-04-30 10:42:14,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 70 states have (on average 1.1571428571428573) internal successors, (81), 75 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:42:14,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 81 transitions. [2025-04-30 10:42:14,021 INFO L79 Accepts]: Start accepts. Automaton has 76 states and 81 transitions. Word has length 50 [2025-04-30 10:42:14,021 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:42:14,021 INFO L485 AbstractCegarLoop]: Abstraction has 76 states and 81 transitions. [2025-04-30 10:42:14,021 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.0) internal successors, (40), 9 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:42:14,021 INFO L278 IsEmpty]: Start isEmpty. Operand 76 states and 81 transitions. [2025-04-30 10:42:14,021 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-04-30 10:42:14,021 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:42:14,021 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:42:14,021 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-04-30 10:42:14,021 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2025-04-30 10:42:14,021 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:42:14,021 INFO L85 PathProgramCache]: Analyzing trace with hash 149977332, now seen corresponding path program 1 times [2025-04-30 10:42:14,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:42:14,022 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897568396] [2025-04-30 10:42:14,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:42:14,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:42:14,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-04-30 10:42:14,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-04-30 10:42:14,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:42:14,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:42:14,098 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-04-30 10:42:14,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:42:14,098 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897568396] [2025-04-30 10:42:14,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897568396] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:42:14,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:42:14,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-30 10:42:14,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102763010] [2025-04-30 10:42:14,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:42:14,098 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-30 10:42:14,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:42:14,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-30 10:42:14,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-04-30 10:42:14,099 INFO L87 Difference]: Start difference. First operand 76 states and 81 transitions. Second operand has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:42:14,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:42:14,182 INFO L93 Difference]: Finished difference Result 78 states and 83 transitions. [2025-04-30 10:42:14,182 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-30 10:42:14,183 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2025-04-30 10:42:14,183 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:42:14,183 INFO L225 Difference]: With dead ends: 78 [2025-04-30 10:42:14,183 INFO L226 Difference]: Without dead ends: 78 [2025-04-30 10:42:14,183 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-04-30 10:42:14,185 INFO L437 NwaCegarLoop]: 31 mSDtfsCounter, 15 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 216 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 [2025-04-30 10:42:14,185 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 216 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:42:14,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-04-30 10:42:14,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2025-04-30 10:42:14,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 70 states have (on average 1.1428571428571428) internal successors, (80), 75 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:42:14,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 80 transitions. [2025-04-30 10:42:14,186 INFO L79 Accepts]: Start accepts. Automaton has 76 states and 80 transitions. Word has length 51 [2025-04-30 10:42:14,186 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:42:14,186 INFO L485 AbstractCegarLoop]: Abstraction has 76 states and 80 transitions. [2025-04-30 10:42:14,186 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:42:14,187 INFO L278 IsEmpty]: Start isEmpty. Operand 76 states and 80 transitions. [2025-04-30 10:42:14,187 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-04-30 10:42:14,187 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:42:14,187 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:42:14,187 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-04-30 10:42:14,187 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2025-04-30 10:42:14,187 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:42:14,187 INFO L85 PathProgramCache]: Analyzing trace with hash -1912160833, now seen corresponding path program 1 times [2025-04-30 10:42:14,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:42:14,187 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121626439] [2025-04-30 10:42:14,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:42:14,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:42:14,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-04-30 10:42:14,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-04-30 10:42:14,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:42:14,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:42:14,284 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-04-30 10:42:14,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:42:14,284 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121626439] [2025-04-30 10:42:14,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121626439] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:42:14,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:42:14,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-30 10:42:14,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074700089] [2025-04-30 10:42:14,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:42:14,285 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-30 10:42:14,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:42:14,285 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-30 10:42:14,285 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-04-30 10:42:14,285 INFO L87 Difference]: Start difference. First operand 76 states and 80 transitions. Second operand has 9 states, 8 states have (on average 5.375) internal successors, (43), 9 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:42:14,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:42:14,379 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2025-04-30 10:42:14,380 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-30 10:42:14,380 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.375) internal successors, (43), 9 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2025-04-30 10:42:14,380 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:42:14,380 INFO L225 Difference]: With dead ends: 77 [2025-04-30 10:42:14,380 INFO L226 Difference]: Without dead ends: 77 [2025-04-30 10:42:14,380 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-04-30 10:42:14,381 INFO L437 NwaCegarLoop]: 31 mSDtfsCounter, 11 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:42:14,382 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 200 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:42:14,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-04-30 10:42:14,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2025-04-30 10:42:14,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 71 states have (on average 1.1408450704225352) internal successors, (81), 76 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:42:14,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 81 transitions. [2025-04-30 10:42:14,384 INFO L79 Accepts]: Start accepts. Automaton has 77 states and 81 transitions. Word has length 53 [2025-04-30 10:42:14,384 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:42:14,384 INFO L485 AbstractCegarLoop]: Abstraction has 77 states and 81 transitions. [2025-04-30 10:42:14,384 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.375) internal successors, (43), 9 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:42:14,384 INFO L278 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2025-04-30 10:42:14,384 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-04-30 10:42:14,384 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:42:14,384 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:42:14,385 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-04-30 10:42:14,386 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2025-04-30 10:42:14,386 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:42:14,386 INFO L85 PathProgramCache]: Analyzing trace with hash 1293379112, now seen corresponding path program 2 times [2025-04-30 10:42:14,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:42:14,386 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069741898] [2025-04-30 10:42:14,386 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:42:14,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:42:14,407 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 53 statements into 2 equivalence classes. [2025-04-30 10:42:14,413 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 53 of 53 statements. [2025-04-30 10:42:14,413 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:42:14,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:42:14,461 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-04-30 10:42:14,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:42:14,461 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069741898] [2025-04-30 10:42:14,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069741898] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:42:14,461 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1305618851] [2025-04-30 10:42:14,461 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:42:14,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:42:14,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:42:14,463 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) [2025-04-30 10:42:14,464 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-04-30 10:42:14,580 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 53 statements into 2 equivalence classes. [2025-04-30 10:42:14,607 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 53 of 53 statements. [2025-04-30 10:42:14,607 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:42:14,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:42:14,608 INFO L256 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-30 10:42:14,611 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:42:14,658 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-04-30 10:42:14,658 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:42:14,695 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-04-30 10:42:14,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1305618851] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:42:14,695 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:42:14,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2025-04-30 10:42:14,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39870174] [2025-04-30 10:42:14,695 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:42:14,695 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-30 10:42:14,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:42:14,696 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-30 10:42:14,696 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-04-30 10:42:14,696 INFO L87 Difference]: Start difference. First operand 77 states and 81 transitions. Second operand has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:42:14,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:42:14,716 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2025-04-30 10:42:14,716 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:42:14,716 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2025-04-30 10:42:14,716 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:42:14,716 INFO L225 Difference]: With dead ends: 66 [2025-04-30 10:42:14,716 INFO L226 Difference]: Without dead ends: 66 [2025-04-30 10:42:14,717 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 100 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2025-04-30 10:42:14,717 INFO L437 NwaCegarLoop]: 41 mSDtfsCounter, 48 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:42:14,717 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 125 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:42:14,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2025-04-30 10:42:14,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2025-04-30 10:42:14,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 61 states have (on average 1.1311475409836065) internal successors, (69), 65 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:42:14,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 69 transitions. [2025-04-30 10:42:14,718 INFO L79 Accepts]: Start accepts. Automaton has 66 states and 69 transitions. Word has length 53 [2025-04-30 10:42:14,718 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:42:14,718 INFO L485 AbstractCegarLoop]: Abstraction has 66 states and 69 transitions. [2025-04-30 10:42:14,718 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:42:14,718 INFO L278 IsEmpty]: Start isEmpty. Operand 66 states and 69 transitions. [2025-04-30 10:42:14,720 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-30 10:42:14,720 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:42:14,720 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:42:14,727 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-04-30 10:42:14,920 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-04-30 10:42:14,920 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2025-04-30 10:42:14,921 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:42:14,921 INFO L85 PathProgramCache]: Analyzing trace with hash -1032008226, now seen corresponding path program 1 times [2025-04-30 10:42:14,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:42:14,921 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522344021] [2025-04-30 10:42:14,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:42:14,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:42:14,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-30 10:42:14,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-30 10:42:14,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:42:14,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:42:15,536 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-04-30 10:42:15,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:42:15,536 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522344021] [2025-04-30 10:42:15,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522344021] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:42:15,536 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1254562588] [2025-04-30 10:42:15,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:42:15,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:42:15,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:42:15,538 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) [2025-04-30 10:42:15,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-04-30 10:42:15,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-30 10:42:15,679 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-30 10:42:15,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:42:15,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:42:15,681 INFO L256 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 71 conjuncts are in the unsatisfiable core [2025-04-30 10:42:15,683 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:42:15,693 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-30 10:42:15,693 INFO L354 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 [2025-04-30 10:42:15,748 INFO L354 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 15 treesize of output 1 [2025-04-30 10:42:15,885 INFO L325 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-04-30 10:42:15,885 INFO L354 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 [2025-04-30 10:42:15,922 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:42:15,922 INFO L354 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 33 treesize of output 17 [2025-04-30 10:42:16,007 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:42:16,007 INFO L354 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 27 treesize of output 21 [2025-04-30 10:42:16,103 INFO L325 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2025-04-30 10:42:16,103 INFO L354 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 13 [2025-04-30 10:42:16,105 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 9 proven. 11 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-30 10:42:16,105 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:42:16,404 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:42:16,405 INFO L354 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 45 treesize of output 49 [2025-04-30 10:42:16,436 WARN L849 $PredicateComparison]: unable to prove that (and (forall ((v_prenex_4 Int) (v_prenex_3 Int) (v_prenex_2 (Array Int Int))) (or (= (select (store (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_prenex_2) |c_ULTIMATE.start_main_~s~0#1.base|) v_prenex_3 v_prenex_4) 4) |c_ULTIMATE.start_sll_update_at_~head#1.base|) (< |c_ULTIMATE.start_main_~s~0#1.offset| v_prenex_3))) (forall ((v_ArrVal_1779 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_60| Int) (v_ArrVal_1781 Int)) (or (not (= (select (store (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1779) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_60| v_ArrVal_1781) 4) |c_ULTIMATE.start_main_~s~0#1.base|)) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_60|)))) is different from false [2025-04-30 10:42:16,547 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_sll_update_at_~head#1.offset| 4)))) (and (forall ((v_prenex_4 Int) (v_prenex_3 Int) (v_prenex_2 (Array Int Int))) (or (= .cse0 (select (store (select (store |c_#memory_$Pointer$#1.base| .cse0 v_prenex_2) |c_ULTIMATE.start_main_~s~0#1.base|) v_prenex_3 v_prenex_4) 4)) (< |c_ULTIMATE.start_main_~s~0#1.offset| v_prenex_3))) (forall ((v_ArrVal_1779 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_60| Int) (v_ArrVal_1781 Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_60|) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (store (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1779) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_60| v_ArrVal_1781) 4))))))) is different from false [2025-04-30 10:42:16,653 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_#res#1.base|) (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4)))) (and (forall ((v_ArrVal_1779 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_60| Int) (v_ArrVal_1781 Int)) (or (not (= (select (store (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1779) |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_60| v_ArrVal_1781) 4) |c_ULTIMATE.start_sll_create_#res#1.base|)) (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_60|))) (forall ((v_prenex_4 Int) (v_prenex_3 Int) (v_prenex_2 (Array Int Int))) (or (< |c_ULTIMATE.start_sll_create_#res#1.offset| v_prenex_3) (= (select (store (select (store |c_#memory_$Pointer$#1.base| .cse0 v_prenex_2) |c_ULTIMATE.start_sll_create_#res#1.base|) v_prenex_3 v_prenex_4) 4) .cse0))))) is different from false [2025-04-30 10:42:16,743 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4)))) (and (forall ((v_prenex_4 Int) (v_prenex_3 Int) (v_prenex_2 (Array Int Int))) (or (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| v_prenex_3) (= (select (store (select (store |c_#memory_$Pointer$#1.base| .cse0 v_prenex_2) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) v_prenex_3 v_prenex_4) 4) .cse0))) (forall ((v_ArrVal_1779 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_60| Int) (v_ArrVal_1781 Int)) (or (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_60|) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (select (store (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1779) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_60| v_ArrVal_1781) 4))))))) is different from false [2025-04-30 10:42:16,748 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:42:16,749 INFO L354 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 23 treesize of output 24 [2025-04-30 10:42:16,756 INFO L354 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 34 [2025-04-30 10:42:16,759 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2025-04-30 10:42:16,765 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:42:16,765 INFO L354 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 32 treesize of output 34 [2025-04-30 10:42:16,789 INFO L325 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-04-30 10:42:16,789 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 1 [2025-04-30 10:42:16,854 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 10 trivial. 5 not checked. [2025-04-30 10:42:16,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1254562588] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:42:16,854 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:42:16,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 21] total 50 [2025-04-30 10:42:16,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665410912] [2025-04-30 10:42:16,858 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:42:16,859 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2025-04-30 10:42:16,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:42:16,859 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2025-04-30 10:42:16,860 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=1963, Unknown=45, NotChecked=372, Total=2550 [2025-04-30 10:42:16,860 INFO L87 Difference]: Start difference. First operand 66 states and 69 transitions. Second operand has 51 states, 50 states have (on average 2.22) internal successors, (111), 51 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:42:17,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:42:17,677 INFO L93 Difference]: Finished difference Result 75 states and 80 transitions. [2025-04-30 10:42:17,677 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-30 10:42:17,677 INFO L79 Accepts]: Start accepts. Automaton has has 51 states, 50 states have (on average 2.22) internal successors, (111), 51 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2025-04-30 10:42:17,677 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:42:17,678 INFO L225 Difference]: With dead ends: 75 [2025-04-30 10:42:17,678 INFO L226 Difference]: Without dead ends: 75 [2025-04-30 10:42:17,679 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 80 SyntacticMatches, 7 SemanticMatches, 62 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 951 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=289, Invalid=3217, Unknown=50, NotChecked=476, Total=4032 [2025-04-30 10:42:17,679 INFO L437 NwaCegarLoop]: 18 mSDtfsCounter, 21 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 1361 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 1610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 241 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-30 10:42:17,679 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 432 Invalid, 1610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1361 Invalid, 0 Unknown, 241 Unchecked, 0.5s Time] [2025-04-30 10:42:17,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-04-30 10:42:17,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 69. [2025-04-30 10:42:17,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 64 states have (on average 1.15625) internal successors, (74), 68 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:42:17,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 74 transitions. [2025-04-30 10:42:17,680 INFO L79 Accepts]: Start accepts. Automaton has 69 states and 74 transitions. Word has length 56 [2025-04-30 10:42:17,680 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:42:17,680 INFO L485 AbstractCegarLoop]: Abstraction has 69 states and 74 transitions. [2025-04-30 10:42:17,680 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 50 states have (on average 2.22) internal successors, (111), 51 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:42:17,680 INFO L278 IsEmpty]: Start isEmpty. Operand 69 states and 74 transitions. [2025-04-30 10:42:17,681 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-30 10:42:17,681 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:42:17,681 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:42:17,688 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-04-30 10:42:17,881 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-04-30 10:42:17,881 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2025-04-30 10:42:17,881 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:42:17,882 INFO L85 PathProgramCache]: Analyzing trace with hash -1032008225, now seen corresponding path program 1 times [2025-04-30 10:42:17,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:42:17,882 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749377925] [2025-04-30 10:42:17,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:42:17,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:42:17,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-30 10:42:17,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-30 10:42:17,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:42:17,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:42:18,631 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-30 10:42:18,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:42:18,631 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749377925] [2025-04-30 10:42:18,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749377925] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:42:18,631 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [48471947] [2025-04-30 10:42:18,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:42:18,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:42:18,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:42:18,633 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) [2025-04-30 10:42:18,634 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-04-30 10:42:18,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-30 10:42:18,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-30 10:42:18,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:42:18,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:42:18,786 INFO L256 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 98 conjuncts are in the unsatisfiable core [2025-04-30 10:42:18,788 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:42:18,792 INFO L354 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 [2025-04-30 10:42:18,859 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-30 10:42:18,859 INFO L354 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 [2025-04-30 10:42:18,862 INFO L354 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 [2025-04-30 10:42:18,886 INFO L354 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 [2025-04-30 10:42:18,891 INFO L354 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 15 treesize of output 1 [2025-04-30 10:42:19,005 INFO L325 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-04-30 10:42:19,006 INFO L354 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 50 treesize of output 45 [2025-04-30 10:42:19,010 INFO L354 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 [2025-04-30 10:42:19,063 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:42:19,064 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-04-30 10:42:19,067 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:42:19,067 INFO L354 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 33 treesize of output 17 [2025-04-30 10:42:19,174 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:42:19,174 INFO L354 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 15 [2025-04-30 10:42:19,180 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:42:19,180 INFO L354 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 27 treesize of output 21 [2025-04-30 10:42:19,248 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-30 10:42:19,248 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:42:19,460 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base|))) (and (forall ((v_ArrVal_1896 (Array Int Int))) (or (forall ((v_ArrVal_1897 Int)) (<= (+ 8 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1896) |c_ULTIMATE.start_main_~s~0#1.base|) 4)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_1897)) |c_ULTIMATE.start_main_~s~0#1.base|) 4)))) (not (= v_ArrVal_1896 (store .cse0 |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select v_ArrVal_1896 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)))))) (forall ((v_ArrVal_1896 (Array Int Int))) (or (not (= v_ArrVal_1896 (store .cse0 |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select v_ArrVal_1896 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)))) (< 0 (+ 5 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1896) |c_ULTIMATE.start_main_~s~0#1.base|) 4))))))) is different from false [2025-04-30 10:42:19,588 WARN L849 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1894 (Array Int Int)) (v_ArrVal_1893 (Array Int Int)) (v_ArrVal_1897 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_67| Int) (v_DerPreprocessor_4 Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_67|) (< (+ 7 (select (store (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1893) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_67| v_DerPreprocessor_4) 4)) (select |c_#length| (select (store (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1894) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_67| v_ArrVal_1897) 4))))) (forall ((v_ArrVal_1893 (Array Int Int)) (v_DerPreprocessor_5 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_67| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_67|) (< 0 (+ 5 (select (store (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1893) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_67| v_DerPreprocessor_5) 4)))))) is different from false [2025-04-30 10:42:19,721 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_sll_update_at_~head#1.offset| 4)))) (and (forall ((v_ArrVal_1893 (Array Int Int)) (v_DerPreprocessor_5 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_67| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_67|) (< 0 (+ 5 (select (store (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1893) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_67| v_DerPreprocessor_5) 4))))) (forall ((v_ArrVal_1894 (Array Int Int)) (v_ArrVal_1893 (Array Int Int)) (v_ArrVal_1897 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_67| Int) (v_DerPreprocessor_4 Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_67|) (< (+ (select (store (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1893) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_67| v_DerPreprocessor_4) 4) 7) (select |c_#length| (select (store (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1894) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_67| v_ArrVal_1897) 4))))))) is different from false [2025-04-30 10:42:19,748 WARN L849 $PredicateComparison]: unable to prove that (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| 4)))) (and (forall ((v_ArrVal_1893 (Array Int Int)) (v_DerPreprocessor_5 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_67| Int)) (or (< 0 (+ 5 (select (store (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1893) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_67| v_DerPreprocessor_5) 4))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_67|))) (forall ((v_ArrVal_1894 (Array Int Int)) (v_ArrVal_1893 (Array Int Int)) (v_ArrVal_1897 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_67| Int) (v_DerPreprocessor_4 Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_67|) (< (+ (select (store (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1893) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_67| v_DerPreprocessor_4) 4) 7) (select |c_#length| (select (store (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1894) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_67| v_ArrVal_1897) 4))))))) is different from false [2025-04-30 10:42:19,761 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_#res#1.base|) (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4)))) (and (forall ((v_ArrVal_1893 (Array Int Int)) (v_DerPreprocessor_5 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_67| Int)) (or (< 0 (+ 5 (select (store (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1893) |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_67| v_DerPreprocessor_5) 4))) (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_67|))) (forall ((v_ArrVal_1894 (Array Int Int)) (v_ArrVal_1893 (Array Int Int)) (v_ArrVal_1897 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_67| Int) (v_DerPreprocessor_4 Int)) (or (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_67|) (< (+ 7 (select (store (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1893) |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_67| v_DerPreprocessor_4) 4)) (select |c_#length| (select (store (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1894) |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_67| v_ArrVal_1897) 4))))))) is different from false [2025-04-30 10:42:19,870 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4)))) (and (forall ((v_ArrVal_1893 (Array Int Int)) (v_DerPreprocessor_5 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_67| Int)) (or (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_67|) (< 0 (+ 5 (select (store (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1893) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_67| v_DerPreprocessor_5) 4))))) (forall ((v_ArrVal_1894 (Array Int Int)) (v_ArrVal_1893 (Array Int Int)) (v_ArrVal_1897 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_67| Int) (v_DerPreprocessor_4 Int)) (or (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_67|) (< (+ 7 (select (store (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1893) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_67| v_DerPreprocessor_4) 4)) (select |c_#length| (select (store (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1894) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_67| v_ArrVal_1897) 4))))))) is different from false [2025-04-30 10:42:19,877 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:42:19,877 INFO L354 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 47 treesize of output 48 [2025-04-30 10:42:19,884 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:42:19,884 INFO L354 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 37 treesize of output 38 [2025-04-30 10:42:19,886 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 62 [2025-04-30 10:42:19,888 INFO L354 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 112 treesize of output 106 [2025-04-30 10:42:19,895 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:42:19,895 INFO L354 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 50 treesize of output 52 [2025-04-30 10:42:19,903 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:42:19,903 INFO L354 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 57 treesize of output 59 [2025-04-30 10:42:19,909 INFO L354 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 40 treesize of output 38 [2025-04-30 10:42:19,913 INFO L354 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 47 treesize of output 45 [2025-04-30 10:42:19,946 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:42:19,946 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2025-04-30 10:42:19,948 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:42:19,949 INFO L354 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 21 treesize of output 17 [2025-04-30 10:42:19,950 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:42:19,951 INFO L354 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 14 treesize of output 10 [2025-04-30 10:42:20,186 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:42:20,186 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 52 [2025-04-30 10:42:20,299 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 10 trivial. 7 not checked. [2025-04-30 10:42:20,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [48471947] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:42:20,299 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:42:20,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 24] total 56 [2025-04-30 10:42:20,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572383448] [2025-04-30 10:42:20,299 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:42:20,299 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2025-04-30 10:42:20,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:42:20,300 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2025-04-30 10:42:20,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=2343, Unknown=43, NotChecked=618, Total=3192 [2025-04-30 10:42:20,301 INFO L87 Difference]: Start difference. First operand 69 states and 74 transitions. Second operand has 57 states, 56 states have (on average 2.2857142857142856) internal successors, (128), 57 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:42:21,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:42:21,212 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2025-04-30 10:42:21,212 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-30 10:42:21,212 INFO L79 Accepts]: Start accepts. Automaton has has 57 states, 56 states have (on average 2.2857142857142856) internal successors, (128), 57 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2025-04-30 10:42:21,213 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:42:21,213 INFO L225 Difference]: With dead ends: 77 [2025-04-30 10:42:21,213 INFO L226 Difference]: Without dead ends: 77 [2025-04-30 10:42:21,214 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 78 SyntacticMatches, 7 SemanticMatches, 67 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 767 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=309, Invalid=3577, Unknown=44, NotChecked=762, Total=4692 [2025-04-30 10:42:21,214 INFO L437 NwaCegarLoop]: 19 mSDtfsCounter, 40 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 1166 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 1547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 368 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-30 10:42:21,214 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 478 Invalid, 1547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1166 Invalid, 0 Unknown, 368 Unchecked, 0.5s Time] [2025-04-30 10:42:21,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-04-30 10:42:21,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 71. [2025-04-30 10:42:21,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 66 states have (on average 1.1363636363636365) internal successors, (75), 70 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:42:21,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2025-04-30 10:42:21,216 INFO L79 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 56 [2025-04-30 10:42:21,216 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:42:21,216 INFO L485 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2025-04-30 10:42:21,216 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 56 states have (on average 2.2857142857142856) internal successors, (128), 57 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:42:21,216 INFO L278 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2025-04-30 10:42:21,216 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-04-30 10:42:21,216 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:42:21,216 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:42:21,223 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-04-30 10:42:21,416 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:42:21,417 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2025-04-30 10:42:21,417 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:42:21,417 INFO L85 PathProgramCache]: Analyzing trace with hash -1927471921, now seen corresponding path program 1 times [2025-04-30 10:42:21,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:42:21,417 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174688163] [2025-04-30 10:42:21,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:42:21,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:42:21,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-04-30 10:42:21,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-04-30 10:42:21,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:42:21,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:42:22,072 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 17 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-30 10:42:22,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:42:22,073 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174688163] [2025-04-30 10:42:22,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174688163] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:42:22,073 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1087963979] [2025-04-30 10:42:22,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:42:22,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:42:22,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:42:22,074 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) [2025-04-30 10:42:22,076 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-04-30 10:42:22,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-04-30 10:42:22,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-04-30 10:42:22,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:42:22,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:42:22,227 INFO L256 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 56 conjuncts are in the unsatisfiable core [2025-04-30 10:42:22,229 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:42:22,245 INFO L354 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 [2025-04-30 10:42:22,252 INFO L354 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 [2025-04-30 10:42:22,489 INFO L325 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-04-30 10:42:22,489 INFO L354 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 [2025-04-30 10:42:22,563 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:42:22,563 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 16 [2025-04-30 10:42:22,616 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-04-30 10:42:22,616 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:42:22,739 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:42:22,740 INFO L354 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 21 treesize of output 22 [2025-04-30 10:42:23,104 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-30 10:42:23,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1087963979] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:42:23,105 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:42:23,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 17, 18] total 51 [2025-04-30 10:42:23,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091311622] [2025-04-30 10:42:23,105 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:42:23,105 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2025-04-30 10:42:23,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:42:23,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2025-04-30 10:42:23,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=2359, Unknown=0, NotChecked=0, Total=2550 [2025-04-30 10:42:23,106 INFO L87 Difference]: Start difference. First operand 71 states and 75 transitions. Second operand has 51 states, 51 states have (on average 2.7254901960784315) internal successors, (139), 51 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:42:24,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:42:24,066 INFO L93 Difference]: Finished difference Result 77 states and 80 transitions. [2025-04-30 10:42:24,066 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-04-30 10:42:24,066 INFO L79 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 2.7254901960784315) internal successors, (139), 51 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2025-04-30 10:42:24,066 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:42:24,066 INFO L225 Difference]: With dead ends: 77 [2025-04-30 10:42:24,066 INFO L226 Difference]: Without dead ends: 77 [2025-04-30 10:42:24,068 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 89 SyntacticMatches, 1 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 853 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=522, Invalid=5330, Unknown=0, NotChecked=0, Total=5852 [2025-04-30 10:42:24,068 INFO L437 NwaCegarLoop]: 16 mSDtfsCounter, 128 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 1327 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 1344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-30 10:42:24,068 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 465 Invalid, 1344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1327 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-30 10:42:24,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-04-30 10:42:24,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 71. [2025-04-30 10:42:24,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 66 states have (on average 1.121212121212121) internal successors, (74), 70 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:42:24,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 74 transitions. [2025-04-30 10:42:24,070 INFO L79 Accepts]: Start accepts. Automaton has 71 states and 74 transitions. Word has length 57 [2025-04-30 10:42:24,070 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:42:24,070 INFO L485 AbstractCegarLoop]: Abstraction has 71 states and 74 transitions. [2025-04-30 10:42:24,070 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 2.7254901960784315) internal successors, (139), 51 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:42:24,070 INFO L278 IsEmpty]: Start isEmpty. Operand 71 states and 74 transitions. [2025-04-30 10:42:24,071 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-04-30 10:42:24,071 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:42:24,071 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:42:24,077 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-04-30 10:42:24,271 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:42:24,272 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2025-04-30 10:42:24,272 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:42:24,272 INFO L85 PathProgramCache]: Analyzing trace with hash -1181100326, now seen corresponding path program 1 times [2025-04-30 10:42:24,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:42:24,272 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260481117] [2025-04-30 10:42:24,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:42:24,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:42:24,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-04-30 10:42:24,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-04-30 10:42:24,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:42:24,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:42:24,960 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-30 10:42:24,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:42:24,960 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260481117] [2025-04-30 10:42:24,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260481117] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:42:24,960 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1312343832] [2025-04-30 10:42:24,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:42:24,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:42:24,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:42:24,962 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:42:24,963 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-04-30 10:42:25,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-04-30 10:42:25,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-04-30 10:42:25,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:42:25,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:42:25,128 INFO L256 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 71 conjuncts are in the unsatisfiable core [2025-04-30 10:42:25,130 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:42:25,131 INFO L354 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 [2025-04-30 10:42:25,180 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-30 10:42:25,180 INFO L354 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 [2025-04-30 10:42:25,204 INFO L354 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 15 treesize of output 1 [2025-04-30 10:42:25,318 INFO L325 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-04-30 10:42:25,318 INFO L354 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 [2025-04-30 10:42:25,361 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:42:25,361 INFO L354 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 33 treesize of output 17 [2025-04-30 10:42:25,439 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:42:25,439 INFO L354 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 27 treesize of output 21 [2025-04-30 10:42:25,486 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-04-30 10:42:25,487 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:42:25,742 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2114 (Array Int Int)) (v_ArrVal_2115 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_79| Int)) (or (< (select (store (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_2114) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_79| v_ArrVal_2115) 4) |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_79|))) is different from false [2025-04-30 10:42:25,749 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2114 (Array Int Int)) (v_ArrVal_2115 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_79| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_79|) (< (select (store (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_sll_update_at_~head#1.offset| 4)) v_ArrVal_2114) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_79| v_ArrVal_2115) 4) |c_#StackHeapBarrier|))) is different from false [2025-04-30 10:42:25,758 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2114 (Array Int Int)) (v_ArrVal_2115 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_79| Int)) (or (< (select (store (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_2114) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_79| v_ArrVal_2115) 4) |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_79|))) is different from false [2025-04-30 10:42:25,764 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2114 (Array Int Int)) (v_ArrVal_2115 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_79| Int)) (or (< (select (store (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_#res#1.base|) (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4)) v_ArrVal_2114) |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_79| v_ArrVal_2115) 4) |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_79|))) is different from false [2025-04-30 10:42:25,770 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2114 (Array Int Int)) (v_ArrVal_2115 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_79| Int)) (or (< (select (store (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) v_ArrVal_2114) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_79| v_ArrVal_2115) 4) |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_79|))) is different from false [2025-04-30 10:42:25,775 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2114 (Array Int Int)) (v_ArrVal_2115 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_79| Int)) (or (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_79|) (< (select (store (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4)) v_ArrVal_2114) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_79| v_ArrVal_2115) 4) |c_#StackHeapBarrier|))) is different from false [2025-04-30 10:42:25,779 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:42:25,779 INFO L354 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 23 treesize of output 24 [2025-04-30 10:42:25,783 INFO L354 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 34 [2025-04-30 10:42:25,789 INFO L354 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 26 treesize of output 24 [2025-04-30 10:42:25,795 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:42:25,795 INFO L354 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 36 treesize of output 38 [2025-04-30 10:42:25,951 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 10 trivial. 6 not checked. [2025-04-30 10:42:25,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1312343832] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:42:25,951 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:42:25,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 22, 23] total 47 [2025-04-30 10:42:25,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909849681] [2025-04-30 10:42:25,951 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:42:25,952 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-04-30 10:42:25,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:42:25,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-04-30 10:42:25,952 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=1565, Unknown=26, NotChecked=510, Total=2256 [2025-04-30 10:42:25,952 INFO L87 Difference]: Start difference. First operand 71 states and 74 transitions. Second operand has 48 states, 47 states have (on average 2.5319148936170213) internal successors, (119), 48 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:42:26,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:42:26,727 INFO L93 Difference]: Finished difference Result 78 states and 81 transitions. [2025-04-30 10:42:26,727 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-30 10:42:26,727 INFO L79 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 2.5319148936170213) internal successors, (119), 48 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2025-04-30 10:42:26,727 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:42:26,728 INFO L225 Difference]: With dead ends: 78 [2025-04-30 10:42:26,728 INFO L226 Difference]: Without dead ends: 78 [2025-04-30 10:42:26,728 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 93 SyntacticMatches, 7 SemanticMatches, 60 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 556 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=265, Invalid=2811, Unknown=28, NotChecked=678, Total=3782 [2025-04-30 10:42:26,729 INFO L437 NwaCegarLoop]: 25 mSDtfsCounter, 33 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 1087 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 1470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1087 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 376 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-30 10:42:26,729 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 529 Invalid, 1470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1087 Invalid, 0 Unknown, 376 Unchecked, 0.4s Time] [2025-04-30 10:42:26,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-04-30 10:42:26,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 72. [2025-04-30 10:42:26,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 67 states have (on average 1.1194029850746268) internal successors, (75), 71 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:42:26,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 75 transitions. [2025-04-30 10:42:26,731 INFO L79 Accepts]: Start accepts. Automaton has 72 states and 75 transitions. Word has length 59 [2025-04-30 10:42:26,731 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:42:26,731 INFO L485 AbstractCegarLoop]: Abstraction has 72 states and 75 transitions. [2025-04-30 10:42:26,731 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 2.5319148936170213) internal successors, (119), 48 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:42:26,732 INFO L278 IsEmpty]: Start isEmpty. Operand 72 states and 75 transitions. [2025-04-30 10:42:26,732 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-04-30 10:42:26,732 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:42:26,732 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:42:26,738 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-04-30 10:42:26,932 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:42:26,932 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2025-04-30 10:42:26,933 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:42:26,933 INFO L85 PathProgramCache]: Analyzing trace with hash -1787602205, now seen corresponding path program 2 times [2025-04-30 10:42:26,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:42:26,933 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139068231] [2025-04-30 10:42:26,933 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:42:26,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:42:26,946 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 62 statements into 2 equivalence classes. [2025-04-30 10:42:26,969 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 62 of 62 statements. [2025-04-30 10:42:26,969 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:42:26,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:42:28,237 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 28 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-04-30 10:42:28,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:42:28,238 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139068231] [2025-04-30 10:42:28,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139068231] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:42:28,238 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2099252951] [2025-04-30 10:42:28,238 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:42:28,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:42:28,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:42:28,240 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:42:28,240 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-04-30 10:42:28,376 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 62 statements into 2 equivalence classes. [2025-04-30 10:42:28,412 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 62 of 62 statements. [2025-04-30 10:42:28,413 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:42:28,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:42:28,415 INFO L256 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 116 conjuncts are in the unsatisfiable core [2025-04-30 10:42:28,417 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:42:28,441 INFO L354 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 [2025-04-30 10:42:28,444 INFO L354 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 [2025-04-30 10:42:28,478 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-30 10:42:28,478 INFO L354 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 [2025-04-30 10:42:28,515 INFO L354 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 [2025-04-30 10:42:28,521 INFO L354 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 [2025-04-30 10:42:28,526 INFO L354 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 [2025-04-30 10:42:28,531 INFO L354 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 [2025-04-30 10:42:28,598 INFO L354 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 27 treesize of output 15 [2025-04-30 10:42:28,602 INFO L354 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 27 treesize of output 15 [2025-04-30 10:42:28,888 INFO L325 Elim1Store]: treesize reduction 92, result has 35.2 percent of original size [2025-04-30 10:42:28,889 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 97 treesize of output 96 [2025-04-30 10:42:28,938 INFO L325 Elim1Store]: treesize reduction 64, result has 47.5 percent of original size [2025-04-30 10:42:28,939 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 39 treesize of output 67 [2025-04-30 10:42:29,290 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:42:29,350 INFO L325 Elim1Store]: treesize reduction 104, result has 32.5 percent of original size [2025-04-30 10:42:29,350 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 128 treesize of output 138 [2025-04-30 10:42:29,398 INFO L325 Elim1Store]: treesize reduction 32, result has 52.2 percent of original size [2025-04-30 10:42:29,398 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 97 treesize of output 111 [2025-04-30 10:42:29,620 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-04-30 10:42:29,634 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-30 10:42:29,634 INFO L354 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 13 treesize of output 11 [2025-04-30 10:42:29,644 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-04-30 10:42:29,690 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-30 10:42:29,690 INFO L354 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 13 treesize of output 11 [2025-04-30 10:42:32,461 INFO L354 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 [2025-04-30 10:42:32,557 INFO L325 Elim1Store]: treesize reduction 21, result has 27.6 percent of original size [2025-04-30 10:42:32,558 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 43 [2025-04-30 10:42:32,569 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:42:32,569 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 15 [2025-04-30 10:42:32,605 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 26 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-30 10:42:32,606 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:42:32,676 INFO L354 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 10 treesize of output 8 [2025-04-30 10:42:33,570 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|) 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base|) 4)) (.cse3 (select |c_#memory_$Pointer$#1.base| .cse1))) (and (forall ((v_ArrVal_2234 Int) (v_ArrVal_2235 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_89| Int)) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#1.base| .cse1 (store .cse3 |v_ULTIMATE.start_sll_update_at_~head#1.offset_89| v_ArrVal_2234)) |c_ULTIMATE.start_main_~s~0#1.base|) 4))) (or (< .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_89|) (= (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_2235) .cse2) 4) 0) (not (= (store (select |c_#memory_$Pointer$#1.offset| .cse1) |v_ULTIMATE.start_sll_update_at_~head#1.offset_89| (select v_ArrVal_2235 |v_ULTIMATE.start_sll_update_at_~head#1.offset_89|)) v_ArrVal_2235)) (= .cse2 |c_ULTIMATE.start_main_~s~0#1.base|)))) (forall ((v_ArrVal_2234 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_89| Int)) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| .cse1 (store .cse3 |v_ULTIMATE.start_sll_update_at_~head#1.offset_89| v_ArrVal_2234)))) (let ((.cse5 (select (select .cse4 |c_ULTIMATE.start_main_~s~0#1.base|) 4))) (or (< .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_89|) (= (select (select .cse4 .cse5) 4) 0) (= .cse5 |c_ULTIMATE.start_main_~s~0#1.base|)))))))) is different from false [2025-04-30 10:42:33,596 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_#res#1.base|) 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_#res#1.base|) 4)) (.cse4 (select |c_#memory_$Pointer$#1.base| .cse3))) (and (forall ((v_ArrVal_2234 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_89| Int)) (let ((.cse0 (store |c_#memory_$Pointer$#1.base| .cse3 (store .cse4 |v_ULTIMATE.start_sll_update_at_~head#1.offset_89| v_ArrVal_2234)))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_sll_create_#res#1.base|) 4))) (or (= (select (select .cse0 .cse1) 4) 0) (= .cse1 |c_ULTIMATE.start_sll_create_#res#1.base|) (< .cse2 |v_ULTIMATE.start_sll_update_at_~head#1.offset_89|))))) (forall ((v_ArrVal_2234 Int) (v_ArrVal_2235 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_89| Int)) (let ((.cse5 (select (select (store |c_#memory_$Pointer$#1.base| .cse3 (store .cse4 |v_ULTIMATE.start_sll_update_at_~head#1.offset_89| v_ArrVal_2234)) |c_ULTIMATE.start_sll_create_#res#1.base|) 4))) (or (not (= (store (select |c_#memory_$Pointer$#1.offset| .cse3) |v_ULTIMATE.start_sll_update_at_~head#1.offset_89| (select v_ArrVal_2235 |v_ULTIMATE.start_sll_update_at_~head#1.offset_89|)) v_ArrVal_2235)) (= (select (select (store |c_#memory_$Pointer$#1.offset| .cse3 v_ArrVal_2235) .cse5) 4) 0) (= .cse5 |c_ULTIMATE.start_sll_create_#res#1.base|) (< .cse2 |v_ULTIMATE.start_sll_update_at_~head#1.offset_89|))))))) is different from false [2025-04-30 10:42:33,615 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4)) (.cse3 (select |c_#memory_$Pointer$#1.base| .cse0))) (and (forall ((v_ArrVal_2234 Int) (v_ArrVal_2235 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_89| Int)) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#1.base| .cse0 (store .cse3 |v_ULTIMATE.start_sll_update_at_~head#1.offset_89| v_ArrVal_2234)) |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))) (or (not (= v_ArrVal_2235 (store (select |c_#memory_$Pointer$#1.offset| .cse0) |v_ULTIMATE.start_sll_update_at_~head#1.offset_89| (select v_ArrVal_2235 |v_ULTIMATE.start_sll_update_at_~head#1.offset_89|)))) (= (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2235) .cse1) 4) 0) (= |c_ULTIMATE.start_sll_create_~head~0#1.base| .cse1) (< .cse2 |v_ULTIMATE.start_sll_update_at_~head#1.offset_89|)))) (forall ((v_ArrVal_2234 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_89| Int)) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| .cse0 (store .cse3 |v_ULTIMATE.start_sll_update_at_~head#1.offset_89| v_ArrVal_2234)))) (let ((.cse5 (select (select .cse4 |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))) (or (= (select (select .cse4 .cse5) 4) 0) (= |c_ULTIMATE.start_sll_create_~head~0#1.base| .cse5) (< .cse2 |v_ULTIMATE.start_sll_update_at_~head#1.offset_89|)))))))) is different from false [2025-04-30 10:42:33,636 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4)) (.cse3 (select |c_#memory_$Pointer$#1.base| .cse0))) (and (forall ((v_ArrVal_2234 Int) (v_ArrVal_2235 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_89| Int)) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#1.base| .cse0 (store .cse3 |v_ULTIMATE.start_sll_update_at_~head#1.offset_89| v_ArrVal_2234)) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4))) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2235) .cse1) 4) 0) (< .cse2 |v_ULTIMATE.start_sll_update_at_~head#1.offset_89|) (not (= v_ArrVal_2235 (store (select |c_#memory_$Pointer$#1.offset| .cse0) |v_ULTIMATE.start_sll_update_at_~head#1.offset_89| (select v_ArrVal_2235 |v_ULTIMATE.start_sll_update_at_~head#1.offset_89|)))) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse1)))) (forall ((v_ArrVal_2234 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_89| Int)) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| .cse0 (store .cse3 |v_ULTIMATE.start_sll_update_at_~head#1.offset_89| v_ArrVal_2234)))) (let ((.cse5 (select (select .cse4 |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4))) (or (< .cse2 |v_ULTIMATE.start_sll_update_at_~head#1.offset_89|) (= (select (select .cse4 .cse5) 4) 0) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse5)))))))) is different from false [2025-04-30 10:42:33,664 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse9 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4))) (let ((.cse10 (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse9 |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (let ((.cse5 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse10)) (.cse1 (select .cse10 4)) (.cse4 (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse9 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (let ((.cse3 (select .cse4 4)) (.cse6 (select .cse5 .cse1))) (and (forall ((v_ArrVal_2234 Int) (v_ArrVal_2235 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_89| Int)) (let ((.cse2 (select (select (store .cse5 .cse1 (store .cse6 |v_ULTIMATE.start_sll_update_at_~head#1.offset_89| v_ArrVal_2234)) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4)) (.cse0 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse4))) (or (= (select (select (store .cse0 .cse1 v_ArrVal_2235) .cse2) 4) 0) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse2) (not (= (store (select .cse0 .cse1) |v_ULTIMATE.start_sll_update_at_~head#1.offset_89| (select v_ArrVal_2235 |v_ULTIMATE.start_sll_update_at_~head#1.offset_89|)) v_ArrVal_2235)) (< .cse3 |v_ULTIMATE.start_sll_update_at_~head#1.offset_89|)))) (forall ((v_ArrVal_2234 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_89| Int)) (let ((.cse8 (store .cse5 .cse1 (store .cse6 |v_ULTIMATE.start_sll_update_at_~head#1.offset_89| v_ArrVal_2234)))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4))) (or (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse7) (= (select (select .cse8 .cse7) 4) 0) (< .cse3 |v_ULTIMATE.start_sll_update_at_~head#1.offset_89|)))))))))) is different from false [2025-04-30 10:42:33,697 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse9 (+ |c_ULTIMATE.start_node_create_#res#1.offset| 4))) (let ((.cse10 (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_#res#1.base|) .cse9 |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_#res#1.base| .cse10)) (.cse2 (select .cse10 4)) (.cse6 (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_node_create_#res#1.base|) .cse9 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (let ((.cse0 (select .cse6 4)) (.cse5 (select .cse4 .cse2))) (and (forall ((v_ArrVal_2234 Int) (v_ArrVal_2235 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_89| Int)) (let ((.cse1 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_node_create_#res#1.base| .cse6)) (.cse3 (select (select (store .cse4 .cse2 (store .cse5 |v_ULTIMATE.start_sll_update_at_~head#1.offset_89| v_ArrVal_2234)) |c_ULTIMATE.start_node_create_#res#1.base|) 4))) (or (< .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_89|) (not (= (store (select .cse1 .cse2) |v_ULTIMATE.start_sll_update_at_~head#1.offset_89| (select v_ArrVal_2235 |v_ULTIMATE.start_sll_update_at_~head#1.offset_89|)) v_ArrVal_2235)) (= |c_ULTIMATE.start_node_create_#res#1.base| .cse3) (= (select (select (store .cse1 .cse2 v_ArrVal_2235) .cse3) 4) 0)))) (forall ((v_ArrVal_2234 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_89| Int)) (let ((.cse8 (store .cse4 .cse2 (store .cse5 |v_ULTIMATE.start_sll_update_at_~head#1.offset_89| v_ArrVal_2234)))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_node_create_#res#1.base|) 4))) (or (< .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_89|) (= |c_ULTIMATE.start_node_create_#res#1.base| .cse7) (= (select (select .cse8 .cse7) 4) 0)))))))))) is different from false [2025-04-30 10:42:33,729 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse9 (+ 4 |c_ULTIMATE.start_node_create_~temp~0#1.offset|))) (let ((.cse10 (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base|) .cse9 |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| .cse10)) (.cse4 (select .cse10 4)) (.cse8 (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base|) .cse9 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (let ((.cse0 (select .cse8 4)) (.cse5 (select .cse3 .cse4))) (and (forall ((v_ArrVal_2234 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_89| Int)) (let ((.cse2 (store .cse3 .cse4 (store .cse5 |v_ULTIMATE.start_sll_update_at_~head#1.offset_89| v_ArrVal_2234)))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) (or (< .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_89|) (= |c_ULTIMATE.start_node_create_~temp~0#1.base| .cse1) (= (select (select .cse2 .cse1) 4) 0))))) (forall ((v_ArrVal_2234 Int) (v_ArrVal_2235 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_89| Int)) (let ((.cse6 (select (select (store .cse3 .cse4 (store .cse5 |v_ULTIMATE.start_sll_update_at_~head#1.offset_89| v_ArrVal_2234)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) (.cse7 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| .cse8))) (or (< .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_89|) (= |c_ULTIMATE.start_node_create_~temp~0#1.base| .cse6) (= (select (select (store .cse7 .cse4 v_ArrVal_2235) .cse6) 4) 0) (not (= (store (select .cse7 .cse4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_89| (select v_ArrVal_2235 |v_ULTIMATE.start_sll_update_at_~head#1.offset_89|)) v_ArrVal_2235)))))))))) is different from false [2025-04-30 10:42:33,765 INFO L325 Elim1Store]: treesize reduction 10, result has 66.7 percent of original size [2025-04-30 10:42:33,765 INFO L354 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 211 treesize of output 158 [2025-04-30 10:42:33,776 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2025-04-30 10:42:33,954 INFO L325 Elim1Store]: treesize reduction 10, result has 66.7 percent of original size [2025-04-30 10:42:33,958 INFO L354 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 111 treesize of output 118 [2025-04-30 10:42:33,981 INFO L325 Elim1Store]: treesize reduction 10, result has 66.7 percent of original size [2025-04-30 10:42:33,982 INFO L354 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 213 treesize of output 180 [2025-04-30 10:42:38,619 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse5 (= |c_ULTIMATE.start_node_create_~temp~0#1.offset| 0))) (let ((.cse31 (not .cse5)) (.cse3 (+ 4 |c_ULTIMATE.start_node_create_~temp~0#1.offset|))) (and (or (forall ((v_arrayElimArr_17 (Array Int Int)) (v_ArrVal_2234 Int) (v_arrayElimArr_16 (Array Int Int)) (v_ArrVal_2235 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_89| Int)) (let ((.cse1 (select v_arrayElimArr_17 4))) (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_16)) (.cse2 (select (select (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_17))) (store .cse4 .cse1 (store (select .cse4 .cse1) |v_ULTIMATE.start_sll_update_at_~head#1.offset_89| v_ArrVal_2234))) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) (or (= (select (select (store .cse0 .cse1 v_ArrVal_2235) .cse2) 4) 0) (not (= (store (select .cse0 .cse1) |v_ULTIMATE.start_sll_update_at_~head#1.offset_89| (select v_ArrVal_2235 |v_ULTIMATE.start_sll_update_at_~head#1.offset_89|)) v_ArrVal_2235)) (< (select v_arrayElimArr_16 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_89|) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_89|) (= |c_ULTIMATE.start_node_create_~temp~0#1.base| .cse2) (not (= (select v_arrayElimArr_16 .cse3) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) (not (= |c_ULTIMATE.start_sll_create_~head~0#1.base| (select v_arrayElimArr_17 .cse3))))))) .cse5) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_89| Int)) (or (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_89|) (forall ((v_arrayElimArr_15 (Array Int Int))) (or (forall ((v_ArrVal_2234 Int)) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_15))) (let ((.cse9 (store .cse7 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse7 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_89| v_ArrVal_2234)))) (let ((.cse10 (select (select .cse9 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) (or (= (select (let ((.cse6 (let ((.cse8 (select v_arrayElimArr_15 4))) (store .cse7 .cse8 (store (select .cse7 .cse8) |v_ULTIMATE.start_sll_update_at_~head#1.offset_89| v_ArrVal_2234))))) (select .cse6 (select (select .cse6 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0) (= (select (select .cse9 .cse10) 4) 0) (= |c_ULTIMATE.start_node_create_~temp~0#1.base| .cse10)))))) (not (= |c_ULTIMATE.start_sll_create_~head~0#1.base| (select v_arrayElimArr_15 .cse3))))))) (or .cse5 (and (forall ((v_arrayElimArr_17 (Array Int Int)) (v_ArrVal_2234 Int) (v_arrayElimArr_16 (Array Int Int)) (v_ArrVal_2235 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_89| Int)) (let ((.cse12 (select v_arrayElimArr_17 4))) (let ((.cse11 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_16)) (.cse13 (select (select (let ((.cse14 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_17))) (store .cse14 .cse12 (store (select .cse14 .cse12) |v_ULTIMATE.start_sll_update_at_~head#1.offset_89| v_ArrVal_2234))) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) (or (= (select (select (store .cse11 .cse12 v_ArrVal_2235) .cse13) 4) 0) (not (= (store (select .cse11 .cse12) |v_ULTIMATE.start_sll_update_at_~head#1.offset_89| (select v_ArrVal_2235 |v_ULTIMATE.start_sll_update_at_~head#1.offset_89|)) v_ArrVal_2235)) (< (select v_arrayElimArr_16 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_89|) (= |c_ULTIMATE.start_node_create_~temp~0#1.base| .cse13) (not (= (select v_arrayElimArr_16 .cse3) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) (not (= |c_ULTIMATE.start_sll_create_~head~0#1.base| (select v_arrayElimArr_17 .cse3))))))) (forall ((v_arrayElimArr_17 (Array Int Int)) (v_ArrVal_2234 Int) (v_arrayElimArr_16 (Array Int Int)) (v_ArrVal_2235 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_89| Int)) (let ((.cse18 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_17)) (.cse16 (select v_arrayElimArr_17 4))) (let ((.cse15 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_16)) (.cse17 (select (select (store .cse18 .cse16 (store (select .cse18 .cse16) |v_ULTIMATE.start_sll_update_at_~head#1.offset_89| v_ArrVal_2234)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) (or (= (select (select (store .cse15 .cse16 v_ArrVal_2235) .cse17) 4) 0) (not (= (store (select .cse15 .cse16) |v_ULTIMATE.start_sll_update_at_~head#1.offset_89| (select v_ArrVal_2235 |v_ULTIMATE.start_sll_update_at_~head#1.offset_89|)) v_ArrVal_2235)) (< (select v_arrayElimArr_16 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_89|) (= (select (select (store .cse15 |c_ULTIMATE.start_sll_create_~head~0#1.base| v_ArrVal_2235) (select (select (store .cse18 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse18 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_89| v_ArrVal_2234)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (= |c_ULTIMATE.start_node_create_~temp~0#1.base| .cse17) (not (= (select v_arrayElimArr_16 .cse3) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) (not (= |c_ULTIMATE.start_sll_create_~head~0#1.base| (select v_arrayElimArr_17 .cse3))))))))) (or (forall ((v_arrayElimArr_15 (Array Int Int)) (v_ArrVal_2234 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_89| Int)) (let ((.cse22 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_15))) (let ((.cse20 (let ((.cse23 (select v_arrayElimArr_15 4))) (store .cse22 .cse23 (store (select .cse22 .cse23) |v_ULTIMATE.start_sll_update_at_~head#1.offset_89| v_ArrVal_2234))))) (let ((.cse19 (select (select .cse20 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) (or (= |c_ULTIMATE.start_node_create_~temp~0#1.base| .cse19) (= (select (select .cse20 .cse19) 4) 0) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_89|) (= (select (let ((.cse21 (store .cse22 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse22 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_89| v_ArrVal_2234)))) (select .cse21 (select (select .cse21 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0) (not (= |c_ULTIMATE.start_sll_create_~head~0#1.base| (select v_arrayElimArr_15 .cse3)))))))) .cse5) (or .cse5 (forall ((v_arrayElimArr_17 (Array Int Int)) (v_ArrVal_2234 Int) (v_arrayElimArr_16 (Array Int Int)) (v_ArrVal_2235 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_89| Int)) (let ((.cse27 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_17)) (.cse25 (select v_arrayElimArr_17 4))) (let ((.cse24 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_16)) (.cse26 (select (select (store .cse27 .cse25 (store (select .cse27 .cse25) |v_ULTIMATE.start_sll_update_at_~head#1.offset_89| v_ArrVal_2234)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) (or (= (select (select (store .cse24 .cse25 v_ArrVal_2235) .cse26) 4) 0) (not (= (store (select .cse24 .cse25) |v_ULTIMATE.start_sll_update_at_~head#1.offset_89| (select v_ArrVal_2235 |v_ULTIMATE.start_sll_update_at_~head#1.offset_89|)) v_ArrVal_2235)) (< (select v_arrayElimArr_16 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_89|) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_89|) (= (select (select (store .cse24 |c_ULTIMATE.start_sll_create_~head~0#1.base| v_ArrVal_2235) (select (select (store .cse27 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse27 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_89| v_ArrVal_2234)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (= |c_ULTIMATE.start_node_create_~temp~0#1.base| .cse26) (not (= (select v_arrayElimArr_16 .cse3) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) (not (= |c_ULTIMATE.start_sll_create_~head~0#1.base| (select v_arrayElimArr_17 .cse3)))))))) (or (forall ((v_arrayElimArr_17 (Array Int Int)) (v_ArrVal_2234 Int) (v_arrayElimArr_16 (Array Int Int)) (v_ArrVal_2235 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_89| Int)) (let ((.cse29 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_17)) (.cse28 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_16)) (.cse30 (select v_arrayElimArr_17 4))) (or (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_89|) (= (select (select (store .cse28 |c_ULTIMATE.start_sll_create_~head~0#1.base| v_ArrVal_2235) (select (select (store .cse29 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse29 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_89| v_ArrVal_2234)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (not (= (select v_arrayElimArr_16 4) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) (= |c_ULTIMATE.start_node_create_~temp~0#1.base| (select (select (store .cse29 .cse30 (store (select .cse29 .cse30) |v_ULTIMATE.start_sll_update_at_~head#1.offset_89| v_ArrVal_2234)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) (not (= v_ArrVal_2235 (store (select .cse28 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_89| (select v_ArrVal_2235 |v_ULTIMATE.start_sll_update_at_~head#1.offset_89|)))) (not (= |c_ULTIMATE.start_sll_create_~head~0#1.base| .cse30))))) .cse31) (or (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_89| Int)) (or (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_89|) (forall ((v_arrayElimArr_17 (Array Int Int))) (or (forall ((v_ArrVal_2234 Int)) (let ((.cse32 (select (select (let ((.cse34 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_17))) (store .cse34 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse34 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_89| v_ArrVal_2234))) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) (or (= |c_ULTIMATE.start_node_create_~temp~0#1.base| .cse32) (forall ((v_arrayElimArr_16 (Array Int Int)) (v_ArrVal_2235 (Array Int Int))) (let ((.cse33 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_16))) (or (= (select (select (store .cse33 |c_ULTIMATE.start_sll_create_~head~0#1.base| v_ArrVal_2235) .cse32) 4) 0) (not (= (select v_arrayElimArr_16 4) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) (not (= v_ArrVal_2235 (store (select .cse33 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_89| (select v_ArrVal_2235 |v_ULTIMATE.start_sll_update_at_~head#1.offset_89|)))))))))) (not (= |c_ULTIMATE.start_sll_create_~head~0#1.base| (select v_arrayElimArr_17 4))))))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_89| Int)) (or (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_89|) (forall ((v_arrayElimArr_17 (Array Int Int))) (or (not (= |c_ULTIMATE.start_sll_create_~head~0#1.base| (select v_arrayElimArr_17 4))) (forall ((v_ArrVal_2234 Int)) (let ((.cse37 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_17))) (let ((.cse35 (select (select (store .cse37 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse37 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_89| v_ArrVal_2234)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) (or (= |c_ULTIMATE.start_node_create_~temp~0#1.base| .cse35) (forall ((v_arrayElimCell_140 Int) (v_arrayElimArr_16 (Array Int Int)) (v_ArrVal_2235 (Array Int Int))) (let ((.cse36 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_16))) (or (= (select (select (store .cse36 |c_ULTIMATE.start_sll_create_~head~0#1.base| v_ArrVal_2235) .cse35) 4) 0) (= (select (select (store .cse36 v_arrayElimCell_140 v_ArrVal_2235) (select (select (store .cse37 v_arrayElimCell_140 (store (select .cse37 v_arrayElimCell_140) |v_ULTIMATE.start_sll_update_at_~head#1.offset_89| v_ArrVal_2234)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (not (= (select v_arrayElimArr_16 4) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) (not (= v_ArrVal_2235 (store (select .cse36 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_89| (select v_ArrVal_2235 |v_ULTIMATE.start_sll_update_at_~head#1.offset_89|)))))))))))))))) .cse31) (or .cse5 (forall ((v_arrayElimArr_15 (Array Int Int)) (v_ArrVal_2234 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_89| Int)) (let ((.cse39 (let ((.cse40 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_15)) (.cse41 (select v_arrayElimArr_15 4))) (store .cse40 .cse41 (store (select .cse40 .cse41) |v_ULTIMATE.start_sll_update_at_~head#1.offset_89| v_ArrVal_2234))))) (let ((.cse38 (select (select .cse39 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) (or (= |c_ULTIMATE.start_node_create_~temp~0#1.base| .cse38) (= (select (select .cse39 .cse38) 4) 0) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_89|) (not (= |c_ULTIMATE.start_sll_create_~head~0#1.base| (select v_arrayElimArr_15 .cse3)))))))) (or (and (forall ((v_arrayElimArr_15 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_89| Int)) (or (forall ((v_ArrVal_2234 Int)) (let ((.cse43 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_15))) (let ((.cse45 (store .cse43 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse43 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_89| v_ArrVal_2234)))) (let ((.cse46 (select (select .cse45 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) (or (= (select (let ((.cse42 (let ((.cse44 (select v_arrayElimArr_15 4))) (store .cse43 .cse44 (store (select .cse43 .cse44) |v_ULTIMATE.start_sll_update_at_~head#1.offset_89| v_ArrVal_2234))))) (select .cse42 (select (select .cse42 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0) (= (select (select .cse45 .cse46) 4) 0) (= |c_ULTIMATE.start_node_create_~temp~0#1.base| .cse46)))))) (not (= |c_ULTIMATE.start_sll_create_~head~0#1.base| (select v_arrayElimArr_15 .cse3))))) (forall ((v_arrayElimArr_15 (Array Int Int)) (v_ArrVal_2234 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_89| Int)) (let ((.cse50 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_15))) (let ((.cse48 (let ((.cse51 (select v_arrayElimArr_15 4))) (store .cse50 .cse51 (store (select .cse50 .cse51) |v_ULTIMATE.start_sll_update_at_~head#1.offset_89| v_ArrVal_2234))))) (let ((.cse47 (select (select .cse48 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) (or (= |c_ULTIMATE.start_node_create_~temp~0#1.base| .cse47) (= (select (select .cse48 .cse47) 4) 0) (= (select (let ((.cse49 (store .cse50 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse50 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_89| v_ArrVal_2234)))) (select .cse49 (select (select .cse49 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0) (not (= |c_ULTIMATE.start_sll_create_~head~0#1.base| (select v_arrayElimArr_15 .cse3)))))))) (forall ((v_arrayElimArr_15 (Array Int Int)) (v_ArrVal_2234 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_89| Int)) (let ((.cse53 (let ((.cse54 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_15)) (.cse55 (select v_arrayElimArr_15 4))) (store .cse54 .cse55 (store (select .cse54 .cse55) |v_ULTIMATE.start_sll_update_at_~head#1.offset_89| v_ArrVal_2234))))) (let ((.cse52 (select (select .cse53 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) (or (= |c_ULTIMATE.start_node_create_~temp~0#1.base| .cse52) (= (select (select .cse53 .cse52) 4) 0) (not (= |c_ULTIMATE.start_sll_create_~head~0#1.base| (select v_arrayElimArr_15 .cse3)))))))) .cse5)))) is different from false [2025-04-30 10:42:40,350 WARN L849 $PredicateComparison]: unable to prove that (and (forall ((v_arrayElimArr_17 (Array Int Int)) (v_ArrVal_2234 Int) (v_arrayElimArr_16 (Array Int Int)) (v_ArrVal_2235 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_89| Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_80| Int)) (let ((.cse0 (select v_arrayElimArr_16 4)) (.cse1 (select v_arrayElimArr_17 4)) (.cse2 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_80| v_arrayElimArr_16)) (.cse3 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_80| v_arrayElimArr_17))) (or (< .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_89|) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_80|) 0)) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse1)) (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| .cse0) (not (= (store (select .cse2 |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_89| (select v_ArrVal_2235 |v_ULTIMATE.start_sll_update_at_~head#1.offset_89|)) v_ArrVal_2235)) (= (select (select (store .cse3 .cse1 (store (select .cse3 .cse1) |v_ULTIMATE.start_sll_update_at_~head#1.offset_89| v_ArrVal_2234)) |v_ULTIMATE.start_node_create_~temp~0#1.base_80|) 4) |v_ULTIMATE.start_node_create_~temp~0#1.base_80|) (= 0 (select (select (store .cse2 |c_ULTIMATE.start_sll_create_~new_head~0#1.base| v_ArrVal_2235) (select (select (store .cse3 |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select .cse3 |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_89| v_ArrVal_2234)) |v_ULTIMATE.start_node_create_~temp~0#1.base_80|) 4)) 4))))) (forall ((v_arrayElimArr_15 (Array Int Int)) (v_ArrVal_2234 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_89| Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_80| Int)) (let ((.cse4 (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_80| v_arrayElimArr_15))) (store .cse6 |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select .cse6 |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_89| v_ArrVal_2234))))) (let ((.cse5 (select (select .cse4 |v_ULTIMATE.start_node_create_~temp~0#1.base_80|) 4))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_80|) 0)) (= (select (select .cse4 .cse5) 4) 0) (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_89|) (= .cse5 |v_ULTIMATE.start_node_create_~temp~0#1.base_80|) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (select v_arrayElimArr_15 4))))))) (forall ((v_arrayElimArr_17 (Array Int Int)) (v_ArrVal_2234 Int) (v_arrayElimArr_16 (Array Int Int)) (v_ArrVal_2235 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_89| Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_80| Int)) (let ((.cse7 (select v_arrayElimArr_16 4)) (.cse9 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_80| v_arrayElimArr_16)) (.cse8 (select (select (let ((.cse10 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_80| v_arrayElimArr_17))) (store .cse10 |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select .cse10 |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_89| v_ArrVal_2234))) |v_ULTIMATE.start_node_create_~temp~0#1.base_80|) 4))) (or (< .cse7 |v_ULTIMATE.start_sll_update_at_~head#1.offset_89|) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_80|) 0)) (= .cse8 |v_ULTIMATE.start_node_create_~temp~0#1.base_80|) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (select v_arrayElimArr_17 4))) (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| .cse7) (not (= (store (select .cse9 |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_89| (select v_ArrVal_2235 |v_ULTIMATE.start_sll_update_at_~head#1.offset_89|)) v_ArrVal_2235)) (= 0 (select (select (store .cse9 |c_ULTIMATE.start_sll_create_~new_head~0#1.base| v_ArrVal_2235) .cse8) 4))))) (forall ((v_arrayElimCell_140 Int) (v_arrayElimArr_17 (Array Int Int)) (v_ArrVal_2234 Int) (v_arrayElimArr_16 (Array Int Int)) (v_ArrVal_2235 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_89| Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_80| Int)) (let ((.cse13 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_80| v_arrayElimArr_17))) (let ((.cse11 (select v_arrayElimArr_16 4)) (.cse12 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_80| v_arrayElimArr_16)) (.cse14 (select (select (store .cse13 |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select .cse13 |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_89| v_ArrVal_2234)) |v_ULTIMATE.start_node_create_~temp~0#1.base_80|) 4))) (or (< .cse11 |v_ULTIMATE.start_sll_update_at_~head#1.offset_89|) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_80|) 0)) (= (select (select (store .cse12 v_arrayElimCell_140 v_ArrVal_2235) (select (select (store .cse13 v_arrayElimCell_140 (store (select .cse13 v_arrayElimCell_140) |v_ULTIMATE.start_sll_update_at_~head#1.offset_89| v_ArrVal_2234)) |v_ULTIMATE.start_node_create_~temp~0#1.base_80|) 4)) 4) 0) (= .cse14 |v_ULTIMATE.start_node_create_~temp~0#1.base_80|) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (select v_arrayElimArr_17 4))) (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| .cse11) (not (= (store (select .cse12 |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_89| (select v_ArrVal_2235 |v_ULTIMATE.start_sll_update_at_~head#1.offset_89|)) v_ArrVal_2235)) (= 0 (select (select (store .cse12 |c_ULTIMATE.start_sll_create_~new_head~0#1.base| v_ArrVal_2235) .cse14) 4))))))) is different from false [2025-04-30 10:42:40,629 INFO L325 Elim1Store]: treesize reduction 34, result has 64.2 percent of original size [2025-04-30 10:42:40,629 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 1001 treesize of output 820 [2025-04-30 10:42:41,229 INFO L325 Elim1Store]: treesize reduction 162, result has 75.2 percent of original size [2025-04-30 10:42:41,231 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 22 case distinctions, treesize of input 1433 treesize of output 1790 [2025-04-30 10:42:41,424 INFO L325 Elim1Store]: treesize reduction 49, result has 68.6 percent of original size [2025-04-30 10:42:41,425 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 2311 treesize of output 2286 [2025-04-30 10:42:41,558 INFO L354 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 1401 treesize of output 1339 [2025-04-30 10:42:42,181 INFO L325 Elim1Store]: treesize reduction 228, result has 63.3 percent of original size [2025-04-30 10:42:42,182 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 1343 treesize of output 1669 [2025-04-30 10:42:42,370 INFO L325 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2025-04-30 10:42:42,371 INFO L354 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 905 treesize of output 908 [2025-04-30 10:42:42,547 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:42:42,548 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 895 treesize of output 965 [2025-04-30 10:42:42,851 INFO L354 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 1676 treesize of output 1600 [2025-04-30 10:42:43,009 INFO L354 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 1688 treesize of output 1610 [2025-04-30 10:42:43,247 INFO L354 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 1164 treesize of output 1122 [2025-04-30 10:42:43,476 INFO L325 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2025-04-30 10:42:43,480 INFO L354 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 924 treesize of output 933 [2025-04-30 10:42:43,673 INFO L325 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2025-04-30 10:42:43,673 INFO L354 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 913 treesize of output 922 Killed by 15