./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/divbin2_valuebound2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 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/divbin2_valuebound2.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b13c7652df725cabbd532da1a8071964fc183988971efb0d5513967afd08dfea --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 03:14:14,065 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 03:14:14,132 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 03:14:14,136 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 03:14:14,137 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 03:14:14,163 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 03:14:14,164 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 03:14:14,165 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 03:14:14,165 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 03:14:14,165 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 03:14:14,166 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 03:14:14,166 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 03:14:14,166 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 03:14:14,166 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 03:14:14,166 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 03:14:14,167 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 03:14:14,168 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 03:14:14,168 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 03:14:14,168 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 03:14:14,168 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 03:14:14,168 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 03:14:14,168 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 03:14:14,168 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 03:14:14,168 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 03:14:14,168 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 03:14:14,168 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 03:14:14,168 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 03:14:14,168 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 03:14:14,168 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 03:14:14,168 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 03:14:14,168 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 03:14:14,168 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 03:14:14,168 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:14:14,168 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 03:14:14,168 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 03:14:14,169 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 03:14:14,169 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 03:14:14,169 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:14:14,169 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 03:14:14,169 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 03:14:14,169 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 03:14:14,169 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 03:14:14,169 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 03:14:14,169 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 03:14:14,169 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 03:14:14,169 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 03:14:14,169 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 03:14:14,169 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 03:14:14,169 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 -> b13c7652df725cabbd532da1a8071964fc183988971efb0d5513967afd08dfea [2025-01-09 03:14:14,431 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 03:14:14,437 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 03:14:14,439 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 03:14:14,440 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 03:14:14,440 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 03:14:14,441 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/divbin2_valuebound2.i [2025-01-09 03:14:15,671 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/58ca2aefa/fcd95d9f67af423698919da87c40f3bf/FLAG4acabde9e [2025-01-09 03:14:15,906 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 03:14:15,907 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/divbin2_valuebound2.i [2025-01-09 03:14:15,914 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/58ca2aefa/fcd95d9f67af423698919da87c40f3bf/FLAG4acabde9e [2025-01-09 03:14:16,263 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/58ca2aefa/fcd95d9f67af423698919da87c40f3bf [2025-01-09 03:14:16,266 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 03:14:16,267 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 03:14:16,268 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 03:14:16,268 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 03:14:16,272 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 03:14:16,273 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:14:16" (1/1) ... [2025-01-09 03:14:16,274 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37455aab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:14:16, skipping insertion in model container [2025-01-09 03:14:16,274 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:14:16" (1/1) ... [2025-01-09 03:14:16,287 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 03:14:16,415 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/divbin2_valuebound2.i[951,964] [2025-01-09 03:14:16,429 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 03:14:16,438 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 03:14:16,447 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/divbin2_valuebound2.i[951,964] [2025-01-09 03:14:16,453 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 03:14:16,469 INFO L204 MainTranslator]: Completed translation [2025-01-09 03:14:16,472 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:14:16 WrapperNode [2025-01-09 03:14:16,472 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 03:14:16,473 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 03:14:16,474 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 03:14:16,474 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 03:14:16,481 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:14:16" (1/1) ... [2025-01-09 03:14:16,487 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:14:16" (1/1) ... [2025-01-09 03:14:16,500 INFO L138 Inliner]: procedures = 16, calls = 9, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 40 [2025-01-09 03:14:16,502 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 03:14:16,502 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 03:14:16,503 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 03:14:16,503 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 03:14:16,510 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:14:16" (1/1) ... [2025-01-09 03:14:16,510 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:14:16" (1/1) ... [2025-01-09 03:14:16,512 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:14:16" (1/1) ... [2025-01-09 03:14:16,521 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-01-09 03:14:16,522 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:14:16" (1/1) ... [2025-01-09 03:14:16,522 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:14:16" (1/1) ... [2025-01-09 03:14:16,527 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:14:16" (1/1) ... [2025-01-09 03:14:16,529 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:14:16" (1/1) ... [2025-01-09 03:14:16,531 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:14:16" (1/1) ... [2025-01-09 03:14:16,535 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:14:16" (1/1) ... [2025-01-09 03:14:16,536 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:14:16" (1/1) ... [2025-01-09 03:14:16,537 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 03:14:16,538 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 03:14:16,539 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 03:14:16,539 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 03:14:16,541 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:14:16" (1/1) ... [2025-01-09 03:14:16,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:14:16,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:14:16,571 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-01-09 03:14:16,579 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-01-09 03:14:16,601 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 03:14:16,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 03:14:16,601 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 03:14:16,601 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 03:14:16,601 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-01-09 03:14:16,602 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-01-09 03:14:16,653 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 03:14:16,655 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 03:14:16,773 INFO L? ?]: Removed 7 outVars from TransFormulas that were not future-live. [2025-01-09 03:14:16,773 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 03:14:16,781 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 03:14:16,782 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-01-09 03:14:16,783 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:14:16 BoogieIcfgContainer [2025-01-09 03:14:16,783 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 03:14:16,785 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 03:14:16,785 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 03:14:16,789 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 03:14:16,790 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:14:16" (1/3) ... [2025-01-09 03:14:16,791 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@210d63f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:14:16, skipping insertion in model container [2025-01-09 03:14:16,791 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:14:16" (2/3) ... [2025-01-09 03:14:16,792 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@210d63f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:14:16, skipping insertion in model container [2025-01-09 03:14:16,792 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:14:16" (3/3) ... [2025-01-09 03:14:16,794 INFO L128 eAbstractionObserver]: Analyzing ICFG divbin2_valuebound2.i [2025-01-09 03:14:16,806 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 03:14:16,808 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG divbin2_valuebound2.i that has 2 procedures, 19 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-01-09 03:14:16,844 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 03:14:16,852 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;@1142ce9a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 03:14:16,852 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 03:14:16,855 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 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-01-09 03:14:16,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-01-09 03:14:16,860 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:14:16,861 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:14:16,861 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:14:16,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:14:16,867 INFO L85 PathProgramCache]: Analyzing trace with hash -586448253, now seen corresponding path program 1 times [2025-01-09 03:14:16,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:14:16,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969741100] [2025-01-09 03:14:16,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:14:16,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:14:16,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-09 03:14:16,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-09 03:14:16,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:14:16,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:14:17,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:14:17,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:14:17,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969741100] [2025-01-09 03:14:17,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969741100] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:14:17,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:14:17,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 03:14:17,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108398833] [2025-01-09 03:14:17,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:14:17,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 03:14:17,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:14:17,037 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 03:14:17,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 03:14:17,039 INFO L87 Difference]: Start difference. First operand has 19 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 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 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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-01-09 03:14:17,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:14:17,054 INFO L93 Difference]: Finished difference Result 35 states and 50 transitions. [2025-01-09 03:14:17,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 03:14:17,056 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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 9 [2025-01-09 03:14:17,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:14:17,061 INFO L225 Difference]: With dead ends: 35 [2025-01-09 03:14:17,061 INFO L226 Difference]: Without dead ends: 15 [2025-01-09 03:14:17,064 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-01-09 03:14:17,071 INFO L435 NwaCegarLoop]: 22 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, 22 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-01-09 03:14:17,071 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:14:17,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2025-01-09 03:14:17,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2025-01-09 03:14:17,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 12 states have internal predecessors, (15), 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-01-09 03:14:17,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. [2025-01-09 03:14:17,102 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 18 transitions. Word has length 9 [2025-01-09 03:14:17,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:14:17,102 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 18 transitions. [2025-01-09 03:14:17,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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-01-09 03:14:17,102 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 18 transitions. [2025-01-09 03:14:17,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-01-09 03:14:17,103 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:14:17,103 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:14:17,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 03:14:17,104 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:14:17,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:14:17,105 INFO L85 PathProgramCache]: Analyzing trace with hash 1184865025, now seen corresponding path program 1 times [2025-01-09 03:14:17,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:14:17,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054646749] [2025-01-09 03:14:17,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:14:17,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:14:17,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-09 03:14:17,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-09 03:14:17,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:14:17,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 03:14:17,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1821846510] [2025-01-09 03:14:17,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:14:17,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:14:17,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:14:17,163 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-01-09 03:14:17,165 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-01-09 03:14:17,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-09 03:14:17,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-09 03:14:17,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:14:17,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:14:17,234 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-09 03:14:17,239 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:14:17,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:14:17,470 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:14:17,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:14:17,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054646749] [2025-01-09 03:14:17,471 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-09 03:14:17,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1821846510] [2025-01-09 03:14:17,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1821846510] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:14:17,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:14:17,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 03:14:17,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784587097] [2025-01-09 03:14:17,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:14:17,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 03:14:17,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:14:17,474 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 03:14:17,474 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:14:17,475 INFO L87 Difference]: Start difference. First operand 15 states and 18 transitions. Second operand has 7 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 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-01-09 03:14:17,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:14:17,568 INFO L93 Difference]: Finished difference Result 25 states and 30 transitions. [2025-01-09 03:14:17,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 03:14:17,569 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 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 9 [2025-01-09 03:14:17,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:14:17,569 INFO L225 Difference]: With dead ends: 25 [2025-01-09 03:14:17,569 INFO L226 Difference]: Without dead ends: 22 [2025-01-09 03:14:17,570 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:14:17,570 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 11 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:14:17,571 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 42 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:14:17,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2025-01-09 03:14:17,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2025-01-09 03:14:17,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 16 states have (on average 1.3125) internal successors, (21), 17 states have internal predecessors, (21), 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-01-09 03:14:17,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2025-01-09 03:14:17,575 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 9 [2025-01-09 03:14:17,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:14:17,575 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2025-01-09 03:14:17,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 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-01-09 03:14:17,576 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2025-01-09 03:14:17,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-01-09 03:14:17,576 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:14:17,576 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:14:17,584 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 03:14:17,780 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-01-09 03:14:17,780 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:14:17,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:14:17,781 INFO L85 PathProgramCache]: Analyzing trace with hash 307606896, now seen corresponding path program 1 times [2025-01-09 03:14:17,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:14:17,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48085819] [2025-01-09 03:14:17,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:14:17,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:14:17,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-09 03:14:17,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-09 03:14:17,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:14:17,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:14:18,018 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:14:18,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:14:18,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48085819] [2025-01-09 03:14:18,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48085819] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:14:18,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:14:18,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:14:18,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398503113] [2025-01-09 03:14:18,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:14:18,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:14:18,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:14:18,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:14:18,020 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:14:18,021 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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-01-09 03:14:18,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:14:18,044 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2025-01-09 03:14:18,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:14:18,046 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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 16 [2025-01-09 03:14:18,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:14:18,046 INFO L225 Difference]: With dead ends: 42 [2025-01-09 03:14:18,046 INFO L226 Difference]: Without dead ends: 23 [2025-01-09 03:14:18,047 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:14:18,047 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 0 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:14:18,047 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 26 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:14:18,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2025-01-09 03:14:18,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2025-01-09 03:14:18,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 18 states have internal predecessors, (22), 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-01-09 03:14:18,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2025-01-09 03:14:18,057 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 16 [2025-01-09 03:14:18,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:14:18,057 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2025-01-09 03:14:18,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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-01-09 03:14:18,058 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2025-01-09 03:14:18,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-01-09 03:14:18,058 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:14:18,058 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:14:18,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 03:14:18,058 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:14:18,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:14:18,059 INFO L85 PathProgramCache]: Analyzing trace with hash 1115574231, now seen corresponding path program 1 times [2025-01-09 03:14:18,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:14:18,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191163286] [2025-01-09 03:14:18,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:14:18,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:14:18,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-09 03:14:18,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-09 03:14:18,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:14:18,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 03:14:18,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1163842050] [2025-01-09 03:14:18,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:14:18,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:14:18,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:14:18,122 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-01-09 03:14:18,125 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-01-09 03:14:18,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-09 03:14:18,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-09 03:14:18,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:14:18,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:14:18,189 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-01-09 03:14:18,191 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:14:18,276 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 03:14:18,276 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 03:14:22,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:14:22,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191163286] [2025-01-09 03:14:22,570 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-09 03:14:22,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1163842050] [2025-01-09 03:14:22,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1163842050] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:14:22,570 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:14:22,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2025-01-09 03:14:22,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90184949] [2025-01-09 03:14:22,571 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-01-09 03:14:22,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:14:22,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:14:22,572 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:14:22,573 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=51, Unknown=1, NotChecked=0, Total=72 [2025-01-09 03:14:22,574 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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-01-09 03:14:22,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:14:22,650 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2025-01-09 03:14:22,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 03:14:22,650 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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 17 [2025-01-09 03:14:22,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:14:22,651 INFO L225 Difference]: With dead ends: 32 [2025-01-09 03:14:22,651 INFO L226 Difference]: Without dead ends: 29 [2025-01-09 03:14:22,651 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=24, Invalid=65, Unknown=1, NotChecked=0, Total=90 [2025-01-09 03:14:22,652 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 5 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:14:22,652 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 43 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:14:22,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2025-01-09 03:14:22,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2025-01-09 03:14:22,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 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-01-09 03:14:22,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2025-01-09 03:14:22,658 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 17 [2025-01-09 03:14:22,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:14:22,658 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2025-01-09 03:14:22,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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-01-09 03:14:22,658 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2025-01-09 03:14:22,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-01-09 03:14:22,659 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:14:22,659 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:14:22,667 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 03:14:22,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:14:22,860 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:14:22,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:14:22,860 INFO L85 PathProgramCache]: Analyzing trace with hash -895733028, now seen corresponding path program 1 times [2025-01-09 03:14:22,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:14:22,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75558192] [2025-01-09 03:14:22,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:14:22,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:14:22,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-09 03:14:22,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-09 03:14:22,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:14:22,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:14:23,488 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 03:14:23,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:14:23,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75558192] [2025-01-09 03:14:23,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75558192] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:14:23,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [193353592] [2025-01-09 03:14:23,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:14:23,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:14:23,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:14:23,495 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-01-09 03:14:23,498 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-01-09 03:14:23,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-09 03:14:23,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-09 03:14:23,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:14:23,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:14:23,549 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-09 03:14:23,554 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:14:23,783 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 03:14:23,783 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 03:14:24,165 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 03:14:24,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [193353592] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 03:14:24,167 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 03:14:24,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 15 [2025-01-09 03:14:24,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970944938] [2025-01-09 03:14:24,167 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 03:14:24,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 03:14:24,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:14:24,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 03:14:24,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2025-01-09 03:14:24,170 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-09 03:14:24,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:14:24,460 INFO L93 Difference]: Finished difference Result 62 states and 76 transitions. [2025-01-09 03:14:24,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 03:14:24,461 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 24 [2025-01-09 03:14:24,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:14:24,462 INFO L225 Difference]: With dead ends: 62 [2025-01-09 03:14:24,463 INFO L226 Difference]: Without dead ends: 39 [2025-01-09 03:14:24,464 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=81, Invalid=261, Unknown=0, NotChecked=0, Total=342 [2025-01-09 03:14:24,464 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 8 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 03:14:24,465 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 99 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 03:14:24,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-01-09 03:14:24,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2025-01-09 03:14:24,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 28 states have internal predecessors, (34), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-09 03:14:24,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 47 transitions. [2025-01-09 03:14:24,480 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 47 transitions. Word has length 24 [2025-01-09 03:14:24,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:14:24,481 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 47 transitions. [2025-01-09 03:14:24,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-09 03:14:24,481 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 47 transitions. [2025-01-09 03:14:24,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-01-09 03:14:24,483 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:14:24,483 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:14:24,490 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-01-09 03:14:24,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:14:24,684 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:14:24,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:14:24,684 INFO L85 PathProgramCache]: Analyzing trace with hash -897580070, now seen corresponding path program 2 times [2025-01-09 03:14:24,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:14:24,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837105410] [2025-01-09 03:14:24,684 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 03:14:24,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:14:24,690 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-01-09 03:14:24,707 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-01-09 03:14:24,707 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 03:14:24,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:14:25,228 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 03:14:25,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:14:25,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837105410] [2025-01-09 03:14:25,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837105410] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:14:25,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1952961357] [2025-01-09 03:14:25,229 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 03:14:25,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:14:25,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:14:25,231 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-01-09 03:14:25,234 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-01-09 03:14:25,259 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-01-09 03:14:25,287 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-01-09 03:14:25,287 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 03:14:25,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:14:25,289 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-01-09 03:14:25,290 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:14:25,481 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 03:14:25,481 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 03:14:25,743 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 03:14:25,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1952961357] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 03:14:25,744 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 03:14:25,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 7] total 19 [2025-01-09 03:14:25,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451564594] [2025-01-09 03:14:25,744 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 03:14:25,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-01-09 03:14:25,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:14:25,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-01-09 03:14:25,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2025-01-09 03:14:25,745 INFO L87 Difference]: Start difference. First operand 38 states and 47 transitions. Second operand has 19 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 19 states have internal predecessors, (30), 7 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-09 03:14:26,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:14:26,125 INFO L93 Difference]: Finished difference Result 57 states and 75 transitions. [2025-01-09 03:14:26,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 03:14:26,126 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 19 states have internal predecessors, (30), 7 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 24 [2025-01-09 03:14:26,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:14:26,127 INFO L225 Difference]: With dead ends: 57 [2025-01-09 03:14:26,127 INFO L226 Difference]: Without dead ends: 37 [2025-01-09 03:14:26,128 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=178, Invalid=578, Unknown=0, NotChecked=0, Total=756 [2025-01-09 03:14:26,129 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 17 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 03:14:26,129 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 136 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 03:14:26,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-01-09 03:14:26,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2025-01-09 03:14:26,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 27 states have internal predecessors, (33), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-09 03:14:26,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 42 transitions. [2025-01-09 03:14:26,136 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 42 transitions. Word has length 24 [2025-01-09 03:14:26,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:14:26,136 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 42 transitions. [2025-01-09 03:14:26,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 19 states have internal predecessors, (30), 7 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-09 03:14:26,136 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions. [2025-01-09 03:14:26,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-01-09 03:14:26,136 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:14:26,136 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:14:26,145 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-01-09 03:14:26,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-01-09 03:14:26,337 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:14:26,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:14:26,338 INFO L85 PathProgramCache]: Analyzing trace with hash 622032451, now seen corresponding path program 2 times [2025-01-09 03:14:26,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:14:26,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306848441] [2025-01-09 03:14:26,338 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 03:14:26,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:14:26,343 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-01-09 03:14:26,376 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-01-09 03:14:26,376 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 03:14:26,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 03:14:26,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [190436674] [2025-01-09 03:14:26,380 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 03:14:26,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:14:26,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:14:26,383 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:14:26,385 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 03:14:26,410 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-01-09 03:14:26,524 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-01-09 03:14:26,525 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 03:14:26,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:14:26,526 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-01-09 03:14:26,529 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:14:27,396 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-09 03:14:27,397 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 03:15:04,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:15:04,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306848441] [2025-01-09 03:15:04,827 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-09 03:15:04,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [190436674] [2025-01-09 03:15:04,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [190436674] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:15:04,827 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:15:04,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2025-01-09 03:15:04,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123417765] [2025-01-09 03:15:04,828 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-01-09 03:15:04,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 03:15:04,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:15:04,829 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 03:15:04,829 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=240, Unknown=3, NotChecked=0, Total=306 [2025-01-09 03:15:04,829 INFO L87 Difference]: Start difference. First operand 35 states and 42 transitions. Second operand has 11 states, 10 states have (on average 1.7) internal successors, (17), 10 states have internal predecessors, (17), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 03:15:04,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:15:04,970 INFO L93 Difference]: Finished difference Result 45 states and 54 transitions. [2025-01-09 03:15:04,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 03:15:04,971 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.7) internal successors, (17), 10 states have internal predecessors, (17), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2025-01-09 03:15:04,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:15:04,971 INFO L225 Difference]: With dead ends: 45 [2025-01-09 03:15:04,971 INFO L226 Difference]: Without dead ends: 42 [2025-01-09 03:15:04,972 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 23.8s TimeCoverageRelationStatistics Valid=69, Invalid=270, Unknown=3, NotChecked=0, Total=342 [2025-01-09 03:15:04,973 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 12 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:15:04,973 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 55 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:15:04,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-01-09 03:15:04,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2025-01-09 03:15:04,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 32 states have internal predecessors, (39), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-09 03:15:04,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 50 transitions. [2025-01-09 03:15:04,979 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 50 transitions. Word has length 25 [2025-01-09 03:15:04,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:15:04,979 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 50 transitions. [2025-01-09 03:15:04,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.7) internal successors, (17), 10 states have internal predecessors, (17), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 03:15:04,979 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 50 transitions. [2025-01-09 03:15:04,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-01-09 03:15:04,979 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:15:04,980 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:15:04,986 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-09 03:15:05,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:15:05,180 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:15:05,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:15:05,181 INFO L85 PathProgramCache]: Analyzing trace with hash 620185409, now seen corresponding path program 3 times [2025-01-09 03:15:05,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:15:05,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139260059] [2025-01-09 03:15:05,181 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 03:15:05,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:15:05,185 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 3 equivalence classes. [2025-01-09 03:15:05,213 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 25 of 25 statements. [2025-01-09 03:15:05,213 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-01-09 03:15:05,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:15:05,843 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 03:15:05,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:15:05,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139260059] [2025-01-09 03:15:05,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139260059] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:15:05,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1279121362] [2025-01-09 03:15:05,844 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 03:15:05,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:15:05,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:15:05,846 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:15:05,847 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-09 03:15:05,868 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 3 equivalence classes. [2025-01-09 03:15:05,902 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 25 of 25 statements. [2025-01-09 03:15:05,902 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-01-09 03:15:05,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:15:05,903 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-01-09 03:15:05,904 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:15:06,313 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-09 03:15:06,313 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 03:15:15,444 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (mod |c_ULTIMATE.start_main_~B~0#1| 4294967296)) (.cse3 (mod |c_ULTIMATE.start_main_~r~0#1| 4294967296))) (and (forall ((v_z_104 Int)) (or (< 4294967295 v_z_104) (forall ((v_y_104 Int)) (let ((.cse4 (* 4294967295 v_z_104)) (.cse5 (* v_y_104 4294967296))) (let ((.cse0 (+ .cse4 .cse5))) (or (< 1 .cse0) (forall ((v_y_103 Int)) (let ((.cse2 (+ .cse4 .cse5 (* 2 v_y_103)))) (or (< (+ v_z_104 (mod (+ |c_ULTIMATE.start_main_~r~0#1| (* 4294967294 v_y_103)) 4294967296)) (+ v_y_103 4294967296)) (= .cse1 .cse2) (< .cse3 .cse2) (< (+ (* v_y_103 4) (* v_z_104 8589934590) (* 8589934592 v_y_104)) .cse3) (< 2147483647 .cse2)))) (< .cse0 0))))) (< v_z_104 0))) (forall ((v_z_100 Int)) (or (forall ((v_y_100 Int)) (let ((.cse9 (* 4294967295 v_z_100)) (.cse10 (* v_y_100 4294967296))) (let ((.cse6 (+ .cse9 .cse10))) (or (< .cse6 0) (< 1 .cse6) (forall ((v_y_97 Int)) (let ((.cse7 (+ (mod (+ (* v_y_97 4294967294) |c_ULTIMATE.start_main_~r~0#1|) 4294967296) v_z_100)) (.cse8 (+ .cse9 .cse10 (* v_y_97 2)))) (or (< .cse7 v_y_97) (= v_y_97 .cse7) (= .cse1 .cse8) (< 4294967295 .cse7) (< (+ (* v_z_100 8589934590) (* 8589934592 v_y_100) (* v_y_97 4)) .cse3) (< 2147483647 .cse8) (< .cse3 .cse8)))))))) (< v_z_100 0) (< 4294967295 v_z_100))) (forall ((v_z_100 Int)) (or (forall ((v_y_100 Int)) (let ((.cse15 (* 4294967295 v_z_100)) (.cse16 (* v_y_100 4294967296))) (let ((.cse11 (+ .cse15 .cse16))) (or (< .cse11 0) (< 1 .cse11) (forall ((v_y_97 Int)) (let ((.cse12 (+ (mod (+ (* v_y_97 4294967294) |c_ULTIMATE.start_main_~r~0#1|) 4294967296) v_z_100)) (.cse13 (+ v_y_97 4294967296)) (.cse14 (+ .cse15 .cse16 (* v_y_97 2)))) (or (< .cse12 .cse13) (= .cse1 .cse14) (< (+ (* v_z_100 8589934590) (* 8589934592 v_y_100) (* v_y_97 4)) .cse3) (= .cse12 .cse13) (< 2147483647 .cse14) (< .cse3 .cse14)))))))) (< v_z_100 0) (< 4294967295 v_z_100))) (forall ((v_z_104 Int)) (or (< 4294967295 v_z_104) (forall ((v_y_104 Int)) (let ((.cse20 (* 4294967295 v_z_104)) (.cse21 (* v_y_104 4294967296))) (let ((.cse17 (+ .cse20 .cse21))) (or (< 1 .cse17) (< .cse17 0) (forall ((v_y_103 Int)) (let ((.cse19 (+ v_z_104 (mod (+ |c_ULTIMATE.start_main_~r~0#1| (* 4294967294 v_y_103)) 4294967296))) (.cse18 (+ .cse20 .cse21 (* 2 v_y_103)))) (or (= .cse1 .cse18) (< .cse3 .cse18) (< .cse19 v_y_103) (< (+ (* v_y_103 4) (* v_z_104 8589934590) (* 8589934592 v_y_104)) .cse3) (< 4294967295 .cse19) (< 2147483647 .cse18)))))))) (< v_z_104 0))))) is different from false [2025-01-09 03:15:46,536 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 2 not checked. [2025-01-09 03:15:46,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1279121362] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 03:15:46,536 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 03:15:46,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 25 [2025-01-09 03:15:46,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945687172] [2025-01-09 03:15:46,537 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 03:15:46,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-01-09 03:15:46,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:15:46,537 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-01-09 03:15:46,538 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=449, Unknown=3, NotChecked=44, Total=600 [2025-01-09 03:15:46,538 INFO L87 Difference]: Start difference. First operand 42 states and 50 transitions. Second operand has 25 states, 25 states have (on average 1.44) internal successors, (36), 25 states have internal predecessors, (36), 7 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-09 03:15:47,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:15:47,570 INFO L93 Difference]: Finished difference Result 67 states and 80 transitions. [2025-01-09 03:15:47,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 03:15:47,571 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.44) internal successors, (36), 25 states have internal predecessors, (36), 7 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 25 [2025-01-09 03:15:47,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:15:47,571 INFO L225 Difference]: With dead ends: 67 [2025-01-09 03:15:47,571 INFO L226 Difference]: Without dead ends: 0 [2025-01-09 03:15:47,572 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 34.7s TimeCoverageRelationStatistics Valid=200, Invalid=731, Unknown=3, NotChecked=58, Total=992 [2025-01-09 03:15:47,573 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 19 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 15 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 03:15:47,573 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 117 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 130 Invalid, 0 Unknown, 15 Unchecked, 0.3s Time] [2025-01-09 03:15:47,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-09 03:15:47,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-09 03:15:47,574 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-01-09 03:15:47,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-09 03:15:47,574 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2025-01-09 03:15:47,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:15:47,574 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-09 03:15:47,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.44) internal successors, (36), 25 states have internal predecessors, (36), 7 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-09 03:15:47,574 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-09 03:15:47,574 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-09 03:15:47,576 INFO L782 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 03:15:47,582 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-09 03:15:47,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-01-09 03:15:47,779 INFO L422 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1] [2025-01-09 03:15:47,780 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-09 03:15:48,223 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 03:15:48,236 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 03:15:48 BoogieIcfgContainer [2025-01-09 03:15:48,236 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 03:15:48,237 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 03:15:48,237 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 03:15:48,237 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 03:15:48,237 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:14:16" (3/4) ... [2025-01-09 03:15:48,240 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-09 03:15:48,244 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2025-01-09 03:15:48,247 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-01-09 03:15:48,247 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-01-09 03:15:48,247 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-09 03:15:48,247 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-09 03:15:48,310 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 03:15:48,310 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 03:15:48,310 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 03:15:48,311 INFO L158 Benchmark]: Toolchain (without parser) took 92044.08ms. Allocated memory was 142.6MB in the beginning and 394.3MB in the end (delta: 251.7MB). Free memory was 105.9MB in the beginning and 256.4MB in the end (delta: -150.6MB). Peak memory consumption was 101.4MB. Max. memory is 16.1GB. [2025-01-09 03:15:48,311 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 201.3MB. Free memory is still 124.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 03:15:48,311 INFO L158 Benchmark]: CACSL2BoogieTranslator took 204.19ms. Allocated memory is still 142.6MB. Free memory was 105.9MB in the beginning and 95.3MB in the end (delta: 10.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 03:15:48,312 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.07ms. Allocated memory is still 142.6MB. Free memory was 95.3MB in the beginning and 94.4MB in the end (delta: 968.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 03:15:48,312 INFO L158 Benchmark]: Boogie Preprocessor took 34.89ms. Allocated memory is still 142.6MB. Free memory was 94.4MB in the beginning and 92.7MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 03:15:48,312 INFO L158 Benchmark]: RCFGBuilder took 245.03ms. Allocated memory is still 142.6MB. Free memory was 92.7MB in the beginning and 82.4MB in the end (delta: 10.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 03:15:48,312 INFO L158 Benchmark]: TraceAbstraction took 91451.18ms. Allocated memory was 142.6MB in the beginning and 394.3MB in the end (delta: 251.7MB). Free memory was 81.4MB in the beginning and 264.6MB in the end (delta: -183.1MB). Peak memory consumption was 67.9MB. Max. memory is 16.1GB. [2025-01-09 03:15:48,313 INFO L158 Benchmark]: Witness Printer took 73.65ms. Allocated memory is still 394.3MB. Free memory was 264.6MB in the beginning and 256.4MB in the end (delta: 8.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 03:15:48,314 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.16ms. Allocated memory is still 201.3MB. Free memory is still 124.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 204.19ms. Allocated memory is still 142.6MB. Free memory was 105.9MB in the beginning and 95.3MB in the end (delta: 10.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.07ms. Allocated memory is still 142.6MB. Free memory was 95.3MB in the beginning and 94.4MB in the end (delta: 968.1kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 34.89ms. Allocated memory is still 142.6MB. Free memory was 94.4MB in the beginning and 92.7MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 245.03ms. Allocated memory is still 142.6MB. Free memory was 92.7MB in the beginning and 82.4MB in the end (delta: 10.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 91451.18ms. Allocated memory was 142.6MB in the beginning and 394.3MB in the end (delta: 251.7MB). Free memory was 81.4MB in the beginning and 264.6MB in the end (delta: -183.1MB). Peak memory consumption was 67.9MB. Max. memory is 16.1GB. * Witness Printer took 73.65ms. Allocated memory is still 394.3MB. Free memory was 264.6MB in the beginning and 256.4MB in the end (delta: 8.1MB). 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: 21]: 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, 19 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 90.9s, OverallIterations: 8, TraceHistogramMax: 3, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 78 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 72 mSDsluCounter, 540 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 15 IncrementalHoareTripleChecker+Unchecked, 430 mSDsCounter, 58 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 670 IncrementalHoareTripleChecker+Invalid, 743 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 58 mSolverCounterUnsat, 110 mSDtfsCounter, 670 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 266 GetRequests, 155 SyntacticMatches, 6 SemanticMatches, 105 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 481 ImplicationChecksByTransitivity, 64.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42occurred in iteration=7, InterpolantAutomatonStates: 62, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 3 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 86.6s InterpolantComputationTime, 273 NumberOfCodeBlocks, 273 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 281 ConstructedInterpolants, 5 QuantifiedInterpolants, 3954 SizeOfPredicates, 16 NumberOfNonLiveVariables, 424 ConjunctsInSsa, 114 ConjunctsInUnsatCore, 14 InterpolantComputations, 3 PerfectInterpolantSequences, 111/155 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]: Loop Invariant Derived loop invariant: ((((((((b == 4) && (A <= 2)) && (1 <= r)) && (q == 0)) && (A == r)) && (B == 1)) || (((((b == 1) && (q == 0)) && (A == r)) && (((long long) r + A) <= ((long long) 2 + A))) && (B == 1))) || ((((((1 <= r) && (q == 0)) && (A == r)) && (((long long) r + A) <= ((long long) 2 + A))) && (2 == b)) && (B == 1))) - InvariantResult [Line: 38]: Loop Invariant Derived loop invariant: (((((((((A <= 2) && (q == 0)) && (B == b)) && (A == r)) || ((((((b == 4) && (A <= 2)) && (1 <= r)) && (q == 0)) && (A == r)) && (B == 1))) || ((((((b == 1) && ((((((unsigned long long) 4294967295 * r) + A) % 4294967296) / 2) == 1)) && (A <= 2)) && (2 == q)) && (((((unsigned long long) 4294967295 * r) + A) % 4294967296) <= A)) && (B == 1))) || ((((A <= 2) && (q == 1)) && (((long long) b + r) == A)) && (b == B))) || ((((((((((long long) b + r) % 4294967296) <= ((long long) 2 * b)) && (q == 1)) && (((long long) b + r) == A)) && ((((long long) b + r) % 4294967296) <= 2)) && (0 != (b / 2))) && (B == 1)) && (b <= (((long long) b + r) % 4294967296)))) || (((((q == 0) && (A == r)) && (2 == b)) && (B == 1)) && (r == 1))) RESULT: Ultimate proved your program to be correct! [2025-01-09 03:15:48,500 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE