./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/geo2-ll_unwindbound2.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/nla-digbench-scaling/geo2-ll_unwindbound2.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 2ad2bfafb2e5236f68c3ecdd808488f9d9b4cfe5e1ccbe679b253d376c8c4674 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 20:40:53,639 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 20:40:53,697 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-07 20:40:53,703 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 20:40:53,704 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 20:40:53,724 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 20:40:53,724 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 20:40:53,724 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 20:40:53,725 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 20:40:53,725 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 20:40:53,725 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 20:40:53,725 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 20:40:53,725 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 20:40:53,725 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 20:40:53,725 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 20:40:53,725 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 20:40:53,725 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 20:40:53,725 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-07 20:40:53,725 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-07 20:40:53,727 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-07 20:40:53,727 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 20:40:53,727 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 20:40:53,727 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 20:40:53,727 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 20:40:53,727 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-07 20:40:53,727 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 20:40:53,727 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 20:40:53,727 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 20:40:53,727 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 20:40:53,727 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 20:40:53,728 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 20:40:53,728 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 20:40:53,728 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 20:40:53,728 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 20:40:53,728 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 20:40:53,728 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 20:40:53,728 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 20:40:53,728 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-07 20:40:53,728 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-07 20:40:53,728 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 20:40:53,728 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 20:40:53,728 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 20:40:53,728 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 20:40:53,728 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 -> 2ad2bfafb2e5236f68c3ecdd808488f9d9b4cfe5e1ccbe679b253d376c8c4674 [2025-02-07 20:40:53,949 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 20:40:53,956 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 20:40:53,958 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 20:40:53,959 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 20:40:53,959 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 20:40:53,960 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/geo2-ll_unwindbound2.c [2025-02-07 20:40:55,141 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0c89447ee/1768d60fd53b4cf98f0b3634ef1f30af/FLAG02f967ba2 [2025-02-07 20:40:55,369 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 20:40:55,370 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/geo2-ll_unwindbound2.c [2025-02-07 20:40:55,375 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0c89447ee/1768d60fd53b4cf98f0b3634ef1f30af/FLAG02f967ba2 [2025-02-07 20:40:55,384 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0c89447ee/1768d60fd53b4cf98f0b3634ef1f30af [2025-02-07 20:40:55,386 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 20:40:55,387 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 20:40:55,387 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 20:40:55,387 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 20:40:55,390 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 20:40:55,391 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 08:40:55" (1/1) ... [2025-02-07 20:40:55,391 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35bbe078 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:40:55, skipping insertion in model container [2025-02-07 20:40:55,392 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 08:40:55" (1/1) ... [2025-02-07 20:40:55,402 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 20:40:55,513 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/nla-digbench-scaling/geo2-ll_unwindbound2.c[525,538] [2025-02-07 20:40:55,528 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 20:40:55,534 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 20:40:55,543 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/nla-digbench-scaling/geo2-ll_unwindbound2.c[525,538] [2025-02-07 20:40:55,546 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 20:40:55,559 INFO L204 MainTranslator]: Completed translation [2025-02-07 20:40:55,560 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:40:55 WrapperNode [2025-02-07 20:40:55,560 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 20:40:55,561 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 20:40:55,562 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 20:40:55,562 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 20:40:55,566 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:40:55" (1/1) ... [2025-02-07 20:40:55,571 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:40:55" (1/1) ... [2025-02-07 20:40:55,582 INFO L138 Inliner]: procedures = 14, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 42 [2025-02-07 20:40:55,582 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 20:40:55,584 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 20:40:55,584 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 20:40:55,584 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 20:40:55,590 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:40:55" (1/1) ... [2025-02-07 20:40:55,590 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:40:55" (1/1) ... [2025-02-07 20:40:55,591 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:40:55" (1/1) ... [2025-02-07 20:40:55,601 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-07 20:40:55,601 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:40:55" (1/1) ... [2025-02-07 20:40:55,602 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:40:55" (1/1) ... [2025-02-07 20:40:55,604 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:40:55" (1/1) ... [2025-02-07 20:40:55,605 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:40:55" (1/1) ... [2025-02-07 20:40:55,608 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:40:55" (1/1) ... [2025-02-07 20:40:55,608 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:40:55" (1/1) ... [2025-02-07 20:40:55,609 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 20:40:55,611 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 20:40:55,611 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 20:40:55,611 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 20:40:55,612 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:40:55" (1/1) ... [2025-02-07 20:40:55,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 20:40:55,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:40:55,637 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 20:40:55,642 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 20:40:55,656 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 20:40:55,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-07 20:40:55,656 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 20:40:55,656 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 20:40:55,656 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-07 20:40:55,656 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-07 20:40:55,693 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 20:40:55,694 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 20:40:55,780 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2025-02-07 20:40:55,780 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 20:40:55,786 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 20:40:55,786 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 20:40:55,786 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 08:40:55 BoogieIcfgContainer [2025-02-07 20:40:55,786 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 20:40:55,788 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 20:40:55,788 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 20:40:55,791 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 20:40:55,791 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 08:40:55" (1/3) ... [2025-02-07 20:40:55,791 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33d65609 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 08:40:55, skipping insertion in model container [2025-02-07 20:40:55,791 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:40:55" (2/3) ... [2025-02-07 20:40:55,791 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33d65609 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 08:40:55, skipping insertion in model container [2025-02-07 20:40:55,792 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 08:40:55" (3/3) ... [2025-02-07 20:40:55,792 INFO L128 eAbstractionObserver]: Analyzing ICFG geo2-ll_unwindbound2.c [2025-02-07 20:40:55,803 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 20:40:55,804 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG geo2-ll_unwindbound2.c that has 2 procedures, 15 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-07 20:40:55,847 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 20:40:55,857 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;@d09bf11, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 20:40:55,857 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-07 20:40:55,860 INFO L276 IsEmpty]: Start isEmpty. Operand has 15 states, 10 states have (on average 1.5) internal successors, (15), 11 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-07 20:40:55,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-07 20:40:55,864 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:40:55,864 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-07 20:40:55,865 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:40:55,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:40:55,868 INFO L85 PathProgramCache]: Analyzing trace with hash 1212242397, now seen corresponding path program 1 times [2025-02-07 20:40:55,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:40:55,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280765425] [2025-02-07 20:40:55,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:40:55,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:40:55,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-07 20:40:55,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-07 20:40:55,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:40:55,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:40:55,974 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 20:40:55,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:40:55,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280765425] [2025-02-07 20:40:55,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280765425] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:40:55,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:40:55,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-07 20:40:55,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588857204] [2025-02-07 20:40:55,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:40:55,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-07 20:40:55,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:40:55,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-07 20:40:55,999 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-07 20:40:56,001 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.5) internal successors, (15), 11 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:40:56,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:40:56,013 INFO L93 Difference]: Finished difference Result 29 states and 39 transitions. [2025-02-07 20:40:56,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-07 20:40:56,014 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-02-07 20:40:56,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:40:56,018 INFO L225 Difference]: With dead ends: 29 [2025-02-07 20:40:56,018 INFO L226 Difference]: Without dead ends: 12 [2025-02-07 20:40:56,020 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-07 20:40:56,023 INFO L435 NwaCegarLoop]: 17 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, 17 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-02-07 20:40:56,024 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 20:40:56,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2025-02-07 20:40:56,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2025-02-07 20:40:56,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-07 20:40:56,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2025-02-07 20:40:56,049 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 14 transitions. Word has length 6 [2025-02-07 20:40:56,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:40:56,049 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 14 transitions. [2025-02-07 20:40:56,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:40:56,049 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2025-02-07 20:40:56,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-07 20:40:56,050 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:40:56,050 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:40:56,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-07 20:40:56,051 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:40:56,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:40:56,051 INFO L85 PathProgramCache]: Analyzing trace with hash -1114781629, now seen corresponding path program 1 times [2025-02-07 20:40:56,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:40:56,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100107549] [2025-02-07 20:40:56,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:40:56,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:40:56,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-07 20:40:56,072 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-07 20:40:56,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:40:56,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-07 20:40:56,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [933724632] [2025-02-07 20:40:56,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:40:56,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:40:56,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:40:56,078 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 20:40:56,080 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 20:40:56,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-07 20:40:56,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-07 20:40:56,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:40:56,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:40:56,118 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-07 20:40:56,121 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:40:56,231 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 20:40:56,232 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-07 20:40:56,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:40:56,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100107549] [2025-02-07 20:40:56,233 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-07 20:40:56,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [933724632] [2025-02-07 20:40:56,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [933724632] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:40:56,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:40:56,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 20:40:56,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022422870] [2025-02-07 20:40:56,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:40:56,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 20:40:56,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:40:56,235 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 20:40:56,236 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 20:40:56,236 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. Second operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:40:56,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:40:56,279 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2025-02-07 20:40:56,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 20:40:56,279 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.2) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 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 20:40:56,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:40:56,280 INFO L225 Difference]: With dead ends: 23 [2025-02-07 20:40:56,280 INFO L226 Difference]: Without dead ends: 20 [2025-02-07 20:40:56,280 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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-02-07 20:40:56,281 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 5 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 38 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 20:40:56,281 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 38 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 20:40:56,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2025-02-07 20:40:56,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2025-02-07 20:40:56,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-07 20:40:56,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2025-02-07 20:40:56,285 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 7 [2025-02-07 20:40:56,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:40:56,285 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2025-02-07 20:40:56,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.2) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:40:56,285 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2025-02-07 20:40:56,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-02-07 20:40:56,286 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:40:56,286 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:40:56,293 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 20:40:56,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:40:56,488 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:40:56,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:40:56,488 INFO L85 PathProgramCache]: Analyzing trace with hash 1881871726, now seen corresponding path program 1 times [2025-02-07 20:40:56,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:40:56,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877257346] [2025-02-07 20:40:56,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:40:56,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:40:56,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-07 20:40:56,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-07 20:40:56,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:40:56,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-07 20:40:56,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1801630262] [2025-02-07 20:40:56,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:40:56,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:40:56,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:40:56,533 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 20:40:56,534 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 20:40:56,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-07 20:40:56,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-07 20:40:56,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:40:56,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:40:56,575 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-02-07 20:40:56,577 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:40:56,663 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:40:56,664 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:41:12,917 WARN L873 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~z~0#1| Int)) (or (= (mod (+ (* |c_ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|) (* |c_ULTIMATE.start_main_~y~0#1| 18446744073709551615 |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|) |ULTIMATE.start_main_~z~0#1| (* 18446744073709551615 |c_ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|)) 18446744073709551616) 0) (not (= (mod (+ (* |c_ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|) (* 18446744073709551615 |c_ULTIMATE.start_main_~x~0#1|) (* |c_ULTIMATE.start_main_~y~0#1| 18446744073709551615 |ULTIMATE.start_main_~z~0#1|) 1) 18446744073709551616) 0)))) is different from true [2025-02-07 20:41:12,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:41:12,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877257346] [2025-02-07 20:41:12,921 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-07 20:41:12,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1801630262] [2025-02-07 20:41:12,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1801630262] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:41:12,921 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-02-07 20:41:12,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2025-02-07 20:41:12,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737662518] [2025-02-07 20:41:12,921 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-02-07 20:41:12,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-07 20:41:12,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:41:12,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-07 20:41:12,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=85, Unknown=2, NotChecked=18, Total=132 [2025-02-07 20:41:12,922 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand has 8 states, 8 states have (on average 1.5) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-07 20:41:13,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:41:13,013 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2025-02-07 20:41:13,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-07 20:41:13,016 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.5) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2025-02-07 20:41:13,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:41:13,017 INFO L225 Difference]: With dead ends: 31 [2025-02-07 20:41:13,017 INFO L226 Difference]: Without dead ends: 28 [2025-02-07 20:41:13,017 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=34, Invalid=100, Unknown=2, NotChecked=20, Total=156 [2025-02-07 20:41:13,019 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 5 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 20:41:13,019 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 68 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 20:41:13,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-02-07 20:41:13,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2025-02-07 20:41:13,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-07 20:41:13,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2025-02-07 20:41:13,025 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 15 [2025-02-07 20:41:13,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:41:13,025 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2025-02-07 20:41:13,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.5) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-07 20:41:13,025 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2025-02-07 20:41:13,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-02-07 20:41:13,028 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:41:13,028 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1] [2025-02-07 20:41:13,034 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-07 20:41:13,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:41:13,230 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:41:13,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:41:13,231 INFO L85 PathProgramCache]: Analyzing trace with hash -1297479783, now seen corresponding path program 2 times [2025-02-07 20:41:13,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:41:13,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137549709] [2025-02-07 20:41:13,231 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 20:41:13,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:41:13,237 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-02-07 20:41:13,247 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-02-07 20:41:13,248 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 20:41:13,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:41:13,462 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-07 20:41:13,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:41:13,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137549709] [2025-02-07 20:41:13,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137549709] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:41:13,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1870869885] [2025-02-07 20:41:13,463 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 20:41:13,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:41:13,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:41:13,465 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 20:41:13,467 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-07 20:41:13,492 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-02-07 20:41:13,506 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-02-07 20:41:13,506 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 20:41:13,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:41:13,507 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-07 20:41:13,508 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:41:13,547 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:41:13,547 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:41:13,583 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-07 20:41:13,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1870869885] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 20:41:13,584 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 20:41:13,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 6] total 9 [2025-02-07 20:41:13,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273622490] [2025-02-07 20:41:13,584 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 20:41:13,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-07 20:41:13,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:41:13,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-07 20:41:13,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-07 20:41:13,585 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 3 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-07 20:41:13,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:41:13,629 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2025-02-07 20:41:13,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-07 20:41:13,630 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 3 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 23 [2025-02-07 20:41:13,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:41:13,630 INFO L225 Difference]: With dead ends: 37 [2025-02-07 20:41:13,630 INFO L226 Difference]: Without dead ends: 24 [2025-02-07 20:41:13,630 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 42 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2025-02-07 20:41:13,632 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 4 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 20:41:13,632 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 61 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 20:41:13,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2025-02-07 20:41:13,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2025-02-07 20:41:13,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 18 states have (on average 1.0) internal successors, (18), 18 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-07 20:41:13,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 23 transitions. [2025-02-07 20:41:13,635 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 23 transitions. Word has length 23 [2025-02-07 20:41:13,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:41:13,635 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 23 transitions. [2025-02-07 20:41:13,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 3 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-07 20:41:13,635 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 23 transitions. [2025-02-07 20:41:13,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-02-07 20:41:13,636 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:41:13,636 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-02-07 20:41:13,642 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-07 20:41:13,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:41:13,837 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:41:13,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:41:13,837 INFO L85 PathProgramCache]: Analyzing trace with hash -1296615844, now seen corresponding path program 1 times [2025-02-07 20:41:13,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:41:13,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246049970] [2025-02-07 20:41:13,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:41:13,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:41:13,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-07 20:41:13,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-07 20:41:13,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:41:13,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-07 20:41:13,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [583362837] [2025-02-07 20:41:13,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:41:13,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:41:13,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:41:13,860 INFO L229 MonitoredProcess]: Starting monitored process 5 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 20:41:13,862 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-07 20:41:13,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-07 20:41:13,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-07 20:41:13,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:41:13,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:41:13,929 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-02-07 20:41:13,933 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:41:14,064 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-07 20:41:14,064 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:41:39,919 WARN L873 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~z~0#1| Int)) (or (not (= (mod (+ (* |c_ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|) (* 18446744073709551615 |c_ULTIMATE.start_main_~x~0#1|) (* |c_ULTIMATE.start_main_~y~0#1| 18446744073709551615 |ULTIMATE.start_main_~z~0#1|) 1) 18446744073709551616) 0)) (= (mod (+ (* |c_ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|) (* |c_ULTIMATE.start_main_~y~0#1| 18446744073709551615 |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|) (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|) (* 18446744073709551615 |c_ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|)) 18446744073709551616) 0))) is different from true [2025-02-07 20:41:39,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:41:39,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246049970] [2025-02-07 20:41:39,920 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-07 20:41:39,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [583362837] [2025-02-07 20:41:39,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [583362837] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:41:39,920 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-02-07 20:41:39,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2025-02-07 20:41:39,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368107616] [2025-02-07 20:41:39,921 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-02-07 20:41:39,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-07 20:41:39,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:41:39,921 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-07 20:41:39,921 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=4, NotChecked=22, Total=182 [2025-02-07 20:41:39,921 INFO L87 Difference]: Start difference. First operand 24 states and 23 transitions. Second operand has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-07 20:41:39,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:41:39,999 INFO L93 Difference]: Finished difference Result 24 states and 23 transitions. [2025-02-07 20:41:40,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-07 20:41:40,000 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 23 [2025-02-07 20:41:40,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:41:40,000 INFO L225 Difference]: With dead ends: 24 [2025-02-07 20:41:40,000 INFO L226 Difference]: Without dead ends: 0 [2025-02-07 20:41:40,001 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 17.6s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=4, NotChecked=24, Total=210 [2025-02-07 20:41:40,001 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 3 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 20:41:40,001 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 68 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 20:41:40,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-07 20:41:40,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-07 20:41:40,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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 20:41:40,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-07 20:41:40,002 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 23 [2025-02-07 20:41:40,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:41:40,002 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-07 20:41:40,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-07 20:41:40,002 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-07 20:41:40,002 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-07 20:41:40,008 INFO L782 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-07 20:41:40,017 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-07 20:41:40,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:41:40,212 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1] [2025-02-07 20:41:40,214 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-07 20:41:40,303 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-07 20:41:40,316 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.02 08:41:40 BoogieIcfgContainer [2025-02-07 20:41:40,316 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-07 20:41:40,317 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-07 20:41:40,317 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-07 20:41:40,317 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-07 20:41:40,318 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 08:40:55" (3/4) ... [2025-02-07 20:41:40,319 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-07 20:41:40,323 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2025-02-07 20:41:40,326 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-02-07 20:41:40,326 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-02-07 20:41:40,326 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-07 20:41:40,326 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-07 20:41:40,383 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-07 20:41:40,383 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-07 20:41:40,384 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-07 20:41:40,385 INFO L158 Benchmark]: Toolchain (without parser) took 44997.97ms. Allocated memory is still 142.6MB. Free memory was 106.3MB in the beginning and 66.7MB in the end (delta: 39.6MB). Peak memory consumption was 41.7MB. Max. memory is 16.1GB. [2025-02-07 20:41:40,385 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 201.3MB. Free memory is still 126.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 20:41:40,385 INFO L158 Benchmark]: CACSL2BoogieTranslator took 173.12ms. Allocated memory is still 142.6MB. Free memory was 106.3MB in the beginning and 95.0MB in the end (delta: 11.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-07 20:41:40,386 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.25ms. Allocated memory is still 142.6MB. Free memory was 95.0MB in the beginning and 93.9MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 20:41:40,386 INFO L158 Benchmark]: Boogie Preprocessor took 25.17ms. Allocated memory is still 142.6MB. Free memory was 93.9MB in the beginning and 92.2MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-07 20:41:40,386 INFO L158 Benchmark]: IcfgBuilder took 175.63ms. Allocated memory is still 142.6MB. Free memory was 92.2MB in the beginning and 81.6MB in the end (delta: 10.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-07 20:41:40,387 INFO L158 Benchmark]: TraceAbstraction took 44528.44ms. Allocated memory is still 142.6MB. Free memory was 80.5MB in the beginning and 72.4MB in the end (delta: 8.1MB). Peak memory consumption was 8.1MB. Max. memory is 16.1GB. [2025-02-07 20:41:40,387 INFO L158 Benchmark]: Witness Printer took 66.76ms. Allocated memory is still 142.6MB. Free memory was 72.4MB in the beginning and 66.7MB in the end (delta: 5.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-07 20:41:40,388 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 201.3MB. Free memory is still 126.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 173.12ms. Allocated memory is still 142.6MB. Free memory was 106.3MB in the beginning and 95.0MB in the end (delta: 11.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 21.25ms. Allocated memory is still 142.6MB. Free memory was 95.0MB in the beginning and 93.9MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 25.17ms. Allocated memory is still 142.6MB. Free memory was 93.9MB in the beginning and 92.2MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 175.63ms. Allocated memory is still 142.6MB. Free memory was 92.2MB in the beginning and 81.6MB in the end (delta: 10.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 44528.44ms. Allocated memory is still 142.6MB. Free memory was 80.5MB in the beginning and 72.4MB in the end (delta: 8.1MB). Peak memory consumption was 8.1MB. Max. memory is 16.1GB. * Witness Printer took 66.76ms. Allocated memory is still 142.6MB. Free memory was 72.4MB in the beginning and 66.7MB in the end (delta: 5.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 17]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 15 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 44.4s, OverallIterations: 5, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 19 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 17 mSDsluCounter, 252 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 186 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 157 IncrementalHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 66 mSDtfsCounter, 157 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 124 GetRequests, 85 SyntacticMatches, 3 SemanticMatches, 36 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 25.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=28occurred in iteration=3, InterpolantAutomatonStates: 30, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 42.8s InterpolantComputationTime, 142 NumberOfCodeBlocks, 142 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 113 ConstructedInterpolants, 0 QuantifiedInterpolants, 388 SizeOfPredicates, 5 NumberOfNonLiveVariables, 293 ConjunctsInSsa, 56 ConjunctsInUnsatCore, 7 InterpolantComputations, 2 PerfectInterpolantSequences, 50/75 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 34]: Location Invariant Derived location invariant: (((((2 <= counter) && (y == ((long long) z * z))) && (x == (((long long) z + 1) + ((long long) z * z)))) || (((y == z) && (1 <= counter)) && (x == ((long long) z + 1)))) || (((x == 1) && (y == 1)) && (counter == 0))) RESULT: Ultimate proved your program to be correct! [2025-02-07 20:41:40,407 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE