./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/bitvector/jain_5-2.c --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/bitvector/jain_5-2.c -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 51f18e80b5b0f6da04af12e6407c1afb08dc9b5e98545aeafa4f330f4ac3434e --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 10:37:32,839 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 10:37:32,886 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 10:37:32,890 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 10:37:32,890 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 10:37:32,916 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 10:37:32,917 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 10:37:32,917 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 10:37:32,917 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 10:37:32,917 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 10:37:32,917 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 10:37:32,917 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 10:37:32,918 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 10:37:32,918 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 10:37:32,918 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 10:37:32,918 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 10:37:32,918 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 10:37:32,918 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 10:37:32,918 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 10:37:32,918 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 10:37:32,918 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 10:37:32,918 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 10:37:32,918 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 10:37:32,918 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 10:37:32,918 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 10:37:32,918 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 10:37:32,918 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 10:37:32,918 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 10:37:32,918 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 10:37:32,919 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 10:37:32,919 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 10:37:32,919 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 10:37:32,919 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 10:37:32,919 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 10:37:32,919 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 10:37:32,919 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 10:37:32,919 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 10:37:32,919 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 10:37:32,919 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 10:37:32,919 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 10:37:32,919 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 10:37:32,919 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 10:37:32,919 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 10:37:32,919 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 -> 51f18e80b5b0f6da04af12e6407c1afb08dc9b5e98545aeafa4f330f4ac3434e [2025-02-05 10:37:33,137 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 10:37:33,144 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 10:37:33,146 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 10:37:33,148 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 10:37:33,148 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 10:37:33,149 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/jain_5-2.c [2025-02-05 10:37:34,301 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9468ca057/f0bbb424b2ee4c97a43198ca0e81921c/FLAG4f4b02ff5 [2025-02-05 10:37:34,521 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 10:37:34,521 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/bitvector/jain_5-2.c [2025-02-05 10:37:34,528 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9468ca057/f0bbb424b2ee4c97a43198ca0e81921c/FLAG4f4b02ff5 [2025-02-05 10:37:34,863 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9468ca057/f0bbb424b2ee4c97a43198ca0e81921c [2025-02-05 10:37:34,865 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 10:37:34,867 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 10:37:34,868 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 10:37:34,868 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 10:37:34,871 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 10:37:34,871 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:37:34" (1/1) ... [2025-02-05 10:37:34,872 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14d91769 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:37:34, skipping insertion in model container [2025-02-05 10:37:34,872 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:37:34" (1/1) ... [2025-02-05 10:37:34,881 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 10:37:34,976 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/bitvector/jain_5-2.c[665,678] [2025-02-05 10:37:34,983 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 10:37:34,991 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 10:37:34,998 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/bitvector/jain_5-2.c[665,678] [2025-02-05 10:37:35,000 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 10:37:35,011 INFO L204 MainTranslator]: Completed translation [2025-02-05 10:37:35,012 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:37:35 WrapperNode [2025-02-05 10:37:35,012 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 10:37:35,013 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 10:37:35,013 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 10:37:35,013 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 10:37:35,017 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:37:35" (1/1) ... [2025-02-05 10:37:35,023 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:37:35" (1/1) ... [2025-02-05 10:37:35,032 INFO L138 Inliner]: procedures = 13, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 25 [2025-02-05 10:37:35,034 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 10:37:35,035 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 10:37:35,035 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 10:37:35,035 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 10:37:35,040 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:37:35" (1/1) ... [2025-02-05 10:37:35,041 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:37:35" (1/1) ... [2025-02-05 10:37:35,042 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:37:35" (1/1) ... [2025-02-05 10:37:35,049 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 10:37:35,049 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:37:35" (1/1) ... [2025-02-05 10:37:35,049 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:37:35" (1/1) ... [2025-02-05 10:37:35,052 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:37:35" (1/1) ... [2025-02-05 10:37:35,054 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:37:35" (1/1) ... [2025-02-05 10:37:35,055 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:37:35" (1/1) ... [2025-02-05 10:37:35,055 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:37:35" (1/1) ... [2025-02-05 10:37:35,056 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 10:37:35,056 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 10:37:35,056 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 10:37:35,056 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 10:37:35,057 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:37:35" (1/1) ... [2025-02-05 10:37:35,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 10:37:35,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:37:35,087 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 10:37:35,094 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 10:37:35,111 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 10:37:35,112 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 10:37:35,112 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 10:37:35,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 10:37:35,148 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 10:37:35,150 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 10:37:35,241 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2025-02-05 10:37:35,241 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 10:37:35,253 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 10:37:35,253 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 10:37:35,253 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:37:35 BoogieIcfgContainer [2025-02-05 10:37:35,254 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 10:37:35,255 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 10:37:35,255 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 10:37:35,258 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 10:37:35,258 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 10:37:34" (1/3) ... [2025-02-05 10:37:35,259 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33fe6a4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:37:35, skipping insertion in model container [2025-02-05 10:37:35,259 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:37:35" (2/3) ... [2025-02-05 10:37:35,259 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33fe6a4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:37:35, skipping insertion in model container [2025-02-05 10:37:35,260 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:37:35" (3/3) ... [2025-02-05 10:37:35,261 INFO L128 eAbstractionObserver]: Analyzing ICFG jain_5-2.c [2025-02-05 10:37:35,269 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 10:37:35,272 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG jain_5-2.c that has 1 procedures, 10 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 10:37:35,313 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 10:37:35,322 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;@2bdd0a44, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 10:37:35,322 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 10:37:35,327 INFO L276 IsEmpty]: Start isEmpty. Operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:37:35,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-02-05 10:37:35,330 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:37:35,330 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-02-05 10:37:35,331 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:37:35,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:37:35,334 INFO L85 PathProgramCache]: Analyzing trace with hash 39094664, now seen corresponding path program 1 times [2025-02-05 10:37:35,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:37:35,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138802761] [2025-02-05 10:37:35,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:37:35,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:37:35,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-05 10:37:35,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-05 10:37:35,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:37:35,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:37:35,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:37:35,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:37:35,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138802761] [2025-02-05 10:37:35,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138802761] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:37:35,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:37:35,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 10:37:35,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662101032] [2025-02-05 10:37:35,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:37:35,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 10:37:35,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:37:35,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 10:37:35,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 10:37:35,512 INFO L87 Difference]: Start difference. First operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:37:35,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:37:35,531 INFO L93 Difference]: Finished difference Result 17 states and 22 transitions. [2025-02-05 10:37:35,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 10:37:35,533 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-02-05 10:37:35,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:37:35,537 INFO L225 Difference]: With dead ends: 17 [2025-02-05 10:37:35,537 INFO L226 Difference]: Without dead ends: 9 [2025-02-05 10:37:35,538 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 10:37:35,540 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:37:35,541 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 12 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:37:35,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2025-02-05 10:37:35,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2025-02-05 10:37:35,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:37:35,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2025-02-05 10:37:35,558 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2025-02-05 10:37:35,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:37:35,559 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2025-02-05 10:37:35,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:37:35,559 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2025-02-05 10:37:35,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-05 10:37:35,559 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:37:35,559 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-02-05 10:37:35,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 10:37:35,559 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:37:35,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:37:35,560 INFO L85 PathProgramCache]: Analyzing trace with hash 733841028, now seen corresponding path program 1 times [2025-02-05 10:37:35,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:37:35,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569596702] [2025-02-05 10:37:35,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:37:35,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:37:35,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-05 10:37:35,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-05 10:37:35,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:37:35,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:37:35,681 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:37:35,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:37:35,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569596702] [2025-02-05 10:37:35,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569596702] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:37:35,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [328176606] [2025-02-05 10:37:35,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:37:35,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:37:35,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:37:35,684 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 10:37:35,686 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 10:37:35,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-05 10:37:35,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-05 10:37:35,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:37:35,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:37:35,743 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-02-05 10:37:35,748 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:37:35,832 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:37:35,834 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:37:35,891 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:37:35,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [328176606] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:37:35,895 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:37:35,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-02-05 10:37:35,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958373223] [2025-02-05 10:37:35,895 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:37:35,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 10:37:35,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:37:35,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 10:37:35,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-02-05 10:37:35,896 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 9 states, 9 states have (on average 2.0) internal successors, (18), 9 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:37:35,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:37:35,988 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2025-02-05 10:37:35,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 10:37:35,989 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 9 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-02-05 10:37:35,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:37:35,989 INFO L225 Difference]: With dead ends: 20 [2025-02-05 10:37:35,989 INFO L226 Difference]: Without dead ends: 18 [2025-02-05 10:37:35,989 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2025-02-05 10:37:35,990 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 2 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:37:35,990 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 24 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:37:35,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2025-02-05 10:37:35,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2025-02-05 10:37:35,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:37:35,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2025-02-05 10:37:35,996 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 8 [2025-02-05 10:37:35,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:37:35,996 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2025-02-05 10:37:35,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 9 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:37:35,996 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2025-02-05 10:37:35,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-02-05 10:37:35,997 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:37:35,997 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1] [2025-02-05 10:37:36,004 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 10:37:36,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:37:36,202 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:37:36,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:37:36,203 INFO L85 PathProgramCache]: Analyzing trace with hash -68041080, now seen corresponding path program 2 times [2025-02-05 10:37:36,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:37:36,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072704187] [2025-02-05 10:37:36,203 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 10:37:36,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:37:36,214 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-02-05 10:37:36,234 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-02-05 10:37:36,235 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 10:37:36,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:37:36,467 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:37:36,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:37:36,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072704187] [2025-02-05 10:37:36,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072704187] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:37:36,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1353874716] [2025-02-05 10:37:36,468 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 10:37:36,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:37:36,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:37:36,470 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 10:37:36,472 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 10:37:36,492 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-02-05 10:37:36,503 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-02-05 10:37:36,503 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 10:37:36,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:37:36,504 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-02-05 10:37:36,505 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:37:36,623 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:37:36,623 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:37:36,849 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:37:36,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1353874716] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:37:36,849 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:37:36,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 20 [2025-02-05 10:37:36,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694365250] [2025-02-05 10:37:36,850 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:37:36,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-05 10:37:36,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:37:36,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-05 10:37:36,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=291, Unknown=0, NotChecked=0, Total=380 [2025-02-05 10:37:36,851 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand has 20 states, 20 states have (on average 2.25) internal successors, (45), 20 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:37:39,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:37:39,303 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2025-02-05 10:37:39,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-02-05 10:37:39,304 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.25) internal successors, (45), 20 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-02-05 10:37:39,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:37:39,305 INFO L225 Difference]: With dead ends: 38 [2025-02-05 10:37:39,305 INFO L226 Difference]: Without dead ends: 36 [2025-02-05 10:37:39,305 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=273, Invalid=719, Unknown=0, NotChecked=0, Total=992 [2025-02-05 10:37:39,306 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 2 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 10:37:39,306 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 57 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 10:37:39,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-02-05 10:37:39,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2025-02-05 10:37:39,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.0285714285714285) internal successors, (36), 35 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:37:39,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2025-02-05 10:37:39,313 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 17 [2025-02-05 10:37:39,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:37:39,313 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2025-02-05 10:37:39,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.25) internal successors, (45), 20 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:37:39,314 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2025-02-05 10:37:39,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-02-05 10:37:39,314 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:37:39,314 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 1, 1, 1, 1] [2025-02-05 10:37:39,320 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-05 10:37:39,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:37:39,519 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:37:39,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:37:39,519 INFO L85 PathProgramCache]: Analyzing trace with hash -839314936, now seen corresponding path program 3 times [2025-02-05 10:37:39,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:37:39,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878634204] [2025-02-05 10:37:39,519 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-05 10:37:39,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:37:39,526 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 35 statements into 11 equivalence classes. [2025-02-05 10:37:39,668 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 35 of 35 statements. [2025-02-05 10:37:39,668 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-02-05 10:37:39,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:37:39,956 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:37:39,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:37:39,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878634204] [2025-02-05 10:37:39,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878634204] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:37:39,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1461658095] [2025-02-05 10:37:39,957 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-05 10:37:39,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:37:39,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:37:39,959 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 10:37:39,960 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 10:37:39,984 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 35 statements into 11 equivalence classes. [2025-02-05 10:37:40,738 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 35 of 35 statements. [2025-02-05 10:37:40,738 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-02-05 10:37:40,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:37:40,741 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 67 conjuncts are in the unsatisfiable core [2025-02-05 10:37:40,745 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:37:41,125 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:37:41,126 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:37:46,740 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:37:46,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1461658095] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:37:46,741 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:37:46,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17, 17] total 42 [2025-02-05 10:37:46,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266119096] [2025-02-05 10:37:46,741 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:37:46,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-02-05 10:37:46,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:37:46,742 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-02-05 10:37:46,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=338, Invalid=1384, Unknown=0, NotChecked=0, Total=1722 [2025-02-05 10:37:46,743 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand has 42 states, 42 states have (on average 2.357142857142857) internal successors, (99), 42 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:37:51,024 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 144 (* |c_ULTIMATE.start_main_~y~0#1| 9)) 4294967296))) (.cse0 (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 10) |c_ULTIMATE.start_main_~x~0#1| 180) 4294967296) 30)) (.cse6 (= 30 (mod (+ |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (.cse5 (= (mod (+ 40 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 5)) 4294967296) 30)) (.cse8 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 6) 60) 4294967296) 30)) (.cse1 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 7) 84) 4294967296) 30)) (.cse4 (= 30 (mod (+ 112 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 8)) 4294967296))) (.cse7 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 4) 24) 4294967296))) (.cse9 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 2) 4) 4294967296) 30)) (.cse2 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12 (* |c_ULTIMATE.start_main_~y~0#1| 3)) 4294967296) 30))) (and (or (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 11) 220) 4294967296) 30)) .cse0 .cse1 .cse2) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| 1) (or (not .cse3) .cse4 .cse5 .cse6) (not .cse6) (or (not .cse5) .cse7 .cse6) (or .cse8 .cse3 (not .cse0) .cse9) (or .cse8 .cse2 (not .cse1)) (or (not .cse9) .cse6) (or .cse2 (not .cse7)) (or .cse5 .cse9 (not .cse8)) (or .cse1 (not .cse4) .cse7) (or .cse9 (not .cse2)))) is different from false [2025-02-05 10:37:55,031 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 144 (* |c_ULTIMATE.start_main_~y~0#1| 9)) 4294967296))) (.cse3 (= 30 (mod (+ |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (.cse2 (= (mod (+ 40 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 5)) 4294967296) 30)) (.cse5 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 6) 60) 4294967296) 30)) (.cse8 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 7) 84) 4294967296) 30)) (.cse1 (= 30 (mod (+ 112 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 8)) 4294967296))) (.cse4 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 4) 24) 4294967296))) (.cse6 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 2) 4) 4294967296) 30)) (.cse7 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12 (* |c_ULTIMATE.start_main_~y~0#1| 3)) 4294967296) 30))) (and (or (not .cse0) .cse1 .cse2 .cse3) (not .cse3) (or (not .cse2) .cse4 .cse3) (or .cse5 .cse0 (not (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 10) |c_ULTIMATE.start_main_~x~0#1| 180) 4294967296) 30)) .cse6) (or .cse5 .cse7 (not .cse8)) (or (not .cse6) .cse3) (or .cse7 (not .cse4)) (or .cse2 .cse6 (not .cse5)) (or .cse8 (not .cse1) .cse4) (or .cse6 (not .cse7)))) is different from false