./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-79.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_codestructure_dependencies_file-79.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 b1eb2d71fd6556e3c29f30215f2d9de84c58444bd8e95325c3358257aa3db343 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 20:25:32,548 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 20:25:32,604 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 20:25:32,608 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 20:25:32,608 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 20:25:32,627 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 20:25:32,628 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 20:25:32,629 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 20:25:32,629 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 20:25:32,629 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 20:25:32,630 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 20:25:32,630 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 20:25:32,630 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 20:25:32,630 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 20:25:32,631 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 20:25:32,631 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 20:25:32,631 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 20:25:32,631 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 20:25:32,631 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 20:25:32,631 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 20:25:32,631 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 20:25:32,631 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 20:25:32,631 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 20:25:32,631 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 20:25:32,632 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 20:25:32,632 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 20:25:32,632 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 20:25:32,632 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 20:25:32,632 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 20:25:32,632 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 20:25:32,632 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 20:25:32,632 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 20:25:32,632 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 20:25:32,632 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 20:25:32,633 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 20:25:32,633 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 20:25:32,633 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 20:25:32,633 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 20:25:32,633 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 20:25:32,633 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 20:25:32,633 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 20:25:32,633 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 20:25:32,633 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 20:25:32,633 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 -> b1eb2d71fd6556e3c29f30215f2d9de84c58444bd8e95325c3358257aa3db343 [2025-02-05 20:25:32,866 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 20:25:32,873 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 20:25:32,874 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 20:25:32,875 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 20:25:32,875 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 20:25:32,878 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-79.i [2025-02-05 20:25:34,002 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f8ef5a42d/5aeb7e0bc02b4d4283c38d7aa213d706/FLAG63ab408e0 [2025-02-05 20:25:34,340 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 20:25:34,341 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-79.i [2025-02-05 20:25:34,350 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f8ef5a42d/5aeb7e0bc02b4d4283c38d7aa213d706/FLAG63ab408e0 [2025-02-05 20:25:34,585 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f8ef5a42d/5aeb7e0bc02b4d4283c38d7aa213d706 [2025-02-05 20:25:34,587 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 20:25:34,588 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 20:25:34,589 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 20:25:34,589 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 20:25:34,592 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 20:25:34,593 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 08:25:34" (1/1) ... [2025-02-05 20:25:34,593 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ef3eaba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:25:34, skipping insertion in model container [2025-02-05 20:25:34,593 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 08:25:34" (1/1) ... [2025-02-05 20:25:34,604 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 20:25:34,707 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_codestructure_dependencies_file-79.i[919,932] [2025-02-05 20:25:34,772 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 20:25:34,785 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 20:25:34,793 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_codestructure_dependencies_file-79.i[919,932] [2025-02-05 20:25:34,827 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 20:25:34,843 INFO L204 MainTranslator]: Completed translation [2025-02-05 20:25:34,844 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:25:34 WrapperNode [2025-02-05 20:25:34,844 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 20:25:34,845 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 20:25:34,846 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 20:25:34,846 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 20:25:34,851 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:25:34" (1/1) ... [2025-02-05 20:25:34,859 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:25:34" (1/1) ... [2025-02-05 20:25:34,896 INFO L138 Inliner]: procedures = 26, calls = 38, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 157 [2025-02-05 20:25:34,896 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 20:25:34,897 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 20:25:34,897 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 20:25:34,897 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 20:25:34,905 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:25:34" (1/1) ... [2025-02-05 20:25:34,905 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:25:34" (1/1) ... [2025-02-05 20:25:34,908 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:25:34" (1/1) ... [2025-02-05 20:25:34,919 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-05 20:25:34,920 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:25:34" (1/1) ... [2025-02-05 20:25:34,920 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:25:34" (1/1) ... [2025-02-05 20:25:34,926 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:25:34" (1/1) ... [2025-02-05 20:25:34,927 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:25:34" (1/1) ... [2025-02-05 20:25:34,932 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:25:34" (1/1) ... [2025-02-05 20:25:34,932 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:25:34" (1/1) ... [2025-02-05 20:25:34,936 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 20:25:34,937 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 20:25:34,937 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 20:25:34,937 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 20:25:34,942 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:25:34" (1/1) ... [2025-02-05 20:25:34,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 20:25:34,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:25:34,966 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-05 20:25:34,968 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-05 20:25:34,983 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 20:25:34,983 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 20:25:34,983 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 20:25:34,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 20:25:34,983 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 20:25:34,983 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 20:25:35,037 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 20:25:35,038 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 20:25:35,376 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-02-05 20:25:35,376 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 20:25:35,385 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 20:25:35,386 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 20:25:35,386 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 08:25:35 BoogieIcfgContainer [2025-02-05 20:25:35,387 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 20:25:35,390 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 20:25:35,390 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 20:25:35,394 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 20:25:35,394 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 08:25:34" (1/3) ... [2025-02-05 20:25:35,394 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13700127 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 08:25:35, skipping insertion in model container [2025-02-05 20:25:35,394 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:25:34" (2/3) ... [2025-02-05 20:25:35,395 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13700127 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 08:25:35, skipping insertion in model container [2025-02-05 20:25:35,395 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 08:25:35" (3/3) ... [2025-02-05 20:25:35,396 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-79.i [2025-02-05 20:25:35,407 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 20:25:35,410 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_dependencies_file-79.i that has 2 procedures, 70 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 20:25:35,460 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 20:25:35,470 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;@2d85aa5a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 20:25:35,470 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 20:25:35,474 INFO L276 IsEmpty]: Start isEmpty. Operand has 70 states, 42 states have (on average 1.3333333333333333) internal successors, (56), 43 states have internal predecessors, (56), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-02-05 20:25:35,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-02-05 20:25:35,484 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:25:35,485 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 20:25:35,485 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:25:35,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:25:35,489 INFO L85 PathProgramCache]: Analyzing trace with hash -1045616449, now seen corresponding path program 1 times [2025-02-05 20:25:35,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:25:35,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978016744] [2025-02-05 20:25:35,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:25:35,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:25:35,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-02-05 20:25:35,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-02-05 20:25:35,594 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:25:35,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:25:35,769 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 1152 trivial. 0 not checked. [2025-02-05 20:25:35,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:25:35,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978016744] [2025-02-05 20:25:35,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978016744] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 20:25:35,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1599633567] [2025-02-05 20:25:35,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:25:35,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:25:35,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:25:35,773 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-05 20:25:35,774 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-05 20:25:35,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-02-05 20:25:35,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-02-05 20:25:35,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:25:35,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:25:35,897 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 20:25:35,906 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:25:35,937 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 1152 trivial. 0 not checked. [2025-02-05 20:25:35,940 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 20:25:35,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1599633567] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:25:35,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 20:25:35,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-05 20:25:35,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620740159] [2025-02-05 20:25:35,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:25:35,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 20:25:35,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:25:35,962 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 20:25:35,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 20:25:35,965 INFO L87 Difference]: Start difference. First operand has 70 states, 42 states have (on average 1.3333333333333333) internal successors, (56), 43 states have internal predecessors, (56), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2025-02-05 20:25:35,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:25:35,988 INFO L93 Difference]: Finished difference Result 134 states and 232 transitions. [2025-02-05 20:25:35,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 20:25:35,990 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) Word has length 157 [2025-02-05 20:25:35,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:25:35,995 INFO L225 Difference]: With dead ends: 134 [2025-02-05 20:25:35,996 INFO L226 Difference]: Without dead ends: 67 [2025-02-05 20:25:36,000 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 158 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-05 20:25:36,002 INFO L435 NwaCegarLoop]: 100 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, 100 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-05 20:25:36,003 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 20:25:36,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-02-05 20:25:36,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2025-02-05 20:25:36,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 40 states have (on average 1.25) internal successors, (50), 40 states have internal predecessors, (50), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-02-05 20:25:36,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 100 transitions. [2025-02-05 20:25:36,039 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 100 transitions. Word has length 157 [2025-02-05 20:25:36,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:25:36,040 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 100 transitions. [2025-02-05 20:25:36,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2025-02-05 20:25:36,041 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 100 transitions. [2025-02-05 20:25:36,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-02-05 20:25:36,043 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:25:36,044 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 20:25:36,051 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-05 20:25:36,244 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-05 20:25:36,245 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:25:36,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:25:36,246 INFO L85 PathProgramCache]: Analyzing trace with hash 703764390, now seen corresponding path program 1 times [2025-02-05 20:25:36,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:25:36,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610397098] [2025-02-05 20:25:36,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:25:36,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:25:36,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-02-05 20:25:36,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-02-05 20:25:36,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:25:36,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:25:36,614 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-02-05 20:25:36,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:25:36,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610397098] [2025-02-05 20:25:36,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610397098] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:25:36,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:25:36,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 20:25:36,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313887334] [2025-02-05 20:25:36,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:25:36,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 20:25:36,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:25:36,615 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 20:25:36,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 20:25:36,616 INFO L87 Difference]: Start difference. First operand 67 states and 100 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-02-05 20:25:36,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:25:36,798 INFO L93 Difference]: Finished difference Result 209 states and 314 transitions. [2025-02-05 20:25:36,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 20:25:36,799 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 157 [2025-02-05 20:25:36,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:25:36,800 INFO L225 Difference]: With dead ends: 209 [2025-02-05 20:25:36,800 INFO L226 Difference]: Without dead ends: 145 [2025-02-05 20:25:36,801 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 20:25:36,802 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 80 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 20:25:36,802 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 289 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 20:25:36,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2025-02-05 20:25:36,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 129. [2025-02-05 20:25:36,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 76 states have (on average 1.2236842105263157) internal successors, (93), 76 states have internal predecessors, (93), 50 states have call successors, (50), 2 states have call predecessors, (50), 2 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2025-02-05 20:25:36,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 193 transitions. [2025-02-05 20:25:36,828 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 193 transitions. Word has length 157 [2025-02-05 20:25:36,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:25:36,828 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 193 transitions. [2025-02-05 20:25:36,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-02-05 20:25:36,830 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 193 transitions. [2025-02-05 20:25:36,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-02-05 20:25:36,833 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:25:36,833 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 20:25:36,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 20:25:36,834 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:25:36,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:25:36,834 INFO L85 PathProgramCache]: Analyzing trace with hash 208672135, now seen corresponding path program 1 times [2025-02-05 20:25:36,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:25:36,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558854075] [2025-02-05 20:25:36,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:25:36,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:25:36,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-02-05 20:25:36,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-02-05 20:25:36,897 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:25:36,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:25:37,063 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-02-05 20:25:37,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:25:37,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558854075] [2025-02-05 20:25:37,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558854075] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:25:37,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:25:37,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 20:25:37,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553023043] [2025-02-05 20:25:37,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:25:37,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 20:25:37,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:25:37,068 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 20:25:37,069 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 20:25:37,069 INFO L87 Difference]: Start difference. First operand 129 states and 193 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-02-05 20:25:37,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:25:37,109 INFO L93 Difference]: Finished difference Result 271 states and 401 transitions. [2025-02-05 20:25:37,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 20:25:37,110 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 159 [2025-02-05 20:25:37,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:25:37,114 INFO L225 Difference]: With dead ends: 271 [2025-02-05 20:25:37,114 INFO L226 Difference]: Without dead ends: 145 [2025-02-05 20:25:37,115 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-05 20:25:37,117 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 33 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 20:25:37,118 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 181 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 20:25:37,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2025-02-05 20:25:37,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 144. [2025-02-05 20:25:37,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 85 states have (on average 1.1764705882352942) internal successors, (100), 86 states have internal predecessors, (100), 54 states have call successors, (54), 4 states have call predecessors, (54), 4 states have return successors, (54), 53 states have call predecessors, (54), 54 states have call successors, (54) [2025-02-05 20:25:37,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 208 transitions. [2025-02-05 20:25:37,144 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 208 transitions. Word has length 159 [2025-02-05 20:25:37,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:25:37,144 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 208 transitions. [2025-02-05 20:25:37,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-02-05 20:25:37,144 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 208 transitions. [2025-02-05 20:25:37,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-02-05 20:25:37,148 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:25:37,148 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 20:25:37,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 20:25:37,149 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:25:37,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:25:37,149 INFO L85 PathProgramCache]: Analyzing trace with hash -1129641408, now seen corresponding path program 1 times [2025-02-05 20:25:37,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:25:37,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130553101] [2025-02-05 20:25:37,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:25:37,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:25:37,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-02-05 20:25:37,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-02-05 20:25:37,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:25:37,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:25:37,591 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 42 proven. 30 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2025-02-05 20:25:37,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:25:37,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130553101] [2025-02-05 20:25:37,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130553101] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 20:25:37,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [47027393] [2025-02-05 20:25:37,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:25:37,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:25:37,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:25:37,595 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-05 20:25:37,596 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-05 20:25:37,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-02-05 20:25:37,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-02-05 20:25:37,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:25:37,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:25:37,702 INFO L256 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-02-05 20:25:37,708 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:25:38,187 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 612 proven. 30 refuted. 0 times theorem prover too weak. 558 trivial. 0 not checked. [2025-02-05 20:25:38,188 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 20:25:38,489 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 42 proven. 30 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2025-02-05 20:25:38,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [47027393] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 20:25:38,490 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 20:25:38,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 15 [2025-02-05 20:25:38,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422127701] [2025-02-05 20:25:38,490 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 20:25:38,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-05 20:25:38,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:25:38,491 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-05 20:25:38,492 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2025-02-05 20:25:38,492 INFO L87 Difference]: Start difference. First operand 144 states and 208 transitions. Second operand has 15 states, 15 states have (on average 6.133333333333334) internal successors, (92), 15 states have internal predecessors, (92), 5 states have call successors, (60), 3 states have call predecessors, (60), 6 states have return successors, (61), 5 states have call predecessors, (61), 5 states have call successors, (61) [2025-02-05 20:25:38,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:25:38,801 INFO L93 Difference]: Finished difference Result 232 states and 325 transitions. [2025-02-05 20:25:38,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 20:25:38,802 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 6.133333333333334) internal successors, (92), 15 states have internal predecessors, (92), 5 states have call successors, (60), 3 states have call predecessors, (60), 6 states have return successors, (61), 5 states have call predecessors, (61), 5 states have call successors, (61) Word has length 160 [2025-02-05 20:25:38,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:25:38,808 INFO L225 Difference]: With dead ends: 232 [2025-02-05 20:25:38,808 INFO L226 Difference]: Without dead ends: 164 [2025-02-05 20:25:38,809 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 312 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=159, Invalid=347, Unknown=0, NotChecked=0, Total=506 [2025-02-05 20:25:38,809 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 154 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 171 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 171 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 20:25:38,809 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 141 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [171 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 20:25:38,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2025-02-05 20:25:38,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 152. [2025-02-05 20:25:38,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 91 states have (on average 1.1318681318681318) internal successors, (103), 92 states have internal predecessors, (103), 54 states have call successors, (54), 6 states have call predecessors, (54), 6 states have return successors, (54), 53 states have call predecessors, (54), 54 states have call successors, (54) [2025-02-05 20:25:38,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 211 transitions. [2025-02-05 20:25:38,847 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 211 transitions. Word has length 160 [2025-02-05 20:25:38,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:25:38,848 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 211 transitions. [2025-02-05 20:25:38,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 6.133333333333334) internal successors, (92), 15 states have internal predecessors, (92), 5 states have call successors, (60), 3 states have call predecessors, (60), 6 states have return successors, (61), 5 states have call predecessors, (61), 5 states have call successors, (61) [2025-02-05 20:25:38,848 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 211 transitions. [2025-02-05 20:25:38,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-02-05 20:25:38,849 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:25:38,850 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 20:25:38,856 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-05 20:25:39,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:25:39,051 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:25:39,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:25:39,052 INFO L85 PathProgramCache]: Analyzing trace with hash -510011748, now seen corresponding path program 1 times [2025-02-05 20:25:39,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:25:39,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711913595] [2025-02-05 20:25:39,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:25:39,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:25:39,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-02-05 20:25:39,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-02-05 20:25:39,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:25:39,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-05 20:25:39,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [777834493] [2025-02-05 20:25:39,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:25:39,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:25:39,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:25:39,124 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-05 20:25:39,126 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-05 20:25:39,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-02-05 20:25:39,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-02-05 20:25:39,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:25:39,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 20:25:39,446 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-05 20:25:39,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-02-05 20:25:39,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-02-05 20:25:39,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:25:39,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 20:25:39,545 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-05 20:25:39,545 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-05 20:25:39,546 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-05 20:25:39,554 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-05 20:25:39,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:25:39,756 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-02-05 20:25:39,838 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-05 20:25:39,842 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 08:25:39 BoogieIcfgContainer [2025-02-05 20:25:39,842 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-05 20:25:39,843 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-05 20:25:39,843 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-05 20:25:39,843 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-05 20:25:39,844 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 08:25:35" (3/4) ... [2025-02-05 20:25:39,846 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-05 20:25:39,846 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-05 20:25:39,847 INFO L158 Benchmark]: Toolchain (without parser) took 5258.69ms. Allocated memory was 142.6MB in the beginning and 335.5MB in the end (delta: 192.9MB). Free memory was 106.5MB in the beginning and 116.1MB in the end (delta: -9.6MB). Peak memory consumption was 184.2MB. Max. memory is 16.1GB. [2025-02-05 20:25:39,847 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 201.3MB. Free memory is still 117.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 20:25:39,847 INFO L158 Benchmark]: CACSL2BoogieTranslator took 255.61ms. Allocated memory is still 142.6MB. Free memory was 105.9MB in the beginning and 91.6MB in the end (delta: 14.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-05 20:25:39,847 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.40ms. Allocated memory is still 142.6MB. Free memory was 91.6MB in the beginning and 87.5MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 20:25:39,848 INFO L158 Benchmark]: Boogie Preprocessor took 39.19ms. Allocated memory is still 142.6MB. Free memory was 87.5MB in the beginning and 80.5MB in the end (delta: 7.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 20:25:39,848 INFO L158 Benchmark]: IcfgBuilder took 450.00ms. Allocated memory is still 142.6MB. Free memory was 80.5MB in the beginning and 57.4MB in the end (delta: 23.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-05 20:25:39,848 INFO L158 Benchmark]: TraceAbstraction took 4452.42ms. Allocated memory was 142.6MB in the beginning and 335.5MB in the end (delta: 192.9MB). Free memory was 56.8MB in the beginning and 117.5MB in the end (delta: -60.6MB). Peak memory consumption was 142.3MB. Max. memory is 16.1GB. [2025-02-05 20:25:39,848 INFO L158 Benchmark]: Witness Printer took 3.84ms. Allocated memory is still 335.5MB. Free memory was 116.1MB in the beginning and 116.1MB in the end (delta: 27.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 20:25:39,849 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.28ms. Allocated memory is still 201.3MB. Free memory is still 117.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 255.61ms. Allocated memory is still 142.6MB. Free memory was 105.9MB in the beginning and 91.6MB in the end (delta: 14.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.40ms. Allocated memory is still 142.6MB. Free memory was 91.6MB in the beginning and 87.5MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 39.19ms. Allocated memory is still 142.6MB. Free memory was 87.5MB in the beginning and 80.5MB in the end (delta: 7.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 450.00ms. Allocated memory is still 142.6MB. Free memory was 80.5MB in the beginning and 57.4MB in the end (delta: 23.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 4452.42ms. Allocated memory was 142.6MB in the beginning and 335.5MB in the end (delta: 192.9MB). Free memory was 56.8MB in the beginning and 117.5MB in the end (delta: -60.6MB). Peak memory consumption was 142.3MB. Max. memory is 16.1GB. * Witness Printer took 3.84ms. Allocated memory is still 335.5MB. Free memory was 116.1MB in the beginning and 116.1MB 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 142, overapproximation of someBinaryDOUBLEComparisonOperation at line 113, overapproximation of someBinaryDOUBLEComparisonOperation at line 142, overapproximation of someBinaryDOUBLEComparisonOperation at line 111, overapproximation of someBinaryDOUBLEComparisonOperation at line 117, overapproximation of someBinaryDOUBLEComparisonOperation at line 105, overapproximation of someBinaryDOUBLEComparisonOperation at line 115, overapproximation of someBinaryDOUBLEComparisonOperation at line 107, overapproximation of someBinaryDOUBLEComparisonOperation at line 68, overapproximation of someBinaryDOUBLEComparisonOperation at line 86, overapproximation of someBinaryDOUBLEComparisonOperation at line 109, overapproximation of someBinaryDOUBLEComparisonOperation at line 90. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 2; [L23] unsigned char var_1_2 = 1; [L24] unsigned char var_1_3 = 0; [L25] unsigned char var_1_7 = 50; [L26] unsigned char var_1_8 = 0; [L27] double var_1_9 = 127.625; [L28] double var_1_10 = 256.8; [L29] double var_1_11 = 0.30000000000000004; [L30] signed long int var_1_12 = -2; [L31] double var_1_13 = 2.475; [L32] double var_1_14 = 25.2; [L33] double var_1_15 = 500.125; [L34] double var_1_16 = 10.75; [L35] double var_1_17 = 255.4; [L36] unsigned char var_1_18 = 1; [L37] unsigned char var_1_19 = 0; [L38] unsigned char var_1_20 = 100; [L39] unsigned char var_1_21 = 128; [L40] unsigned char var_1_22 = 0; [L41] unsigned char var_1_23 = 1; [L42] unsigned char var_1_24 = 8; [L43] unsigned char var_1_25 = 10; [L44] float var_1_26 = 16.8; [L45] unsigned long int var_1_27 = 64; [L46] unsigned char last_1_var_1_18 = 1; [L47] unsigned char last_1_var_1_20 = 100; VAL [isInitial=0, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L146] isInitial = 1 [L147] FCALL initially() [L148] COND TRUE 1 [L149] CALL updateLastVariables() [L138] last_1_var_1_18 = var_1_18 [L139] last_1_var_1_20 = var_1_20 VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L149] RET updateLastVariables() [L150] CALL updateVariables() [L95] var_1_2 = __VERIFIER_nondet_uchar() [L96] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L96] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L97] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L97] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L98] var_1_3 = __VERIFIER_nondet_uchar() [L99] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L99] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L100] CALL assume_abort_if_not(var_1_3 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L100] RET assume_abort_if_not(var_1_3 <= 1) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L101] var_1_8 = __VERIFIER_nondet_uchar() [L102] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_9=1021/8] [L102] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_9=1021/8] [L103] CALL assume_abort_if_not(var_1_8 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L103] RET assume_abort_if_not(var_1_8 <= 254) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L104] var_1_10 = __VERIFIER_nondet_double() [L105] CALL assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L105] RET assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L106] var_1_11 = __VERIFIER_nondet_double() [L107] CALL assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L107] RET assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L108] var_1_13 = __VERIFIER_nondet_double() [L109] CALL assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L109] RET assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L110] var_1_14 = __VERIFIER_nondet_double() [L111] CALL assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L111] RET assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L112] var_1_15 = __VERIFIER_nondet_double() [L113] CALL assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L113] RET assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L114] var_1_16 = __VERIFIER_nondet_double() [L115] CALL assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427387900e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L115] RET assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427387900e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L116] var_1_17 = __VERIFIER_nondet_double() [L117] CALL assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 4611686.018427387900e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L117] RET assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 4611686.018427387900e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L118] var_1_19 = __VERIFIER_nondet_uchar() [L119] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L119] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L120] CALL assume_abort_if_not(var_1_19 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L120] RET assume_abort_if_not(var_1_19 <= 0) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L121] var_1_21 = __VERIFIER_nondet_uchar() [L122] CALL assume_abort_if_not(var_1_21 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=-129, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=-129, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L122] RET assume_abort_if_not(var_1_21 >= 127) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=-129, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L123] CALL assume_abort_if_not(var_1_21 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=-129, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=-129, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L123] RET assume_abort_if_not(var_1_21 <= 254) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=-129, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L124] var_1_22 = __VERIFIER_nondet_uchar() [L125] CALL assume_abort_if_not(var_1_22 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=-129, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=-129, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L125] RET assume_abort_if_not(var_1_22 >= 0) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=-129, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L126] CALL assume_abort_if_not(var_1_22 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=-129, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=-129, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L126] RET assume_abort_if_not(var_1_22 <= 127) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=-129, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L127] var_1_23 = __VERIFIER_nondet_uchar() [L128] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=-129, var_1_22=0, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=-129, var_1_22=0, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L128] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=-129, var_1_22=0, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L129] CALL assume_abort_if_not(var_1_23 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=-129, var_1_22=0, var_1_23=0, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=-129, var_1_22=0, var_1_23=0, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L129] RET assume_abort_if_not(var_1_23 <= 127) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=-129, var_1_22=0, var_1_23=0, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L130] var_1_24 = __VERIFIER_nondet_uchar() [L131] CALL assume_abort_if_not(var_1_24 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=-129, var_1_22=0, var_1_23=0, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=-129, var_1_22=0, var_1_23=0, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L131] RET assume_abort_if_not(var_1_24 >= 0) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=-129, var_1_22=0, var_1_23=0, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L132] CALL assume_abort_if_not(var_1_24 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=-129, var_1_22=0, var_1_23=0, var_1_24=63, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=-129, var_1_22=0, var_1_23=0, var_1_24=63, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L132] RET assume_abort_if_not(var_1_24 <= 127) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=-129, var_1_22=0, var_1_23=0, var_1_24=63, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L133] var_1_25 = __VERIFIER_nondet_uchar() [L134] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=-129, var_1_22=0, var_1_23=0, var_1_24=63, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=-129, var_1_22=0, var_1_23=0, var_1_24=63, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L134] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=-129, var_1_22=0, var_1_23=0, var_1_24=63, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L135] CALL assume_abort_if_not(var_1_25 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=-129, var_1_22=0, var_1_23=0, var_1_24=63, var_1_25=63, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=-129, var_1_22=0, var_1_23=0, var_1_24=63, var_1_25=63, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L135] RET assume_abort_if_not(var_1_25 <= 127) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=-129, var_1_22=0, var_1_23=0, var_1_24=63, var_1_25=63, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L150] RET updateVariables() [L151] CALL step() [L51] COND TRUE last_1_var_1_18 && last_1_var_1_18 VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=-129, var_1_22=0, var_1_23=0, var_1_24=63, var_1_25=63, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L52] COND FALSE !(((((last_1_var_1_20) < ((last_1_var_1_20 * last_1_var_1_20))) ? (last_1_var_1_20) : ((last_1_var_1_20 * last_1_var_1_20)))) > last_1_var_1_20) [L55] var_1_7 = var_1_8 VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=-129, var_1_22=0, var_1_23=0, var_1_24=63, var_1_25=63, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=0, var_1_8=0, var_1_9=1021/8] [L60] COND FALSE !(\read(var_1_3)) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=-129, var_1_22=0, var_1_23=0, var_1_24=63, var_1_25=63, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=0, var_1_8=0, var_1_9=1021/8] [L65] var_1_26 = var_1_16 [L66] var_1_27 = 10u VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_16=2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=-129, var_1_22=0, var_1_23=0, var_1_24=63, var_1_25=63, var_1_26=2, var_1_27=10, var_1_2=1, var_1_3=0, var_1_7=0, var_1_8=0, var_1_9=1021/8] [L67] COND TRUE var_1_8 >= var_1_7 VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_16=2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=-129, var_1_22=0, var_1_23=0, var_1_24=63, var_1_25=63, var_1_26=2, var_1_27=10, var_1_2=1, var_1_3=0, var_1_7=0, var_1_8=0, var_1_9=1021/8] [L68] COND TRUE var_1_15 >= var_1_26 [L69] var_1_20 = (var_1_21 - ((((((((var_1_22) < (var_1_23)) ? (var_1_22) : (var_1_23)))) > (((((var_1_24) < (var_1_25)) ? (var_1_24) : (var_1_25))))) ? (((((var_1_22) < (var_1_23)) ? (var_1_22) : (var_1_23)))) : (((((var_1_24) < (var_1_25)) ? (var_1_24) : (var_1_25))))))) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_16=2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=64, var_1_21=-129, var_1_22=0, var_1_23=0, var_1_24=63, var_1_25=63, var_1_26=2, var_1_27=10, var_1_2=1, var_1_3=0, var_1_7=0, var_1_8=0, var_1_9=1021/8] [L76] COND TRUE \read(var_1_18) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_16=2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=64, var_1_21=-129, var_1_22=0, var_1_23=0, var_1_24=63, var_1_25=63, var_1_26=2, var_1_27=10, var_1_2=1, var_1_3=0, var_1_7=0, var_1_8=0, var_1_9=1021/8] [L77] COND FALSE !(! var_1_18) [L80] var_1_1 = (var_1_20 - var_1_20) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_16=2, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=64, var_1_21=-129, var_1_22=0, var_1_23=0, var_1_24=63, var_1_25=63, var_1_26=2, var_1_27=10, var_1_2=1, var_1_3=0, var_1_7=0, var_1_8=0, var_1_9=1021/8] [L85] COND TRUE var_1_27 != (var_1_8 + var_1_7) [L86] var_1_9 = ((((var_1_10) < (((((var_1_11) < (32.6)) ? (var_1_11) : (32.6))))) ? (var_1_10) : (((((var_1_11) < (32.6)) ? (var_1_11) : (32.6)))))) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=3, var_1_11=0, var_1_12=-2, var_1_16=2, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=64, var_1_21=-129, var_1_22=0, var_1_23=0, var_1_24=63, var_1_25=63, var_1_26=2, var_1_27=10, var_1_2=1, var_1_3=0, var_1_7=0, var_1_8=0, var_1_9=3] [L90] COND TRUE (var_1_13 - var_1_14) >= (var_1_15 - (var_1_16 + var_1_17)) [L91] var_1_12 = (var_1_20 + var_1_20) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=3, var_1_11=0, var_1_12=128, var_1_16=2, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=64, var_1_21=-129, var_1_22=0, var_1_23=0, var_1_24=63, var_1_25=63, var_1_26=2, var_1_27=10, var_1_2=1, var_1_3=0, var_1_7=0, var_1_8=0, var_1_9=3] [L151] RET step() [L152] CALL, EXPR property() [L142-L143] return (((((((var_1_18 ? ((! var_1_18) ? (var_1_1 == ((signed short int) (var_1_7 + 5))) : (var_1_1 == ((signed short int) (var_1_20 - var_1_20)))) : (var_1_1 == ((signed short int) var_1_20))) && ((last_1_var_1_18 && last_1_var_1_18) ? ((((((last_1_var_1_20) < ((last_1_var_1_20 * last_1_var_1_20))) ? (last_1_var_1_20) : ((last_1_var_1_20 * last_1_var_1_20)))) > last_1_var_1_20) ? (var_1_7 == ((unsigned char) var_1_8)) : (var_1_7 == ((unsigned char) var_1_8))) : (var_1_7 == ((unsigned char) var_1_8)))) && ((var_1_27 != (var_1_8 + var_1_7)) ? (var_1_9 == ((double) ((((var_1_10) < (((((var_1_11) < (32.6)) ? (var_1_11) : (32.6))))) ? (var_1_10) : (((((var_1_11) < (32.6)) ? (var_1_11) : (32.6)))))))) : (var_1_9 == ((double) ((((var_1_11) < (((((var_1_10) < 0 ) ? -(var_1_10) : (var_1_10))))) ? (var_1_11) : (((((var_1_10) < 0 ) ? -(var_1_10) : (var_1_10)))))))))) && (((var_1_13 - var_1_14) >= (var_1_15 - (var_1_16 + var_1_17))) ? (var_1_12 == ((signed long int) (var_1_20 + var_1_20))) : 1)) && (var_1_3 ? (var_1_2 ? (var_1_18 == ((unsigned char) (! var_1_19))) : 1) : 1)) && ((var_1_8 >= var_1_7) ? ((var_1_15 >= var_1_26) ? (var_1_20 == ((unsigned char) (var_1_21 - ((((((((var_1_22) < (var_1_23)) ? (var_1_22) : (var_1_23)))) > (((((var_1_24) < (var_1_25)) ? (var_1_24) : (var_1_25))))) ? (((((var_1_22) < (var_1_23)) ? (var_1_22) : (var_1_23)))) : (((((var_1_24) < (var_1_25)) ? (var_1_24) : (var_1_25))))))))) : (var_1_20 == ((unsigned char) var_1_24))) : (var_1_20 == ((unsigned char) var_1_22)))) && (var_1_26 == ((float) var_1_16))) && (var_1_27 == ((unsigned long int) 10u)) ; VAL [\result=0, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=3, var_1_11=0, var_1_12=128, var_1_16=2, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=64, var_1_21=-129, var_1_22=0, var_1_23=0, var_1_24=63, var_1_25=63, var_1_26=2, var_1_27=10, var_1_2=1, var_1_3=0, var_1_7=0, var_1_8=0, var_1_9=3] [L152] RET, EXPR property() [L152] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=3, var_1_11=0, var_1_12=128, var_1_16=2, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=64, var_1_21=-129, var_1_22=0, var_1_23=0, var_1_24=63, var_1_25=63, var_1_26=2, var_1_27=10, var_1_2=1, var_1_3=0, var_1_7=0, var_1_8=0, var_1_9=3] [L19] reach_error() VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=3, var_1_11=0, var_1_12=128, var_1_16=2, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=64, var_1_21=-129, var_1_22=0, var_1_23=0, var_1_24=63, var_1_25=63, var_1_26=2, var_1_27=10, var_1_2=1, var_1_3=0, var_1_7=0, var_1_8=0, var_1_9=3] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 70 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.3s, OverallIterations: 5, TraceHistogramMax: 25, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 267 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 267 mSDsluCounter, 711 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 334 mSDsCounter, 250 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 178 IncrementalHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 250 mSolverCounterUnsat, 377 mSDtfsCounter, 178 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 503 GetRequests, 477 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=152occurred in iteration=4, InterpolantAutomatonStates: 19, 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, 29 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 1270 NumberOfCodeBlocks, 1270 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1103 ConstructedInterpolants, 0 QuantifiedInterpolants, 2266 SizeOfPredicates, 4 NumberOfNonLiveVariables, 723 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 7 InterpolantComputations, 3 PerfectInterpolantSequences, 8262/8400 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-05 20:25:39,864 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_codestructure_dependencies_file-79.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 b1eb2d71fd6556e3c29f30215f2d9de84c58444bd8e95325c3358257aa3db343 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 20:25:41,719 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 20:25:41,797 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-02-05 20:25:41,810 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 20:25:41,811 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 20:25:41,842 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 20:25:41,842 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 20:25:41,843 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 20:25:41,843 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 20:25:41,843 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 20:25:41,843 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 20:25:41,843 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 20:25:41,844 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 20:25:41,844 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 20:25:41,844 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 20:25:41,844 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 20:25:41,844 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 20:25:41,844 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 20:25:41,844 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 20:25:41,844 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 20:25:41,844 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 20:25:41,844 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 20:25:41,844 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 20:25:41,844 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-05 20:25:41,844 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-05 20:25:41,844 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-05 20:25:41,844 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 20:25:41,844 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 20:25:41,844 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 20:25:41,844 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 20:25:41,845 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 20:25:41,845 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 20:25:41,845 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 20:25:41,845 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 20:25:41,845 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 20:25:41,845 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 20:25:41,845 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 20:25:41,845 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 20:25:41,845 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 20:25:41,845 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-05 20:25:41,845 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-05 20:25:41,845 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 20:25:41,845 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 20:25:41,845 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 20:25:41,845 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 20:25:41,845 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 -> b1eb2d71fd6556e3c29f30215f2d9de84c58444bd8e95325c3358257aa3db343 [2025-02-05 20:25:42,069 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 20:25:42,076 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 20:25:42,078 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 20:25:42,079 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 20:25:42,079 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 20:25:42,081 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-79.i [2025-02-05 20:25:43,222 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d291bdce2/2f8bc547af554a4e832d43eb5c53ca16/FLAG029d50fb2 [2025-02-05 20:25:43,471 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 20:25:43,472 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-79.i [2025-02-05 20:25:43,481 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d291bdce2/2f8bc547af554a4e832d43eb5c53ca16/FLAG029d50fb2 [2025-02-05 20:25:43,788 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d291bdce2/2f8bc547af554a4e832d43eb5c53ca16 [2025-02-05 20:25:43,790 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 20:25:43,791 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 20:25:43,792 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 20:25:43,792 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 20:25:43,795 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 20:25:43,796 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 08:25:43" (1/1) ... [2025-02-05 20:25:43,798 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ab1799c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:25:43, skipping insertion in model container [2025-02-05 20:25:43,798 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 08:25:43" (1/1) ... [2025-02-05 20:25:43,815 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 20:25:43,912 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_codestructure_dependencies_file-79.i[919,932] [2025-02-05 20:25:43,962 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 20:25:43,976 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 20:25:43,984 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_codestructure_dependencies_file-79.i[919,932] [2025-02-05 20:25:44,000 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 20:25:44,012 INFO L204 MainTranslator]: Completed translation [2025-02-05 20:25:44,012 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:25:44 WrapperNode [2025-02-05 20:25:44,012 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 20:25:44,013 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 20:25:44,013 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 20:25:44,013 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 20:25:44,017 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:25:44" (1/1) ... [2025-02-05 20:25:44,024 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:25:44" (1/1) ... [2025-02-05 20:25:44,040 INFO L138 Inliner]: procedures = 27, calls = 38, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 157 [2025-02-05 20:25:44,040 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 20:25:44,041 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 20:25:44,041 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 20:25:44,041 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 20:25:44,046 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:25:44" (1/1) ... [2025-02-05 20:25:44,046 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:25:44" (1/1) ... [2025-02-05 20:25:44,049 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:25:44" (1/1) ... [2025-02-05 20:25:44,058 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-05 20:25:44,058 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:25:44" (1/1) ... [2025-02-05 20:25:44,058 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:25:44" (1/1) ... [2025-02-05 20:25:44,064 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:25:44" (1/1) ... [2025-02-05 20:25:44,065 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:25:44" (1/1) ... [2025-02-05 20:25:44,066 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:25:44" (1/1) ... [2025-02-05 20:25:44,067 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:25:44" (1/1) ... [2025-02-05 20:25:44,069 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 20:25:44,069 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 20:25:44,069 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 20:25:44,069 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 20:25:44,075 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:25:44" (1/1) ... [2025-02-05 20:25:44,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 20:25:44,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:25:44,108 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-05 20:25:44,111 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-05 20:25:44,131 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 20:25:44,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-05 20:25:44,131 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 20:25:44,131 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 20:25:44,131 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 20:25:44,131 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 20:25:44,189 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 20:25:44,190 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 20:25:52,423 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-02-05 20:25:52,423 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 20:25:52,429 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 20:25:52,430 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 20:25:52,430 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 08:25:52 BoogieIcfgContainer [2025-02-05 20:25:52,430 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 20:25:52,431 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 20:25:52,431 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 20:25:52,438 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 20:25:52,438 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 08:25:43" (1/3) ... [2025-02-05 20:25:52,439 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f4630a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 08:25:52, skipping insertion in model container [2025-02-05 20:25:52,439 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:25:44" (2/3) ... [2025-02-05 20:25:52,439 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f4630a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 08:25:52, skipping insertion in model container [2025-02-05 20:25:52,439 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 08:25:52" (3/3) ... [2025-02-05 20:25:52,440 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-79.i [2025-02-05 20:25:52,450 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 20:25:52,452 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_dependencies_file-79.i that has 2 procedures, 70 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 20:25:52,487 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 20:25:52,494 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;@6eb3c856, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 20:25:52,495 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 20:25:52,498 INFO L276 IsEmpty]: Start isEmpty. Operand has 70 states, 42 states have (on average 1.3333333333333333) internal successors, (56), 43 states have internal predecessors, (56), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-02-05 20:25:52,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-02-05 20:25:52,528 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:25:52,529 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 20:25:52,529 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:25:52,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:25:52,534 INFO L85 PathProgramCache]: Analyzing trace with hash -1045616449, now seen corresponding path program 1 times [2025-02-05 20:25:52,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 20:25:52,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2030744392] [2025-02-05 20:25:52,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:25:52,542 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-05 20:25:52,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 20:25:52,545 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-05 20:25:52,550 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-05 20:25:52,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-02-05 20:25:52,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-02-05 20:25:52,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:25:52,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:25:52,931 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 20:25:52,937 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:25:52,967 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 620 proven. 0 refuted. 0 times theorem prover too weak. 580 trivial. 0 not checked. [2025-02-05 20:25:52,967 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 20:25:52,968 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 20:25:52,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2030744392] [2025-02-05 20:25:52,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2030744392] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:25:52,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:25:52,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 20:25:52,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364338802] [2025-02-05 20:25:52,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:25:52,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 20:25:52,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 20:25:52,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 20:25:52,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 20:25:52,991 INFO L87 Difference]: Start difference. First operand has 70 states, 42 states have (on average 1.3333333333333333) internal successors, (56), 43 states have internal predecessors, (56), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-02-05 20:25:53,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:25:53,012 INFO L93 Difference]: Finished difference Result 134 states and 232 transitions. [2025-02-05 20:25:53,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 20:25:53,014 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 157 [2025-02-05 20:25:53,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:25:53,018 INFO L225 Difference]: With dead ends: 134 [2025-02-05 20:25:53,018 INFO L226 Difference]: Without dead ends: 67 [2025-02-05 20:25:53,020 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 156 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-05 20:25:53,022 INFO L435 NwaCegarLoop]: 100 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, 100 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-05 20:25:53,026 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 20:25:53,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-02-05 20:25:53,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2025-02-05 20:25:53,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 40 states have (on average 1.25) internal successors, (50), 40 states have internal predecessors, (50), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-02-05 20:25:53,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 100 transitions. [2025-02-05 20:25:53,063 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 100 transitions. Word has length 157 [2025-02-05 20:25:53,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:25:53,065 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 100 transitions. [2025-02-05 20:25:53,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-02-05 20:25:53,065 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 100 transitions. [2025-02-05 20:25:53,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-02-05 20:25:53,068 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:25:53,069 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 20:25:53,082 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-05 20:25:53,269 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-05 20:25:53,270 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:25:53,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:25:53,271 INFO L85 PathProgramCache]: Analyzing trace with hash 703764390, now seen corresponding path program 1 times [2025-02-05 20:25:53,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 20:25:53,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [581976359] [2025-02-05 20:25:53,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:25:53,271 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-05 20:25:53,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 20:25:53,273 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-05 20:25:53,274 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-05 20:25:53,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-02-05 20:25:53,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-02-05 20:25:53,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:25:53,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:25:53,633 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 20:25:53,638 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:25:54,724 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-02-05 20:25:54,724 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 20:25:54,724 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 20:25:54,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [581976359] [2025-02-05 20:25:54,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [581976359] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:25:54,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:25:54,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 20:25:54,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053689896] [2025-02-05 20:25:54,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:25:54,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 20:25:54,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 20:25:54,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 20:25:54,726 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 20:25:54,727 INFO L87 Difference]: Start difference. First operand 67 states and 100 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-02-05 20:25:59,095 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-05 20:26:00,572 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-05 20:26:04,685 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-05 20:26:04,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:26:04,686 INFO L93 Difference]: Finished difference Result 209 states and 314 transitions. [2025-02-05 20:26:04,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 20:26:04,715 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 157 [2025-02-05 20:26:04,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:26:04,717 INFO L225 Difference]: With dead ends: 209 [2025-02-05 20:26:04,717 INFO L226 Difference]: Without dead ends: 145 [2025-02-05 20:26:04,718 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 20:26:04,718 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 77 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 53 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.9s IncrementalHoareTripleChecker+Time [2025-02-05 20:26:04,719 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 289 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 14 Invalid, 2 Unknown, 0 Unchecked, 9.9s Time] [2025-02-05 20:26:04,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2025-02-05 20:26:04,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 129. [2025-02-05 20:26:04,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 76 states have (on average 1.2236842105263157) internal successors, (93), 76 states have internal predecessors, (93), 50 states have call successors, (50), 2 states have call predecessors, (50), 2 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2025-02-05 20:26:04,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 193 transitions. [2025-02-05 20:26:04,736 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 193 transitions. Word has length 157 [2025-02-05 20:26:04,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:26:04,736 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 193 transitions. [2025-02-05 20:26:04,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-02-05 20:26:04,737 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 193 transitions. [2025-02-05 20:26:04,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-02-05 20:26:04,738 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:26:04,738 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 20:26:04,754 INFO L540 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)] Forceful destruction successful, exit code 0 [2025-02-05 20:26:04,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /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-05 20:26:04,939 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:26:04,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:26:04,940 INFO L85 PathProgramCache]: Analyzing trace with hash 208672135, now seen corresponding path program 1 times [2025-02-05 20:26:04,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 20:26:04,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [720266011] [2025-02-05 20:26:04,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:26:04,940 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-05 20:26:04,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 20:26:04,942 INFO L229 MonitoredProcess]: Starting monitored process 4 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-05 20:26:04,943 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 (4)] Waiting until timeout for monitored process [2025-02-05 20:26:04,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-02-05 20:26:05,294 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-02-05 20:26:05,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:26:05,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:26:05,309 INFO L256 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 20:26:05,312 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:26:05,404 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-02-05 20:26:05,405 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 20:26:05,406 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 20:26:05,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [720266011] [2025-02-05 20:26:05,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [720266011] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:26:05,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:26:05,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 20:26:05,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145749550] [2025-02-05 20:26:05,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:26:05,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 20:26:05,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 20:26:05,407 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 20:26:05,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 20:26:05,409 INFO L87 Difference]: Start difference. First operand 129 states and 193 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-02-05 20:26:09,541 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-05 20:26:09,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:26:09,594 INFO L93 Difference]: Finished difference Result 271 states and 401 transitions. [2025-02-05 20:26:09,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 20:26:09,595 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 159 [2025-02-05 20:26:09,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:26:09,597 INFO L225 Difference]: With dead ends: 271 [2025-02-05 20:26:09,597 INFO L226 Difference]: Without dead ends: 145 [2025-02-05 20:26:09,598 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 157 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-05 20:26:09,599 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 33 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-02-05 20:26:09,599 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 180 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2025-02-05 20:26:09,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2025-02-05 20:26:09,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 144. [2025-02-05 20:26:09,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 85 states have (on average 1.1764705882352942) internal successors, (100), 86 states have internal predecessors, (100), 54 states have call successors, (54), 4 states have call predecessors, (54), 4 states have return successors, (54), 53 states have call predecessors, (54), 54 states have call successors, (54) [2025-02-05 20:26:09,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 208 transitions. [2025-02-05 20:26:09,624 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 208 transitions. Word has length 159 [2025-02-05 20:26:09,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:26:09,625 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 208 transitions. [2025-02-05 20:26:09,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-02-05 20:26:09,626 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 208 transitions. [2025-02-05 20:26:09,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-02-05 20:26:09,630 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:26:09,630 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 20:26:09,645 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 (4)] Ended with exit code 0 [2025-02-05 20:26:09,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /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-05 20:26:09,831 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:26:09,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:26:09,831 INFO L85 PathProgramCache]: Analyzing trace with hash -1129641408, now seen corresponding path program 1 times [2025-02-05 20:26:09,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 20:26:09,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2030961726] [2025-02-05 20:26:09,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:26:09,832 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-05 20:26:09,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 20:26:09,835 INFO L229 MonitoredProcess]: Starting monitored process 5 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-05 20:26:09,835 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 (5)] Waiting until timeout for monitored process [2025-02-05 20:26:09,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-02-05 20:26:10,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-02-05 20:26:10,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:26:10,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:26:10,170 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-05 20:26:10,173 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:26:10,845 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 612 proven. 30 refuted. 0 times theorem prover too weak. 558 trivial. 0 not checked. [2025-02-05 20:26:10,846 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 20:26:11,567 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 42 proven. 30 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2025-02-05 20:26:11,568 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 20:26:11,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2030961726] [2025-02-05 20:26:11,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2030961726] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 20:26:11,568 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-05 20:26:11,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2025-02-05 20:26:11,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181088956] [2025-02-05 20:26:11,568 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-05 20:26:11,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 20:26:11,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 20:26:11,569 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 20:26:11,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-02-05 20:26:11,570 INFO L87 Difference]: Start difference. First operand 144 states and 208 transitions. Second operand has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 2 states have call successors, (35), 2 states have call predecessors, (35), 4 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2025-02-05 20:26:16,683 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-05 20:26:19,910 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.23s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-05 20:26:19,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:26:19,965 INFO L93 Difference]: Finished difference Result 232 states and 325 transitions. [2025-02-05 20:26:19,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 20:26:19,997 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 2 states have call successors, (35), 2 states have call predecessors, (35), 4 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) Word has length 160 [2025-02-05 20:26:19,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:26:19,999 INFO L225 Difference]: With dead ends: 232 [2025-02-05 20:26:19,999 INFO L226 Difference]: Without dead ends: 164 [2025-02-05 20:26:20,000 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 311 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2025-02-05 20:26:20,000 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 120 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 111 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.1s IncrementalHoareTripleChecker+Time [2025-02-05 20:26:20,000 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 144 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 143 Invalid, 1 Unknown, 0 Unchecked, 8.1s Time] [2025-02-05 20:26:20,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2025-02-05 20:26:20,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 152. [2025-02-05 20:26:20,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 91 states have (on average 1.1428571428571428) internal successors, (104), 92 states have internal predecessors, (104), 54 states have call successors, (54), 6 states have call predecessors, (54), 6 states have return successors, (54), 53 states have call predecessors, (54), 54 states have call successors, (54) [2025-02-05 20:26:20,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 212 transitions. [2025-02-05 20:26:20,028 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 212 transitions. Word has length 160 [2025-02-05 20:26:20,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:26:20,030 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 212 transitions. [2025-02-05 20:26:20,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 2 states have call successors, (35), 2 states have call predecessors, (35), 4 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2025-02-05 20:26:20,030 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 212 transitions. [2025-02-05 20:26:20,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-02-05 20:26:20,032 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:26:20,032 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 20:26:20,047 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 (5)] Ended with exit code 0 [2025-02-05 20:26:20,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /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-05 20:26:20,233 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:26:20,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:26:20,234 INFO L85 PathProgramCache]: Analyzing trace with hash -510011748, now seen corresponding path program 1 times [2025-02-05 20:26:20,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 20:26:20,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1389356197] [2025-02-05 20:26:20,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:26:20,234 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-05 20:26:20,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 20:26:20,236 INFO L229 MonitoredProcess]: Starting monitored process 6 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-05 20:26:20,237 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 (6)] Waiting until timeout for monitored process [2025-02-05 20:26:20,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-02-05 20:26:20,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-02-05 20:26:20,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:26:20,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:26:20,596 INFO L256 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-02-05 20:26:20,601 INFO L279 TraceCheckSpWp]: Computing forward predicates...