./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/bitvector/gcd_3.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d 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/gcd_3.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 17434adceb46f4d2d18d3a85d6d4ed55515fdf3dbd1a573601edbae0be0a7746 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 17:27:27,071 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 17:27:27,136 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-07 17:27:27,144 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 17:27:27,144 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 17:27:27,161 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 17:27:27,162 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 17:27:27,162 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 17:27:27,162 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 17:27:27,162 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 17:27:27,163 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 17:27:27,163 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 17:27:27,163 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 17:27:27,163 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 17:27:27,163 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 17:27:27,163 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 17:27:27,163 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 17:27:27,163 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-07 17:27:27,163 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-07 17:27:27,163 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-07 17:27:27,164 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 17:27:27,164 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 17:27:27,164 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 17:27:27,164 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 17:27:27,164 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-07 17:27:27,164 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 17:27:27,164 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 17:27:27,164 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 17:27:27,164 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 17:27:27,164 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 17:27:27,164 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 17:27:27,165 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 17:27:27,165 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 17:27:27,165 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 17:27:27,165 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 17:27:27,165 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 17:27:27,165 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 17:27:27,165 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-07 17:27:27,165 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-07 17:27:27,165 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 17:27:27,165 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 17:27:27,165 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 17:27:27,166 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 17:27:27,166 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 -> 17434adceb46f4d2d18d3a85d6d4ed55515fdf3dbd1a573601edbae0be0a7746 [2025-02-07 17:27:27,492 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 17:27:27,501 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 17:27:27,502 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 17:27:27,504 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 17:27:27,504 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 17:27:27,504 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/gcd_3.c [2025-02-07 17:27:28,774 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a30794bc1/fb7797ab642b49659d54b88857fea961/FLAGa111e1a27 [2025-02-07 17:27:29,005 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 17:27:29,007 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/bitvector/gcd_3.c [2025-02-07 17:27:29,016 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a30794bc1/fb7797ab642b49659d54b88857fea961/FLAGa111e1a27 [2025-02-07 17:27:29,348 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a30794bc1/fb7797ab642b49659d54b88857fea961 [2025-02-07 17:27:29,351 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 17:27:29,352 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 17:27:29,353 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 17:27:29,354 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 17:27:29,358 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 17:27:29,359 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 05:27:29" (1/1) ... [2025-02-07 17:27:29,360 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d8c171b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:27:29, skipping insertion in model container [2025-02-07 17:27:29,360 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 05:27:29" (1/1) ... [2025-02-07 17:27:29,371 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 17:27:29,465 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/gcd_3.c[664,677] [2025-02-07 17:27:29,473 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 17:27:29,479 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 17:27:29,485 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/gcd_3.c[664,677] [2025-02-07 17:27:29,488 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 17:27:29,496 INFO L204 MainTranslator]: Completed translation [2025-02-07 17:27:29,496 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:27:29 WrapperNode [2025-02-07 17:27:29,496 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 17:27:29,497 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 17:27:29,497 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 17:27:29,497 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 17:27:29,501 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:27:29" (1/1) ... [2025-02-07 17:27:29,505 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:27:29" (1/1) ... [2025-02-07 17:27:29,514 INFO L138 Inliner]: procedures = 14, calls = 17, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 53 [2025-02-07 17:27:29,514 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 17:27:29,514 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 17:27:29,515 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 17:27:29,515 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 17:27:29,520 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:27:29" (1/1) ... [2025-02-07 17:27:29,520 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:27:29" (1/1) ... [2025-02-07 17:27:29,521 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:27:29" (1/1) ... [2025-02-07 17:27:29,527 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2025-02-07 17:27:29,527 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:27:29" (1/1) ... [2025-02-07 17:27:29,528 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:27:29" (1/1) ... [2025-02-07 17:27:29,529 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:27:29" (1/1) ... [2025-02-07 17:27:29,530 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:27:29" (1/1) ... [2025-02-07 17:27:29,530 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:27:29" (1/1) ... [2025-02-07 17:27:29,530 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:27:29" (1/1) ... [2025-02-07 17:27:29,531 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 17:27:29,532 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 17:27:29,532 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 17:27:29,532 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 17:27:29,532 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:27:29" (1/1) ... [2025-02-07 17:27:29,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 17:27:29,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:27:29,553 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-07 17:27:29,556 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-07 17:27:29,585 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 17:27:29,585 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-07 17:27:29,585 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-07 17:27:29,586 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 17:27:29,587 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 17:27:29,631 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 17:27:29,633 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 17:27:29,740 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L45: havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; [2025-02-07 17:27:29,746 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2025-02-07 17:27:29,746 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 17:27:29,751 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 17:27:29,751 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 17:27:29,751 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 05:27:29 BoogieIcfgContainer [2025-02-07 17:27:29,752 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 17:27:29,753 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 17:27:29,754 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 17:27:29,757 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 17:27:29,757 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 05:27:29" (1/3) ... [2025-02-07 17:27:29,757 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@565d0400 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 05:27:29, skipping insertion in model container [2025-02-07 17:27:29,757 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:27:29" (2/3) ... [2025-02-07 17:27:29,757 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@565d0400 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 05:27:29, skipping insertion in model container [2025-02-07 17:27:29,757 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 05:27:29" (3/3) ... [2025-02-07 17:27:29,758 INFO L128 eAbstractionObserver]: Analyzing ICFG gcd_3.c [2025-02-07 17:27:29,767 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 17:27:29,768 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG gcd_3.c that has 1 procedures, 12 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-07 17:27:29,805 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 17:27:29,812 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;@66b6c18, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 17:27:29,813 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-07 17:27:29,815 INFO L276 IsEmpty]: Start isEmpty. Operand has 12 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:27:29,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-07 17:27:29,818 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:27:29,818 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-07 17:27:29,818 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:27:29,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:27:29,821 INFO L85 PathProgramCache]: Analyzing trace with hash -1741890935, now seen corresponding path program 1 times [2025-02-07 17:27:29,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:27:29,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111269209] [2025-02-07 17:27:29,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:27:29,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:27:29,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-07 17:27:29,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-07 17:27:29,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:27:29,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:27:30,025 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-07 17:27:30,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:27:30,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111269209] [2025-02-07 17:27:30,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111269209] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 17:27:30,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 17:27:30,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 17:27:30,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177094753] [2025-02-07 17:27:30,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 17:27:30,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 17:27:30,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:27:30,045 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 17:27:30,046 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 17:27:30,047 INFO L87 Difference]: Start difference. First operand has 12 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:27:30,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:27:30,115 INFO L93 Difference]: Finished difference Result 21 states and 29 transitions. [2025-02-07 17:27:30,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 17:27:30,119 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-02-07 17:27:30,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:27:30,124 INFO L225 Difference]: With dead ends: 21 [2025-02-07 17:27:30,124 INFO L226 Difference]: Without dead ends: 9 [2025-02-07 17:27:30,127 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-07 17:27:30,130 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 8 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 17:27:30,131 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 19 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 17:27:30,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2025-02-07 17:27:30,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2025-02-07 17:27:30,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 7 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-07 17:27:30,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2025-02-07 17:27:30,153 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 9 transitions. Word has length 7 [2025-02-07 17:27:30,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:27:30,153 INFO L471 AbstractCegarLoop]: Abstraction has 8 states and 9 transitions. [2025-02-07 17:27:30,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:27:30,153 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2025-02-07 17:27:30,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-07 17:27:30,153 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:27:30,153 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-07 17:27:30,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-07 17:27:30,154 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:27:30,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:27:30,154 INFO L85 PathProgramCache]: Analyzing trace with hash -1713261784, now seen corresponding path program 1 times [2025-02-07 17:27:30,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:27:30,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076514116] [2025-02-07 17:27:30,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:27:30,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:27:30,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-07 17:27:30,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-07 17:27:30,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:27:30,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:27:30,302 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-07 17:27:30,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:27:30,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076514116] [2025-02-07 17:27:30,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076514116] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 17:27:30,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 17:27:30,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 17:27:30,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382993626] [2025-02-07 17:27:30,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 17:27:30,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 17:27:30,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:27:30,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 17:27:30,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 17:27:30,305 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:27:30,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:27:30,328 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2025-02-07 17:27:30,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 17:27:30,328 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-02-07 17:27:30,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:27:30,329 INFO L225 Difference]: With dead ends: 13 [2025-02-07 17:27:30,329 INFO L226 Difference]: Without dead ends: 9 [2025-02-07 17:27:30,329 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 17:27:30,329 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 1 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 17:27:30,330 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 15 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 17:27:30,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2025-02-07 17:27:30,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2025-02-07 17:27:30,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 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-07 17:27:30,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2025-02-07 17:27:30,333 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 7 [2025-02-07 17:27:30,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:27:30,333 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2025-02-07 17:27:30,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:27:30,333 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2025-02-07 17:27:30,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-07 17:27:30,334 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:27:30,334 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 17:27:30,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-07 17:27:30,334 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:27:30,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:27:30,335 INFO L85 PathProgramCache]: Analyzing trace with hash -1570522692, now seen corresponding path program 1 times [2025-02-07 17:27:30,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:27:30,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090057262] [2025-02-07 17:27:30,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:27:30,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:27:30,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-07 17:27:30,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-07 17:27:30,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:27:30,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-07 17:27:30,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [486380882] [2025-02-07 17:27:30,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:27:30,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:27:30,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:27:30,382 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-07 17:27:30,384 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-07 17:27:30,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-07 17:27:30,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-07 17:27:30,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:27:30,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:27:30,430 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-02-07 17:27:30,434 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 17:27:30,751 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 17:27:30,752 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 17:27:42,229 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 17:27:42,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:27:42,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090057262] [2025-02-07 17:27:42,230 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-07 17:27:42,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [486380882] [2025-02-07 17:27:42,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [486380882] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 17:27:42,230 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-07 17:27:42,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2025-02-07 17:27:42,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750869448] [2025-02-07 17:27:42,230 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-07 17:27:42,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-07 17:27:42,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:27:42,231 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-07 17:27:42,231 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=79, Unknown=2, NotChecked=0, Total=110 [2025-02-07 17:27:42,231 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand has 11 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 10 states have internal predecessors, (14), 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-07 17:27:51,519 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2025-02-07 17:27:51,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:27:51,602 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2025-02-07 17:27:51,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-07 17:27:51,602 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 10 states have internal predecessors, (14), 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-07 17:27:51,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:27:51,602 INFO L225 Difference]: With dead ends: 17 [2025-02-07 17:27:51,602 INFO L226 Difference]: Without dead ends: 12 [2025-02-07 17:27:51,606 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 14.8s TimeCoverageRelationStatistics Valid=36, Invalid=93, Unknown=3, NotChecked=0, Total=132 [2025-02-07 17:27:51,606 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 4 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2025-02-07 17:27:51,606 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 23 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 43 Invalid, 1 Unknown, 0 Unchecked, 4.5s Time] [2025-02-07 17:27:51,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2025-02-07 17:27:51,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2025-02-07 17:27:51,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 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-07 17:27:51,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2025-02-07 17:27:51,613 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 8 [2025-02-07 17:27:51,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:27:51,613 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 13 transitions. [2025-02-07 17:27:51,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 10 states have internal predecessors, (14), 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-07 17:27:51,613 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2025-02-07 17:27:51,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-07 17:27:51,613 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:27:51,613 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 17:27:51,620 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-07 17:27:51,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:27:51,814 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:27:51,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:27:51,815 INFO L85 PathProgramCache]: Analyzing trace with hash -1384597464, now seen corresponding path program 2 times [2025-02-07 17:27:51,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:27:51,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910015036] [2025-02-07 17:27:51,819 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 17:27:51,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:27:51,833 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-02-07 17:27:51,883 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-02-07 17:27:51,883 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 17:27:51,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-07 17:27:51,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2042158092] [2025-02-07 17:27:51,885 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 17:27:51,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:27:51,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:27:51,887 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-07 17:27:51,895 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-07 17:27:51,917 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-02-07 17:27:51,976 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-02-07 17:27:51,976 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 17:27:51,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:27:51,977 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-02-07 17:27:51,982 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 17:28:01,409 WARN L851 $PredicateComparison]: unable to prove that (and (<= 0 |c_ULTIMATE.start_main_~x~0#1|) (let ((.cse3 (* |c_ULTIMATE.start_gcd_test_~a#1| 255))) (let ((.cse15 (+ |c_ULTIMATE.start_gcd_test_~a#1| 256)) (.cse20 (mod .cse3 256)) (.cse9 (mod |c_ULTIMATE.start_gcd_test_~a#1| 256))) (let ((.cse0 (<= 0 |c_ULTIMATE.start_gcd_test_~a#1|)) (.cse22 (<= (+ |c_ULTIMATE.start_gcd_test_~a#1| 1) 0)) (.cse19 (<= 128 .cse9)) (.cse7 (= |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse8 (<= 128 .cse20)) (.cse21 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (and (= (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |c_ULTIMATE.start_gcd_test_~a#1|) 0) (= .cse15 (mod (mod |c_ULTIMATE.start_main_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_14|) 256)) (not (= |v_ULTIMATE.start_gcd_test_~a#1_14| 0))))) (.cse1 (+ |c_ULTIMATE.start_gcd_test_~b#1| 256))) (or (and .cse0 (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse2 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |c_ULTIMATE.start_gcd_test_~a#1|)) (.cse4 (mod (mod |c_ULTIMATE.start_main_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_14|) 256))) (and (= .cse1 (mod (+ .cse2 .cse3) 256)) (not (= .cse2 0)) (<= .cse4 127) (<= (+ |c_ULTIMATE.start_gcd_test_~a#1| .cse2) 127) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_14| 1) 0) (= |c_ULTIMATE.start_gcd_test_~a#1| .cse4)))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse6 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |c_ULTIMATE.start_gcd_test_~a#1|)) (.cse5 (mod (mod |c_ULTIMATE.start_main_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_14|) 256))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_14|) (<= .cse5 127) (<= (+ |c_ULTIMATE.start_gcd_test_~a#1| .cse6) 127) (= |c_ULTIMATE.start_gcd_test_~b#1| .cse6) (not (= |v_ULTIMATE.start_gcd_test_~a#1_14| 0)) (= |c_ULTIMATE.start_gcd_test_~a#1| .cse5)))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (and (= (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |c_ULTIMATE.start_gcd_test_~a#1|) 0) (not (= |v_ULTIMATE.start_gcd_test_~a#1_14| 0)) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod |c_ULTIMATE.start_main_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_14|) 256)))) .cse7 .cse8 (<= .cse9 127)))) (and .cse0 (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse10 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |c_ULTIMATE.start_gcd_test_~a#1|)) (.cse11 (mod (mod |c_ULTIMATE.start_main_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_14|) 256))) (and (<= 128 (+ |c_ULTIMATE.start_gcd_test_~a#1| .cse10)) (= .cse1 (mod (+ .cse10 .cse3) 256)) (<= .cse11 127) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_14| 1) 0) (= |c_ULTIMATE.start_gcd_test_~a#1| .cse11)))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse12 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |c_ULTIMATE.start_gcd_test_~a#1|)) (.cse13 (mod (mod |c_ULTIMATE.start_main_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_14|) 256))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_14|) (<= 128 (+ |c_ULTIMATE.start_gcd_test_~a#1| .cse12)) (<= .cse13 127) (= |c_ULTIMATE.start_gcd_test_~b#1| .cse12) (= |c_ULTIMATE.start_gcd_test_~a#1| .cse13)))))) (and (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse14 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |c_ULTIMATE.start_gcd_test_~a#1|)) (.cse16 (mod (mod |c_ULTIMATE.start_main_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_14|) 256))) (and (= .cse1 (mod (+ |c_ULTIMATE.start_gcd_test_~a#1| .cse14) 256)) (not (= .cse14 0)) (<= (mod (+ .cse14 .cse3) 256) 127) (= .cse15 .cse16) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_14| 1) 0) (<= 128 .cse16)))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse17 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |c_ULTIMATE.start_gcd_test_~a#1|)) (.cse18 (mod (mod |c_ULTIMATE.start_main_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_14|) 256))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_14|) (<= (mod (+ .cse17 .cse3) 256) 127) (= |c_ULTIMATE.start_gcd_test_~b#1| .cse17) (= .cse15 .cse18) (<= 128 .cse18) (not (= |v_ULTIMATE.start_gcd_test_~a#1_14| 0))))) (and .cse19 (<= .cse20 127) .cse7 .cse21)) .cse22) (and .cse22 (or (and .cse19 .cse7 .cse8 .cse21) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse23 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |c_ULTIMATE.start_gcd_test_~a#1|)) (.cse24 (mod (mod |c_ULTIMATE.start_main_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_14|) 256))) (and (= .cse1 (mod (+ |c_ULTIMATE.start_gcd_test_~a#1| .cse23) 256)) (not (= .cse23 0)) (<= 128 (mod (+ .cse23 .cse3) 256)) (= .cse15 .cse24) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_14| 1) 0) (<= 128 .cse24)))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse25 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |c_ULTIMATE.start_gcd_test_~a#1|)) (.cse26 (mod (mod |c_ULTIMATE.start_main_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_14|) 256))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_14|) (<= 128 (mod (+ .cse25 .cse3) 256)) (= |c_ULTIMATE.start_gcd_test_~b#1| .cse25) (= .cse15 .cse26) (<= 128 .cse26) (not (= |v_ULTIMATE.start_gcd_test_~a#1_14| 0))))))))))) (not (= |c_ULTIMATE.start_gcd_test_~a#1| 0))) is different from false [2025-02-07 17:28:17,271 WARN L851 $PredicateComparison]: unable to prove that (and (<= 0 |c_ULTIMATE.start_main_~x~0#1|) (let ((.cse5 (+ |c_ULTIMATE.start_gcd_test_~b#1| 256)) (.cse17 (= |c_ULTIMATE.start_gcd_test_~b#1| 0))) (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse0 (mod (mod |c_ULTIMATE.start_main_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_14|) 256))) (let ((.cse1 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| .cse0))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_14|) (not (= .cse0 0)) (not (= .cse1 0)) (<= (+ .cse0 .cse1) 127) (= (mod .cse0 .cse1) |c_ULTIMATE.start_gcd_test_~b#1|))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse2 (mod |c_ULTIMATE.start_main_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_14|))) (let ((.cse6 (mod .cse2 256))) (let ((.cse7 (+ (- 256) .cse6))) (let ((.cse3 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| .cse7))) (let ((.cse4 (mod .cse7 (+ (- 256) (mod (+ .cse2 .cse3) 256))))) (and (<= 128 (mod (+ (* 255 .cse2) .cse3) 256)) (not (= .cse4 0)) (= (mod (+ .cse4 .cse2 .cse3) 256) .cse5) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_14| 1) 0) (<= 128 .cse6)))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse9 (mod |c_ULTIMATE.start_main_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_14|))) (let ((.cse11 (mod .cse9 256))) (let ((.cse12 (+ (- 256) .cse11))) (let ((.cse10 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| .cse12))) (let ((.cse8 (mod .cse12 (+ (- 256) (mod (+ .cse9 .cse10) 256))))) (and (not (= .cse8 0)) (= (mod (+ .cse8 .cse9 .cse10) 256) .cse5) (<= (mod (+ (* 255 .cse9) .cse10) 256) 127) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_14| 1) 0) (<= 128 .cse11)))))))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse14 (mod |c_ULTIMATE.start_main_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_14|))) (let ((.cse16 (mod .cse14 256))) (let ((.cse13 (+ (- 256) .cse16))) (let ((.cse15 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| .cse13))) (and (= (mod .cse13 (+ (- 256) (mod (+ .cse14 .cse15) 256))) 0) (not (= .cse15 0)) (<= 128 (mod (+ (* 255 .cse14) .cse15) 256)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_14| 1) 0) (<= 128 .cse16))))))) .cse17) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse20 (mod |c_ULTIMATE.start_main_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_14|))) (let ((.cse21 (mod .cse20 256))) (let ((.cse22 (+ (- 256) .cse21))) (let ((.cse18 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| .cse22))) (let ((.cse19 (mod .cse22 .cse18))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_14|) (= (mod (+ (* 255 .cse18) .cse19) 256) .cse5) (not (= .cse18 0)) (<= 128 (mod (+ (* 255 .cse20) .cse18) 256)) (not (= .cse19 0)) (<= 128 .cse21)))))))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse24 (mod |c_ULTIMATE.start_main_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_14|))) (let ((.cse26 (mod .cse24 256))) (let ((.cse25 (+ (- 256) .cse26))) (let ((.cse23 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| .cse25))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_14|) (not (= .cse23 0)) (<= 128 (mod (+ (* 255 .cse24) .cse23) 256)) (= (mod .cse25 .cse23) 0) (<= 128 .cse26))))))) .cse17) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse29 (mod |c_ULTIMATE.start_main_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_14|))) (let ((.cse30 (mod .cse29 256))) (let ((.cse31 (+ (- 256) .cse30))) (let ((.cse27 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| .cse31))) (let ((.cse28 (mod .cse31 .cse27))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_14|) (= (mod (+ (* 255 .cse27) .cse28) 256) .cse5) (not (= .cse27 0)) (not (= .cse28 0)) (<= (mod (+ (* 255 .cse29) .cse27) 256) 127) (<= 128 .cse30)))))))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse33 (mod |c_ULTIMATE.start_main_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_14|))) (let ((.cse35 (mod .cse33 256))) (let ((.cse32 (+ (- 256) .cse35))) (let ((.cse34 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| .cse32))) (and (= (mod .cse32 (+ (- 256) (mod (+ .cse33 .cse34) 256))) 0) (not (= .cse34 0)) (<= (mod (+ (* 255 .cse33) .cse34) 256) 127) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_14| 1) 0) (<= 128 .cse35))))))) .cse17) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse38 (mod |c_ULTIMATE.start_main_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_14|))) (let ((.cse36 (mod .cse38 256))) (let ((.cse37 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| .cse36))) (and (not (= .cse36 0)) (<= .cse36 127) (<= 128 (+ .cse36 .cse37)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse36 (+ (- 256) (mod (+ (* 255 .cse38) .cse37) 256)))) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_14| 1) 0)))))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse41 (mod |c_ULTIMATE.start_main_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_14|))) (let ((.cse42 (mod .cse41 256))) (let ((.cse40 (+ (- 256) .cse42))) (let ((.cse39 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| .cse40))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_14|) (not (= .cse39 0)) (= (mod .cse40 .cse39) 0) (<= (mod (+ (* 255 .cse41) .cse39) 256) 127) (<= 128 .cse42))))))) .cse17) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse45 (mod |c_ULTIMATE.start_main_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_14|))) (let ((.cse43 (mod .cse45 256))) (let ((.cse44 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| .cse43))) (and (not (= .cse43 0)) (not (= .cse44 0)) (<= (+ .cse43 .cse44) 127) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse43 (+ (- 256) (mod (+ (* 255 .cse45) .cse44) 256)))) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_14| 1) 0)))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse46 (mod (mod |c_ULTIMATE.start_main_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_14|) 256))) (let ((.cse47 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| .cse46))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_14|) (not (= .cse46 0)) (<= .cse46 127) (<= 128 (+ .cse46 .cse47)) (= (mod .cse46 .cse47) |c_ULTIMATE.start_gcd_test_~b#1|)))))))) is different from false [2025-02-07 17:28:28,461 WARN L851 $PredicateComparison]: unable to prove that (and (<= 0 |c_ULTIMATE.start_main_~x~0#1|) (let ((.cse6 (+ |c_ULTIMATE.start_gcd_test_~a#1| 256))) (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse1 (mod |c_ULTIMATE.start_main_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_14|))) (let ((.cse0 (mod .cse1 256))) (let ((.cse2 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| .cse0))) (and (= |c_ULTIMATE.start_gcd_test_~a#1| (mod .cse0 (+ (- 256) (mod (+ (* 255 .cse1) .cse2) 256)))) (<= (+ .cse0 .cse2) 127) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_14| 1) 0)))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse4 (mod |c_ULTIMATE.start_main_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_14|))) (let ((.cse3 (mod .cse4 256))) (let ((.cse5 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| .cse3))) (and (= |c_ULTIMATE.start_gcd_test_~a#1| (mod .cse3 (+ (- 256) (mod (+ (* 255 .cse4) .cse5) 256)))) (<= .cse3 127) (<= 128 (+ .cse3 .cse5)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_14| 1) 0)))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse8 (mod |c_ULTIMATE.start_main_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_14|))) (let ((.cse10 (mod .cse8 256))) (let ((.cse11 (+ (- 256) .cse10))) (let ((.cse9 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| .cse11))) (let ((.cse7 (mod .cse11 (+ (- 256) (mod (+ .cse8 .cse9) 256))))) (and (= .cse6 (mod (+ .cse7 .cse8 .cse9) 256)) (not (= .cse7 0)) (<= (mod (+ (* 255 .cse8) .cse9) 256) 127) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_14| 1) 0) (<= 128 .cse10)))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse14 (mod |c_ULTIMATE.start_main_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_14|))) (let ((.cse15 (mod .cse14 256))) (let ((.cse16 (+ (- 256) .cse15))) (let ((.cse12 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| .cse16))) (let ((.cse13 (mod .cse16 .cse12))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_14|) (not (= .cse12 0)) (not (= .cse13 0)) (<= (mod (+ (* 255 .cse14) .cse12) 256) 127) (<= 128 .cse15) (= .cse6 (mod (+ (* 255 .cse12) .cse13) 256))))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse18 (mod |c_ULTIMATE.start_main_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_14|))) (let ((.cse20 (mod .cse18 256))) (let ((.cse21 (+ (- 256) .cse20))) (let ((.cse17 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| .cse21))) (let ((.cse19 (mod .cse21 .cse17))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_14|) (not (= .cse17 0)) (<= 128 (mod (+ (* 255 .cse18) .cse17) 256)) (not (= .cse19 0)) (<= 128 .cse20) (= .cse6 (mod (+ (* 255 .cse17) .cse19) 256))))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse23 (mod |c_ULTIMATE.start_main_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_14|))) (let ((.cse25 (mod .cse23 256))) (let ((.cse26 (+ (- 256) .cse25))) (let ((.cse24 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| .cse26))) (let ((.cse22 (mod .cse26 (+ (- 256) (mod (+ .cse23 .cse24) 256))))) (and (= .cse6 (mod (+ .cse22 .cse23 .cse24) 256)) (<= 128 (mod (+ (* 255 .cse23) .cse24) 256)) (not (= .cse22 0)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_14| 1) 0) (<= 128 .cse25)))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse27 (mod (mod |c_ULTIMATE.start_main_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_14|) 256))) (let ((.cse28 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| .cse27))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_14|) (= (mod .cse27 .cse28) |c_ULTIMATE.start_gcd_test_~a#1|) (<= .cse27 127) (<= 128 (+ .cse27 .cse28)))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse29 (mod (mod |c_ULTIMATE.start_main_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_14|) 256))) (let ((.cse30 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| .cse29))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_14|) (= (mod .cse29 .cse30) |c_ULTIMATE.start_gcd_test_~a#1|) (not (= .cse30 0)) (<= (+ .cse29 .cse30) 127))))))) (let ((.cse40 (+ |c_ULTIMATE.start_gcd_test_~b#1| 256))) (let ((.cse43 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_16| Int)) (let ((.cse54 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_16| |c_ULTIMATE.start_gcd_test_~a#1|) 256))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_16|) (= |c_ULTIMATE.start_gcd_test_~b#1| .cse54) (<= .cse54 127))))) (.cse46 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_16| Int)) (let ((.cse53 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_16| |c_ULTIMATE.start_gcd_test_~a#1|) 256))) (and (= .cse40 .cse53) (<= 128 .cse53) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_16|))))) (.cse34 (<= (+ |c_ULTIMATE.start_gcd_test_~a#1| 1) 0)) (.cse33 (* |c_ULTIMATE.start_gcd_test_~a#1| 255)) (.cse37 (<= 0 |c_ULTIMATE.start_gcd_test_~a#1|))) (or (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_16| Int)) (let ((.cse32 (mod |v_ULTIMATE.start_gcd_test_~a#1_16| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse31 (mod (+ |c_ULTIMATE.start_gcd_test_~a#1| .cse32) 256))) (and (<= .cse31 127) (not (= .cse32 0)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_16| 1) 0) (<= 128 (mod (+ .cse32 .cse33) 256)) (= .cse31 |c_ULTIMATE.start_gcd_test_~b#1|))))) .cse34) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_16| Int)) (let ((.cse35 (mod |v_ULTIMATE.start_gcd_test_~a#1_16| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse36 (mod (+ .cse35 .cse33) 256))) (and (<= (mod (+ |c_ULTIMATE.start_gcd_test_~a#1| .cse35) 256) 127) (not (= .cse35 0)) (<= .cse36 127) (= .cse36 |c_ULTIMATE.start_gcd_test_~b#1|) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_16| 1) 0))))) .cse37) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_16| Int)) (let ((.cse38 (mod |v_ULTIMATE.start_gcd_test_~a#1_16| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse39 (mod (+ .cse38 .cse33) 256))) (and (<= (mod (+ |c_ULTIMATE.start_gcd_test_~a#1| .cse38) 256) 127) (not (= .cse38 0)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_16| 1) 0) (<= 128 .cse39) (= .cse39 .cse40))))) .cse37) (and .cse34 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_16| Int)) (let ((.cse41 (mod |v_ULTIMATE.start_gcd_test_~a#1_16| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse42 (mod (+ |c_ULTIMATE.start_gcd_test_~a#1| .cse41) 256))) (and (not (= .cse41 0)) (= .cse42 .cse40) (<= 128 .cse42) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_16| 1) 0) (<= 128 (mod (+ .cse41 .cse33) 256))))))) (and .cse43 .cse37) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_16| Int)) (let ((.cse44 (mod |v_ULTIMATE.start_gcd_test_~a#1_16| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse45 (mod (+ |c_ULTIMATE.start_gcd_test_~a#1| .cse44) 256))) (and (not (= .cse44 0)) (= .cse45 .cse40) (<= (mod (+ .cse44 .cse33) 256) 127) (<= 128 .cse45) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_16| 1) 0))))) .cse34) (and .cse43 .cse34) (and .cse46 .cse37) (and .cse46 .cse34) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_16| Int)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_16| |c_ULTIMATE.start_gcd_test_~a#1|) 0)) (= |c_ULTIMATE.start_gcd_test_~b#1| 0)) (and .cse37 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_16| Int)) (let ((.cse47 (mod |v_ULTIMATE.start_gcd_test_~a#1_16| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse48 (mod (+ .cse47 .cse33) 256))) (and (not (= .cse47 0)) (<= 128 (mod (+ |c_ULTIMATE.start_gcd_test_~a#1| .cse47) 256)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_16| 1) 0) (<= 128 .cse48) (= .cse48 .cse40)))))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_16| Int)) (let ((.cse50 (mod |v_ULTIMATE.start_gcd_test_~a#1_16| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse49 (mod (+ |c_ULTIMATE.start_gcd_test_~a#1| .cse50) 256))) (and (<= .cse49 127) (not (= .cse50 0)) (<= (mod (+ .cse50 .cse33) 256) 127) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_16| 1) 0) (= .cse49 |c_ULTIMATE.start_gcd_test_~b#1|))))) .cse34) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_16| Int)) (let ((.cse51 (mod |v_ULTIMATE.start_gcd_test_~a#1_16| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse52 (mod (+ .cse51 .cse33) 256))) (and (not (= .cse51 0)) (<= .cse52 127) (= .cse52 |c_ULTIMATE.start_gcd_test_~b#1|) (<= 128 (mod (+ |c_ULTIMATE.start_gcd_test_~a#1| .cse51) 256)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_16| 1) 0))))) .cse37)))) (not (= |c_ULTIMATE.start_gcd_test_~a#1| 0))) is different from false [2025-02-07 17:28:37,813 WARN L851 $PredicateComparison]: unable to prove that (and (<= 0 |c_ULTIMATE.start_main_~x~0#1|) (let ((.cse5 (+ 256 |c_ULTIMATE.start_main_~g~0#1|))) (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse0 (mod (mod |c_ULTIMATE.start_main_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_14|) 256))) (let ((.cse1 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| .cse0))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_14|) (<= .cse0 127) (<= 128 (+ .cse0 .cse1)) (= (mod .cse0 .cse1) |c_ULTIMATE.start_main_~g~0#1|))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse4 (mod |c_ULTIMATE.start_main_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_14|))) (let ((.cse6 (mod .cse4 256))) (let ((.cse7 (+ (- 256) .cse6))) (let ((.cse2 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| .cse7))) (let ((.cse3 (mod .cse7 .cse2))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_14|) (not (= .cse2 0)) (not (= .cse3 0)) (<= (mod (+ (* 255 .cse4) .cse2) 256) 127) (= (mod (+ (* 255 .cse2) .cse3) 256) .cse5) (<= 128 .cse6)))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse10 (mod |c_ULTIMATE.start_main_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_14|))) (let ((.cse8 (mod .cse10 256))) (let ((.cse9 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| .cse8))) (and (<= .cse8 127) (<= 128 (+ .cse8 .cse9)) (= |c_ULTIMATE.start_main_~g~0#1| (mod .cse8 (+ (- 256) (mod (+ (* 255 .cse10) .cse9) 256)))) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_14| 1) 0)))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse13 (mod |c_ULTIMATE.start_main_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_14|))) (let ((.cse11 (mod .cse13 256))) (let ((.cse12 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| .cse11))) (and (<= (+ .cse11 .cse12) 127) (= |c_ULTIMATE.start_main_~g~0#1| (mod .cse11 (+ (- 256) (mod (+ (* 255 .cse13) .cse12) 256)))) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_14| 1) 0)))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse14 (mod |c_ULTIMATE.start_main_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_14|))) (let ((.cse17 (mod .cse14 256))) (let ((.cse18 (+ (- 256) .cse17))) (let ((.cse15 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| .cse18))) (let ((.cse16 (mod .cse18 (+ (- 256) (mod (+ .cse14 .cse15) 256))))) (and (<= 128 (mod (+ (* 255 .cse14) .cse15) 256)) (= (mod (+ .cse16 .cse14 .cse15) 256) .cse5) (not (= .cse16 0)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_14| 1) 0) (<= 128 .cse17)))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse20 (mod |c_ULTIMATE.start_main_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_14|))) (let ((.cse22 (mod .cse20 256))) (let ((.cse23 (+ (- 256) .cse22))) (let ((.cse21 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| .cse23))) (let ((.cse19 (mod .cse23 (+ (- 256) (mod (+ .cse20 .cse21) 256))))) (and (= (mod (+ .cse19 .cse20 .cse21) 256) .cse5) (not (= .cse19 0)) (<= (mod (+ (* 255 .cse20) .cse21) 256) 127) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_14| 1) 0) (<= 128 .cse22)))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse25 (mod (mod |c_ULTIMATE.start_main_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_14|) 256))) (let ((.cse24 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| .cse25))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_14|) (not (= .cse24 0)) (= (mod .cse25 .cse24) |c_ULTIMATE.start_main_~g~0#1|) (<= (+ .cse25 .cse24) 127))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse27 (mod |c_ULTIMATE.start_main_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_14|))) (let ((.cse29 (mod .cse27 256))) (let ((.cse30 (+ (- 256) .cse29))) (let ((.cse26 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| .cse30))) (let ((.cse28 (mod .cse30 .cse26))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_14|) (not (= .cse26 0)) (<= 128 (mod (+ (* 255 .cse27) .cse26) 256)) (not (= .cse28 0)) (= (mod (+ (* 255 .cse26) .cse28) 256) .cse5) (<= 128 .cse29)))))))))) (let ((.cse33 (* 255 |c_ULTIMATE.start_main_~g~0#1|)) (.cse31 (<= (+ |c_ULTIMATE.start_main_~g~0#1| 1) 0))) (or (and (<= 0 |c_ULTIMATE.start_main_~g~0#1|) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_16| Int)) (and (= (mod |v_ULTIMATE.start_gcd_test_~a#1_16| |c_ULTIMATE.start_main_~g~0#1|) 0) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_16|)))) (and .cse31 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_16| Int)) (let ((.cse32 (mod |v_ULTIMATE.start_gcd_test_~a#1_16| |c_ULTIMATE.start_main_~g~0#1|))) (and (<= (mod (+ .cse32 .cse33) 256) 127) (not (= .cse32 0)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_16| 1) 0) (= (mod (+ .cse32 |c_ULTIMATE.start_main_~g~0#1|) 256) 0))))) (and .cse31 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_16| Int)) (let ((.cse34 (mod |v_ULTIMATE.start_gcd_test_~a#1_16| |c_ULTIMATE.start_main_~g~0#1|))) (and (<= 128 (mod (+ .cse34 .cse33) 256)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_16| 1) 0) (= (mod (+ .cse34 |c_ULTIMATE.start_main_~g~0#1|) 256) 0))))) (and .cse31 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_16| Int)) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_16|) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_16| |c_ULTIMATE.start_main_~g~0#1|) 256) 0)))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_16| Int)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_16| |c_ULTIMATE.start_main_~g~0#1|) 0)))) (not (= |c_ULTIMATE.start_main_~g~0#1| 0)) (<= |c_ULTIMATE.start_main_~g~0#1| 127)) is different from false [2025-02-07 17:28:45,326 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2025-02-07 17:28:45,326 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 17:29:04,295 WARN L286 SmtUtils]: Spent 11.03s on a formula simplification. DAG size of input: 291 DAG size of output: 289 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)