./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/forester-heap/sll-optional-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed 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/AutomizerReach.xml -i ../sv-benchmarks/c/forester-heap/sll-optional-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-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 ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8b0f1d623fff7bbdf74e6250d2f53fb98e44ca7ba1aae1265f5b0871b427fba0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 04:30:22,748 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 04:30:22,802 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 04:30:22,807 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 04:30:22,808 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 04:30:22,824 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 04:30:22,825 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 04:30:22,825 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 04:30:22,825 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 04:30:22,825 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 04:30:22,826 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 04:30:22,826 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 04:30:22,826 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 04:30:22,826 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 04:30:22,826 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 04:30:22,826 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 04:30:22,826 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 04:30:22,827 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 04:30:22,827 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 04:30:22,827 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 04:30:22,827 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 04:30:22,827 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 04:30:22,827 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 04:30:22,827 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 04:30:22,827 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 04:30:22,827 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 04:30:22,828 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 04:30:22,828 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 04:30:22,828 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 04:30:22,828 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 04:30:22,828 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 04:30:22,828 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 04:30:22,828 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 04:30:22,828 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 04:30:22,829 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 04:30:22,829 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 04:30:22,829 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 04:30:22,829 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 04:30:22,829 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 04:30:22,829 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 04:30:22,829 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 04:30:22,829 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 04:30:22,829 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 04:30:22,829 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 ! call(reach_error())) ) 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 -> 8b0f1d623fff7bbdf74e6250d2f53fb98e44ca7ba1aae1265f5b0871b427fba0 [2025-03-08 04:30:23,048 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 04:30:23,056 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 04:30:23,057 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 04:30:23,058 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 04:30:23,059 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 04:30:23,059 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/sll-optional-1.i [2025-03-08 04:30:24,281 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f921788d/4dfbf9703d2b4ba497a50a8ee760f560/FLAG082e1647a [2025-03-08 04:30:24,520 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 04:30:24,521 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-optional-1.i [2025-03-08 04:30:24,532 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f921788d/4dfbf9703d2b4ba497a50a8ee760f560/FLAG082e1647a [2025-03-08 04:30:24,848 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f921788d/4dfbf9703d2b4ba497a50a8ee760f560 [2025-03-08 04:30:24,849 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 04:30:24,850 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 04:30:24,851 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 04:30:24,851 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 04:30:24,854 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 04:30:24,855 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:30:24" (1/1) ... [2025-03-08 04:30:24,855 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12fdff9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:30:24, skipping insertion in model container [2025-03-08 04:30:24,856 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:30:24" (1/1) ... [2025-03-08 04:30:24,888 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 04:30:25,060 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-optional-1.i[22688,22701] [2025-03-08 04:30:25,065 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 04:30:25,071 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 04:30:25,098 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-optional-1.i[22688,22701] [2025-03-08 04:30:25,100 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 04:30:25,119 INFO L204 MainTranslator]: Completed translation [2025-03-08 04:30:25,120 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:30:25 WrapperNode [2025-03-08 04:30:25,121 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 04:30:25,122 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 04:30:25,122 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 04:30:25,122 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 04:30:25,126 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:30:25" (1/1) ... [2025-03-08 04:30:25,133 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:30:25" (1/1) ... [2025-03-08 04:30:25,146 INFO L138 Inliner]: procedures = 119, calls = 41, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 125 [2025-03-08 04:30:25,147 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 04:30:25,147 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 04:30:25,147 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 04:30:25,147 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 04:30:25,153 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:30:25" (1/1) ... [2025-03-08 04:30:25,153 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:30:25" (1/1) ... [2025-03-08 04:30:25,157 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:30:25" (1/1) ... [2025-03-08 04:30:25,173 INFO L175 MemorySlicer]: Split 31 memory accesses to 2 slices as follows [2, 29]. 94 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 17 writes are split as follows [0, 17]. [2025-03-08 04:30:25,174 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:30:25" (1/1) ... [2025-03-08 04:30:25,174 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:30:25" (1/1) ... [2025-03-08 04:30:25,178 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:30:25" (1/1) ... [2025-03-08 04:30:25,179 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:30:25" (1/1) ... [2025-03-08 04:30:25,180 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:30:25" (1/1) ... [2025-03-08 04:30:25,180 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:30:25" (1/1) ... [2025-03-08 04:30:25,182 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 04:30:25,186 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 04:30:25,186 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 04:30:25,186 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 04:30:25,187 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:30:25" (1/1) ... [2025-03-08 04:30:25,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 04:30:25,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:30:25,210 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-03-08 04:30:25,212 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-03-08 04:30:25,229 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 04:30:25,230 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 04:30:25,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 04:30:25,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 04:30:25,230 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-08 04:30:25,230 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 04:30:25,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-08 04:30:25,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-08 04:30:25,230 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-08 04:30:25,231 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-08 04:30:25,231 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 04:30:25,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 04:30:25,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 04:30:25,231 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 04:30:25,231 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 04:30:25,317 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 04:30:25,318 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 04:30:25,496 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2025-03-08 04:30:25,496 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 04:30:25,501 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 04:30:25,501 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 04:30:25,501 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:30:25 BoogieIcfgContainer [2025-03-08 04:30:25,501 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 04:30:25,502 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 04:30:25,502 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 04:30:25,505 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 04:30:25,505 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 04:30:24" (1/3) ... [2025-03-08 04:30:25,506 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e99605e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:30:25, skipping insertion in model container [2025-03-08 04:30:25,506 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:30:25" (2/3) ... [2025-03-08 04:30:25,506 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e99605e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:30:25, skipping insertion in model container [2025-03-08 04:30:25,506 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:30:25" (3/3) ... [2025-03-08 04:30:25,507 INFO L128 eAbstractionObserver]: Analyzing ICFG sll-optional-1.i [2025-03-08 04:30:25,515 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 04:30:25,517 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sll-optional-1.i that has 1 procedures, 28 locations, 1 initial locations, 4 loop locations, and 1 error locations. [2025-03-08 04:30:25,557 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 04:30:25,566 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@43012421, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 04:30:25,567 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 04:30:25,570 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 26 states have (on average 1.6153846153846154) internal successors, (42), 27 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:30:25,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-08 04:30:25,573 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:30:25,573 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:30:25,574 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:30:25,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:30:25,577 INFO L85 PathProgramCache]: Analyzing trace with hash -1786671106, now seen corresponding path program 1 times [2025-03-08 04:30:25,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:30:25,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116822423] [2025-03-08 04:30:25,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:30:25,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:30:25,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-08 04:30:25,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-08 04:30:25,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:30:25,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:30:25,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:30:25,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:30:25,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116822423] [2025-03-08 04:30:25,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116822423] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 04:30:25,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 04:30:25,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 04:30:25,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520843983] [2025-03-08 04:30:25,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 04:30:25,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 04:30:25,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:30:25,761 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 04:30:25,762 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 04:30:25,763 INFO L87 Difference]: Start difference. First operand has 28 states, 26 states have (on average 1.6153846153846154) internal successors, (42), 27 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 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-03-08 04:30:25,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:30:25,771 INFO L93 Difference]: Finished difference Result 47 states and 69 transitions. [2025-03-08 04:30:25,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 04:30:25,773 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 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-03-08 04:30:25,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:30:25,778 INFO L225 Difference]: With dead ends: 47 [2025-03-08 04:30:25,778 INFO L226 Difference]: Without dead ends: 22 [2025-03-08 04:30:25,779 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 04:30:25,783 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 04:30:25,783 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 04:30:25,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2025-03-08 04:30:25,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2025-03-08 04:30:25,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 21 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:30:25,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 30 transitions. [2025-03-08 04:30:25,803 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 30 transitions. Word has length 15 [2025-03-08 04:30:25,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:30:25,803 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 30 transitions. [2025-03-08 04:30:25,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 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-03-08 04:30:25,803 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 30 transitions. [2025-03-08 04:30:25,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-08 04:30:25,803 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:30:25,803 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:30:25,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 04:30:25,804 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:30:25,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:30:25,804 INFO L85 PathProgramCache]: Analyzing trace with hash 1244846678, now seen corresponding path program 1 times [2025-03-08 04:30:25,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:30:25,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231717751] [2025-03-08 04:30:25,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:30:25,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:30:25,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-08 04:30:25,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-08 04:30:25,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:30:25,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:30:25,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:30:25,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:30:25,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231717751] [2025-03-08 04:30:25,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231717751] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 04:30:25,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 04:30:25,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 04:30:25,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932773907] [2025-03-08 04:30:25,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 04:30:25,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 04:30:25,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:30:25,889 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 04:30:25,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 04:30:25,889 INFO L87 Difference]: Start difference. First operand 22 states and 30 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:30:25,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:30:25,898 INFO L93 Difference]: Finished difference Result 25 states and 33 transitions. [2025-03-08 04:30:25,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 04:30:25,899 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-03-08 04:30:25,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:30:25,899 INFO L225 Difference]: With dead ends: 25 [2025-03-08 04:30:25,899 INFO L226 Difference]: Without dead ends: 23 [2025-03-08 04:30:25,899 INFO L434 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-03-08 04:30:25,900 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 0 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 53 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-03-08 04:30:25,900 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 53 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 04:30:25,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2025-03-08 04:30:25,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2025-03-08 04:30:25,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 22 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-03-08 04:30:25,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions. [2025-03-08 04:30:25,902 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 31 transitions. Word has length 16 [2025-03-08 04:30:25,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:30:25,903 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 31 transitions. [2025-03-08 04:30:25,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:30:25,903 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2025-03-08 04:30:25,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-08 04:30:25,903 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:30:25,903 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:30:25,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 04:30:25,904 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:30:25,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:30:25,904 INFO L85 PathProgramCache]: Analyzing trace with hash 1244845717, now seen corresponding path program 1 times [2025-03-08 04:30:25,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:30:25,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944719620] [2025-03-08 04:30:25,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:30:25,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:30:25,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-08 04:30:25,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-08 04:30:25,955 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:30:25,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:30:26,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:30:26,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:30:26,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944719620] [2025-03-08 04:30:26,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944719620] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 04:30:26,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 04:30:26,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 04:30:26,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161369276] [2025-03-08 04:30:26,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 04:30:26,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 04:30:26,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:30:26,543 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 04:30:26,543 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 04:30:26,543 INFO L87 Difference]: Start difference. First operand 23 states and 31 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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-03-08 04:30:26,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:30:26,788 INFO L93 Difference]: Finished difference Result 68 states and 87 transitions. [2025-03-08 04:30:26,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 04:30:26,789 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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 16 [2025-03-08 04:30:26,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:30:26,790 INFO L225 Difference]: With dead ends: 68 [2025-03-08 04:30:26,790 INFO L226 Difference]: Without dead ends: 55 [2025-03-08 04:30:26,790 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2025-03-08 04:30:26,791 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 97 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 04:30:26,792 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 71 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 04:30:26,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-03-08 04:30:26,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 34. [2025-03-08 04:30:26,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.3636363636363635) internal successors, (45), 33 states have internal predecessors, (45), 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-03-08 04:30:26,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 45 transitions. [2025-03-08 04:30:26,800 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 45 transitions. Word has length 16 [2025-03-08 04:30:26,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:30:26,800 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 45 transitions. [2025-03-08 04:30:26,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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-03-08 04:30:26,800 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 45 transitions. [2025-03-08 04:30:26,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-08 04:30:26,801 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:30:26,801 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:30:26,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 04:30:26,801 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:30:26,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:30:26,802 INFO L85 PathProgramCache]: Analyzing trace with hash 1245769238, now seen corresponding path program 1 times [2025-03-08 04:30:26,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:30:26,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554730533] [2025-03-08 04:30:26,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:30:26,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:30:26,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-08 04:30:26,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-08 04:30:26,820 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:30:26,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:30:26,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:30:26,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:30:26,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554730533] [2025-03-08 04:30:26,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554730533] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 04:30:26,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 04:30:26,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 04:30:26,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163458750] [2025-03-08 04:30:26,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 04:30:26,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 04:30:26,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:30:26,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 04:30:26,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 04:30:26,927 INFO L87 Difference]: Start difference. First operand 34 states and 45 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 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-03-08 04:30:27,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:30:27,030 INFO L93 Difference]: Finished difference Result 49 states and 64 transitions. [2025-03-08 04:30:27,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 04:30:27,031 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 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 16 [2025-03-08 04:30:27,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:30:27,031 INFO L225 Difference]: With dead ends: 49 [2025-03-08 04:30:27,031 INFO L226 Difference]: Without dead ends: 47 [2025-03-08 04:30:27,031 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 04:30:27,032 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 6 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 04:30:27,032 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 87 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 04:30:27,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2025-03-08 04:30:27,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 40. [2025-03-08 04:30:27,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.3846153846153846) internal successors, (54), 39 states have internal predecessors, (54), 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-03-08 04:30:27,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 54 transitions. [2025-03-08 04:30:27,040 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 54 transitions. Word has length 16 [2025-03-08 04:30:27,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:30:27,040 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 54 transitions. [2025-03-08 04:30:27,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 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-03-08 04:30:27,040 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 54 transitions. [2025-03-08 04:30:27,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-08 04:30:27,040 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:30:27,041 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:30:27,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 04:30:27,041 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:30:27,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:30:27,041 INFO L85 PathProgramCache]: Analyzing trace with hash 2133272919, now seen corresponding path program 1 times [2025-03-08 04:30:27,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:30:27,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345297052] [2025-03-08 04:30:27,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:30:27,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:30:27,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-08 04:30:27,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-08 04:30:27,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:30:27,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:30:27,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:30:27,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:30:27,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345297052] [2025-03-08 04:30:27,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345297052] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 04:30:27,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 04:30:27,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 04:30:27,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117471825] [2025-03-08 04:30:27,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 04:30:27,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 04:30:27,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:30:27,170 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 04:30:27,170 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 04:30:27,170 INFO L87 Difference]: Start difference. First operand 40 states and 54 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 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-03-08 04:30:27,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:30:27,282 INFO L93 Difference]: Finished difference Result 81 states and 106 transitions. [2025-03-08 04:30:27,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 04:30:27,283 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 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 16 [2025-03-08 04:30:27,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:30:27,284 INFO L225 Difference]: With dead ends: 81 [2025-03-08 04:30:27,284 INFO L226 Difference]: Without dead ends: 60 [2025-03-08 04:30:27,284 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-03-08 04:30:27,285 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 81 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 04:30:27,286 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 75 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 04:30:27,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-03-08 04:30:27,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 38. [2025-03-08 04:30:27,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.3513513513513513) internal successors, (50), 37 states have internal predecessors, (50), 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-03-08 04:30:27,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 50 transitions. [2025-03-08 04:30:27,296 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 50 transitions. Word has length 16 [2025-03-08 04:30:27,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:30:27,296 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 50 transitions. [2025-03-08 04:30:27,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 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-03-08 04:30:27,296 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 50 transitions. [2025-03-08 04:30:27,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-08 04:30:27,296 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:30:27,296 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:30:27,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 04:30:27,296 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:30:27,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:30:27,297 INFO L85 PathProgramCache]: Analyzing trace with hash -250370467, now seen corresponding path program 1 times [2025-03-08 04:30:27,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:30:27,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373815511] [2025-03-08 04:30:27,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:30:27,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:30:27,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-08 04:30:27,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-08 04:30:27,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:30:27,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:30:27,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:30:27,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:30:27,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373815511] [2025-03-08 04:30:27,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373815511] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 04:30:27,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 04:30:27,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 04:30:27,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844221790] [2025-03-08 04:30:27,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 04:30:27,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 04:30:27,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:30:27,475 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 04:30:27,475 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 04:30:27,475 INFO L87 Difference]: Start difference. First operand 38 states and 50 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 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-03-08 04:30:27,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:30:27,663 INFO L93 Difference]: Finished difference Result 79 states and 104 transitions. [2025-03-08 04:30:27,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 04:30:27,664 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 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 17 [2025-03-08 04:30:27,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:30:27,664 INFO L225 Difference]: With dead ends: 79 [2025-03-08 04:30:27,664 INFO L226 Difference]: Without dead ends: 77 [2025-03-08 04:30:27,665 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2025-03-08 04:30:27,665 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 67 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 04:30:27,665 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 97 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 04:30:27,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-03-08 04:30:27,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 46. [2025-03-08 04:30:27,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.3555555555555556) internal successors, (61), 45 states have internal predecessors, (61), 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-03-08 04:30:27,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 61 transitions. [2025-03-08 04:30:27,678 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 61 transitions. Word has length 17 [2025-03-08 04:30:27,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:30:27,678 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 61 transitions. [2025-03-08 04:30:27,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 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-03-08 04:30:27,678 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 61 transitions. [2025-03-08 04:30:27,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-08 04:30:27,678 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:30:27,678 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:30:27,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 04:30:27,679 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:30:27,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:30:27,679 INFO L85 PathProgramCache]: Analyzing trace with hash 250529043, now seen corresponding path program 1 times [2025-03-08 04:30:27,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:30:27,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672135632] [2025-03-08 04:30:27,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:30:27,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:30:27,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-08 04:30:27,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-08 04:30:27,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:30:27,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:30:28,498 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:30:28,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:30:28,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672135632] [2025-03-08 04:30:28,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672135632] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:30:28,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [232500214] [2025-03-08 04:30:28,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:30:28,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:30:28,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:30:28,506 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-03-08 04:30:28,510 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-03-08 04:30:28,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-08 04:30:28,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-08 04:30:28,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:30:28,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:30:28,625 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 65 conjuncts are in the unsatisfiable core [2025-03-08 04:30:28,630 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:30:28,655 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-08 04:30:28,698 INFO L349 Elim1Store]: treesize reduction 26, result has 35.0 percent of original size [2025-03-08 04:30:28,698 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 29 [2025-03-08 04:30:28,708 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2025-03-08 04:30:28,717 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 11 [2025-03-08 04:30:28,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 04:30:28,844 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 40 [2025-03-08 04:30:28,853 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 04:30:28,863 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2025-03-08 04:30:28,863 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 52 [2025-03-08 04:30:28,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 04:30:28,882 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2025-03-08 04:30:28,883 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 48 [2025-03-08 04:30:28,919 INFO L349 Elim1Store]: treesize reduction 32, result has 45.8 percent of original size [2025-03-08 04:30:28,920 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 42 [2025-03-08 04:30:28,942 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 04:30:28,943 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-08 04:30:28,996 INFO L349 Elim1Store]: treesize reduction 48, result has 36.0 percent of original size [2025-03-08 04:30:28,997 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 41 [2025-03-08 04:30:29,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 04:30:29,151 INFO L349 Elim1Store]: treesize reduction 154, result has 12.0 percent of original size [2025-03-08 04:30:29,151 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 7 new quantified variables, introduced 8 case distinctions, treesize of input 150 treesize of output 155 [2025-03-08 04:30:29,200 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 04:30:29,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 04:30:29,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 36 [2025-03-08 04:30:29,230 INFO L349 Elim1Store]: treesize reduction 8, result has 70.4 percent of original size [2025-03-08 04:30:29,231 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 31 [2025-03-08 04:30:29,242 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2025-03-08 04:30:30,015 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 04:30:30,097 INFO L349 Elim1Store]: treesize reduction 40, result has 69.9 percent of original size [2025-03-08 04:30:30,098 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 14 case distinctions, treesize of input 678 treesize of output 672 [2025-03-08 04:30:30,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 04:30:30,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 04:30:30,165 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:30:30,166 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 80 treesize of output 74 [2025-03-08 04:30:30,264 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:30:30,264 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:30:30,728 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| 0))) (.cse1 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4)) (.cse3 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|))) (and (forall ((|v_ULTIMATE.start_main_~x~0#1.base_24| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~malloc10#1.base_8| Int)) (or (forall ((v_ArrVal_290 (Array Int Int)) (v_ArrVal_294 (Array Int Int)) (v_ArrVal_293 (Array Int Int))) (let ((.cse4 (select (select (store (store .cse5 |v_ULTIMATE.start_main_~x~0#1.base_24| v_ArrVal_293) |v_ULTIMATE.start_main_#t~malloc10#1.base_8| v_ArrVal_290) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1))) (or (= (select (let ((.cse0 (let ((.cse2 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~x~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.base_24|)) |v_ULTIMATE.start_main_~x~0#1.base_24| v_ArrVal_294))) (store .cse2 |v_ULTIMATE.start_main_#t~malloc10#1.base_8| (store (select .cse2 |v_ULTIMATE.start_main_#t~malloc10#1.base_8|) 0 0))))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) .cse1))) .cse4) 0) (= .cse4 |c_ULTIMATE.start_main_~head~0#1.offset|)))) (not (= (select (store |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_24| 1) |v_ULTIMATE.start_main_#t~malloc10#1.base_8|) 0)))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_24|) 0)))) (forall ((|v_ULTIMATE.start_main_~x~0#1.base_24| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~malloc10#1.base_8| Int)) (or (forall ((v_ArrVal_290 (Array Int Int)) (v_ArrVal_294 (Array Int Int)) (v_ArrVal_293 (Array Int Int))) (let ((.cse7 (select (select (let ((.cse8 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~x~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.base_24|)) |v_ULTIMATE.start_main_~x~0#1.base_24| v_ArrVal_294))) (store .cse8 |v_ULTIMATE.start_main_#t~malloc10#1.base_8| (store (select .cse8 |v_ULTIMATE.start_main_#t~malloc10#1.base_8|) 0 0))) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1))) (or (= (let ((.cse6 (store (store .cse5 |v_ULTIMATE.start_main_~x~0#1.base_24| v_ArrVal_293) |v_ULTIMATE.start_main_#t~malloc10#1.base_8| v_ArrVal_290))) (select (select .cse6 .cse7) (select (select .cse6 |c_ULTIMATE.start_main_~head~0#1.base|) .cse1))) 0) (= .cse7 |c_ULTIMATE.start_main_~head~0#1.base|)))) (not (= (select (store |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_24| 1) |v_ULTIMATE.start_main_#t~malloc10#1.base_8|) 0)))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_24|) 0)))) (forall ((|v_ULTIMATE.start_main_~x~0#1.base_24| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~malloc10#1.base_8| Int)) (or (not (= (select (store |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_24| 1) |v_ULTIMATE.start_main_#t~malloc10#1.base_8|) 0)) (forall ((v_ArrVal_290 (Array Int Int)) (v_ArrVal_294 (Array Int Int)) (v_ArrVal_293 (Array Int Int))) (let ((.cse9 (store (store .cse5 |v_ULTIMATE.start_main_~x~0#1.base_24| v_ArrVal_293) |v_ULTIMATE.start_main_#t~malloc10#1.base_8| v_ArrVal_290))) (let ((.cse11 (select (select .cse9 |c_ULTIMATE.start_main_~head~0#1.base|) .cse1))) (or (= (select (select .cse9 (select (select (let ((.cse10 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~x~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.base_24|)) |v_ULTIMATE.start_main_~x~0#1.base_24| v_ArrVal_294))) (store .cse10 |v_ULTIMATE.start_main_#t~malloc10#1.base_8| (store (select .cse10 |v_ULTIMATE.start_main_#t~malloc10#1.base_8|) 0 0))) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1)) .cse11) 0) (= .cse11 |c_ULTIMATE.start_main_~head~0#1.offset|))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_24|) 0)))) (forall ((|v_ULTIMATE.start_main_~x~0#1.base_24| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~malloc10#1.base_8| Int)) (or (forall ((v_ArrVal_290 (Array Int Int)) (v_ArrVal_294 (Array Int Int)) (v_ArrVal_293 (Array Int Int))) (let ((.cse13 (let ((.cse14 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~x~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.base_24|)) |v_ULTIMATE.start_main_~x~0#1.base_24| v_ArrVal_294))) (store .cse14 |v_ULTIMATE.start_main_#t~malloc10#1.base_8| (store (select .cse14 |v_ULTIMATE.start_main_#t~malloc10#1.base_8|) 0 0))))) (let ((.cse12 (select (select .cse13 |c_ULTIMATE.start_main_~head~0#1.base|) .cse1))) (or (= .cse12 |c_ULTIMATE.start_main_~head~0#1.base|) (= (select (select .cse13 .cse12) (select (select (store (store .cse5 |v_ULTIMATE.start_main_~x~0#1.base_24| v_ArrVal_293) |v_ULTIMATE.start_main_#t~malloc10#1.base_8| v_ArrVal_290) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1)) 0))))) (not (= (select (store |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_24| 1) |v_ULTIMATE.start_main_#t~malloc10#1.base_8|) 0)))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_24|) 0)))))) is different from false [2025-03-08 04:30:53,487 WARN L286 SmtUtils]: Spent 21.86s on a formula simplification. DAG size of input: 276 DAG size of output: 200 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2025-03-08 04:30:53,487 INFO L349 Elim1Store]: treesize reduction 7496, result has 40.7 percent of original size [2025-03-08 04:30:53,489 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 10 new quantified variables, introduced 30 case distinctions, treesize of input 1517615 treesize of output 1421752 [2025-03-08 04:30:59,401 WARN L286 SmtUtils]: Spent 5.07s on a formula simplification. DAG size of input: 647 DAG size of output: 179 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2025-03-08 04:30:59,401 INFO L349 Elim1Store]: treesize reduction 1429, result has 19.7 percent of original size [2025-03-08 04:30:59,408 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 16 select indices, 16 select index equivalence classes, 0 disjoint index pairs (out of 120 index pairs), introduced 25 new quantified variables, introduced 137 case distinctions, treesize of input 84037545 treesize of output 65088212 [2025-03-08 04:31:26,181 WARN L286 SmtUtils]: Spent 26.75s on a formula simplification. DAG size of input: 9416 DAG size of output: 2436 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-08 04:31:30,460 INFO L349 Elim1Store]: treesize reduction 1198, result has 22.4 percent of original size [2025-03-08 04:31:30,462 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 14 select indices, 14 select index equivalence classes, 0 disjoint index pairs (out of 91 index pairs), introduced 19 new quantified variables, introduced 106 case distinctions, treesize of input 145350 treesize of output 91665 [2025-03-08 04:31:33,125 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39781 treesize of output 39525 [2025-03-08 04:31:34,400 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39525 treesize of output 39265 [2025-03-08 04:31:39,351 INFO L349 Elim1Store]: treesize reduction 53, result has 94.8 percent of original size [2025-03-08 04:31:39,353 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 13 select indices, 13 select index equivalence classes, 0 disjoint index pairs (out of 78 index pairs), introduced 15 new quantified variables, introduced 78 case distinctions, treesize of input 90891 treesize of output 86845 [2025-03-08 04:31:48,214 INFO L349 Elim1Store]: treesize reduction 453, result has 49.7 percent of original size [2025-03-08 04:31:48,216 INFO L378 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 79189 treesize of output 76886 [2025-03-08 04:31:53,666 WARN L286 SmtUtils]: Spent 5.44s on a formula simplification. DAG size of input: 3413 DAG size of output: 3316 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-08 04:31:53,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 04:31:54,578 INFO L349 Elim1Store]: treesize reduction 17, result has 89.4 percent of original size [2025-03-08 04:31:54,579 INFO L378 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 44914 treesize of output 43109 [2025-03-08 04:31:59,976 WARN L286 SmtUtils]: Spent 5.39s on a formula simplification. DAG size of input: 3380 DAG size of output: 3369 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-08 04:32:00,232 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41918 treesize of output 41518 [2025-03-08 04:32:04,006 INFO L349 Elim1Store]: treesize reduction 17, result has 89.4 percent of original size [2025-03-08 04:32:04,008 INFO L378 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 6 new quantified variables, introduced 10 case distinctions, treesize of input 59459 treesize of output 59162