./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-18.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-18.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bf5dbfe5ddcce299137d12379a3532fad5a0b1d2b0a83e3f07b3ec288904adfe --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 03:36:14,287 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 03:36:14,338 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 03:36:14,342 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 03:36:14,342 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 03:36:14,363 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 03:36:14,364 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 03:36:14,364 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 03:36:14,365 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 03:36:14,365 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 03:36:14,365 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 03:36:14,365 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 03:36:14,366 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 03:36:14,366 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 03:36:14,366 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 03:36:14,366 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 03:36:14,366 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 03:36:14,367 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 03:36:14,367 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 03:36:14,367 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 03:36:14,367 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 03:36:14,367 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 03:36:14,367 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 03:36:14,367 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 03:36:14,367 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 03:36:14,367 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 03:36:14,367 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 03:36:14,367 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 03:36:14,367 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 03:36:14,367 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 03:36:14,368 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 03:36:14,368 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 03:36:14,368 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:36:14,368 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 03:36:14,368 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 03:36:14,368 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 03:36:14,368 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 03:36:14,369 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 03:36:14,369 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 03:36:14,369 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 03:36:14,369 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 03:36:14,369 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 03:36:14,369 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 03:36:14,369 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bf5dbfe5ddcce299137d12379a3532fad5a0b1d2b0a83e3f07b3ec288904adfe [2025-03-17 03:36:14,582 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 03:36:14,589 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 03:36:14,591 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 03:36:14,592 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 03:36:14,592 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 03:36:14,593 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-18.i [2025-03-17 03:36:15,763 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b096da151/b5f4b8ef96e3480eaadae318c3d41e2d/FLAG1aee1eb9f [2025-03-17 03:36:16,006 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 03:36:16,006 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-18.i [2025-03-17 03:36:16,050 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b096da151/b5f4b8ef96e3480eaadae318c3d41e2d/FLAG1aee1eb9f [2025-03-17 03:36:16,333 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b096da151/b5f4b8ef96e3480eaadae318c3d41e2d [2025-03-17 03:36:16,337 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 03:36:16,338 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 03:36:16,339 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 03:36:16,339 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 03:36:16,342 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 03:36:16,342 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:36:16" (1/1) ... [2025-03-17 03:36:16,343 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67366e52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:36:16, skipping insertion in model container [2025-03-17 03:36:16,343 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:36:16" (1/1) ... [2025-03-17 03:36:16,356 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 03:36:16,449 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-18.i[915,928] [2025-03-17 03:36:16,491 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:36:16,501 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 03:36:16,510 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-18.i[915,928] [2025-03-17 03:36:16,528 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:36:16,544 INFO L204 MainTranslator]: Completed translation [2025-03-17 03:36:16,544 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:36:16 WrapperNode [2025-03-17 03:36:16,545 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 03:36:16,546 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 03:36:16,546 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 03:36:16,547 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 03:36:16,551 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:36:16" (1/1) ... [2025-03-17 03:36:16,556 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:36:16" (1/1) ... [2025-03-17 03:36:16,582 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 128 [2025-03-17 03:36:16,582 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 03:36:16,583 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 03:36:16,583 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 03:36:16,583 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 03:36:16,591 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:36:16" (1/1) ... [2025-03-17 03:36:16,591 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:36:16" (1/1) ... [2025-03-17 03:36:16,594 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:36:16" (1/1) ... [2025-03-17 03:36:16,612 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-17 03:36:16,613 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:36:16" (1/1) ... [2025-03-17 03:36:16,613 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:36:16" (1/1) ... [2025-03-17 03:36:16,619 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:36:16" (1/1) ... [2025-03-17 03:36:16,625 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:36:16" (1/1) ... [2025-03-17 03:36:16,626 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:36:16" (1/1) ... [2025-03-17 03:36:16,626 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:36:16" (1/1) ... [2025-03-17 03:36:16,627 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 03:36:16,628 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 03:36:16,628 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 03:36:16,628 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 03:36:16,629 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:36:16" (1/1) ... [2025-03-17 03:36:16,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:36:16,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:36:16,651 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 03:36:16,653 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 03:36:16,667 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 03:36:16,667 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 03:36:16,667 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 03:36:16,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 03:36:16,667 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 03:36:16,667 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 03:36:16,714 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 03:36:16,716 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 03:36:16,940 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L99: havoc property_#t~bitwise13#1; [2025-03-17 03:36:16,959 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-03-17 03:36:16,959 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 03:36:16,972 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 03:36:16,973 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 03:36:16,974 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:36:16 BoogieIcfgContainer [2025-03-17 03:36:16,974 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 03:36:16,975 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 03:36:16,975 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 03:36:16,979 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 03:36:16,979 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 03:36:16" (1/3) ... [2025-03-17 03:36:16,979 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7876bfd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:36:16, skipping insertion in model container [2025-03-17 03:36:16,979 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:36:16" (2/3) ... [2025-03-17 03:36:16,979 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7876bfd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:36:16, skipping insertion in model container [2025-03-17 03:36:16,979 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:36:16" (3/3) ... [2025-03-17 03:36:16,980 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-18.i [2025-03-17 03:36:16,992 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 03:36:16,994 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-while_file-18.i that has 2 procedures, 56 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 03:36:17,037 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 03:36:17,047 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;@57cfa2e7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 03:36:17,047 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 03:36:17,050 INFO L276 IsEmpty]: Start isEmpty. Operand has 56 states, 37 states have (on average 1.4324324324324325) internal successors, (53), 38 states have internal predecessors, (53), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 03:36:17,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-17 03:36:17,058 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:36:17,058 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:36:17,059 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:36:17,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:36:17,062 INFO L85 PathProgramCache]: Analyzing trace with hash -932641390, now seen corresponding path program 1 times [2025-03-17 03:36:17,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:36:17,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088653504] [2025-03-17 03:36:17,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:36:17,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:36:17,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-17 03:36:17,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-17 03:36:17,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:36:17,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:36:17,266 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2025-03-17 03:36:17,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:36:17,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088653504] [2025-03-17 03:36:17,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088653504] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 03:36:17,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [223084743] [2025-03-17 03:36:17,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:36:17,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 03:36:17,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:36:17,271 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 03:36:17,272 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 03:36:17,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-17 03:36:17,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-17 03:36:17,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:36:17,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:36:17,365 INFO L256 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 03:36:17,370 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:36:17,384 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2025-03-17 03:36:17,385 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 03:36:17,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [223084743] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:36:17,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 03:36:17,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 03:36:17,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400566477] [2025-03-17 03:36:17,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:36:17,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 03:36:17,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:36:17,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 03:36:17,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 03:36:17,403 INFO L87 Difference]: Start difference. First operand has 56 states, 37 states have (on average 1.4324324324324325) internal successors, (53), 38 states have internal predecessors, (53), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-17 03:36:17,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:36:17,423 INFO L93 Difference]: Finished difference Result 109 states and 184 transitions. [2025-03-17 03:36:17,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 03:36:17,425 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 103 [2025-03-17 03:36:17,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:36:17,429 INFO L225 Difference]: With dead ends: 109 [2025-03-17 03:36:17,429 INFO L226 Difference]: Without dead ends: 54 [2025-03-17 03:36:17,431 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 03:36:17,433 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 03:36:17,433 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 79 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 03:36:17,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-03-17 03:36:17,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2025-03-17 03:36:17,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 36 states have (on average 1.3611111111111112) internal successors, (49), 36 states have internal predecessors, (49), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 03:36:17,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 81 transitions. [2025-03-17 03:36:17,469 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 81 transitions. Word has length 103 [2025-03-17 03:36:17,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:36:17,469 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 81 transitions. [2025-03-17 03:36:17,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-17 03:36:17,470 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 81 transitions. [2025-03-17 03:36:17,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-17 03:36:17,474 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:36:17,474 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:36:17,481 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 03:36:17,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-17 03:36:17,675 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:36:17,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:36:17,676 INFO L85 PathProgramCache]: Analyzing trace with hash -1364552622, now seen corresponding path program 1 times [2025-03-17 03:36:17,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:36:17,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676636247] [2025-03-17 03:36:17,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:36:17,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:36:17,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-17 03:36:17,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-17 03:36:17,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:36:17,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:36:18,049 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 03:36:18,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:36:18,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676636247] [2025-03-17 03:36:18,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676636247] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:36:18,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:36:18,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 03:36:18,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605671552] [2025-03-17 03:36:18,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:36:18,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 03:36:18,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:36:18,053 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 03:36:18,054 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 03:36:18,054 INFO L87 Difference]: Start difference. First operand 54 states and 81 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 03:36:18,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:36:18,234 INFO L93 Difference]: Finished difference Result 161 states and 242 transitions. [2025-03-17 03:36:18,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 03:36:18,235 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 103 [2025-03-17 03:36:18,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:36:18,238 INFO L225 Difference]: With dead ends: 161 [2025-03-17 03:36:18,239 INFO L226 Difference]: Without dead ends: 108 [2025-03-17 03:36:18,240 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 03:36:18,240 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 59 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 03:36:18,241 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 193 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 03:36:18,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-03-17 03:36:18,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 99. [2025-03-17 03:36:18,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 64 states have (on average 1.3125) internal successors, (84), 64 states have internal predecessors, (84), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-17 03:36:18,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 148 transitions. [2025-03-17 03:36:18,261 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 148 transitions. Word has length 103 [2025-03-17 03:36:18,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:36:18,261 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 148 transitions. [2025-03-17 03:36:18,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 03:36:18,262 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 148 transitions. [2025-03-17 03:36:18,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-17 03:36:18,265 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:36:18,265 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:36:18,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 03:36:18,266 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:36:18,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:36:18,266 INFO L85 PathProgramCache]: Analyzing trace with hash -609263976, now seen corresponding path program 1 times [2025-03-17 03:36:18,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:36:18,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393319804] [2025-03-17 03:36:18,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:36:18,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:36:18,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-17 03:36:18,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-17 03:36:18,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:36:18,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:36:18,492 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 03:36:18,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:36:18,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393319804] [2025-03-17 03:36:18,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393319804] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:36:18,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:36:18,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 03:36:18,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603081498] [2025-03-17 03:36:18,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:36:18,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 03:36:18,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:36:18,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 03:36:18,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 03:36:18,493 INFO L87 Difference]: Start difference. First operand 99 states and 148 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 03:36:18,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:36:18,559 INFO L93 Difference]: Finished difference Result 183 states and 272 transitions. [2025-03-17 03:36:18,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 03:36:18,560 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 107 [2025-03-17 03:36:18,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:36:18,562 INFO L225 Difference]: With dead ends: 183 [2025-03-17 03:36:18,562 INFO L226 Difference]: Without dead ends: 121 [2025-03-17 03:36:18,564 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 03:36:18,565 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 30 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 03:36:18,565 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 161 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 03:36:18,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2025-03-17 03:36:18,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 97. [2025-03-17 03:36:18,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 62 states have (on average 1.2741935483870968) internal successors, (79), 62 states have internal predecessors, (79), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-17 03:36:18,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 143 transitions. [2025-03-17 03:36:18,584 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 143 transitions. Word has length 107 [2025-03-17 03:36:18,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:36:18,585 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 143 transitions. [2025-03-17 03:36:18,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 03:36:18,585 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 143 transitions. [2025-03-17 03:36:18,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-17 03:36:18,586 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:36:18,586 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:36:18,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 03:36:18,586 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:36:18,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:36:18,590 INFO L85 PathProgramCache]: Analyzing trace with hash -2116727638, now seen corresponding path program 1 times [2025-03-17 03:36:18,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:36:18,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206821767] [2025-03-17 03:36:18,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:36:18,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:36:18,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-17 03:36:18,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-17 03:36:18,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:36:18,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:36:19,087 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 03:36:19,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:36:19,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206821767] [2025-03-17 03:36:19,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206821767] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:36:19,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:36:19,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 03:36:19,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986894951] [2025-03-17 03:36:19,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:36:19,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 03:36:19,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:36:19,089 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 03:36:19,089 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 03:36:19,089 INFO L87 Difference]: Start difference. First operand 97 states and 143 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 03:36:19,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:36:19,267 INFO L93 Difference]: Finished difference Result 187 states and 272 transitions. [2025-03-17 03:36:19,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 03:36:19,267 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 108 [2025-03-17 03:36:19,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:36:19,269 INFO L225 Difference]: With dead ends: 187 [2025-03-17 03:36:19,269 INFO L226 Difference]: Without dead ends: 121 [2025-03-17 03:36:19,270 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-17 03:36:19,270 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 55 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 03:36:19,270 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 246 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 03:36:19,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2025-03-17 03:36:19,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 113. [2025-03-17 03:36:19,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 78 states have (on average 1.294871794871795) internal successors, (101), 78 states have internal predecessors, (101), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-17 03:36:19,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 165 transitions. [2025-03-17 03:36:19,296 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 165 transitions. Word has length 108 [2025-03-17 03:36:19,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:36:19,297 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 165 transitions. [2025-03-17 03:36:19,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 03:36:19,297 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 165 transitions. [2025-03-17 03:36:19,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-17 03:36:19,298 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:36:19,298 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:36:19,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 03:36:19,298 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:36:19,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:36:19,298 INFO L85 PathProgramCache]: Analyzing trace with hash 627696557, now seen corresponding path program 1 times [2025-03-17 03:36:19,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:36:19,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96580446] [2025-03-17 03:36:19,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:36:19,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:36:19,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-17 03:36:19,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-17 03:36:19,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:36:19,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 03:36:19,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1068221171] [2025-03-17 03:36:19,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:36:19,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 03:36:19,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:36:19,386 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 03:36:19,388 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 03:36:19,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-17 03:36:19,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-17 03:36:19,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:36:19,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 03:36:19,458 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 03:36:19,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-17 03:36:19,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-17 03:36:19,486 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:36:19,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 03:36:19,529 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 03:36:19,529 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 03:36:19,530 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 03:36:19,538 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 03:36:19,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 03:36:19,734 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-03-17 03:36:19,790 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 03:36:19,794 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 03:36:19 BoogieIcfgContainer [2025-03-17 03:36:19,796 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 03:36:19,796 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 03:36:19,796 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 03:36:19,797 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 03:36:19,797 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:36:16" (3/4) ... [2025-03-17 03:36:19,800 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 03:36:19,801 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 03:36:19,801 INFO L158 Benchmark]: Toolchain (without parser) took 3463.87ms. Allocated memory is still 167.8MB. Free memory was 122.7MB in the beginning and 104.7MB in the end (delta: 18.0MB). Peak memory consumption was 15.1MB. Max. memory is 16.1GB. [2025-03-17 03:36:19,802 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 116.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 03:36:19,802 INFO L158 Benchmark]: CACSL2BoogieTranslator took 206.93ms. Allocated memory is still 167.8MB. Free memory was 122.7MB in the beginning and 110.7MB in the end (delta: 12.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 03:36:19,802 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.23ms. Allocated memory is still 167.8MB. Free memory was 110.7MB in the beginning and 108.9MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 03:36:19,802 INFO L158 Benchmark]: Boogie Preprocessor took 44.61ms. Allocated memory is still 167.8MB. Free memory was 108.9MB in the beginning and 106.6MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 03:36:19,802 INFO L158 Benchmark]: IcfgBuilder took 345.86ms. Allocated memory is still 167.8MB. Free memory was 106.6MB in the beginning and 87.7MB in the end (delta: 18.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 03:36:19,803 INFO L158 Benchmark]: TraceAbstraction took 2820.39ms. Allocated memory is still 167.8MB. Free memory was 87.0MB in the beginning and 104.7MB in the end (delta: -17.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 03:36:19,804 INFO L158 Benchmark]: Witness Printer took 4.57ms. Allocated memory is still 167.8MB. Free memory was 104.7MB in the beginning and 104.7MB in the end (delta: 33.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 03:36:19,805 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.19ms. Allocated memory is still 201.3MB. Free memory is still 116.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 206.93ms. Allocated memory is still 167.8MB. Free memory was 122.7MB in the beginning and 110.7MB in the end (delta: 12.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.23ms. Allocated memory is still 167.8MB. Free memory was 110.7MB in the beginning and 108.9MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.61ms. Allocated memory is still 167.8MB. Free memory was 108.9MB in the beginning and 106.6MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 345.86ms. Allocated memory is still 167.8MB. Free memory was 106.6MB in the beginning and 87.7MB in the end (delta: 18.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2820.39ms. Allocated memory is still 167.8MB. Free memory was 87.0MB in the beginning and 104.7MB in the end (delta: -17.8MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 4.57ms. Allocated memory is still 167.8MB. Free memory was 104.7MB in the beginning and 104.7MB in the end (delta: 33.1kB). There was no memory consumed. 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 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 79, overapproximation of someBinaryFLOATComparisonOperation at line 99, overapproximation of someBinaryFLOATComparisonOperation at line 58, overapproximation of bitwiseOr at line 99, overapproximation of bitwiseOr at line 39. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] float var_1_1 = 99.25; [L23] signed short int var_1_6 = 32; [L24] signed short int var_1_7 = 18477; [L25] signed short int var_1_8 = 5; [L26] float var_1_9 = 100.8; [L27] unsigned long int var_1_10 = 256; [L28] unsigned char var_1_11 = 0; [L29] unsigned char var_1_12 = 10; [L30] unsigned long int var_1_13 = 1879106797; [L31] unsigned long int var_1_14 = 1581421231; [L32] signed long int var_1_15 = -32; [L33] unsigned long int last_1_var_1_10 = 256; [L34] signed long int last_1_var_1_15 = -32; [L103] isInitial = 1 [L104] FCALL initially() [L105] COND TRUE 1 [L106] CALL updateLastVariables() [L95] last_1_var_1_10 = var_1_10 [L96] last_1_var_1_15 = var_1_15 [L106] RET updateLastVariables() [L107] CALL updateVariables() [L69] var_1_6 = __VERIFIER_nondet_short() [L70] CALL assume_abort_if_not(var_1_6 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=0, var_1_7=18477, var_1_8=5, var_1_9=504/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=0, var_1_7=18477, var_1_8=5, var_1_9=504/5] [L70] RET assume_abort_if_not(var_1_6 >= -1) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=0, var_1_7=18477, var_1_8=5, var_1_9=504/5] [L71] CALL assume_abort_if_not(var_1_6 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=0, var_1_7=18477, var_1_8=5, var_1_9=504/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=0, var_1_7=18477, var_1_8=5, var_1_9=504/5] [L71] RET assume_abort_if_not(var_1_6 <= 32767) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=0, var_1_7=18477, var_1_8=5, var_1_9=504/5] [L72] var_1_7 = __VERIFIER_nondet_short() [L73] CALL assume_abort_if_not(var_1_7 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=0, var_1_7=16383, var_1_8=5, var_1_9=504/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=0, var_1_7=16383, var_1_8=5, var_1_9=504/5] [L73] RET assume_abort_if_not(var_1_7 >= 16383) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=0, var_1_7=16383, var_1_8=5, var_1_9=504/5] [L74] CALL assume_abort_if_not(var_1_7 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=0, var_1_7=16383, var_1_8=5, var_1_9=504/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=0, var_1_7=16383, var_1_8=5, var_1_9=504/5] [L74] RET assume_abort_if_not(var_1_7 <= 32767) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=0, var_1_7=16383, var_1_8=5, var_1_9=504/5] [L75] var_1_8 = __VERIFIER_nondet_short() [L76] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=0, var_1_7=16383, var_1_8=0, var_1_9=504/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=0, var_1_7=16383, var_1_8=0, var_1_9=504/5] [L76] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=0, var_1_7=16383, var_1_8=0, var_1_9=504/5] [L77] CALL assume_abort_if_not(var_1_8 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=0, var_1_7=16383, var_1_8=0, var_1_9=504/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=0, var_1_7=16383, var_1_8=0, var_1_9=504/5] [L77] RET assume_abort_if_not(var_1_8 <= 16383) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=0, var_1_7=16383, var_1_8=0, var_1_9=504/5] [L78] var_1_9 = __VERIFIER_nondet_float() [L79] CALL assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=0, var_1_7=16383, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=0, var_1_7=16383, var_1_8=0] [L79] RET assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=0, var_1_7=16383, var_1_8=0] [L80] var_1_11 = __VERIFIER_nondet_uchar() [L81] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=0, var_1_7=16383, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=0, var_1_7=16383, var_1_8=0] [L81] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=0, var_1_7=16383, var_1_8=0] [L82] CALL assume_abort_if_not(var_1_11 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=0, var_1_7=16383, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=0, var_1_7=16383, var_1_8=0] [L82] RET assume_abort_if_not(var_1_11 <= 1) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=0, var_1_7=16383, var_1_8=0] [L83] var_1_12 = __VERIFIER_nondet_uchar() [L84] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=0, var_1_7=16383, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=0, var_1_7=16383, var_1_8=0] [L84] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=0, var_1_7=16383, var_1_8=0] [L85] CALL assume_abort_if_not(var_1_12 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=0, var_1_7=16383, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=0, var_1_7=16383, var_1_8=0] [L85] RET assume_abort_if_not(var_1_12 <= 255) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=0, var_1_7=16383, var_1_8=0] [L86] CALL assume_abort_if_not(var_1_12 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=129, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=0, var_1_7=16383, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=129, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=0, var_1_7=16383, var_1_8=0] [L86] RET assume_abort_if_not(var_1_12 != 0) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=129, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=0, var_1_7=16383, var_1_8=0] [L87] var_1_13 = __VERIFIER_nondet_ulong() [L88] CALL assume_abort_if_not(var_1_13 >= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=129, var_1_13=1073741823, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=0, var_1_7=16383, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=129, var_1_13=1073741823, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=0, var_1_7=16383, var_1_8=0] [L88] RET assume_abort_if_not(var_1_13 >= 1073741823) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=129, var_1_13=1073741823, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=0, var_1_7=16383, var_1_8=0] [L89] CALL assume_abort_if_not(var_1_13 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=129, var_1_13=1073741823, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=0, var_1_7=16383, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=129, var_1_13=1073741823, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=0, var_1_7=16383, var_1_8=0] [L89] RET assume_abort_if_not(var_1_13 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=129, var_1_13=1073741823, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=0, var_1_7=16383, var_1_8=0] [L90] var_1_14 = __VERIFIER_nondet_ulong() [L91] CALL assume_abort_if_not(var_1_14 >= 1073741824) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=129, var_1_13=1073741823, var_1_14=1073741824, var_1_15=-32, var_1_1=397/4, var_1_6=0, var_1_7=16383, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=129, var_1_13=1073741823, var_1_14=1073741824, var_1_15=-32, var_1_1=397/4, var_1_6=0, var_1_7=16383, var_1_8=0] [L91] RET assume_abort_if_not(var_1_14 >= 1073741824) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=129, var_1_13=1073741823, var_1_14=1073741824, var_1_15=-32, var_1_1=397/4, var_1_6=0, var_1_7=16383, var_1_8=0] [L92] CALL assume_abort_if_not(var_1_14 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=129, var_1_13=1073741823, var_1_14=1073741824, var_1_15=-32, var_1_1=397/4, var_1_6=0, var_1_7=16383, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=129, var_1_13=1073741823, var_1_14=1073741824, var_1_15=-32, var_1_1=397/4, var_1_6=0, var_1_7=16383, var_1_8=0] [L92] RET assume_abort_if_not(var_1_14 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=129, var_1_13=1073741823, var_1_14=1073741824, var_1_15=-32, var_1_1=397/4, var_1_6=0, var_1_7=16383, var_1_8=0] [L107] RET updateVariables() [L108] CALL step() [L38] unsigned long int stepLocal_1 = last_1_var_1_10; VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, stepLocal_1=256, var_1_10=256, var_1_11=0, var_1_12=129, var_1_13=1073741823, var_1_14=1073741824, var_1_15=-32, var_1_1=397/4, var_1_6=0, var_1_7=16383, var_1_8=0] [L39] EXPR last_1_var_1_10 ^ ((((last_1_var_1_15) > (last_1_var_1_10)) ? (last_1_var_1_15) : (last_1_var_1_10))) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, stepLocal_1=256, var_1_10=256, var_1_11=0, var_1_12=129, var_1_13=1073741823, var_1_14=1073741824, var_1_15=-32, var_1_1=397/4, var_1_6=0, var_1_7=16383, var_1_8=0] [L39] unsigned long int stepLocal_0 = last_1_var_1_10 ^ ((((last_1_var_1_15) > (last_1_var_1_10)) ? (last_1_var_1_15) : (last_1_var_1_10))); [L40] COND FALSE !(stepLocal_0 != last_1_var_1_10) [L45] var_1_1 = var_1_9 VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, stepLocal_1=256, var_1_10=256, var_1_11=0, var_1_12=129, var_1_13=1073741823, var_1_14=1073741824, var_1_15=-32, var_1_1=2, var_1_6=0, var_1_7=16383, var_1_8=0, var_1_9=2] [L47] signed short int stepLocal_2 = var_1_6; VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, stepLocal_1=256, stepLocal_2=0, var_1_10=256, var_1_11=0, var_1_12=129, var_1_13=1073741823, var_1_14=1073741824, var_1_15=-32, var_1_1=2, var_1_6=0, var_1_7=16383, var_1_8=0, var_1_9=2] [L48] COND FALSE !(\read(var_1_11)) [L55] var_1_10 = var_1_7 VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, stepLocal_1=256, stepLocal_2=0, var_1_10=16383, var_1_11=0, var_1_12=129, var_1_13=1073741823, var_1_14=1073741824, var_1_15=-32, var_1_1=2, var_1_6=0, var_1_7=16383, var_1_8=0, var_1_9=2] [L57] unsigned long int stepLocal_3 = var_1_10; VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, stepLocal_1=256, stepLocal_2=0, stepLocal_3=16383, var_1_10=16383, var_1_11=0, var_1_12=129, var_1_13=1073741823, var_1_14=1073741824, var_1_15=-32, var_1_1=2, var_1_6=0, var_1_7=16383, var_1_8=0, var_1_9=2] [L58] COND FALSE !(var_1_1 <= var_1_9) [L65] var_1_15 = var_1_7 VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, stepLocal_1=256, stepLocal_2=0, stepLocal_3=16383, var_1_10=16383, var_1_11=0, var_1_12=129, var_1_13=1073741823, var_1_14=1073741824, var_1_15=16383, var_1_1=2, var_1_6=0, var_1_7=16383, var_1_8=0, var_1_9=2] [L108] RET step() [L109] CALL, EXPR property() [L99] EXPR last_1_var_1_10 ^ ((((last_1_var_1_15) > (last_1_var_1_10)) ? (last_1_var_1_15) : (last_1_var_1_10))) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=16383, var_1_11=0, var_1_12=129, var_1_13=1073741823, var_1_14=1073741824, var_1_15=16383, var_1_1=2, var_1_6=0, var_1_7=16383, var_1_8=0, var_1_9=2] [L99-L100] return ((((last_1_var_1_10 ^ ((((last_1_var_1_15) > (last_1_var_1_10)) ? (last_1_var_1_15) : (last_1_var_1_10)))) != last_1_var_1_10) ? ((last_1_var_1_10 == (var_1_6 - (var_1_7 - var_1_8))) ? (var_1_1 == ((float) var_1_9)) : 1) : (var_1_1 == ((float) var_1_9))) && (var_1_11 ? (((var_1_7 % var_1_12) >= var_1_6) ? (var_1_10 == ((unsigned long int) ((var_1_13 + var_1_14) - var_1_7))) : (var_1_10 == ((unsigned long int) var_1_12))) : (var_1_10 == ((unsigned long int) var_1_7)))) && ((var_1_1 <= var_1_9) ? ((var_1_10 > (last_1_var_1_15 + (var_1_10 + var_1_7))) ? (var_1_15 == ((signed long int) var_1_7)) : (var_1_15 == ((signed long int) -5))) : (var_1_15 == ((signed long int) var_1_7))) ; [L109] RET, EXPR property() [L109] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=16383, var_1_11=0, var_1_12=129, var_1_13=1073741823, var_1_14=1073741824, var_1_15=16383, var_1_1=2, var_1_6=0, var_1_7=16383, var_1_8=0, var_1_9=2] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=16383, var_1_11=0, var_1_12=129, var_1_13=1073741823, var_1_14=1073741824, var_1_15=16383, var_1_1=2, var_1_6=0, var_1_7=16383, var_1_8=0, var_1_9=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 56 locations, 101 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.7s, OverallIterations: 5, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 144 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 144 mSDsluCounter, 679 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 404 mSDsCounter, 107 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 168 IncrementalHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 107 mSolverCounterUnsat, 275 mSDtfsCounter, 168 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 126 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=113occurred in iteration=4, InterpolantAutomatonStates: 15, 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, 4 MinimizatonAttempts, 41 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 742 NumberOfCodeBlocks, 742 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 519 ConstructedInterpolants, 0 QuantifiedInterpolants, 1214 SizeOfPredicates, 0 NumberOfNonLiveVariables, 249 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 5 InterpolantComputations, 4 PerfectInterpolantSequences, 2370/2400 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-17 03:36:19,823 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-18.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bf5dbfe5ddcce299137d12379a3532fad5a0b1d2b0a83e3f07b3ec288904adfe --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 03:36:21,717 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 03:36:21,801 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-17 03:36:21,814 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 03:36:21,814 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 03:36:21,834 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 03:36:21,836 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 03:36:21,837 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 03:36:21,837 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 03:36:21,837 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 03:36:21,838 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 03:36:21,838 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 03:36:21,838 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 03:36:21,839 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 03:36:21,839 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 03:36:21,839 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 03:36:21,839 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 03:36:21,839 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 03:36:21,839 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 03:36:21,839 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 03:36:21,839 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 03:36:21,839 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 03:36:21,839 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 03:36:21,839 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 03:36:21,840 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 03:36:21,840 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 03:36:21,840 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 03:36:21,840 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 03:36:21,840 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 03:36:21,840 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 03:36:21,840 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 03:36:21,840 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 03:36:21,840 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 03:36:21,841 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 03:36:21,841 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:36:21,841 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 03:36:21,841 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 03:36:21,841 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 03:36:21,841 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 03:36:21,842 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 03:36:21,842 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 03:36:21,842 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 03:36:21,842 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 03:36:21,842 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 03:36:21,842 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 03:36:21,842 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bf5dbfe5ddcce299137d12379a3532fad5a0b1d2b0a83e3f07b3ec288904adfe [2025-03-17 03:36:22,183 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 03:36:22,194 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 03:36:22,196 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 03:36:22,199 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 03:36:22,199 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 03:36:22,201 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-18.i [2025-03-17 03:36:23,360 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/adf8f0411/7e708dec26014a41806a4e2692020f95/FLAGa1dff8486 [2025-03-17 03:36:23,580 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 03:36:23,580 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-18.i [2025-03-17 03:36:23,589 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/adf8f0411/7e708dec26014a41806a4e2692020f95/FLAGa1dff8486 [2025-03-17 03:36:23,919 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/adf8f0411/7e708dec26014a41806a4e2692020f95 [2025-03-17 03:36:23,920 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 03:36:23,921 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 03:36:23,922 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 03:36:23,922 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 03:36:23,925 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 03:36:23,926 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:36:23" (1/1) ... [2025-03-17 03:36:23,926 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@130b8479 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:36:23, skipping insertion in model container [2025-03-17 03:36:23,927 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:36:23" (1/1) ... [2025-03-17 03:36:23,937 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 03:36:24,034 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-18.i[915,928] [2025-03-17 03:36:24,066 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:36:24,075 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 03:36:24,082 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-18.i[915,928] [2025-03-17 03:36:24,093 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:36:24,111 INFO L204 MainTranslator]: Completed translation [2025-03-17 03:36:24,112 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:36:24 WrapperNode [2025-03-17 03:36:24,112 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 03:36:24,112 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 03:36:24,113 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 03:36:24,113 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 03:36:24,118 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:36:24" (1/1) ... [2025-03-17 03:36:24,127 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:36:24" (1/1) ... [2025-03-17 03:36:24,147 INFO L138 Inliner]: procedures = 27, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 104 [2025-03-17 03:36:24,147 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 03:36:24,148 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 03:36:24,148 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 03:36:24,148 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 03:36:24,154 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:36:24" (1/1) ... [2025-03-17 03:36:24,155 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:36:24" (1/1) ... [2025-03-17 03:36:24,157 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:36:24" (1/1) ... [2025-03-17 03:36:24,164 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-17 03:36:24,165 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:36:24" (1/1) ... [2025-03-17 03:36:24,165 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:36:24" (1/1) ... [2025-03-17 03:36:24,170 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:36:24" (1/1) ... [2025-03-17 03:36:24,170 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:36:24" (1/1) ... [2025-03-17 03:36:24,172 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:36:24" (1/1) ... [2025-03-17 03:36:24,173 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:36:24" (1/1) ... [2025-03-17 03:36:24,174 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 03:36:24,176 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 03:36:24,176 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 03:36:24,176 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 03:36:24,180 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:36:24" (1/1) ... [2025-03-17 03:36:24,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:36:24,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:36:24,203 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 03:36:24,210 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 03:36:24,225 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 03:36:24,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 03:36:24,225 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 03:36:24,225 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 03:36:24,225 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 03:36:24,225 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 03:36:24,273 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 03:36:24,275 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 03:36:24,513 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-03-17 03:36:24,513 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 03:36:24,520 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 03:36:24,522 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 03:36:24,523 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:36:24 BoogieIcfgContainer [2025-03-17 03:36:24,523 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 03:36:24,524 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 03:36:24,524 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 03:36:24,529 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 03:36:24,530 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 03:36:23" (1/3) ... [2025-03-17 03:36:24,530 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@673352ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:36:24, skipping insertion in model container [2025-03-17 03:36:24,531 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:36:24" (2/3) ... [2025-03-17 03:36:24,531 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@673352ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:36:24, skipping insertion in model container [2025-03-17 03:36:24,531 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:36:24" (3/3) ... [2025-03-17 03:36:24,532 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-18.i [2025-03-17 03:36:24,542 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 03:36:24,543 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-while_file-18.i that has 2 procedures, 45 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 03:36:24,579 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 03:36:24,588 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;@740b5831, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 03:36:24,588 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 03:36:24,591 INFO L276 IsEmpty]: Start isEmpty. Operand has 45 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 27 states have internal predecessors, (36), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 03:36:24,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-17 03:36:24,598 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:36:24,599 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:36:24,600 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:36:24,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:36:24,604 INFO L85 PathProgramCache]: Analyzing trace with hash -832765068, now seen corresponding path program 1 times [2025-03-17 03:36:24,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 03:36:24,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [953532256] [2025-03-17 03:36:24,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:36:24,616 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 03:36:24,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 03:36:24,620 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 03:36:24,622 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-17 03:36:24,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-17 03:36:24,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-17 03:36:24,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:36:24,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:36:24,790 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 03:36:24,798 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:36:24,834 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2025-03-17 03:36:24,834 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 03:36:24,834 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 03:36:24,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [953532256] [2025-03-17 03:36:24,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [953532256] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:36:24,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:36:24,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 03:36:24,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71243063] [2025-03-17 03:36:24,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:36:24,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 03:36:24,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 03:36:24,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 03:36:24,853 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 03:36:24,855 INFO L87 Difference]: Start difference. First operand has 45 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 27 states have internal predecessors, (36), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 1 states have call successors, (16), 1 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 03:36:24,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:36:24,869 INFO L93 Difference]: Finished difference Result 87 states and 150 transitions. [2025-03-17 03:36:24,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 03:36:24,870 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 1 states have call successors, (16), 1 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 1 states have call successors, (16) Word has length 98 [2025-03-17 03:36:24,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:36:24,874 INFO L225 Difference]: With dead ends: 87 [2025-03-17 03:36:24,874 INFO L226 Difference]: Without dead ends: 43 [2025-03-17 03:36:24,876 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 03:36:24,880 INFO L435 NwaCegarLoop]: 64 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, 64 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 03:36:24,881 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 03:36:24,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-03-17 03:36:24,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2025-03-17 03:36:24,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 25 states have (on average 1.28) internal successors, (32), 25 states have internal predecessors, (32), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 03:36:24,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 64 transitions. [2025-03-17 03:36:24,913 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 64 transitions. Word has length 98 [2025-03-17 03:36:24,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:36:24,913 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 64 transitions. [2025-03-17 03:36:24,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 1 states have call successors, (16), 1 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 03:36:24,914 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 64 transitions. [2025-03-17 03:36:24,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-17 03:36:24,918 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:36:24,918 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:36:24,925 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2025-03-17 03:36:25,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 03:36:25,119 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:36:25,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:36:25,120 INFO L85 PathProgramCache]: Analyzing trace with hash -678609740, now seen corresponding path program 1 times [2025-03-17 03:36:25,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 03:36:25,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [116739411] [2025-03-17 03:36:25,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:36:25,120 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 03:36:25,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 03:36:25,122 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 03:36:25,123 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-17 03:36:25,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-17 03:36:25,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-17 03:36:25,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:36:25,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:36:25,241 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 03:36:25,246 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:36:25,884 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 03:36:25,884 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 03:36:25,884 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 03:36:25,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [116739411] [2025-03-17 03:36:25,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [116739411] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:36:25,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:36:25,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 03:36:25,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863180535] [2025-03-17 03:36:25,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:36:25,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 03:36:25,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 03:36:25,886 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 03:36:25,886 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 03:36:25,886 INFO L87 Difference]: Start difference. First operand 43 states and 64 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 03:36:26,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:36:26,136 INFO L93 Difference]: Finished difference Result 128 states and 191 transitions. [2025-03-17 03:36:26,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 03:36:26,138 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 98 [2025-03-17 03:36:26,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:36:26,139 INFO L225 Difference]: With dead ends: 128 [2025-03-17 03:36:26,140 INFO L226 Difference]: Without dead ends: 86 [2025-03-17 03:36:26,140 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-17 03:36:26,140 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 36 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 03:36:26,141 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 192 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 03:36:26,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-03-17 03:36:26,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 73. [2025-03-17 03:36:26,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 38 states have internal predecessors, (45), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-17 03:36:26,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 109 transitions. [2025-03-17 03:36:26,160 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 109 transitions. Word has length 98 [2025-03-17 03:36:26,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:36:26,161 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 109 transitions. [2025-03-17 03:36:26,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 03:36:26,161 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 109 transitions. [2025-03-17 03:36:26,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-17 03:36:26,162 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:36:26,162 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:36:26,168 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-17 03:36:26,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 03:36:26,363 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:36:26,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:36:26,364 INFO L85 PathProgramCache]: Analyzing trace with hash -2058843698, now seen corresponding path program 1 times [2025-03-17 03:36:26,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 03:36:26,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [489371566] [2025-03-17 03:36:26,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:36:26,364 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 03:36:26,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 03:36:26,366 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 03:36:26,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-17 03:36:26,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-17 03:36:26,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-17 03:36:26,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:36:26,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:36:26,487 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 03:36:26,490 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:36:27,299 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 18 proven. 252 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2025-03-17 03:36:27,300 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 03:36:27,543 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 18 proven. 27 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-03-17 03:36:27,544 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 03:36:27,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [489371566] [2025-03-17 03:36:27,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [489371566] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 03:36:27,544 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 03:36:27,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2025-03-17 03:36:27,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733379960] [2025-03-17 03:36:27,544 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 03:36:27,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 03:36:27,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 03:36:27,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 03:36:27,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2025-03-17 03:36:27,546 INFO L87 Difference]: Start difference. First operand 73 states and 109 transitions. Second operand has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 4 states have call successors, (32), 3 states have call predecessors, (32), 5 states have return successors, (32), 4 states have call predecessors, (32), 4 states have call successors, (32) [2025-03-17 03:36:28,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:36:28,315 INFO L93 Difference]: Finished difference Result 181 states and 249 transitions. [2025-03-17 03:36:28,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-17 03:36:28,316 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 4 states have call successors, (32), 3 states have call predecessors, (32), 5 states have return successors, (32), 4 states have call predecessors, (32), 4 states have call successors, (32) Word has length 99 [2025-03-17 03:36:28,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:36:28,317 INFO L225 Difference]: With dead ends: 181 [2025-03-17 03:36:28,317 INFO L226 Difference]: Without dead ends: 139 [2025-03-17 03:36:28,318 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=188, Invalid=318, Unknown=0, NotChecked=0, Total=506 [2025-03-17 03:36:28,319 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 116 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 03:36:28,319 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 169 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 03:36:28,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2025-03-17 03:36:28,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 106. [2025-03-17 03:36:28,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 61 states have (on average 1.1639344262295082) internal successors, (71), 62 states have internal predecessors, (71), 38 states have call successors, (38), 6 states have call predecessors, (38), 6 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-17 03:36:28,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 147 transitions. [2025-03-17 03:36:28,334 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 147 transitions. Word has length 99 [2025-03-17 03:36:28,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:36:28,334 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 147 transitions. [2025-03-17 03:36:28,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 4 states have call successors, (32), 3 states have call predecessors, (32), 5 states have return successors, (32), 4 states have call predecessors, (32), 4 states have call successors, (32) [2025-03-17 03:36:28,335 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 147 transitions. [2025-03-17 03:36:28,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-17 03:36:28,336 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:36:28,336 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:36:28,342 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-03-17 03:36:28,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 03:36:28,540 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:36:28,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:36:28,541 INFO L85 PathProgramCache]: Analyzing trace with hash -316033363, now seen corresponding path program 1 times [2025-03-17 03:36:28,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 03:36:28,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2096292180] [2025-03-17 03:36:28,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:36:28,541 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 03:36:28,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 03:36:28,544 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 03:36:28,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-03-17 03:36:28,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-17 03:36:28,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-17 03:36:28,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:36:28,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:36:28,639 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-17 03:36:28,643 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:36:34,956 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 03:36:34,956 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 03:36:34,956 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 03:36:34,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2096292180] [2025-03-17 03:36:34,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2096292180] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:36:34,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:36:34,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 03:36:34,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431185965] [2025-03-17 03:36:34,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:36:34,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 03:36:34,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 03:36:34,957 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 03:36:34,958 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-17 03:36:34,958 INFO L87 Difference]: Start difference. First operand 106 states and 147 transitions. Second operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 03:36:35,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:36:35,498 INFO L93 Difference]: Finished difference Result 150 states and 202 transitions. [2025-03-17 03:36:35,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 03:36:35,501 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 99 [2025-03-17 03:36:35,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:36:35,504 INFO L225 Difference]: With dead ends: 150 [2025-03-17 03:36:35,504 INFO L226 Difference]: Without dead ends: 148 [2025-03-17 03:36:35,504 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2025-03-17 03:36:35,505 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 59 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 03:36:35,505 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 285 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 03:36:35,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2025-03-17 03:36:35,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 113. [2025-03-17 03:36:35,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 68 states have (on average 1.1911764705882353) internal successors, (81), 69 states have internal predecessors, (81), 38 states have call successors, (38), 6 states have call predecessors, (38), 6 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-17 03:36:35,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 157 transitions. [2025-03-17 03:36:35,523 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 157 transitions. Word has length 99 [2025-03-17 03:36:35,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:36:35,524 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 157 transitions. [2025-03-17 03:36:35,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 03:36:35,524 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 157 transitions. [2025-03-17 03:36:35,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-17 03:36:35,525 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:36:35,525 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:36:35,533 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2025-03-17 03:36:35,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 03:36:35,725 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:36:35,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:36:35,726 INFO L85 PathProgramCache]: Analyzing trace with hash 601310070, now seen corresponding path program 1 times [2025-03-17 03:36:35,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 03:36:35,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1645075816] [2025-03-17 03:36:35,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:36:35,726 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 03:36:35,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 03:36:35,728 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 03:36:35,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2025-03-17 03:36:35,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-17 03:36:35,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-17 03:36:35,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:36:35,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:36:35,812 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 03:36:35,814 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:36:36,121 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 123 proven. 39 refuted. 0 times theorem prover too weak. 318 trivial. 0 not checked. [2025-03-17 03:36:36,121 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 03:36:36,329 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 03:36:36,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1645075816] [2025-03-17 03:36:36,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1645075816] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 03:36:36,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1001835702] [2025-03-17 03:36:36,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:36:36,329 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-17 03:36:36,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-17 03:36:36,331 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-17 03:36:36,333 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2025-03-17 03:36:36,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-17 03:36:36,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-17 03:36:36,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:36:36,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:36:36,703 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-17 03:36:36,705 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:36:36,969 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 123 proven. 39 refuted. 0 times theorem prover too weak. 318 trivial. 0 not checked. [2025-03-17 03:36:36,969 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 03:36:37,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1001835702] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 03:36:37,092 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 03:36:37,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2025-03-17 03:36:37,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420017702] [2025-03-17 03:36:37,092 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 03:36:37,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 03:36:37,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 03:36:37,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 03:36:37,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2025-03-17 03:36:37,093 INFO L87 Difference]: Start difference. First operand 113 states and 157 transitions. Second operand has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 8 states have internal predecessors, (29), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-17 03:36:37,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:36:37,451 INFO L93 Difference]: Finished difference Result 218 states and 296 transitions. [2025-03-17 03:36:37,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 03:36:37,453 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 8 states have internal predecessors, (29), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 100 [2025-03-17 03:36:37,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:36:37,454 INFO L225 Difference]: With dead ends: 218 [2025-03-17 03:36:37,454 INFO L226 Difference]: Without dead ends: 151 [2025-03-17 03:36:37,455 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 373 GetRequests, 353 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=132, Invalid=330, Unknown=0, NotChecked=0, Total=462 [2025-03-17 03:36:37,456 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 73 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 03:36:37,456 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 204 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 03:36:37,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2025-03-17 03:36:37,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 122. [2025-03-17 03:36:37,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 76 states have (on average 1.1842105263157894) internal successors, (90), 77 states have internal predecessors, (90), 38 states have call successors, (38), 7 states have call predecessors, (38), 7 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-17 03:36:37,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 166 transitions. [2025-03-17 03:36:37,476 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 166 transitions. Word has length 100 [2025-03-17 03:36:37,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:36:37,477 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 166 transitions. [2025-03-17 03:36:37,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 8 states have internal predecessors, (29), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-17 03:36:37,477 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 166 transitions. [2025-03-17 03:36:37,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-17 03:36:37,477 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:36:37,477 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:36:37,485 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Ended with exit code 0 [2025-03-17 03:36:37,683 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2025-03-17 03:36:37,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 03:36:37,878 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:36:37,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:36:37,879 INFO L85 PathProgramCache]: Analyzing trace with hash 601339861, now seen corresponding path program 1 times [2025-03-17 03:36:37,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 03:36:37,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [399161783] [2025-03-17 03:36:37,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:36:37,879 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 03:36:37,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 03:36:37,886 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 03:36:37,887 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2025-03-17 03:36:37,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-17 03:36:37,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-17 03:36:37,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:36:37,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:36:37,973 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-17 03:36:37,976 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:36:43,414 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 123 proven. 39 refuted. 0 times theorem prover too weak. 318 trivial. 0 not checked. [2025-03-17 03:36:43,414 INFO L312 TraceCheckSpWp]: Computing backward predicates...