./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-75.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-75.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 784bfb63323c2eafa68a8b4576cc6ae47526c290d5bc3f9eea23f3a379e575ed --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 01:52:27,050 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 01:52:27,103 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 01:52:27,106 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 01:52:27,107 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 01:52:27,126 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 01:52:27,128 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 01:52:27,128 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 01:52:27,128 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 01:52:27,128 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 01:52:27,129 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 01:52:27,129 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 01:52:27,129 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 01:52:27,129 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 01:52:27,129 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 01:52:27,130 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 01:52:27,130 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 01:52:27,130 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 01:52:27,131 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 01:52:27,131 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 01:52:27,131 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 01:52:27,131 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 01:52:27,131 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 01:52:27,131 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 01:52:27,131 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 01:52:27,131 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 01:52:27,131 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 01:52:27,131 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 01:52:27,131 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 01:52:27,131 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 01:52:27,132 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 01:52:27,132 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 01:52:27,132 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 01:52:27,132 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 01:52:27,132 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 01:52:27,132 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 01:52:27,132 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 01:52:27,132 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 01:52:27,132 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 01:52:27,132 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 01:52:27,132 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 01:52:27,132 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 01:52:27,132 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 01:52:27,132 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 784bfb63323c2eafa68a8b4576cc6ae47526c290d5bc3f9eea23f3a379e575ed [2025-02-06 01:52:27,357 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 01:52:27,365 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 01:52:27,366 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 01:52:27,367 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 01:52:27,367 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 01:52:27,369 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-75.i [2025-02-06 01:52:28,512 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/690d4e3a6/e71b9df59c584629b0e3bc3e58f2c756/FLAG4a339c3a2 [2025-02-06 01:52:28,767 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 01:52:28,768 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-75.i [2025-02-06 01:52:28,778 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/690d4e3a6/e71b9df59c584629b0e3bc3e58f2c756/FLAG4a339c3a2 [2025-02-06 01:52:29,087 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/690d4e3a6/e71b9df59c584629b0e3bc3e58f2c756 [2025-02-06 01:52:29,089 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 01:52:29,090 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 01:52:29,091 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 01:52:29,091 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 01:52:29,094 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 01:52:29,094 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:52:29" (1/1) ... [2025-02-06 01:52:29,095 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@207b3483 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:52:29, skipping insertion in model container [2025-02-06 01:52:29,095 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:52:29" (1/1) ... [2025-02-06 01:52:29,105 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 01:52:29,203 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-75.i[915,928] [2025-02-06 01:52:29,251 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 01:52:29,261 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 01:52:29,269 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-75.i[915,928] [2025-02-06 01:52:29,296 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 01:52:29,307 INFO L204 MainTranslator]: Completed translation [2025-02-06 01:52:29,307 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:52:29 WrapperNode [2025-02-06 01:52:29,307 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 01:52:29,308 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 01:52:29,308 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 01:52:29,308 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 01:52:29,312 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:52:29" (1/1) ... [2025-02-06 01:52:29,317 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:52:29" (1/1) ... [2025-02-06 01:52:29,332 INFO L138 Inliner]: procedures = 26, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 186 [2025-02-06 01:52:29,332 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 01:52:29,332 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 01:52:29,333 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 01:52:29,333 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 01:52:29,338 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:52:29" (1/1) ... [2025-02-06 01:52:29,338 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:52:29" (1/1) ... [2025-02-06 01:52:29,341 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:52:29" (1/1) ... [2025-02-06 01:52:29,349 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-06 01:52:29,350 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:52:29" (1/1) ... [2025-02-06 01:52:29,350 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:52:29" (1/1) ... [2025-02-06 01:52:29,354 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:52:29" (1/1) ... [2025-02-06 01:52:29,355 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:52:29" (1/1) ... [2025-02-06 01:52:29,359 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:52:29" (1/1) ... [2025-02-06 01:52:29,360 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:52:29" (1/1) ... [2025-02-06 01:52:29,361 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 01:52:29,362 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 01:52:29,362 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 01:52:29,362 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 01:52:29,362 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:52:29" (1/1) ... [2025-02-06 01:52:29,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 01:52:29,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 01:52:29,385 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 01:52:29,387 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 01:52:29,401 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 01:52:29,402 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 01:52:29,402 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 01:52:29,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 01:52:29,402 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 01:52:29,402 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 01:52:29,454 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 01:52:29,455 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 01:52:29,680 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L124: havoc property_#t~bitwise20#1;havoc property_#t~ite22#1;havoc property_#t~bitwise21#1;havoc property_#t~short23#1; [2025-02-06 01:52:29,706 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2025-02-06 01:52:29,706 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 01:52:29,718 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 01:52:29,718 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 01:52:29,719 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:52:29 BoogieIcfgContainer [2025-02-06 01:52:29,719 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 01:52:29,721 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 01:52:29,721 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 01:52:29,724 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 01:52:29,724 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 01:52:29" (1/3) ... [2025-02-06 01:52:29,725 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d358469 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:52:29, skipping insertion in model container [2025-02-06 01:52:29,725 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:52:29" (2/3) ... [2025-02-06 01:52:29,725 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d358469 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:52:29, skipping insertion in model container [2025-02-06 01:52:29,726 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:52:29" (3/3) ... [2025-02-06 01:52:29,727 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-while_file-75.i [2025-02-06 01:52:29,738 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 01:52:29,739 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_50-while_file-75.i that has 2 procedures, 81 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 01:52:29,774 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 01:52:29,782 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;@66587f2a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 01:52:29,782 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 01:52:29,787 INFO L276 IsEmpty]: Start isEmpty. Operand has 81 states, 59 states have (on average 1.4067796610169492) internal successors, (83), 60 states have internal predecessors, (83), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-02-06 01:52:29,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-02-06 01:52:29,797 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:52:29,797 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 01:52:29,798 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:52:29,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:52:29,803 INFO L85 PathProgramCache]: Analyzing trace with hash 1695802435, now seen corresponding path program 1 times [2025-02-06 01:52:29,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 01:52:29,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006745591] [2025-02-06 01:52:29,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:52:29,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 01:52:29,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-02-06 01:52:29,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-02-06 01:52:29,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:52:29,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:52:30,019 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2025-02-06 01:52:30,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 01:52:30,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006745591] [2025-02-06 01:52:30,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006745591] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 01:52:30,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2095308496] [2025-02-06 01:52:30,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:52:30,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 01:52:30,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 01:52:30,023 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 01:52:30,024 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 01:52:30,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-02-06 01:52:30,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-02-06 01:52:30,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:52:30,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:52:30,170 INFO L256 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 01:52:30,178 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 01:52:30,202 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2025-02-06 01:52:30,204 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 01:52:30,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2095308496] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 01:52:30,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 01:52:30,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 01:52:30,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314506553] [2025-02-06 01:52:30,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 01:52:30,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 01:52:30,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 01:52:30,224 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 01:52:30,225 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 01:52:30,227 INFO L87 Difference]: Start difference. First operand has 81 states, 59 states have (on average 1.4067796610169492) internal successors, (83), 60 states have internal predecessors, (83), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-02-06 01:52:30,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:52:30,259 INFO L93 Difference]: Finished difference Result 156 states and 256 transitions. [2025-02-06 01:52:30,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 01:52:30,262 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 130 [2025-02-06 01:52:30,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:52:30,268 INFO L225 Difference]: With dead ends: 156 [2025-02-06 01:52:30,268 INFO L226 Difference]: Without dead ends: 78 [2025-02-06 01:52:30,272 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 01:52:30,276 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 01:52:30,276 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 111 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 01:52:30,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-02-06 01:52:30,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2025-02-06 01:52:30,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 57 states have (on average 1.3508771929824561) internal successors, (77), 57 states have internal predecessors, (77), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-02-06 01:52:30,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 115 transitions. [2025-02-06 01:52:30,311 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 115 transitions. Word has length 130 [2025-02-06 01:52:30,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:52:30,315 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 115 transitions. [2025-02-06 01:52:30,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-02-06 01:52:30,315 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 115 transitions. [2025-02-06 01:52:30,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-02-06 01:52:30,317 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:52:30,318 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 01:52:30,324 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 01:52:30,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-06 01:52:30,519 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:52:30,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:52:30,519 INFO L85 PathProgramCache]: Analyzing trace with hash -2070293364, now seen corresponding path program 1 times [2025-02-06 01:52:30,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 01:52:30,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763986222] [2025-02-06 01:52:30,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:52:30,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 01:52:30,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-02-06 01:52:30,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-02-06 01:52:30,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:52:30,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:52:30,892 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-02-06 01:52:30,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 01:52:30,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763986222] [2025-02-06 01:52:30,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763986222] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 01:52:30,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 01:52:30,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 01:52:30,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361407695] [2025-02-06 01:52:30,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 01:52:30,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 01:52:30,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 01:52:30,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 01:52:30,897 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 01:52:30,897 INFO L87 Difference]: Start difference. First operand 78 states and 115 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-02-06 01:52:30,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:52:30,984 INFO L93 Difference]: Finished difference Result 154 states and 229 transitions. [2025-02-06 01:52:30,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 01:52:30,984 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 131 [2025-02-06 01:52:30,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:52:30,986 INFO L225 Difference]: With dead ends: 154 [2025-02-06 01:52:30,986 INFO L226 Difference]: Without dead ends: 79 [2025-02-06 01:52:30,986 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 01:52:30,987 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 0 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 01:52:30,987 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 191 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 01:52:30,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-02-06 01:52:30,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2025-02-06 01:52:31,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 58 states have (on average 1.3448275862068966) internal successors, (78), 58 states have internal predecessors, (78), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-02-06 01:52:31,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 116 transitions. [2025-02-06 01:52:31,004 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 116 transitions. Word has length 131 [2025-02-06 01:52:31,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:52:31,007 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 116 transitions. [2025-02-06 01:52:31,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-02-06 01:52:31,008 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 116 transitions. [2025-02-06 01:52:31,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-02-06 01:52:31,009 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:52:31,009 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 01:52:31,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 01:52:31,009 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:52:31,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:52:31,012 INFO L85 PathProgramCache]: Analyzing trace with hash -572221337, now seen corresponding path program 1 times [2025-02-06 01:52:31,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 01:52:31,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061322376] [2025-02-06 01:52:31,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:52:31,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 01:52:31,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-02-06 01:52:31,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-02-06 01:52:31,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:52:31,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:52:31,324 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 45 proven. 9 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2025-02-06 01:52:31,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 01:52:31,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061322376] [2025-02-06 01:52:31,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061322376] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 01:52:31,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [218774696] [2025-02-06 01:52:31,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:52:31,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 01:52:31,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 01:52:31,327 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 01:52:31,329 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 01:52:31,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-02-06 01:52:31,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-02-06 01:52:31,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:52:31,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:52:31,424 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 01:52:31,427 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 01:52:31,534 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 228 proven. 9 refuted. 0 times theorem prover too weak. 447 trivial. 0 not checked. [2025-02-06 01:52:31,535 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 01:52:31,707 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 45 proven. 9 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2025-02-06 01:52:31,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [218774696] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 01:52:31,707 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 01:52:31,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2025-02-06 01:52:31,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889697603] [2025-02-06 01:52:31,708 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 01:52:31,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 01:52:31,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 01:52:31,710 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 01:52:31,710 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-02-06 01:52:31,711 INFO L87 Difference]: Start difference. First operand 79 states and 116 transitions. Second operand has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 3 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) [2025-02-06 01:52:32,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:52:32,194 INFO L93 Difference]: Finished difference Result 206 states and 297 transitions. [2025-02-06 01:52:32,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-06 01:52:32,194 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 3 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) Word has length 132 [2025-02-06 01:52:32,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:52:32,196 INFO L225 Difference]: With dead ends: 206 [2025-02-06 01:52:32,196 INFO L226 Difference]: Without dead ends: 130 [2025-02-06 01:52:32,197 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 263 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=344, Unknown=0, NotChecked=0, Total=506 [2025-02-06 01:52:32,197 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 278 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 175 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 175 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 01:52:32,197 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 259 Invalid, 542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [175 Valid, 367 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 01:52:32,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2025-02-06 01:52:32,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 82. [2025-02-06 01:52:32,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 60 states have (on average 1.2) internal successors, (72), 60 states have internal predecessors, (72), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-02-06 01:52:32,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 110 transitions. [2025-02-06 01:52:32,209 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 110 transitions. Word has length 132 [2025-02-06 01:52:32,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:52:32,209 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 110 transitions. [2025-02-06 01:52:32,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 3 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) [2025-02-06 01:52:32,210 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 110 transitions. [2025-02-06 01:52:32,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-02-06 01:52:32,211 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:52:32,211 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 01:52:32,218 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-06 01:52:32,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 01:52:32,415 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:52:32,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:52:32,416 INFO L85 PathProgramCache]: Analyzing trace with hash 997749295, now seen corresponding path program 1 times [2025-02-06 01:52:32,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 01:52:32,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266523833] [2025-02-06 01:52:32,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:52:32,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 01:52:32,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-02-06 01:52:32,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-02-06 01:52:32,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:52:32,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:52:32,825 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 45 proven. 9 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2025-02-06 01:52:32,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 01:52:32,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266523833] [2025-02-06 01:52:32,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266523833] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 01:52:32,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1152189728] [2025-02-06 01:52:32,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:52:32,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 01:52:32,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 01:52:32,828 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 01:52:32,830 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 01:52:32,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-02-06 01:52:32,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-02-06 01:52:32,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:52:32,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:52:32,908 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-06 01:52:32,913 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 01:52:33,036 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 228 proven. 9 refuted. 0 times theorem prover too weak. 447 trivial. 0 not checked. [2025-02-06 01:52:33,037 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 01:52:33,222 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 45 proven. 9 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2025-02-06 01:52:33,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1152189728] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 01:52:33,223 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 01:52:33,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2025-02-06 01:52:33,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371448153] [2025-02-06 01:52:33,223 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 01:52:33,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-06 01:52:33,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 01:52:33,225 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-06 01:52:33,225 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2025-02-06 01:52:33,226 INFO L87 Difference]: Start difference. First operand 82 states and 110 transitions. Second operand has 14 states, 14 states have (on average 4.5) internal successors, (63), 14 states have internal predecessors, (63), 3 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) [2025-02-06 01:52:33,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:52:33,725 INFO L93 Difference]: Finished difference Result 209 states and 283 transitions. [2025-02-06 01:52:33,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-06 01:52:33,726 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.5) internal successors, (63), 14 states have internal predecessors, (63), 3 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) Word has length 133 [2025-02-06 01:52:33,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:52:33,727 INFO L225 Difference]: With dead ends: 209 [2025-02-06 01:52:33,727 INFO L226 Difference]: Without dead ends: 130 [2025-02-06 01:52:33,728 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 262 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=149, Invalid=403, Unknown=0, NotChecked=0, Total=552 [2025-02-06 01:52:33,729 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 385 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 459 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 401 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 01:52:33,729 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [401 Valid, 368 Invalid, 629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 459 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 01:52:33,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2025-02-06 01:52:33,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 82. [2025-02-06 01:52:33,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 60 states have (on average 1.1833333333333333) internal successors, (71), 60 states have internal predecessors, (71), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-02-06 01:52:33,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 109 transitions. [2025-02-06 01:52:33,744 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 109 transitions. Word has length 133 [2025-02-06 01:52:33,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:52:33,744 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 109 transitions. [2025-02-06 01:52:33,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.5) internal successors, (63), 14 states have internal predecessors, (63), 3 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) [2025-02-06 01:52:33,744 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 109 transitions. [2025-02-06 01:52:33,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-02-06 01:52:33,747 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:52:33,747 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 01:52:33,758 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-06 01:52:33,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 01:52:33,954 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:52:33,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:52:33,955 INFO L85 PathProgramCache]: Analyzing trace with hash 790902515, now seen corresponding path program 1 times [2025-02-06 01:52:33,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 01:52:33,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147408768] [2025-02-06 01:52:33,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:52:33,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 01:52:33,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-02-06 01:52:34,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-02-06 01:52:34,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:52:34,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 01:52:34,019 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 01:52:34,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-02-06 01:52:34,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-02-06 01:52:34,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:52:34,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 01:52:34,099 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 01:52:34,099 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 01:52:34,100 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-06 01:52:34,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 01:52:34,106 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-02-06 01:52:34,198 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 01:52:34,205 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 01:52:34 BoogieIcfgContainer [2025-02-06 01:52:34,205 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 01:52:34,205 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 01:52:34,205 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 01:52:34,205 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 01:52:34,207 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:52:29" (3/4) ... [2025-02-06 01:52:34,208 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-06 01:52:34,209 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 01:52:34,210 INFO L158 Benchmark]: Toolchain (without parser) took 5120.07ms. Allocated memory was 142.6MB in the beginning and 184.5MB in the end (delta: 41.9MB). Free memory was 112.7MB in the beginning and 127.2MB in the end (delta: -14.5MB). Peak memory consumption was 29.6MB. Max. memory is 16.1GB. [2025-02-06 01:52:34,210 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 122.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 01:52:34,211 INFO L158 Benchmark]: CACSL2BoogieTranslator took 216.93ms. Allocated memory is still 142.6MB. Free memory was 112.7MB in the beginning and 99.1MB in the end (delta: 13.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 01:52:34,211 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.12ms. Allocated memory is still 142.6MB. Free memory was 99.1MB in the beginning and 97.0MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 01:52:34,211 INFO L158 Benchmark]: Boogie Preprocessor took 28.75ms. Allocated memory is still 142.6MB. Free memory was 97.0MB in the beginning and 94.5MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 01:52:34,212 INFO L158 Benchmark]: IcfgBuilder took 357.24ms. Allocated memory is still 142.6MB. Free memory was 94.5MB in the beginning and 72.9MB in the end (delta: 21.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-06 01:52:34,212 INFO L158 Benchmark]: TraceAbstraction took 4484.17ms. Allocated memory was 142.6MB in the beginning and 184.5MB in the end (delta: 41.9MB). Free memory was 72.4MB in the beginning and 127.3MB in the end (delta: -54.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 01:52:34,212 INFO L158 Benchmark]: Witness Printer took 4.00ms. Allocated memory is still 184.5MB. Free memory was 127.3MB in the beginning and 127.2MB in the end (delta: 27.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 01:52:34,214 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.22ms. Allocated memory is still 201.3MB. Free memory is still 122.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 216.93ms. Allocated memory is still 142.6MB. Free memory was 112.7MB in the beginning and 99.1MB in the end (delta: 13.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.12ms. Allocated memory is still 142.6MB. Free memory was 99.1MB in the beginning and 97.0MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 28.75ms. Allocated memory is still 142.6MB. Free memory was 97.0MB in the beginning and 94.5MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 357.24ms. Allocated memory is still 142.6MB. Free memory was 94.5MB in the beginning and 72.9MB in the end (delta: 21.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 4484.17ms. Allocated memory was 142.6MB in the beginning and 184.5MB in the end (delta: 41.9MB). Free memory was 72.4MB in the beginning and 127.3MB in the end (delta: -54.8MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 4.00ms. Allocated memory is still 184.5MB. Free memory was 127.3MB in the beginning and 127.2MB in the end (delta: 27.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 46, overapproximation of someBinaryFLOATComparisonOperation at line 124, overapproximation of someBinaryFLOATComparisonOperation at line 88, overapproximation of someBinaryFLOATComparisonOperation at line 90, overapproximation of someBinaryFLOATComparisonOperation at line 92, overapproximation of someBinaryFLOATComparisonOperation at line 124, overapproximation of bitwiseOr at line 50, overapproximation of bitwiseOr at line 50, overapproximation of someBinaryDOUBLEComparisonOperation at line 62, overapproximation of someBinaryDOUBLEComparisonOperation at line 112, overapproximation of someBinaryDOUBLEComparisonOperation at line 124, overapproximation of someBinaryDOUBLEComparisonOperation at line 69, overapproximation of someBinaryDOUBLEComparisonOperation at line 110, overapproximation of someBinaryDOUBLEComparisonOperation at line 82, overapproximation of someBinaryDOUBLEComparisonOperation at line 106, overapproximation of someBinaryDOUBLEComparisonOperation at line 108, overapproximation of someBinaryArithmeticFLOAToperation at line 80. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] float var_1_1 = 63.6; [L23] float var_1_4 = 128.75; [L24] float var_1_5 = 25.125; [L25] float var_1_6 = 1000000.75; [L26] unsigned char var_1_7 = 1; [L27] unsigned char var_1_11 = 0; [L28] unsigned char var_1_12 = 0; [L29] unsigned char var_1_13 = 0; [L30] unsigned char var_1_14 = 0; [L31] float var_1_15 = 25.75; [L32] double var_1_16 = 0.4; [L33] double var_1_17 = 0.0; [L34] double var_1_18 = 0.0; [L35] double var_1_19 = 1000000000000.5; [L36] double var_1_20 = 24.8; [L37] signed char var_1_21 = 1; [L38] double var_1_22 = 200.8; [L39] unsigned short int var_1_23 = 40076; [L40] unsigned short int var_1_24 = 8; [L41] unsigned long int var_1_25 = 2; [L42] double last_1_var_1_22 = 200.8; VAL [isInitial=0, last_1_var_1_22=1004/5, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_4=515/4, var_1_5=201/8, var_1_6=4000003/4, var_1_7=1] [L128] isInitial = 1 [L129] FCALL initially() [L130] COND TRUE 1 [L131] CALL updateLastVariables() [L121] last_1_var_1_22 = var_1_22 VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_4=515/4, var_1_5=201/8, var_1_6=4000003/4, var_1_7=1] [L131] RET updateLastVariables() [L132] CALL updateVariables() [L87] var_1_4 = __VERIFIER_nondet_float() [L88] CALL assume_abort_if_not((var_1_4 >= -461168.6018427382800e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 4611686.018427382800e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_5=201/8, var_1_6=4000003/4, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_5=201/8, var_1_6=4000003/4, var_1_7=1] [L88] RET assume_abort_if_not((var_1_4 >= -461168.6018427382800e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 4611686.018427382800e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_5=201/8, var_1_6=4000003/4, var_1_7=1] [L89] var_1_5 = __VERIFIER_nondet_float() [L90] CALL assume_abort_if_not((var_1_5 >= -230584.3009213691390e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 2305843.009213691390e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_6=4000003/4, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_6=4000003/4, var_1_7=1] [L90] RET assume_abort_if_not((var_1_5 >= -230584.3009213691390e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 2305843.009213691390e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_6=4000003/4, var_1_7=1] [L91] var_1_6 = __VERIFIER_nondet_float() [L92] CALL assume_abort_if_not((var_1_6 >= -230584.3009213691390e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 2305843.009213691390e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_7=1] [L92] RET assume_abort_if_not((var_1_6 >= -230584.3009213691390e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 2305843.009213691390e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_7=1] [L93] var_1_11 = __VERIFIER_nondet_uchar() [L94] CALL assume_abort_if_not(var_1_11 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_7=1] [L94] RET assume_abort_if_not(var_1_11 >= 1) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_7=1] [L95] CALL assume_abort_if_not(var_1_11 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_7=1] [L95] RET assume_abort_if_not(var_1_11 <= 1) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_7=1] [L96] var_1_12 = __VERIFIER_nondet_uchar() [L97] CALL assume_abort_if_not(var_1_12 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_7=1] [L97] RET assume_abort_if_not(var_1_12 >= 1) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_7=1] [L98] CALL assume_abort_if_not(var_1_12 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_7=1] [L98] RET assume_abort_if_not(var_1_12 <= 1) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_7=1] [L99] var_1_13 = __VERIFIER_nondet_uchar() [L100] CALL assume_abort_if_not(var_1_13 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_7=1] [L100] RET assume_abort_if_not(var_1_13 >= 1) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_7=1] [L101] CALL assume_abort_if_not(var_1_13 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_7=1] [L101] RET assume_abort_if_not(var_1_13 <= 1) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_7=1] [L102] var_1_14 = __VERIFIER_nondet_uchar() [L103] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_7=1] [L103] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_7=1] [L104] CALL assume_abort_if_not(var_1_14 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_7=1] [L104] RET assume_abort_if_not(var_1_14 <= 0) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_7=1] [L105] var_1_17 = __VERIFIER_nondet_double() [L106] CALL assume_abort_if_not((var_1_17 >= 4611686.018427382800e+12F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_7=1] [L106] RET assume_abort_if_not((var_1_17 >= 4611686.018427382800e+12F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_7=1] [L107] var_1_18 = __VERIFIER_nondet_double() [L108] CALL assume_abort_if_not((var_1_18 >= 4611686.018427382800e+12F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_7=1] [L108] RET assume_abort_if_not((var_1_18 >= 4611686.018427382800e+12F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_7=1] [L109] var_1_19 = __VERIFIER_nondet_double() [L110] CALL assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_7=1] [L110] RET assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_7=1] [L111] var_1_20 = __VERIFIER_nondet_double() [L112] CALL assume_abort_if_not((var_1_20 >= 0.0F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_7=1] [L112] RET assume_abort_if_not((var_1_20 >= 0.0F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_7=1] [L113] var_1_23 = __VERIFIER_nondet_ushort() [L114] CALL assume_abort_if_not(var_1_23 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=8, var_1_25=2, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=8, var_1_25=2, var_1_7=1] [L114] RET assume_abort_if_not(var_1_23 >= 32767) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=8, var_1_25=2, var_1_7=1] [L115] CALL assume_abort_if_not(var_1_23 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=8, var_1_25=2, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=8, var_1_25=2, var_1_7=1] [L115] RET assume_abort_if_not(var_1_23 <= 65535) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=8, var_1_25=2, var_1_7=1] [L116] var_1_24 = __VERIFIER_nondet_ushort() [L117] CALL assume_abort_if_not(var_1_24 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_25=2, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_25=2, var_1_7=1] [L117] RET assume_abort_if_not(var_1_24 >= 0) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_25=2, var_1_7=1] [L118] CALL assume_abort_if_not(var_1_24 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_7=1] [L118] RET assume_abort_if_not(var_1_24 <= 32767) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_7=1] [L132] RET updateVariables() [L133] CALL step() [L46] COND TRUE ! (var_1_4 < 16.8f) [L47] var_1_15 = var_1_6 VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=1000000000005, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_6=1000000000005, var_1_7=1] [L49] var_1_25 = var_1_23 VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=1000000000005, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=32767, var_1_6=1000000000005, var_1_7=1] [L50] EXPR 4 | var_1_25 VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=1000000000005, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=32767, var_1_6=1000000000005, var_1_7=1] [L50] EXPR (((var_1_25 + var_1_25)) < ((4 | var_1_25))) ? ((var_1_25 + var_1_25)) : ((4 | var_1_25)) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=1000000000005, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=32767, var_1_6=1000000000005, var_1_7=1] [L50] EXPR 4 | var_1_25 VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=1000000000005, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=32767, var_1_6=1000000000005, var_1_7=1] [L50] EXPR (((var_1_25 + var_1_25)) < ((4 | var_1_25))) ? ((var_1_25 + var_1_25)) : ((4 | var_1_25)) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=1000000000005, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=32767, var_1_6=1000000000005, var_1_7=1] [L50] COND TRUE (((((var_1_25 + var_1_25)) < ((4 | var_1_25))) ? ((var_1_25 + var_1_25)) : ((4 | var_1_25)))) >= var_1_25 [L51] var_1_7 = ((var_1_11 && var_1_12) && var_1_13) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=1000000000005, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=32767, var_1_6=1000000000005, var_1_7=1] [L59] COND FALSE !(var_1_25 > var_1_25) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=1000000000005, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=32767, var_1_6=1000000000005, var_1_7=1] [L62] COND TRUE var_1_18 > (var_1_20 + (var_1_19 * var_1_17)) [L63] var_1_16 = var_1_6 VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=1000000000005, var_1_16=1000000000005, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=32767, var_1_6=1000000000005, var_1_7=1] [L68] unsigned long int stepLocal_1 = var_1_25; VAL [isInitial=1, last_1_var_1_22=1004/5, stepLocal_1=32767, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=1000000000005, var_1_16=1000000000005, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=32767, var_1_6=1000000000005, var_1_7=1] [L69] COND FALSE !(var_1_18 < (last_1_var_1_22 * var_1_4)) [L76] var_1_22 = var_1_20 VAL [isInitial=1, last_1_var_1_22=1004/5, stepLocal_1=32767, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=1000000000005, var_1_16=1000000000005, var_1_1=318/5, var_1_20=1000000000006, var_1_21=1, var_1_22=1000000000006, var_1_23=32767, var_1_24=0, var_1_25=32767, var_1_6=1000000000005, var_1_7=1] [L78] unsigned char stepLocal_0 = -1 <= var_1_25; VAL [isInitial=1, last_1_var_1_22=1004/5, stepLocal_0=0, stepLocal_1=32767, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=1000000000005, var_1_16=1000000000005, var_1_1=318/5, var_1_20=1000000000006, var_1_21=1, var_1_22=1000000000006, var_1_23=32767, var_1_24=0, var_1_25=32767, var_1_6=1000000000005, var_1_7=1] [L79] COND TRUE stepLocal_0 || var_1_7 [L80] var_1_1 = (var_1_4 + (var_1_5 + var_1_6)) VAL [isInitial=1, last_1_var_1_22=1004/5, stepLocal_1=32767, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=1000000000005, var_1_16=1000000000005, var_1_20=1000000000006, var_1_21=1, var_1_22=1000000000006, var_1_23=32767, var_1_24=0, var_1_25=32767, var_1_6=1000000000005, var_1_7=1] [L82] COND TRUE (- (var_1_17 + var_1_1)) >= var_1_16 [L83] var_1_21 = ((((-50) < 0 ) ? -(-50) : (-50))) VAL [isInitial=1, last_1_var_1_22=1004/5, stepLocal_1=32767, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=1000000000005, var_1_16=1000000000005, var_1_20=1000000000006, var_1_21=50, var_1_22=1000000000006, var_1_23=32767, var_1_24=0, var_1_25=32767, var_1_6=1000000000005, var_1_7=1] [L133] RET step() [L134] CALL, EXPR property() [L124] EXPR (((-1 <= var_1_25) || var_1_7) ? (var_1_1 == ((float) (var_1_4 + (var_1_5 + var_1_6)))) : 1) && (((((((var_1_25 + var_1_25)) < ((4 | var_1_25))) ? ((var_1_25 + var_1_25)) : ((4 | var_1_25)))) >= var_1_25) ? (var_1_7 == ((unsigned char) ((var_1_11 && var_1_12) && var_1_13))) : ((var_1_6 == var_1_15) ? (var_1_7 == ((unsigned char) var_1_14)) : (var_1_7 == ((unsigned char) var_1_13)))) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=1000000000005, var_1_16=1000000000005, var_1_20=1000000000006, var_1_21=50, var_1_22=1000000000006, var_1_23=32767, var_1_24=0, var_1_25=32767, var_1_6=1000000000005, var_1_7=1] [L124-L125] return ((((((((-1 <= var_1_25) || var_1_7) ? (var_1_1 == ((float) (var_1_4 + (var_1_5 + var_1_6)))) : 1) && (((((((var_1_25 + var_1_25)) < ((4 | var_1_25))) ? ((var_1_25 + var_1_25)) : ((4 | var_1_25)))) >= var_1_25) ? (var_1_7 == ((unsigned char) ((var_1_11 && var_1_12) && var_1_13))) : ((var_1_6 == var_1_15) ? (var_1_7 == ((unsigned char) var_1_14)) : (var_1_7 == ((unsigned char) var_1_13))))) && ((! (var_1_4 < 16.8f)) ? (var_1_15 == ((float) var_1_6)) : 1)) && ((var_1_25 > var_1_25) ? (var_1_16 == ((double) ((((((var_1_17) < (var_1_18)) ? (var_1_17) : (var_1_18))) - var_1_19) - var_1_20))) : ((var_1_18 > (var_1_20 + (var_1_19 * var_1_17))) ? (var_1_16 == ((double) var_1_6)) : (var_1_16 == ((double) var_1_20))))) && (((- (var_1_17 + var_1_1)) >= var_1_16) ? (var_1_21 == ((signed char) ((((-50) < 0 ) ? -(-50) : (-50))))) : 1)) && ((var_1_18 < (last_1_var_1_22 * var_1_4)) ? (((var_1_23 - var_1_24) < var_1_25) ? (var_1_22 == ((double) var_1_5)) : (var_1_22 == ((double) var_1_17))) : (var_1_22 == ((double) var_1_20)))) && (var_1_25 == ((unsigned long int) var_1_23)) ; [L134] RET, EXPR property() [L134] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=1000000000005, var_1_16=1000000000005, var_1_20=1000000000006, var_1_21=50, var_1_22=1000000000006, var_1_23=32767, var_1_24=0, var_1_25=32767, var_1_6=1000000000005, var_1_7=1] [L19] reach_error() VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=1000000000005, var_1_16=1000000000005, var_1_20=1000000000006, var_1_21=50, var_1_22=1000000000006, var_1_23=32767, var_1_24=0, var_1_25=32767, var_1_6=1000000000005, var_1_7=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 81 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.3s, OverallIterations: 5, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 681 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 663 mSDsluCounter, 929 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 510 mSDsCounter, 345 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 868 IncrementalHoareTripleChecker+Invalid, 1213 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 345 mSolverCounterUnsat, 419 mSDtfsCounter, 868 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 702 GetRequests, 658 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=82occurred in iteration=3, InterpolantAutomatonStates: 37, 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, 96 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 1058 NumberOfCodeBlocks, 1058 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1177 ConstructedInterpolants, 0 QuantifiedInterpolants, 1703 SizeOfPredicates, 4 NumberOfNonLiveVariables, 899 ConjunctsInSsa, 18 ConjunctsInUnsatCore, 9 InterpolantComputations, 2 PerfectInterpolantSequences, 6066/6156 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-02-06 01:52:34,232 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally 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-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-75.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 784bfb63323c2eafa68a8b4576cc6ae47526c290d5bc3f9eea23f3a379e575ed --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 01:52:36,150 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 01:52:36,237 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-02-06 01:52:36,243 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 01:52:36,244 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 01:52:36,266 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 01:52:36,267 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 01:52:36,267 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 01:52:36,268 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 01:52:36,268 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 01:52:36,268 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 01:52:36,269 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 01:52:36,269 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 01:52:36,269 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 01:52:36,269 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 01:52:36,270 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 01:52:36,270 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 01:52:36,270 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 01:52:36,270 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 01:52:36,270 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 01:52:36,270 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 01:52:36,270 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 01:52:36,270 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 01:52:36,270 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 01:52:36,270 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-06 01:52:36,270 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-06 01:52:36,270 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 01:52:36,270 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 01:52:36,270 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 01:52:36,270 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 01:52:36,270 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 01:52:36,270 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 01:52:36,270 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 01:52:36,270 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 01:52:36,270 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 01:52:36,270 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 01:52:36,270 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 01:52:36,271 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 01:52:36,271 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 01:52:36,271 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-06 01:52:36,271 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-06 01:52:36,271 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 01:52:36,271 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 01:52:36,271 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 01:52:36,271 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 01:52:36,271 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 784bfb63323c2eafa68a8b4576cc6ae47526c290d5bc3f9eea23f3a379e575ed [2025-02-06 01:52:36,517 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 01:52:36,523 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 01:52:36,526 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 01:52:36,528 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 01:52:36,528 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 01:52:36,529 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-75.i [2025-02-06 01:52:37,777 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/833a068b1/b36ff5227c03406a83f8dc2a792abe5c/FLAG65f83c9e8 [2025-02-06 01:52:37,979 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 01:52:37,980 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-75.i [2025-02-06 01:52:37,989 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/833a068b1/b36ff5227c03406a83f8dc2a792abe5c/FLAG65f83c9e8 [2025-02-06 01:52:38,005 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/833a068b1/b36ff5227c03406a83f8dc2a792abe5c [2025-02-06 01:52:38,008 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 01:52:38,010 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 01:52:38,011 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 01:52:38,011 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 01:52:38,015 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 01:52:38,016 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:52:38" (1/1) ... [2025-02-06 01:52:38,018 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34874b1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:52:38, skipping insertion in model container [2025-02-06 01:52:38,018 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:52:38" (1/1) ... [2025-02-06 01:52:38,034 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 01:52:38,149 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-75.i[915,928] [2025-02-06 01:52:38,208 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 01:52:38,224 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 01:52:38,235 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-75.i[915,928] [2025-02-06 01:52:38,268 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 01:52:38,283 INFO L204 MainTranslator]: Completed translation [2025-02-06 01:52:38,285 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:52:38 WrapperNode [2025-02-06 01:52:38,285 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 01:52:38,286 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 01:52:38,286 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 01:52:38,286 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 01:52:38,291 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:52:38" (1/1) ... [2025-02-06 01:52:38,299 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:52:38" (1/1) ... [2025-02-06 01:52:38,328 INFO L138 Inliner]: procedures = 27, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 135 [2025-02-06 01:52:38,330 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 01:52:38,331 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 01:52:38,333 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 01:52:38,334 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 01:52:38,342 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:52:38" (1/1) ... [2025-02-06 01:52:38,342 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:52:38" (1/1) ... [2025-02-06 01:52:38,348 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:52:38" (1/1) ... [2025-02-06 01:52:38,363 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-06 01:52:38,363 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:52:38" (1/1) ... [2025-02-06 01:52:38,363 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:52:38" (1/1) ... [2025-02-06 01:52:38,372 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:52:38" (1/1) ... [2025-02-06 01:52:38,373 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:52:38" (1/1) ... [2025-02-06 01:52:38,374 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:52:38" (1/1) ... [2025-02-06 01:52:38,379 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:52:38" (1/1) ... [2025-02-06 01:52:38,386 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 01:52:38,387 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 01:52:38,387 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 01:52:38,387 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 01:52:38,387 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:52:38" (1/1) ... [2025-02-06 01:52:38,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 01:52:38,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 01:52:38,421 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 01:52:38,424 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 01:52:38,444 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 01:52:38,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-06 01:52:38,445 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 01:52:38,445 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 01:52:38,445 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 01:52:38,445 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 01:52:38,510 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 01:52:38,512 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 01:52:59,942 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-02-06 01:52:59,942 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 01:52:59,948 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 01:52:59,948 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 01:52:59,948 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:52:59 BoogieIcfgContainer [2025-02-06 01:52:59,948 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 01:52:59,950 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 01:52:59,950 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 01:52:59,954 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 01:52:59,954 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 01:52:38" (1/3) ... [2025-02-06 01:52:59,954 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a484591 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:52:59, skipping insertion in model container [2025-02-06 01:52:59,954 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:52:38" (2/3) ... [2025-02-06 01:52:59,955 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a484591 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:52:59, skipping insertion in model container [2025-02-06 01:52:59,955 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:52:59" (3/3) ... [2025-02-06 01:52:59,957 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-while_file-75.i [2025-02-06 01:52:59,966 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 01:52:59,968 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_50-while_file-75.i that has 2 procedures, 62 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 01:53:00,007 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 01:53:00,019 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;@1323f7b3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 01:53:00,020 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 01:53:00,024 INFO L276 IsEmpty]: Start isEmpty. Operand has 62 states, 40 states have (on average 1.325) internal successors, (53), 41 states have internal predecessors, (53), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-02-06 01:53:00,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-02-06 01:53:00,033 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:53:00,033 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 01:53:00,034 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:53:00,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:53:00,040 INFO L85 PathProgramCache]: Analyzing trace with hash -496181876, now seen corresponding path program 1 times [2025-02-06 01:53:00,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 01:53:00,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1235483300] [2025-02-06 01:53:00,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:53:00,052 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-02-06 01:53:00,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 01:53:00,057 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/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-02-06 01:53:00,060 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-02-06 01:53:00,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-02-06 01:53:00,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-02-06 01:53:00,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:53:00,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:53:00,656 INFO L256 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 01:53:00,661 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 01:53:00,710 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 356 proven. 0 refuted. 0 times theorem prover too weak. 328 trivial. 0 not checked. [2025-02-06 01:53:00,711 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 01:53:00,711 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 01:53:00,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1235483300] [2025-02-06 01:53:00,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1235483300] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 01:53:00,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 01:53:00,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 01:53:00,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637687331] [2025-02-06 01:53:00,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 01:53:00,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 01:53:00,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 01:53:00,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 01:53:00,732 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 01:53:00,734 INFO L87 Difference]: Start difference. First operand has 62 states, 40 states have (on average 1.325) internal successors, (53), 41 states have internal predecessors, (53), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-02-06 01:53:00,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:53:00,749 INFO L93 Difference]: Finished difference Result 118 states and 196 transitions. [2025-02-06 01:53:00,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 01:53:00,751 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 126 [2025-02-06 01:53:00,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:53:00,755 INFO L225 Difference]: With dead ends: 118 [2025-02-06 01:53:00,755 INFO L226 Difference]: Without dead ends: 59 [2025-02-06 01:53:00,757 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 01:53:00,762 INFO L435 NwaCegarLoop]: 85 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, 85 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 01:53:00,762 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 01:53:00,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-02-06 01:53:00,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2025-02-06 01:53:00,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 38 states have (on average 1.236842105263158) internal successors, (47), 38 states have internal predecessors, (47), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-02-06 01:53:00,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 85 transitions. [2025-02-06 01:53:00,788 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 85 transitions. Word has length 126 [2025-02-06 01:53:00,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:53:00,788 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 85 transitions. [2025-02-06 01:53:00,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-02-06 01:53:00,788 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 85 transitions. [2025-02-06 01:53:00,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-02-06 01:53:00,790 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:53:00,790 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 01:53:00,807 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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)] Ended with exit code 0 [2025-02-06 01:53:00,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/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-02-06 01:53:00,991 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:53:00,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:53:00,991 INFO L85 PathProgramCache]: Analyzing trace with hash -2047870701, now seen corresponding path program 1 times [2025-02-06 01:53:00,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 01:53:00,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1442973750] [2025-02-06 01:53:00,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:53:00,992 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-02-06 01:53:00,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 01:53:00,995 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/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-02-06 01:53:00,996 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-02-06 01:53:01,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-02-06 01:53:02,036 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-02-06 01:53:02,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:53:02,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:53:02,070 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-02-06 01:53:02,084 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 01:53:25,443 WARN L286 SmtUtils]: Spent 8.18s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-02-06 01:53:33,577 WARN L286 SmtUtils]: Spent 8.13s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-02-06 01:53:41,707 WARN L286 SmtUtils]: Spent 8.13s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-02-06 01:53:49,796 WARN L286 SmtUtils]: Spent 8.09s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-02-06 01:53:57,943 WARN L286 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-02-06 01:54:06,082 WARN L286 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)