./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/ps5-ll_valuebound50.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/ps5-ll_valuebound50.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a7db00fa220927f51e1e342e06102a5d28a1c61268049ef86f9068e213c9adb5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 05:19:26,674 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 05:19:26,726 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 05:19:26,729 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 05:19:26,729 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 05:19:26,742 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 05:19:26,742 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 05:19:26,742 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 05:19:26,742 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 05:19:26,742 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 05:19:26,742 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 05:19:26,742 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 05:19:26,743 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 05:19:26,743 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 05:19:26,743 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 05:19:26,743 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 05:19:26,743 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 05:19:26,743 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 05:19:26,743 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 05:19:26,743 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 05:19:26,743 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 05:19:26,743 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 05:19:26,743 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 05:19:26,743 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 05:19:26,743 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 05:19:26,743 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 05:19:26,743 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 05:19:26,743 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 05:19:26,743 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 05:19:26,743 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 05:19:26,743 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 05:19:26,744 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 05:19:26,744 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:19:26,744 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 05:19:26,744 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 05:19:26,744 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 05:19:26,744 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 05:19:26,744 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 05:19:26,744 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 05:19:26,744 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 05:19:26,744 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 05:19:26,744 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 05:19:26,744 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 05:19:26,744 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a7db00fa220927f51e1e342e06102a5d28a1c61268049ef86f9068e213c9adb5 [2025-03-08 05:19:26,963 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 05:19:26,971 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 05:19:26,972 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 05:19:26,973 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 05:19:26,973 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 05:19:26,974 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/ps5-ll_valuebound50.c [2025-03-08 05:19:28,122 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d46df1f80/239b3ffc8c424b1fb5a5ef07494d27d5/FLAG1950aae46 [2025-03-08 05:19:28,352 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 05:19:28,353 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/ps5-ll_valuebound50.c [2025-03-08 05:19:28,367 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d46df1f80/239b3ffc8c424b1fb5a5ef07494d27d5/FLAG1950aae46 [2025-03-08 05:19:28,402 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d46df1f80/239b3ffc8c424b1fb5a5ef07494d27d5 [2025-03-08 05:19:28,406 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 05:19:28,407 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 05:19:28,408 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 05:19:28,408 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 05:19:28,413 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 05:19:28,414 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:19:28" (1/1) ... [2025-03-08 05:19:28,415 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a09345e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:19:28, skipping insertion in model container [2025-03-08 05:19:28,416 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:19:28" (1/1) ... [2025-03-08 05:19:28,426 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 05:19:28,520 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/ps5-ll_valuebound50.c[458,471] [2025-03-08 05:19:28,535 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:19:28,543 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 05:19:28,551 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/ps5-ll_valuebound50.c[458,471] [2025-03-08 05:19:28,559 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:19:28,569 INFO L204 MainTranslator]: Completed translation [2025-03-08 05:19:28,569 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:19:28 WrapperNode [2025-03-08 05:19:28,570 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 05:19:28,570 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 05:19:28,570 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 05:19:28,570 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 05:19:28,575 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:19:28" (1/1) ... [2025-03-08 05:19:28,579 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:19:28" (1/1) ... [2025-03-08 05:19:28,589 INFO L138 Inliner]: procedures = 14, calls = 12, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 33 [2025-03-08 05:19:28,590 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 05:19:28,590 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 05:19:28,590 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 05:19:28,590 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 05:19:28,595 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:19:28" (1/1) ... [2025-03-08 05:19:28,596 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:19:28" (1/1) ... [2025-03-08 05:19:28,600 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:19:28" (1/1) ... [2025-03-08 05:19:28,610 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 05:19:28,610 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:19:28" (1/1) ... [2025-03-08 05:19:28,611 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:19:28" (1/1) ... [2025-03-08 05:19:28,612 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:19:28" (1/1) ... [2025-03-08 05:19:28,613 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:19:28" (1/1) ... [2025-03-08 05:19:28,616 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:19:28" (1/1) ... [2025-03-08 05:19:28,617 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:19:28" (1/1) ... [2025-03-08 05:19:28,618 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 05:19:28,618 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 05:19:28,618 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 05:19:28,618 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 05:19:28,620 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:19:28" (1/1) ... [2025-03-08 05:19:28,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:19:28,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:19:28,649 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 05:19:28,652 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 05:19:28,670 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 05:19:28,671 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 05:19:28,671 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 05:19:28,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 05:19:28,671 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 05:19:28,671 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 05:19:28,671 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-08 05:19:28,671 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-08 05:19:28,712 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 05:19:28,713 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 05:19:28,834 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2025-03-08 05:19:28,836 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 05:19:28,842 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 05:19:28,842 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 05:19:28,842 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:19:28 BoogieIcfgContainer [2025-03-08 05:19:28,842 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 05:19:28,844 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 05:19:28,844 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 05:19:28,847 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 05:19:28,847 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 05:19:28" (1/3) ... [2025-03-08 05:19:28,848 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d687f76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:19:28, skipping insertion in model container [2025-03-08 05:19:28,848 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:19:28" (2/3) ... [2025-03-08 05:19:28,848 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d687f76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:19:28, skipping insertion in model container [2025-03-08 05:19:28,848 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:19:28" (3/3) ... [2025-03-08 05:19:28,849 INFO L128 eAbstractionObserver]: Analyzing ICFG ps5-ll_valuebound50.c [2025-03-08 05:19:28,859 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 05:19:28,860 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG ps5-ll_valuebound50.c that has 3 procedures, 23 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 05:19:28,890 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 05:19:28,897 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;@12dfaca5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 05:19:28,898 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 05:19:28,900 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-08 05:19:28,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-08 05:19:28,905 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:19:28,906 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:19:28,906 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:19:28,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:19:28,910 INFO L85 PathProgramCache]: Analyzing trace with hash 48082696, now seen corresponding path program 1 times [2025-03-08 05:19:28,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:19:28,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572639017] [2025-03-08 05:19:28,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:19:28,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:19:28,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-08 05:19:28,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-08 05:19:28,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:19:28,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:19:28,999 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 05:19:28,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:19:28,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572639017] [2025-03-08 05:19:29,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572639017] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:19:29,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [197030726] [2025-03-08 05:19:29,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:19:29,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:19:29,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:19:29,005 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:19:29,007 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 05:19:29,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-08 05:19:29,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-08 05:19:29,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:19:29,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:19:29,044 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 05:19:29,046 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:19:29,052 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 05:19:29,052 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:19:29,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [197030726] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:19:29,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:19:29,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 05:19:29,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469254113] [2025-03-08 05:19:29,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:19:29,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 05:19:29,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:19:29,071 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 05:19:29,071 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 05:19:29,072 INFO L87 Difference]: Start difference. First operand has 23 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 05:19:29,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:19:29,085 INFO L93 Difference]: Finished difference Result 43 states and 59 transitions. [2025-03-08 05:19:29,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 05:19:29,087 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2025-03-08 05:19:29,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:19:29,092 INFO L225 Difference]: With dead ends: 43 [2025-03-08 05:19:29,092 INFO L226 Difference]: Without dead ends: 19 [2025-03-08 05:19:29,094 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 05:19:29,097 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:19:29,101 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:19:29,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2025-03-08 05:19:29,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2025-03-08 05:19:29,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 12 states have internal predecessors, (13), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-08 05:19:29,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2025-03-08 05:19:29,126 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 17 [2025-03-08 05:19:29,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:19:29,127 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2025-03-08 05:19:29,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 05:19:29,128 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2025-03-08 05:19:29,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-08 05:19:29,128 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:19:29,129 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:19:29,136 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 05:19:29,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 05:19:29,330 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:19:29,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:19:29,331 INFO L85 PathProgramCache]: Analyzing trace with hash 1497490024, now seen corresponding path program 1 times [2025-03-08 05:19:29,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:19:29,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495656958] [2025-03-08 05:19:29,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:19:29,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:19:29,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-08 05:19:29,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-08 05:19:29,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:19:29,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 05:19:29,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [112364938] [2025-03-08 05:19:29,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:19:29,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:19:29,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:19:29,356 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:19:29,357 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 05:19:29,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-08 05:19:29,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-08 05:19:29,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:19:29,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:19:29,396 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-08 05:19:29,398 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:19:29,468 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 05:19:29,468 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:19:29,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:19:29,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495656958] [2025-03-08 05:19:29,469 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 05:19:29,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [112364938] [2025-03-08 05:19:29,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [112364938] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:19:29,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:19:29,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:19:29,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767776426] [2025-03-08 05:19:29,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:19:29,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:19:29,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:19:29,472 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:19:29,472 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:19:29,472 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 05:19:29,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:19:29,517 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2025-03-08 05:19:29,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:19:29,518 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2025-03-08 05:19:29,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:19:29,518 INFO L225 Difference]: With dead ends: 29 [2025-03-08 05:19:29,518 INFO L226 Difference]: Without dead ends: 25 [2025-03-08 05:19:29,519 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:19:29,519 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 4 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:19:29,519 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 65 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:19:29,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2025-03-08 05:19:29,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2025-03-08 05:19:29,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 16 states have internal predecessors, (17), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-08 05:19:29,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2025-03-08 05:19:29,525 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 17 [2025-03-08 05:19:29,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:19:29,526 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2025-03-08 05:19:29,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 05:19:29,526 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2025-03-08 05:19:29,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-08 05:19:29,526 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:19:29,526 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:19:29,536 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 05:19:29,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2025-03-08 05:19:29,727 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:19:29,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:19:29,728 INFO L85 PathProgramCache]: Analyzing trace with hash -722676116, now seen corresponding path program 1 times [2025-03-08 05:19:29,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:19:29,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394496537] [2025-03-08 05:19:29,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:19:29,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:19:29,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-08 05:19:29,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-08 05:19:29,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:19:29,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 05:19:29,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1626477157] [2025-03-08 05:19:29,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:19:29,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:19:29,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:19:29,749 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:19:29,751 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 05:19:29,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-08 05:19:29,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-08 05:19:29,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:19:29,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:19:29,796 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-08 05:19:29,799 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:19:29,872 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 05:19:29,873 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:19:29,968 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-08 05:19:29,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:19:29,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394496537] [2025-03-08 05:19:29,969 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 05:19:29,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1626477157] [2025-03-08 05:19:29,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1626477157] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 05:19:29,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:19:29,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2025-03-08 05:19:29,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011709943] [2025-03-08 05:19:29,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:19:29,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:19:29,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:19:29,970 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:19:29,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:19:29,972 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 05:19:30,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:19:30,008 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2025-03-08 05:19:30,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:19:30,009 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2025-03-08 05:19:30,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:19:30,009 INFO L225 Difference]: With dead ends: 31 [2025-03-08 05:19:30,010 INFO L226 Difference]: Without dead ends: 27 [2025-03-08 05:19:30,010 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:19:30,010 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 4 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:19:30,011 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 62 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:19:30,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-03-08 05:19:30,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2025-03-08 05:19:30,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-08 05:19:30,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2025-03-08 05:19:30,016 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 23 [2025-03-08 05:19:30,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:19:30,016 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2025-03-08 05:19:30,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 05:19:30,016 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2025-03-08 05:19:30,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-08 05:19:30,017 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:19:30,017 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:19:30,023 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 05:19:30,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:19:30,217 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:19:30,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:19:30,218 INFO L85 PathProgramCache]: Analyzing trace with hash 1455469544, now seen corresponding path program 1 times [2025-03-08 05:19:30,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:19:30,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382087446] [2025-03-08 05:19:30,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:19:30,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:19:30,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-08 05:19:30,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-08 05:19:30,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:19:30,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 05:19:30,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2123327828] [2025-03-08 05:19:30,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:19:30,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:19:30,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:19:30,255 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:19:30,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 05:19:30,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-08 05:19:30,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-08 05:19:30,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:19:30,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:19:30,296 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-08 05:19:30,298 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:19:30,381 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-08 05:19:30,381 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:19:30,470 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-08 05:19:30,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:19:30,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382087446] [2025-03-08 05:19:30,471 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 05:19:30,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2123327828] [2025-03-08 05:19:30,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2123327828] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:19:30,472 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 05:19:30,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2025-03-08 05:19:30,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327152745] [2025-03-08 05:19:30,472 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 05:19:30,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 05:19:30,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:19:30,473 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 05:19:30,473 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-03-08 05:19:30,473 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand has 10 states, 8 states have (on average 2.125) internal successors, (17), 9 states have internal predecessors, (17), 7 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2025-03-08 05:19:30,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:19:30,565 INFO L93 Difference]: Finished difference Result 41 states and 50 transitions. [2025-03-08 05:19:30,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 05:19:30,567 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.125) internal successors, (17), 9 states have internal predecessors, (17), 7 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Word has length 34 [2025-03-08 05:19:30,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:19:30,567 INFO L225 Difference]: With dead ends: 41 [2025-03-08 05:19:30,567 INFO L226 Difference]: Without dead ends: 33 [2025-03-08 05:19:30,568 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 56 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-03-08 05:19:30,568 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 1 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:19:30,568 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 129 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:19:30,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-03-08 05:19:30,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2025-03-08 05:19:30,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-08 05:19:30,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2025-03-08 05:19:30,577 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 34 [2025-03-08 05:19:30,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:19:30,578 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2025-03-08 05:19:30,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 2.125) internal successors, (17), 9 states have internal predecessors, (17), 7 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2025-03-08 05:19:30,578 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2025-03-08 05:19:30,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-08 05:19:30,579 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:19:30,579 INFO L218 NwaCegarLoop]: trace histogram [7, 6, 6, 5, 5, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:19:30,585 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-08 05:19:30,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:19:30,780 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:19:30,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:19:30,780 INFO L85 PathProgramCache]: Analyzing trace with hash -431437220, now seen corresponding path program 2 times [2025-03-08 05:19:30,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:19:30,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392983324] [2025-03-08 05:19:30,781 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 05:19:30,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:19:30,788 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 52 statements into 2 equivalence classes. [2025-03-08 05:19:30,850 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 52 of 52 statements. [2025-03-08 05:19:30,851 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 05:19:30,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 05:19:30,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [701873503] [2025-03-08 05:19:30,855 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 05:19:30,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:19:30,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:19:30,860 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:19:30,861 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 05:19:30,887 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 52 statements into 2 equivalence classes. [2025-03-08 05:19:30,905 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 52 of 52 statements. [2025-03-08 05:19:30,905 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 05:19:30,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:19:30,907 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-08 05:19:30,909 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:19:31,093 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 15 proven. 20 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2025-03-08 05:19:31,093 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:19:31,305 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 12 proven. 20 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-03-08 05:19:31,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:19:31,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392983324] [2025-03-08 05:19:31,305 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 05:19:31,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [701873503] [2025-03-08 05:19:31,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [701873503] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:19:31,305 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 05:19:31,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 21 [2025-03-08 05:19:31,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228232478] [2025-03-08 05:19:31,306 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 05:19:31,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-08 05:19:31,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:19:31,307 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-08 05:19:31,307 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=351, Unknown=0, NotChecked=0, Total=420 [2025-03-08 05:19:31,307 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand has 21 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 18 states have internal predecessors, (28), 13 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (15), 14 states have call predecessors, (15), 13 states have call successors, (15) [2025-03-08 05:19:31,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:19:31,703 INFO L93 Difference]: Finished difference Result 53 states and 69 transitions. [2025-03-08 05:19:31,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-08 05:19:31,705 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 18 states have internal predecessors, (28), 13 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (15), 14 states have call predecessors, (15), 13 states have call successors, (15) Word has length 52 [2025-03-08 05:19:31,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:19:31,705 INFO L225 Difference]: With dead ends: 53 [2025-03-08 05:19:31,705 INFO L226 Difference]: Without dead ends: 45 [2025-03-08 05:19:31,706 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=173, Invalid=819, Unknown=0, NotChecked=0, Total=992 [2025-03-08 05:19:31,706 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 14 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:19:31,706 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 226 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:19:31,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-03-08 05:19:31,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2025-03-08 05:19:31,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 25 states have (on average 1.04) internal successors, (26), 25 states have internal predecessors, (26), 14 states have call successors, (14), 4 states have call predecessors, (14), 3 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-08 05:19:31,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 53 transitions. [2025-03-08 05:19:31,723 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 53 transitions. Word has length 52 [2025-03-08 05:19:31,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:19:31,723 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 53 transitions. [2025-03-08 05:19:31,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 18 states have internal predecessors, (28), 13 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (15), 14 states have call predecessors, (15), 13 states have call successors, (15) [2025-03-08 05:19:31,723 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 53 transitions. [2025-03-08 05:19:31,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-08 05:19:31,726 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:19:31,726 INFO L218 NwaCegarLoop]: trace histogram [12, 11, 11, 10, 10, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:19:31,732 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-08 05:19:31,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:19:31,930 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:19:31,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:19:31,931 INFO L85 PathProgramCache]: Analyzing trace with hash -115676216, now seen corresponding path program 3 times [2025-03-08 05:19:31,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:19:31,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824778469] [2025-03-08 05:19:31,931 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 05:19:31,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:19:31,937 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 82 statements into 10 equivalence classes. [2025-03-08 05:19:32,031 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) and asserted 82 of 82 statements. [2025-03-08 05:19:32,031 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2025-03-08 05:19:32,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 05:19:32,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1989327191] [2025-03-08 05:19:32,035 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 05:19:32,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:19:32,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:19:32,039 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:19:32,040 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-08 05:19:32,067 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 82 statements into 10 equivalence classes. [2025-03-08 05:19:32,126 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) and asserted 82 of 82 statements. [2025-03-08 05:19:32,127 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2025-03-08 05:19:32,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:19:32,134 INFO L256 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 54 conjuncts are in the unsatisfiable core [2025-03-08 05:19:32,136 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:19:32,333 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 33 proven. 109 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2025-03-08 05:19:32,333 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:19:40,581 WARN L851 $PredicateComparison]: unable to prove that (or (= (+ (* |c_ULTIMATE.start_main_~c~0#1| |c_ULTIMATE.start_main_~y~0#1|) (* |c_ULTIMATE.start_main_~c~0#1| 5)) (+ (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|) (* |c_ULTIMATE.start_main_~y~0#1| 5))) (not (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 15) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 10) (* |c_ULTIMATE.start_main_~y~0#1| 29) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 6)) 30) 0))) is different from false [2025-03-08 05:19:52,617 WARN L286 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-08 05:20:10,223 WARN L286 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-08 05:20:14,235 WARN L873 $PredicateComparison]: unable to prove that (or (not (= |c___VERIFIER_assert_#in~cond| 0)) (forall ((|v_ULTIMATE.start_main_~c~0#1_BEFORE_CALL_30| Int) (|v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_43| Int)) (or (= (mod (+ (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_43| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_43| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_43| 10) (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_43| 29) (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_43| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_43| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_43| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_43| 15) (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_43| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_43| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_43| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_43| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_43| 6)) 30) 0) (= (+ (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_43| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_43|) (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_43| 5)) (+ (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_43| |v_ULTIMATE.start_main_~c~0#1_BEFORE_CALL_30|) (* |v_ULTIMATE.start_main_~c~0#1_BEFORE_CALL_30| 5)))))) is different from true [2025-03-08 05:20:30,970 WARN L286 SmtUtils]: Spent 8.71s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-08 05:20:47,311 WARN L286 SmtUtils]: Spent 8.22s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-08 05:20:51,318 WARN L873 $PredicateComparison]: unable to prove that (or (not (= |c___VERIFIER_assert_#in~cond| 0)) (forall ((|v_ULTIMATE.start_main_~c~0#1_BEFORE_CALL_30| Int) (|v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_43| Int)) (or (= (mod (+ (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_43| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_43| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_43| 10) (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_43| 29) (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_43| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_43| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_43| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_43| 15) (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_43| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_43| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_43| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_43| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_43| 6)) 30) 0) (= (+ (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_43| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_43|) (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_43| 5)) (+ (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_43| |v_ULTIMATE.start_main_~c~0#1_BEFORE_CALL_30|) (* |v_ULTIMATE.start_main_~c~0#1_BEFORE_CALL_30| 5))))) (= c___VERIFIER_assert_~cond 0)) is different from true [2025-03-08 05:20:59,336 WARN L851 $PredicateComparison]: unable to prove that (or (= (+ (* |c_ULTIMATE.start_main_~c~0#1| 6) (* |c_ULTIMATE.start_main_~c~0#1| |c_ULTIMATE.start_main_~y~0#1|)) (+ (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|) (* |c_ULTIMATE.start_main_~y~0#1| 6))) (not (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 15) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 10) (* |c_ULTIMATE.start_main_~y~0#1| 29) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 6)) 30) 0))) is different from false [2025-03-08 05:21:04,375 WARN L286 SmtUtils]: Spent 5.00s on a formula simplification that was a NOOP. DAG size: 15 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-08 05:21:12,394 WARN L851 $PredicateComparison]: unable to prove that (or (= (+ (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|) (* |c_ULTIMATE.start_main_~y~0#1| 7)) (+ (* |c_ULTIMATE.start_main_~c~0#1| 7) (* |c_ULTIMATE.start_main_~c~0#1| |c_ULTIMATE.start_main_~y~0#1|))) (not (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 15) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 10) (* |c_ULTIMATE.start_main_~y~0#1| 29) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 6)) 30) 0))) is different from false