./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-59.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/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-59.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 e71601c55174be0ad57296dccc2279fd85b1f2c03bb5913dfcee88384188d311 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 10:49:37,603 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 10:49:37,658 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 10:49:37,665 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 10:49:37,665 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 10:49:37,683 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 10:49:37,685 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 10:49:37,685 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 10:49:37,685 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 10:49:37,685 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 10:49:37,686 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 10:49:37,686 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 10:49:37,686 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 10:49:37,686 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 10:49:37,687 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 10:49:37,687 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 10:49:37,687 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 10:49:37,687 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 10:49:37,687 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 10:49:37,687 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 10:49:37,687 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 10:49:37,687 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 10:49:37,688 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 10:49:37,688 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 10:49:37,688 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 10:49:37,688 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 10:49:37,688 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 10:49:37,688 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 10:49:37,688 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 10:49:37,688 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 10:49:37,688 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 10:49:37,688 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 10:49:37,688 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 10:49:37,688 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 10:49:37,689 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 10:49:37,689 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 10:49:37,689 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 10:49:37,689 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 10:49:37,689 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 10:49:37,689 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 10:49:37,689 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 10:49:37,690 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 10:49:37,690 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 10:49:37,690 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 -> e71601c55174be0ad57296dccc2279fd85b1f2c03bb5913dfcee88384188d311 [2025-03-08 10:49:37,943 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 10:49:37,948 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 10:49:37,951 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 10:49:37,952 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 10:49:37,952 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 10:49:37,953 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-59.i [2025-03-08 10:49:39,105 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96f37f5b1/1d6764c8764c420eae79558514463b82/FLAGc8884bbe0 [2025-03-08 10:49:39,344 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 10:49:39,346 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-59.i [2025-03-08 10:49:39,354 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96f37f5b1/1d6764c8764c420eae79558514463b82/FLAGc8884bbe0 [2025-03-08 10:49:39,668 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96f37f5b1/1d6764c8764c420eae79558514463b82 [2025-03-08 10:49:39,670 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 10:49:39,672 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 10:49:39,673 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 10:49:39,673 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 10:49:39,676 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 10:49:39,676 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:49:39" (1/1) ... [2025-03-08 10:49:39,677 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f13129e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:49:39, skipping insertion in model container [2025-03-08 10:49:39,677 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:49:39" (1/1) ... [2025-03-08 10:49:39,696 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 10:49:39,792 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/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-59.i[915,928] [2025-03-08 10:49:39,839 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 10:49:39,849 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 10:49:39,859 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/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-59.i[915,928] [2025-03-08 10:49:39,896 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 10:49:39,911 INFO L204 MainTranslator]: Completed translation [2025-03-08 10:49:39,912 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:49:39 WrapperNode [2025-03-08 10:49:39,913 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 10:49:39,914 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 10:49:39,914 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 10:49:39,914 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 10:49:39,918 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:49:39" (1/1) ... [2025-03-08 10:49:39,927 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:49:39" (1/1) ... [2025-03-08 10:49:39,968 INFO L138 Inliner]: procedures = 26, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 166 [2025-03-08 10:49:39,971 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 10:49:39,971 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 10:49:39,971 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 10:49:39,971 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 10:49:39,978 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:49:39" (1/1) ... [2025-03-08 10:49:39,979 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:49:39" (1/1) ... [2025-03-08 10:49:39,981 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:49:39" (1/1) ... [2025-03-08 10:49:40,000 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 10:49:40,000 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:49:39" (1/1) ... [2025-03-08 10:49:40,000 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:49:39" (1/1) ... [2025-03-08 10:49:40,006 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:49:39" (1/1) ... [2025-03-08 10:49:40,007 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:49:39" (1/1) ... [2025-03-08 10:49:40,008 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:49:39" (1/1) ... [2025-03-08 10:49:40,009 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:49:39" (1/1) ... [2025-03-08 10:49:40,015 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 10:49:40,016 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 10:49:40,016 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 10:49:40,016 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 10:49:40,017 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:49:39" (1/1) ... [2025-03-08 10:49:40,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 10:49:40,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:49:40,044 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 10:49:40,047 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 10:49:40,061 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 10:49:40,061 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 10:49:40,061 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 10:49:40,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 10:49:40,061 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 10:49:40,061 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 10:49:40,116 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 10:49:40,117 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 10:49:40,448 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2025-03-08 10:49:40,448 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 10:49:40,459 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 10:49:40,459 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 10:49:40,462 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:49:40 BoogieIcfgContainer [2025-03-08 10:49:40,462 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 10:49:40,465 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 10:49:40,465 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 10:49:40,468 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 10:49:40,468 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 10:49:39" (1/3) ... [2025-03-08 10:49:40,469 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66c71caa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:49:40, skipping insertion in model container [2025-03-08 10:49:40,469 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:49:39" (2/3) ... [2025-03-08 10:49:40,470 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66c71caa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:49:40, skipping insertion in model container [2025-03-08 10:49:40,470 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:49:40" (3/3) ... [2025-03-08 10:49:40,472 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-59.i [2025-03-08 10:49:40,483 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 10:49:40,487 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-59.i that has 2 procedures, 69 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 10:49:40,538 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 10:49:40,548 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;@2f8476ce, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 10:49:40,549 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 10:49:40,552 INFO L276 IsEmpty]: Start isEmpty. Operand has 69 states, 45 states have (on average 1.3555555555555556) internal successors, (61), 46 states have internal predecessors, (61), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-08 10:49:40,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-08 10:49:40,563 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:49:40,563 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:49:40,564 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:49:40,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:49:40,569 INFO L85 PathProgramCache]: Analyzing trace with hash 1924176642, now seen corresponding path program 1 times [2025-03-08 10:49:40,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:49:40,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680144215] [2025-03-08 10:49:40,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:49:40,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:49:40,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-08 10:49:40,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-08 10:49:40,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:49:40,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:49:40,857 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2025-03-08 10:49:40,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:49:40,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680144215] [2025-03-08 10:49:40,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680144215] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 10:49:40,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2086980471] [2025-03-08 10:49:40,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:49:40,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 10:49:40,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:49:40,860 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 10:49:40,862 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 10:49:40,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-08 10:49:40,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-08 10:49:40,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:49:40,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:49:40,995 INFO L256 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 10:49:41,001 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 10:49:41,025 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2025-03-08 10:49:41,025 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 10:49:41,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2086980471] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:49:41,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 10:49:41,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 10:49:41,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039528367] [2025-03-08 10:49:41,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:49:41,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 10:49:41,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:49:41,046 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 10:49:41,047 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 10:49:41,048 INFO L87 Difference]: Start difference. First operand has 69 states, 45 states have (on average 1.3555555555555556) internal successors, (61), 46 states have internal predecessors, (61), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-08 10:49:41,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:49:41,070 INFO L93 Difference]: Finished difference Result 132 states and 222 transitions. [2025-03-08 10:49:41,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 10:49:41,071 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 139 [2025-03-08 10:49:41,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:49:41,077 INFO L225 Difference]: With dead ends: 132 [2025-03-08 10:49:41,077 INFO L226 Difference]: Without dead ends: 66 [2025-03-08 10:49:41,080 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 140 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 10:49:41,081 INFO L435 NwaCegarLoop]: 98 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, 98 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 10:49:41,082 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 10:49:41,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2025-03-08 10:49:41,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2025-03-08 10:49:41,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 43 states have (on average 1.302325581395349) internal successors, (56), 43 states have internal predecessors, (56), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-08 10:49:41,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 98 transitions. [2025-03-08 10:49:41,113 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 98 transitions. Word has length 139 [2025-03-08 10:49:41,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:49:41,113 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 98 transitions. [2025-03-08 10:49:41,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-08 10:49:41,114 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 98 transitions. [2025-03-08 10:49:41,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-08 10:49:41,115 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:49:41,116 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:49:41,122 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-03-08 10:49:41,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 10:49:41,317 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:49:41,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:49:41,318 INFO L85 PathProgramCache]: Analyzing trace with hash 2038026811, now seen corresponding path program 1 times [2025-03-08 10:49:41,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:49:41,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121928465] [2025-03-08 10:49:41,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:49:41,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:49:41,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-08 10:49:41,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-08 10:49:41,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:49:41,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:49:41,724 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-03-08 10:49:41,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:49:41,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121928465] [2025-03-08 10:49:41,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121928465] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:49:41,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:49:41,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 10:49:41,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573203479] [2025-03-08 10:49:41,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:49:41,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 10:49:41,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:49:41,727 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 10:49:41,727 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 10:49:41,727 INFO L87 Difference]: Start difference. First operand 66 states and 98 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-08 10:49:41,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:49:41,857 INFO L93 Difference]: Finished difference Result 193 states and 289 transitions. [2025-03-08 10:49:41,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 10:49:41,858 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 139 [2025-03-08 10:49:41,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:49:41,859 INFO L225 Difference]: With dead ends: 193 [2025-03-08 10:49:41,859 INFO L226 Difference]: Without dead ends: 130 [2025-03-08 10:49:41,860 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-03-08 10:49:41,860 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 64 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 10:49:41,860 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 278 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 10:49:41,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2025-03-08 10:49:41,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 111. [2025-03-08 10:49:41,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 66 states have (on average 1.2272727272727273) internal successors, (81), 66 states have internal predecessors, (81), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-08 10:49:41,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 165 transitions. [2025-03-08 10:49:41,887 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 165 transitions. Word has length 139 [2025-03-08 10:49:41,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:49:41,887 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 165 transitions. [2025-03-08 10:49:41,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-08 10:49:41,888 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 165 transitions. [2025-03-08 10:49:41,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-08 10:49:41,890 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:49:41,890 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:49:41,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 10:49:41,890 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:49:41,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:49:41,891 INFO L85 PathProgramCache]: Analyzing trace with hash -165281110, now seen corresponding path program 1 times [2025-03-08 10:49:41,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:49:41,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033515440] [2025-03-08 10:49:41,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:49:41,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:49:41,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-08 10:49:41,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-08 10:49:41,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:49:41,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:49:42,188 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-03-08 10:49:42,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:49:42,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033515440] [2025-03-08 10:49:42,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033515440] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:49:42,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:49:42,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 10:49:42,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219164133] [2025-03-08 10:49:42,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:49:42,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 10:49:42,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:49:42,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 10:49:42,193 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 10:49:42,193 INFO L87 Difference]: Start difference. First operand 111 states and 165 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-08 10:49:42,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:49:42,329 INFO L93 Difference]: Finished difference Result 247 states and 367 transitions. [2025-03-08 10:49:42,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 10:49:42,330 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 140 [2025-03-08 10:49:42,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:49:42,332 INFO L225 Difference]: With dead ends: 247 [2025-03-08 10:49:42,334 INFO L226 Difference]: Without dead ends: 184 [2025-03-08 10:49:42,334 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-03-08 10:49:42,336 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 79 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 10:49:42,336 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 276 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 10:49:42,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2025-03-08 10:49:42,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 172. [2025-03-08 10:49:42,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 105 states have (on average 1.2476190476190476) internal successors, (131), 105 states have internal predecessors, (131), 63 states have call successors, (63), 3 states have call predecessors, (63), 3 states have return successors, (63), 63 states have call predecessors, (63), 63 states have call successors, (63) [2025-03-08 10:49:42,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 257 transitions. [2025-03-08 10:49:42,361 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 257 transitions. Word has length 140 [2025-03-08 10:49:42,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:49:42,362 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 257 transitions. [2025-03-08 10:49:42,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-08 10:49:42,362 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 257 transitions. [2025-03-08 10:49:42,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-08 10:49:42,366 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:49:42,366 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:49:42,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 10:49:42,366 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:49:42,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:49:42,366 INFO L85 PathProgramCache]: Analyzing trace with hash 1939814363, now seen corresponding path program 1 times [2025-03-08 10:49:42,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:49:42,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628076539] [2025-03-08 10:49:42,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:49:42,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:49:42,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-08 10:49:42,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-08 10:49:42,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:49:42,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:49:42,948 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 9 proven. 51 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2025-03-08 10:49:42,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:49:42,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628076539] [2025-03-08 10:49:42,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628076539] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 10:49:42,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [78084974] [2025-03-08 10:49:42,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:49:42,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 10:49:42,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:49:42,951 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-03-08 10:49:42,953 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-03-08 10:49:43,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-08 10:49:43,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-08 10:49:43,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:49:43,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:49:43,071 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-08 10:49:43,077 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 10:49:43,917 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 230 proven. 51 refuted. 0 times theorem prover too weak. 559 trivial. 0 not checked. [2025-03-08 10:49:43,917 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 10:49:44,404 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 9 proven. 51 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2025-03-08 10:49:44,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [78084974] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 10:49:44,404 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 10:49:44,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 22 [2025-03-08 10:49:44,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635687790] [2025-03-08 10:49:44,405 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 10:49:44,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-08 10:49:44,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:49:44,406 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-08 10:49:44,407 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=372, Unknown=0, NotChecked=0, Total=462 [2025-03-08 10:49:44,407 INFO L87 Difference]: Start difference. First operand 172 states and 257 transitions. Second operand has 22 states, 22 states have (on average 4.636363636363637) internal successors, (102), 22 states have internal predecessors, (102), 6 states have call successors, (63), 3 states have call predecessors, (63), 6 states have return successors, (63), 6 states have call predecessors, (63), 6 states have call successors, (63) [2025-03-08 10:49:45,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:49:45,327 INFO L93 Difference]: Finished difference Result 379 states and 554 transitions. [2025-03-08 10:49:45,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-08 10:49:45,328 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 4.636363636363637) internal successors, (102), 22 states have internal predecessors, (102), 6 states have call successors, (63), 3 states have call predecessors, (63), 6 states have return successors, (63), 6 states have call predecessors, (63), 6 states have call successors, (63) Word has length 141 [2025-03-08 10:49:45,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:49:45,332 INFO L225 Difference]: With dead ends: 379 [2025-03-08 10:49:45,333 INFO L226 Difference]: Without dead ends: 255 [2025-03-08 10:49:45,334 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 273 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 368 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=359, Invalid=1281, Unknown=0, NotChecked=0, Total=1640 [2025-03-08 10:49:45,335 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 550 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 564 mSolverCounterSat, 282 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 550 SdHoareTripleChecker+Valid, 548 SdHoareTripleChecker+Invalid, 846 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 282 IncrementalHoareTripleChecker+Valid, 564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 10:49:45,336 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [550 Valid, 548 Invalid, 846 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [282 Valid, 564 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 10:49:45,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2025-03-08 10:49:45,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 217. [2025-03-08 10:49:45,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 141 states have (on average 1.2411347517730495) internal successors, (175), 143 states have internal predecessors, (175), 69 states have call successors, (69), 6 states have call predecessors, (69), 6 states have return successors, (69), 67 states have call predecessors, (69), 69 states have call successors, (69) [2025-03-08 10:49:45,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 313 transitions. [2025-03-08 10:49:45,373 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 313 transitions. Word has length 141 [2025-03-08 10:49:45,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:49:45,374 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 313 transitions. [2025-03-08 10:49:45,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 4.636363636363637) internal successors, (102), 22 states have internal predecessors, (102), 6 states have call successors, (63), 3 states have call predecessors, (63), 6 states have return successors, (63), 6 states have call predecessors, (63), 6 states have call successors, (63) [2025-03-08 10:49:45,375 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 313 transitions. [2025-03-08 10:49:45,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-08 10:49:45,378 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:49:45,378 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:49:45,385 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 10:49:45,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-03-08 10:49:45,579 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:49:45,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:49:45,579 INFO L85 PathProgramCache]: Analyzing trace with hash -2061749926, now seen corresponding path program 1 times [2025-03-08 10:49:45,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:49:45,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126546777] [2025-03-08 10:49:45,580 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:49:45,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:49:45,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-08 10:49:45,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-08 10:49:45,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:49:45,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 10:49:45,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [67674797] [2025-03-08 10:49:45,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:49:45,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 10:49:45,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:49:45,670 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-03-08 10:49:45,672 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-03-08 10:49:45,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-08 10:49:45,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-08 10:49:45,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:49:45,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:49:45,778 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-03-08 10:49:45,781 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 10:49:47,174 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 260 proven. 210 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2025-03-08 10:49:47,174 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 10:50:19,644 WARN L286 SmtUtils]: Spent 11.28s on a formula simplification that was a NOOP. DAG size: 49 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-03-08 10:50:39,515 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (mod c_~var_1_4~0 256))) (let ((.cse2 (div (mod c_~var_1_6~0 65536) .cse7)) (.cse4 (mod c_~var_1_19~0 4294967296))) (let ((.cse0 (mod (+ .cse7 c_~var_1_7~0) 65536)) (.cse1 (+ .cse4 1)) (.cse6 (mod |c_ULTIMATE.start_step_~stepLocal_2~0#1| 65536)) (.cse5 (+ (mod c_~var_1_7~0 65536) .cse7 1)) (.cse3 (mod (* c_~var_1_19~0 .cse2) 4294967296))) (and (or (< .cse0 .cse1) (not (= (mod (* .cse2 .cse0) 4294967296) .cse0))) (or (not (= .cse3 .cse0)) (< .cse4 .cse0)) (forall ((v_z_9 Int)) (or (not (= (mod (* v_z_9 .cse2) 4294967296) v_z_9)) (< v_z_9 .cse1) (< v_z_9 .cse5) (< .cse6 v_z_9))) (or (< .cse6 .cse3) (< .cse3 .cse5) (< .cse4 .cse3)))))) is different from false [2025-03-08 10:50:55,984 WARN L286 SmtUtils]: Spent 12.40s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-08 10:51:15,003 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (mod c_~var_1_4~0 256))) (let ((.cse2 (div (mod c_~var_1_6~0 65536) .cse7)) (.cse4 (mod c_~var_1_19~0 4294967296))) (let ((.cse0 (mod (+ .cse7 c_~var_1_7~0) 65536)) (.cse1 (+ .cse4 1)) (.cse6 (mod c_~var_1_17~0 65536)) (.cse5 (+ (mod c_~var_1_7~0 65536) .cse7 1)) (.cse3 (mod (* c_~var_1_19~0 .cse2) 4294967296))) (and (or (< .cse0 .cse1) (not (= (mod (* .cse2 .cse0) 4294967296) .cse0))) (or (not (= .cse3 .cse0)) (< .cse4 .cse0)) (forall ((v_z_9 Int)) (or (not (= (mod (* v_z_9 .cse2) 4294967296) v_z_9)) (< v_z_9 .cse1) (< v_z_9 .cse5) (< .cse6 v_z_9))) (or (< .cse6 .cse3) (< .cse3 .cse5) (< .cse4 .cse3)))))) is different from false