./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-59.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-59.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 3ee40dd4c738937df3cfe28722079ab6375e7aef2ee40a12cb1af18759ea102b --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 22:47:06,590 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 22:47:06,629 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 22:47:06,633 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 22:47:06,635 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 22:47:06,661 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 22:47:06,661 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 22:47:06,661 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 22:47:06,662 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 22:47:06,662 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 22:47:06,662 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 22:47:06,662 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 22:47:06,662 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 22:47:06,662 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 22:47:06,662 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 22:47:06,662 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 22:47:06,663 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 22:47:06,663 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 22:47:06,663 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 22:47:06,663 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 22:47:06,663 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 22:47:06,663 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 22:47:06,663 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 22:47:06,663 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 22:47:06,663 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 22:47:06,663 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 22:47:06,663 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 22:47:06,664 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 22:47:06,664 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 22:47:06,664 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 22:47:06,664 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 22:47:06,664 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 22:47:06,664 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 22:47:06,664 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 22:47:06,664 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 22:47:06,664 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 22:47:06,664 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 22:47:06,664 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 22:47:06,665 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 22:47:06,665 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 22:47:06,665 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 22:47:06,665 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 22:47:06,665 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 22:47:06,665 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-jdk21/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 -> 3ee40dd4c738937df3cfe28722079ab6375e7aef2ee40a12cb1af18759ea102b [2025-02-05 22:47:06,888 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 22:47:06,893 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 22:47:06,895 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 22:47:06,895 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 22:47:06,896 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 22:47:06,896 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-59.i [2025-02-05 22:47:08,003 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bad9f95f0/38dfc16300e64974bea0c40f8b874be9/FLAG9248ce218 [2025-02-05 22:47:08,295 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 22:47:08,295 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-59.i [2025-02-05 22:47:08,313 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bad9f95f0/38dfc16300e64974bea0c40f8b874be9/FLAG9248ce218 [2025-02-05 22:47:08,335 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bad9f95f0/38dfc16300e64974bea0c40f8b874be9 [2025-02-05 22:47:08,337 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 22:47:08,341 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 22:47:08,346 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 22:47:08,346 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 22:47:08,350 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 22:47:08,354 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:47:08" (1/1) ... [2025-02-05 22:47:08,356 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4917128f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:47:08, skipping insertion in model container [2025-02-05 22:47:08,356 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:47:08" (1/1) ... [2025-02-05 22:47:08,391 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 22:47:08,490 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-59.i[919,932] [2025-02-05 22:47:08,552 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 22:47:08,566 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 22:47:08,574 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-59.i[919,932] [2025-02-05 22:47:08,605 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 22:47:08,621 INFO L204 MainTranslator]: Completed translation [2025-02-05 22:47:08,621 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:47:08 WrapperNode [2025-02-05 22:47:08,622 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 22:47:08,622 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 22:47:08,623 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 22:47:08,623 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 22:47:08,626 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:47:08" (1/1) ... [2025-02-05 22:47:08,636 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:47:08" (1/1) ... [2025-02-05 22:47:08,666 INFO L138 Inliner]: procedures = 26, calls = 40, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 211 [2025-02-05 22:47:08,667 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 22:47:08,667 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 22:47:08,667 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 22:47:08,667 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 22:47:08,674 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:47:08" (1/1) ... [2025-02-05 22:47:08,675 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:47:08" (1/1) ... [2025-02-05 22:47:08,677 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:47:08" (1/1) ... [2025-02-05 22:47:08,694 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-02-05 22:47:08,695 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:47:08" (1/1) ... [2025-02-05 22:47:08,695 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:47:08" (1/1) ... [2025-02-05 22:47:08,702 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:47:08" (1/1) ... [2025-02-05 22:47:08,703 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:47:08" (1/1) ... [2025-02-05 22:47:08,704 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:47:08" (1/1) ... [2025-02-05 22:47:08,705 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:47:08" (1/1) ... [2025-02-05 22:47:08,707 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 22:47:08,708 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 22:47:08,708 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 22:47:08,708 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 22:47:08,709 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:47:08" (1/1) ... [2025-02-05 22:47:08,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 22:47:08,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 22:47:08,739 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 22:47:08,748 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 22:47:08,768 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 22:47:08,768 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 22:47:08,768 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 22:47:08,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 22:47:08,769 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 22:47:08,769 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 22:47:08,821 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 22:47:08,824 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 22:47:09,086 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2025-02-05 22:47:09,087 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 22:47:09,098 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 22:47:09,098 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 22:47:09,098 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:47:09 BoogieIcfgContainer [2025-02-05 22:47:09,099 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 22:47:09,100 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 22:47:09,100 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 22:47:09,103 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 22:47:09,103 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 10:47:08" (1/3) ... [2025-02-05 22:47:09,104 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47eedf9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:47:09, skipping insertion in model container [2025-02-05 22:47:09,104 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:47:08" (2/3) ... [2025-02-05 22:47:09,104 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47eedf9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:47:09, skipping insertion in model container [2025-02-05 22:47:09,104 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:47:09" (3/3) ... [2025-02-05 22:47:09,105 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-co_file-59.i [2025-02-05 22:47:09,115 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 22:47:09,117 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pe-co_file-59.i that has 2 procedures, 90 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 22:47:09,164 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 22:47:09,174 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;@370051ba, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 22:47:09,174 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 22:47:09,178 INFO L276 IsEmpty]: Start isEmpty. Operand has 90 states, 60 states have (on average 1.5) internal successors, (90), 61 states have internal predecessors, (90), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-02-05 22:47:09,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-02-05 22:47:09,187 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:47:09,188 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 22:47:09,188 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:47:09,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:47:09,191 INFO L85 PathProgramCache]: Analyzing trace with hash 782060527, now seen corresponding path program 1 times [2025-02-05 22:47:09,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:47:09,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544824297] [2025-02-05 22:47:09,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:47:09,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:47:09,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-02-05 22:47:09,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-02-05 22:47:09,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:47:09,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:47:09,445 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 1352 trivial. 0 not checked. [2025-02-05 22:47:09,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:47:09,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544824297] [2025-02-05 22:47:09,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544824297] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 22:47:09,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1464134515] [2025-02-05 22:47:09,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:47:09,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 22:47:09,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 22:47:09,449 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 22:47:09,453 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 22:47:09,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-02-05 22:47:09,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-02-05 22:47:09,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:47:09,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:47:09,593 INFO L256 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 22:47:09,600 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 22:47:09,628 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 1352 trivial. 0 not checked. [2025-02-05 22:47:09,628 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 22:47:09,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1464134515] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:47:09,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 22:47:09,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-05 22:47:09,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273352010] [2025-02-05 22:47:09,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:47:09,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 22:47:09,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:47:09,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 22:47:09,646 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 22:47:09,648 INFO L87 Difference]: Start difference. First operand has 90 states, 60 states have (on average 1.5) internal successors, (90), 61 states have internal predecessors, (90), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) [2025-02-05 22:47:09,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:47:09,676 INFO L93 Difference]: Finished difference Result 174 states and 310 transitions. [2025-02-05 22:47:09,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 22:47:09,677 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) Word has length 174 [2025-02-05 22:47:09,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:47:09,681 INFO L225 Difference]: With dead ends: 174 [2025-02-05 22:47:09,682 INFO L226 Difference]: Without dead ends: 87 [2025-02-05 22:47:09,685 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 175 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-02-05 22:47:09,688 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 22:47:09,689 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 135 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 22:47:09,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-02-05 22:47:09,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2025-02-05 22:47:09,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 58 states have (on average 1.4310344827586208) internal successors, (83), 58 states have internal predecessors, (83), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-02-05 22:47:09,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 137 transitions. [2025-02-05 22:47:09,722 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 137 transitions. Word has length 174 [2025-02-05 22:47:09,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:47:09,722 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 137 transitions. [2025-02-05 22:47:09,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) [2025-02-05 22:47:09,723 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 137 transitions. [2025-02-05 22:47:09,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-02-05 22:47:09,725 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:47:09,725 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 22:47:09,733 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-05 22:47:09,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-05 22:47:09,926 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:47:09,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:47:09,926 INFO L85 PathProgramCache]: Analyzing trace with hash -157998316, now seen corresponding path program 1 times [2025-02-05 22:47:09,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:47:09,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950282277] [2025-02-05 22:47:09,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:47:09,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:47:09,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-02-05 22:47:09,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-02-05 22:47:09,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:47:09,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:47:10,310 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-02-05 22:47:10,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:47:10,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950282277] [2025-02-05 22:47:10,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950282277] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:47:10,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:47:10,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 22:47:10,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819472270] [2025-02-05 22:47:10,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:47:10,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 22:47:10,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:47:10,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 22:47:10,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 22:47:10,317 INFO L87 Difference]: Start difference. First operand 87 states and 137 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-02-05 22:47:10,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:47:10,470 INFO L93 Difference]: Finished difference Result 256 states and 406 transitions. [2025-02-05 22:47:10,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 22:47:10,471 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 174 [2025-02-05 22:47:10,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:47:10,475 INFO L225 Difference]: With dead ends: 256 [2025-02-05 22:47:10,475 INFO L226 Difference]: Without dead ends: 172 [2025-02-05 22:47:10,475 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-02-05 22:47:10,477 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 89 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 22:47:10,477 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 387 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 22:47:10,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2025-02-05 22:47:10,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 135. [2025-02-05 22:47:10,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 78 states have (on average 1.3205128205128205) internal successors, (103), 78 states have internal predecessors, (103), 54 states have call successors, (54), 2 states have call predecessors, (54), 2 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2025-02-05 22:47:10,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 211 transitions. [2025-02-05 22:47:10,507 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 211 transitions. Word has length 174 [2025-02-05 22:47:10,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:47:10,508 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 211 transitions. [2025-02-05 22:47:10,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-02-05 22:47:10,508 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 211 transitions. [2025-02-05 22:47:10,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-02-05 22:47:10,512 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:47:10,512 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 22:47:10,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 22:47:10,512 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:47:10,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:47:10,513 INFO L85 PathProgramCache]: Analyzing trace with hash -310115550, now seen corresponding path program 1 times [2025-02-05 22:47:10,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:47:10,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619140331] [2025-02-05 22:47:10,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:47:10,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:47:10,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-02-05 22:47:10,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-02-05 22:47:10,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:47:10,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:47:10,790 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-02-05 22:47:10,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:47:10,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619140331] [2025-02-05 22:47:10,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619140331] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:47:10,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:47:10,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 22:47:10,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332359349] [2025-02-05 22:47:10,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:47:10,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 22:47:10,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:47:10,791 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 22:47:10,791 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 22:47:10,791 INFO L87 Difference]: Start difference. First operand 135 states and 211 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-02-05 22:47:10,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:47:10,944 INFO L93 Difference]: Finished difference Result 331 states and 523 transitions. [2025-02-05 22:47:10,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 22:47:10,944 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 175 [2025-02-05 22:47:10,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:47:10,946 INFO L225 Difference]: With dead ends: 331 [2025-02-05 22:47:10,947 INFO L226 Difference]: Without dead ends: 247 [2025-02-05 22:47:10,947 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-02-05 22:47:10,948 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 136 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 22:47:10,948 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 417 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 22:47:10,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2025-02-05 22:47:10,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 217. [2025-02-05 22:47:10,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 132 states have (on average 1.3636363636363635) internal successors, (180), 132 states have internal predecessors, (180), 81 states have call successors, (81), 3 states have call predecessors, (81), 3 states have return successors, (81), 81 states have call predecessors, (81), 81 states have call successors, (81) [2025-02-05 22:47:10,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 342 transitions. [2025-02-05 22:47:10,970 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 342 transitions. Word has length 175 [2025-02-05 22:47:10,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:47:10,970 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 342 transitions. [2025-02-05 22:47:10,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-02-05 22:47:10,970 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 342 transitions. [2025-02-05 22:47:10,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-02-05 22:47:10,973 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:47:10,973 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 22:47:10,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 22:47:10,973 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:47:10,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:47:10,974 INFO L85 PathProgramCache]: Analyzing trace with hash -2034330893, now seen corresponding path program 1 times [2025-02-05 22:47:10,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:47:10,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611427736] [2025-02-05 22:47:10,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:47:10,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:47:10,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-02-05 22:47:11,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-02-05 22:47:11,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:47:11,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:47:11,532 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 6 proven. 72 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2025-02-05 22:47:11,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:47:11,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611427736] [2025-02-05 22:47:11,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611427736] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 22:47:11,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1315659678] [2025-02-05 22:47:11,532 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:47:11,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 22:47:11,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 22:47:11,534 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 22:47:11,536 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 22:47:11,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-02-05 22:47:11,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-02-05 22:47:11,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:47:11,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:47:11,643 INFO L256 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-05 22:47:11,647 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 22:47:11,961 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 222 proven. 72 refuted. 0 times theorem prover too weak. 1110 trivial. 0 not checked. [2025-02-05 22:47:11,961 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 22:47:12,193 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 6 proven. 72 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2025-02-05 22:47:12,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1315659678] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 22:47:12,193 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 22:47:12,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2025-02-05 22:47:12,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398432107] [2025-02-05 22:47:12,193 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 22:47:12,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 22:47:12,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:47:12,195 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 22:47:12,195 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-02-05 22:47:12,195 INFO L87 Difference]: Start difference. First operand 217 states and 342 transitions. Second operand has 10 states, 10 states have (on average 7.7) internal successors, (77), 10 states have internal predecessors, (77), 2 states have call successors, (51), 2 states have call predecessors, (51), 4 states have return successors, (52), 2 states have call predecessors, (52), 2 states have call successors, (52) [2025-02-05 22:47:12,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:47:12,508 INFO L93 Difference]: Finished difference Result 407 states and 628 transitions. [2025-02-05 22:47:12,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-05 22:47:12,509 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.7) internal successors, (77), 10 states have internal predecessors, (77), 2 states have call successors, (51), 2 states have call predecessors, (51), 4 states have return successors, (52), 2 states have call predecessors, (52), 2 states have call successors, (52) Word has length 176 [2025-02-05 22:47:12,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:47:12,511 INFO L225 Difference]: With dead ends: 407 [2025-02-05 22:47:12,511 INFO L226 Difference]: Without dead ends: 241 [2025-02-05 22:47:12,512 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 368 GetRequests, 350 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=204, Unknown=0, NotChecked=0, Total=306 [2025-02-05 22:47:12,512 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 131 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 22:47:12,514 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 256 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 22:47:12,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2025-02-05 22:47:12,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 229. [2025-02-05 22:47:12,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 141 states have (on average 1.3120567375886525) internal successors, (185), 141 states have internal predecessors, (185), 81 states have call successors, (81), 6 states have call predecessors, (81), 6 states have return successors, (81), 81 states have call predecessors, (81), 81 states have call successors, (81) [2025-02-05 22:47:12,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 347 transitions. [2025-02-05 22:47:12,552 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 347 transitions. Word has length 176 [2025-02-05 22:47:12,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:47:12,553 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 347 transitions. [2025-02-05 22:47:12,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.7) internal successors, (77), 10 states have internal predecessors, (77), 2 states have call successors, (51), 2 states have call predecessors, (51), 4 states have return successors, (52), 2 states have call predecessors, (52), 2 states have call successors, (52) [2025-02-05 22:47:12,554 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 347 transitions. [2025-02-05 22:47:12,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-02-05 22:47:12,556 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:47:12,556 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 22:47:12,566 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-05 22:47:12,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 22:47:12,760 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:47:12,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:47:12,761 INFO L85 PathProgramCache]: Analyzing trace with hash -1758822365, now seen corresponding path program 1 times [2025-02-05 22:47:12,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:47:12,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940037297] [2025-02-05 22:47:12,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:47:12,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:47:12,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-02-05 22:47:12,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-02-05 22:47:12,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:47:12,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-05 22:47:12,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [52392004] [2025-02-05 22:47:12,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:47:12,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 22:47:12,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 22:47:12,856 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 22:47:12,857 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-05 22:47:12,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-02-05 22:47:12,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-02-05 22:47:12,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:47:12,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:47:12,993 INFO L256 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-02-05 22:47:13,000 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 22:47:14,759 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 338 proven. 300 refuted. 0 times theorem prover too weak. 766 trivial. 0 not checked. [2025-02-05 22:47:14,759 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 22:47:34,935 WARN L286 SmtUtils]: Spent 6.98s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-02-05 22:47:47,540 WARN L286 SmtUtils]: Spent 6.48s on a formula simplification that was a NOOP. DAG size: 52 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-02-05 22:47:57,836 WARN L286 SmtUtils]: Spent 6.20s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-02-05 22:48:02,391 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_~var_1_19~0 4294967296))) (or (= .cse0 0) (let ((.cse7 (mod c_~var_1_4~0 256))) (let ((.cse3 (div (mod c_~var_1_6~0 65536) .cse7))) (let ((.cse1 (mod (+ .cse7 c_~var_1_7~0) 65536)) (.cse4 (mod (* c_~var_1_19~0 .cse3) 4294967296)) (.cse5 (mod |c_ULTIMATE.start_step_~stepLocal_2~0#1| 65536)) (.cse6 (+ (mod c_~var_1_7~0 65536) .cse7 1)) (.cse2 (+ .cse0 1))) (and (or (< .cse1 .cse2) (not (= (mod (* .cse3 .cse1) 4294967296) .cse1))) (or (not (= .cse4 .cse1)) (< .cse0 .cse1)) (or (< .cse5 .cse4) (< .cse4 .cse6) (< .cse0 .cse4)) (forall ((v_z_20 Int)) (or (< .cse5 v_z_20) (< v_z_20 .cse6) (< v_z_20 .cse2) (not (= v_z_20 (mod (* v_z_20 .cse3) 4294967296))))))))))) is different from false [2025-02-05 22:48:24,956 WARN L286 SmtUtils]: Spent 14.53s 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-02-05 22:48:34,985 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (mod c_~var_1_19~0 4294967296))) (or (let ((.cse7 (mod c_~var_1_4~0 256))) (let ((.cse3 (div (mod c_~var_1_6~0 65536) .cse7))) (let ((.cse2 (+ .cse6 1)) (.cse4 (mod (+ .cse7 c_~var_1_7~0) 65536)) (.cse0 (mod c_~var_1_17~0 65536)) (.cse1 (+ (mod c_~var_1_7~0 65536) .cse7 1)) (.cse5 (mod (* c_~var_1_19~0 .cse3) 4294967296))) (and (forall ((v_z_20 Int)) (or (< .cse0 v_z_20) (< v_z_20 .cse1) (< v_z_20 .cse2) (not (= v_z_20 (mod (* v_z_20 .cse3) 4294967296))))) (or (< .cse4 .cse2) (not (= (mod (* .cse3 .cse4) 4294967296) .cse4))) (or (not (= .cse5 .cse4)) (< .cse6 .cse4)) (or (< .cse0 .cse5) (< .cse5 .cse1) (< .cse6 .cse5)))))) (= .cse6 0))) is different from false [2025-02-05 22:48:50,554 WARN L286 SmtUtils]: Spent 5.37s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)