./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-6.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_normal_file-6.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 14d46b3452c5154f69b317613614954cdc9bf43a13d2d7e7de582291df0d6a41 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 20:36:48,053 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 20:36:48,093 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:36:48,096 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 20:36:48,097 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 20:36:48,110 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 20:36:48,111 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 20:36:48,111 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 20:36:48,111 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 20:36:48,111 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 20:36:48,111 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 20:36:48,111 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 20:36:48,111 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 20:36:48,111 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 20:36:48,112 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 20:36:48,112 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 20:36:48,112 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 20:36:48,112 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 20:36:48,112 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 20:36:48,112 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 20:36:48,112 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 20:36:48,112 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 20:36:48,112 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 20:36:48,112 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 20:36:48,112 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 20:36:48,113 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 20:36:48,113 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 20:36:48,113 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 20:36:48,113 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 20:36:48,113 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 20:36:48,113 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 20:36:48,113 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 20:36:48,113 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 20:36:48,113 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 20:36:48,113 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 20:36:48,114 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 20:36:48,114 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 20:36:48,114 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 20:36:48,114 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 20:36:48,114 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 20:36:48,114 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 20:36:48,114 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 20:36:48,114 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 20:36:48,114 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 -> 14d46b3452c5154f69b317613614954cdc9bf43a13d2d7e7de582291df0d6a41 [2025-02-05 20:36:48,343 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 20:36:48,352 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 20:36:48,354 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 20:36:48,356 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 20:36:48,356 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 20:36:48,357 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-6.i [2025-02-05 20:36:49,452 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/484538a39/fc59f6eb8c3347c8b80f2861eb8b31e4/FLAG8f1454b13 [2025-02-05 20:36:49,729 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 20:36:49,730 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-6.i [2025-02-05 20:36:49,738 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/484538a39/fc59f6eb8c3347c8b80f2861eb8b31e4/FLAG8f1454b13 [2025-02-05 20:36:50,040 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/484538a39/fc59f6eb8c3347c8b80f2861eb8b31e4 [2025-02-05 20:36:50,042 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 20:36:50,045 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 20:36:50,046 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 20:36:50,046 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 20:36:50,049 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 20:36:50,050 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 08:36:50" (1/1) ... [2025-02-05 20:36:50,050 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24416f5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:36:50, skipping insertion in model container [2025-02-05 20:36:50,050 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 08:36:50" (1/1) ... [2025-02-05 20:36:50,065 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 20:36:50,195 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_normal_file-6.i[912,925] [2025-02-05 20:36:50,241 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 20:36:50,249 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 20:36:50,256 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_normal_file-6.i[912,925] [2025-02-05 20:36:50,280 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 20:36:50,298 INFO L204 MainTranslator]: Completed translation [2025-02-05 20:36:50,299 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:36:50 WrapperNode [2025-02-05 20:36:50,299 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 20:36:50,300 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 20:36:50,300 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 20:36:50,300 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 20:36:50,304 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:36:50" (1/1) ... [2025-02-05 20:36:50,315 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:36:50" (1/1) ... [2025-02-05 20:36:50,338 INFO L138 Inliner]: procedures = 26, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 128 [2025-02-05 20:36:50,342 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 20:36:50,343 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 20:36:50,343 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 20:36:50,343 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 20:36:50,349 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:36:50" (1/1) ... [2025-02-05 20:36:50,350 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:36:50" (1/1) ... [2025-02-05 20:36:50,352 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:36:50" (1/1) ... [2025-02-05 20:36:50,366 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:36:50,366 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:36:50" (1/1) ... [2025-02-05 20:36:50,367 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:36:50" (1/1) ... [2025-02-05 20:36:50,374 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:36:50" (1/1) ... [2025-02-05 20:36:50,375 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:36:50" (1/1) ... [2025-02-05 20:36:50,376 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:36:50" (1/1) ... [2025-02-05 20:36:50,377 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:36:50" (1/1) ... [2025-02-05 20:36:50,379 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 20:36:50,383 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 20:36:50,383 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 20:36:50,383 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 20:36:50,384 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:36:50" (1/1) ... [2025-02-05 20:36:50,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 20:36:50,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:36:50,409 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:36:50,412 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:36:50,428 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 20:36:50,428 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 20:36:50,428 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 20:36:50,428 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 20:36:50,429 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 20:36:50,429 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 20:36:50,484 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 20:36:50,485 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 20:36:50,702 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-02-05 20:36:50,702 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 20:36:50,712 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 20:36:50,712 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 20:36:50,712 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 08:36:50 BoogieIcfgContainer [2025-02-05 20:36:50,713 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 20:36:50,718 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 20:36:50,718 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 20:36:50,721 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 20:36:50,722 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 08:36:50" (1/3) ... [2025-02-05 20:36:50,722 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a9fe36f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 08:36:50, skipping insertion in model container [2025-02-05 20:36:50,723 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:36:50" (2/3) ... [2025-02-05 20:36:50,724 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a9fe36f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 08:36:50, skipping insertion in model container [2025-02-05 20:36:50,724 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 08:36:50" (3/3) ... [2025-02-05 20:36:50,725 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_normal_file-6.i [2025-02-05 20:36:50,734 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 20:36:50,736 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_normal_file-6.i that has 2 procedures, 60 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 20:36:50,782 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 20:36:50,793 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;@32c90f28, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 20:36:50,793 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 20:36:50,797 INFO L276 IsEmpty]: Start isEmpty. Operand has 60 states, 38 states have (on average 1.3421052631578947) internal successors, (51), 39 states have internal predecessors, (51), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-02-05 20:36:50,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-02-05 20:36:50,807 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:36:50,808 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:36:50,808 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:36:50,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:36:50,813 INFO L85 PathProgramCache]: Analyzing trace with hash 1591482478, now seen corresponding path program 1 times [2025-02-05 20:36:50,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:36:50,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056506538] [2025-02-05 20:36:50,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:36:50,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:36:50,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-05 20:36:50,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-05 20:36:50,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:36:50,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:36:51,040 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2025-02-05 20:36:51,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:36:51,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056506538] [2025-02-05 20:36:51,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056506538] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 20:36:51,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1427178181] [2025-02-05 20:36:51,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:36:51,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:36:51,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:36:51,047 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:36:51,048 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:36:51,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-05 20:36:51,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-05 20:36:51,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:36:51,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:36:51,158 INFO L256 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 20:36:51,163 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:36:51,182 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2025-02-05 20:36:51,183 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 20:36:51,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1427178181] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:36:51,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 20:36:51,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-05 20:36:51,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971825739] [2025-02-05 20:36:51,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:36:51,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 20:36:51,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:36:51,208 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 20:36:51,208 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 20:36:51,210 INFO L87 Difference]: Start difference. First operand has 60 states, 38 states have (on average 1.3421052631578947) internal successors, (51), 39 states have internal predecessors, (51), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-02-05 20:36:51,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:36:51,232 INFO L93 Difference]: Finished difference Result 114 states and 192 transitions. [2025-02-05 20:36:51,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 20:36:51,234 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 123 [2025-02-05 20:36:51,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:36:51,238 INFO L225 Difference]: With dead ends: 114 [2025-02-05 20:36:51,238 INFO L226 Difference]: Without dead ends: 57 [2025-02-05 20:36:51,240 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 124 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:36:51,242 INFO L435 NwaCegarLoop]: 84 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, 84 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:36:51,242 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 20:36:51,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-02-05 20:36:51,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2025-02-05 20:36:51,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 36 states have internal predecessors, (46), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-02-05 20:36:51,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 84 transitions. [2025-02-05 20:36:51,269 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 84 transitions. Word has length 123 [2025-02-05 20:36:51,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:36:51,271 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 84 transitions. [2025-02-05 20:36:51,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-02-05 20:36:51,271 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 84 transitions. [2025-02-05 20:36:51,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-02-05 20:36:51,274 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:36:51,275 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:36:51,285 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:36:51,475 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:36:51,476 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:36:51,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:36:51,477 INFO L85 PathProgramCache]: Analyzing trace with hash 598702991, now seen corresponding path program 1 times [2025-02-05 20:36:51,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:36:51,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851249876] [2025-02-05 20:36:51,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:36:51,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:36:51,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-05 20:36:51,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-05 20:36:51,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:36:51,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:36:52,270 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 51 proven. 3 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2025-02-05 20:36:52,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:36:52,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851249876] [2025-02-05 20:36:52,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851249876] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 20:36:52,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1281593853] [2025-02-05 20:36:52,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:36:52,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:36:52,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:36:52,274 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:36:52,274 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:36:52,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-05 20:36:52,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-05 20:36:52,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:36:52,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:36:52,366 INFO L256 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-05 20:36:52,369 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:36:52,464 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 120 proven. 3 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-02-05 20:36:52,464 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 20:36:52,742 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 51 proven. 3 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2025-02-05 20:36:52,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1281593853] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 20:36:52,743 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 20:36:52,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2025-02-05 20:36:52,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54506340] [2025-02-05 20:36:52,743 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 20:36:52,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 20:36:52,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:36:52,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 20:36:52,746 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-02-05 20:36:52,746 INFO L87 Difference]: Start difference. First operand 57 states and 84 transitions. Second operand has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 2 states have call successors, (20), 2 states have call predecessors, (20), 4 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-02-05 20:36:52,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:36:52,996 INFO L93 Difference]: Finished difference Result 117 states and 170 transitions. [2025-02-05 20:36:52,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 20:36:52,998 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 2 states have call successors, (20), 2 states have call predecessors, (20), 4 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 123 [2025-02-05 20:36:53,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:36:53,000 INFO L225 Difference]: With dead ends: 117 [2025-02-05 20:36:53,002 INFO L226 Difference]: Without dead ends: 63 [2025-02-05 20:36:53,003 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 243 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2025-02-05 20:36:53,003 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 128 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 20:36:53,004 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 139 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 20:36:53,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-02-05 20:36:53,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 61. [2025-02-05 20:36:53,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 39 states have internal predecessors, (48), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-02-05 20:36:53,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 86 transitions. [2025-02-05 20:36:53,021 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 86 transitions. Word has length 123 [2025-02-05 20:36:53,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:36:53,022 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 86 transitions. [2025-02-05 20:36:53,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 2 states have call successors, (20), 2 states have call predecessors, (20), 4 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-02-05 20:36:53,022 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 86 transitions. [2025-02-05 20:36:53,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-02-05 20:36:53,023 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:36:53,023 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:36:53,033 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-05 20:36:53,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:36:53,224 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:36:53,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:36:53,224 INFO L85 PathProgramCache]: Analyzing trace with hash 1409537750, now seen corresponding path program 1 times [2025-02-05 20:36:53,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:36:53,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045694566] [2025-02-05 20:36:53,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:36:53,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:36:53,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-02-05 20:36:53,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-02-05 20:36:53,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:36:53,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-05 20:36:53,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [829924784] [2025-02-05 20:36:53,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:36:53,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:36:53,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:36:53,319 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:36:53,321 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:36:53,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-02-05 20:36:53,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-02-05 20:36:53,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:36:53,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 20:36:53,395 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-05 20:36:53,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-02-05 20:36:53,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-02-05 20:36:53,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:36:53,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 20:36:53,488 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-05 20:36:53,488 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-05 20:36:53,489 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-05 20:36:53,500 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:36:53,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:36:53,695 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-02-05 20:36:53,739 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-05 20:36:53,741 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 08:36:53 BoogieIcfgContainer [2025-02-05 20:36:53,742 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-05 20:36:53,742 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-05 20:36:53,742 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-05 20:36:53,742 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-05 20:36:53,743 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 08:36:50" (3/4) ... [2025-02-05 20:36:53,747 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-05 20:36:53,748 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-05 20:36:53,748 INFO L158 Benchmark]: Toolchain (without parser) took 3704.04ms. Allocated memory is still 167.8MB. Free memory was 133.2MB in the beginning and 74.6MB in the end (delta: 58.5MB). Peak memory consumption was 57.4MB. Max. memory is 16.1GB. [2025-02-05 20:36:53,749 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 201.3MB. Free memory is still 128.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 20:36:53,749 INFO L158 Benchmark]: CACSL2BoogieTranslator took 253.60ms. Allocated memory is still 167.8MB. Free memory was 133.2MB in the beginning and 119.7MB in the end (delta: 13.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-05 20:36:53,750 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.35ms. Allocated memory is still 167.8MB. Free memory was 119.7MB in the beginning and 117.2MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 20:36:53,750 INFO L158 Benchmark]: Boogie Preprocessor took 39.39ms. Allocated memory is still 167.8MB. Free memory was 117.2MB in the beginning and 114.7MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 20:36:53,750 INFO L158 Benchmark]: IcfgBuilder took 329.77ms. Allocated memory is still 167.8MB. Free memory was 114.7MB in the beginning and 97.1MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-05 20:36:53,750 INFO L158 Benchmark]: TraceAbstraction took 3023.94ms. Allocated memory is still 167.8MB. Free memory was 96.7MB in the beginning and 74.7MB in the end (delta: 22.1MB). Peak memory consumption was 23.8MB. Max. memory is 16.1GB. [2025-02-05 20:36:53,751 INFO L158 Benchmark]: Witness Printer took 5.49ms. Allocated memory is still 167.8MB. Free memory was 74.7MB in the beginning and 74.6MB in the end (delta: 33.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 20:36:53,752 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.29ms. Allocated memory is still 201.3MB. Free memory is still 128.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 253.60ms. Allocated memory is still 167.8MB. Free memory was 133.2MB in the beginning and 119.7MB in the end (delta: 13.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.35ms. Allocated memory is still 167.8MB. Free memory was 119.7MB in the beginning and 117.2MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 39.39ms. Allocated memory is still 167.8MB. Free memory was 117.2MB in the beginning and 114.7MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 329.77ms. Allocated memory is still 167.8MB. Free memory was 114.7MB in the beginning and 97.1MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 3023.94ms. Allocated memory is still 167.8MB. Free memory was 96.7MB in the beginning and 74.7MB in the end (delta: 22.1MB). Peak memory consumption was 23.8MB. Max. memory is 16.1GB. * Witness Printer took 5.49ms. Allocated memory is still 167.8MB. Free memory was 74.7MB in the beginning and 74.6MB in the end (delta: 33.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 106, overapproximation of someBinaryFLOATComparisonOperation at line 104, overapproximation of someBinaryFLOATComparisonOperation at line 114, overapproximation of someBinaryDOUBLEComparisonOperation at line 93, overapproximation of someBinaryDOUBLEComparisonOperation at line 62, overapproximation of someBinaryDOUBLEComparisonOperation at line 71, overapproximation of someBinaryDOUBLEComparisonOperation at line 89, overapproximation of someBinaryDOUBLEComparisonOperation at line 91, overapproximation of someBinaryDOUBLEComparisonOperation at line 114, overapproximation of someBinaryArithmeticFLOAToperation at line 58. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 100.25; [L23] unsigned char var_1_2 = 0; [L24] unsigned char var_1_3 = 8; [L25] unsigned char var_1_4 = 0; [L26] double var_1_5 = 1.9; [L27] double var_1_6 = 7.5; [L28] double var_1_7 = 64.25; [L29] signed long int var_1_8 = 2; [L30] signed long int var_1_9 = 1000000000; [L31] signed long int var_1_10 = 1000000000; [L32] signed long int var_1_11 = 1957998270; [L33] float var_1_12 = 50.25; [L34] float var_1_13 = 9.8; [L35] float var_1_14 = 25.5; [L36] float var_1_15 = 3.5; [L37] signed long int var_1_16 = -500; [L38] unsigned char var_1_17 = 1; [L39] unsigned char var_1_18 = 1; [L40] unsigned char var_1_19 = 0; VAL [isInitial=0, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_3=8, var_1_4=0, var_1_5=19/10, var_1_6=15/2, var_1_7=257/4, var_1_8=2, var_1_9=1000000000] [L118] isInitial = 1 [L119] FCALL initially() [L120] COND TRUE 1 [L121] FCALL updateLastVariables() [L122] CALL updateVariables() [L79] var_1_2 = __VERIFIER_nondet_uchar() [L80] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_3=8, var_1_4=0, var_1_5=19/10, var_1_6=15/2, var_1_7=257/4, var_1_8=2, var_1_9=1000000000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_3=8, var_1_4=0, var_1_5=19/10, var_1_6=15/2, var_1_7=257/4, var_1_8=2, var_1_9=1000000000] [L80] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_3=8, var_1_4=0, var_1_5=19/10, var_1_6=15/2, var_1_7=257/4, var_1_8=2, var_1_9=1000000000] [L81] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_3=8, var_1_4=0, var_1_5=19/10, var_1_6=15/2, var_1_7=257/4, var_1_8=2, var_1_9=1000000000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_3=8, var_1_4=0, var_1_5=19/10, var_1_6=15/2, var_1_7=257/4, var_1_8=2, var_1_9=1000000000] [L81] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_3=8, var_1_4=0, var_1_5=19/10, var_1_6=15/2, var_1_7=257/4, var_1_8=2, var_1_9=1000000000] [L82] var_1_3 = __VERIFIER_nondet_uchar() [L83] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_4=0, var_1_5=19/10, var_1_6=15/2, var_1_7=257/4, var_1_8=2, var_1_9=1000000000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_4=0, var_1_5=19/10, var_1_6=15/2, var_1_7=257/4, var_1_8=2, var_1_9=1000000000] [L83] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_4=0, var_1_5=19/10, var_1_6=15/2, var_1_7=257/4, var_1_8=2, var_1_9=1000000000] [L84] CALL assume_abort_if_not(var_1_3 <= 255) VAL [\old(cond)=1, isInitial=1, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_4=0, var_1_5=19/10, var_1_6=15/2, var_1_7=257/4, var_1_8=2, var_1_9=1000000000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_4=0, var_1_5=19/10, var_1_6=15/2, var_1_7=257/4, var_1_8=2, var_1_9=1000000000] [L84] RET assume_abort_if_not(var_1_3 <= 255) VAL [isInitial=1, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_4=0, var_1_5=19/10, var_1_6=15/2, var_1_7=257/4, var_1_8=2, var_1_9=1000000000] [L85] var_1_4 = __VERIFIER_nondet_uchar() [L86] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_5=19/10, var_1_6=15/2, var_1_7=257/4, var_1_8=2, var_1_9=1000000000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_5=19/10, var_1_6=15/2, var_1_7=257/4, var_1_8=2, var_1_9=1000000000] [L86] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_5=19/10, var_1_6=15/2, var_1_7=257/4, var_1_8=2, var_1_9=1000000000] [L87] CALL assume_abort_if_not(var_1_4 <= 255) VAL [\old(cond)=1, isInitial=1, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_5=19/10, var_1_6=15/2, var_1_7=257/4, var_1_8=2, var_1_9=1000000000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_5=19/10, var_1_6=15/2, var_1_7=257/4, var_1_8=2, var_1_9=1000000000] [L87] RET assume_abort_if_not(var_1_4 <= 255) VAL [isInitial=1, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_5=19/10, var_1_6=15/2, var_1_7=257/4, var_1_8=2, var_1_9=1000000000] [L88] var_1_5 = __VERIFIER_nondet_double() [L89] CALL assume_abort_if_not((var_1_5 >= -461168.6018427382800e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 4611686.018427382800e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_6=15/2, var_1_7=257/4, var_1_8=2, var_1_9=1000000000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_6=15/2, var_1_7=257/4, var_1_8=2, var_1_9=1000000000] [L89] RET assume_abort_if_not((var_1_5 >= -461168.6018427382800e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 4611686.018427382800e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_6=15/2, var_1_7=257/4, var_1_8=2, var_1_9=1000000000] [L90] var_1_6 = __VERIFIER_nondet_double() [L91] CALL assume_abort_if_not((var_1_6 >= -461168.6018427382800e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 4611686.018427382800e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_7=257/4, var_1_8=2, var_1_9=1000000000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_7=257/4, var_1_8=2, var_1_9=1000000000] [L91] RET assume_abort_if_not((var_1_6 >= -461168.6018427382800e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 4611686.018427382800e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_7=257/4, var_1_8=2, var_1_9=1000000000] [L92] var_1_7 = __VERIFIER_nondet_double() [L93] CALL assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_8=2, var_1_9=1000000000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_8=2, var_1_9=1000000000] [L93] RET assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_8=2, var_1_9=1000000000] [L94] var_1_9 = __VERIFIER_nondet_long() [L95] CALL assume_abort_if_not(var_1_9 >= 536870911) VAL [\old(cond)=1, isInitial=1, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_8=2, var_1_9=1073741823] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_8=2, var_1_9=1073741823] [L95] RET assume_abort_if_not(var_1_9 >= 536870911) VAL [isInitial=1, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_8=2, var_1_9=1073741823] [L96] CALL assume_abort_if_not(var_1_9 <= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_8=2, var_1_9=1073741823] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_8=2, var_1_9=1073741823] [L96] RET assume_abort_if_not(var_1_9 <= 1073741823) VAL [isInitial=1, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_8=2, var_1_9=1073741823] [L97] var_1_10 = __VERIFIER_nondet_long() [L98] CALL assume_abort_if_not(var_1_10 >= 536870911) VAL [\old(cond)=1, isInitial=1, var_1_10=1073741822, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_8=2, var_1_9=1073741823] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1073741822, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_8=2, var_1_9=1073741823] [L98] RET assume_abort_if_not(var_1_10 >= 536870911) VAL [isInitial=1, var_1_10=1073741822, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_8=2, var_1_9=1073741823] [L99] CALL assume_abort_if_not(var_1_10 <= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=1073741822, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_8=2, var_1_9=1073741823] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1073741822, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_8=2, var_1_9=1073741823] [L99] RET assume_abort_if_not(var_1_10 <= 1073741823) VAL [isInitial=1, var_1_10=1073741822, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_8=2, var_1_9=1073741823] [L100] var_1_11 = __VERIFIER_nondet_long() [L101] CALL assume_abort_if_not(var_1_11 >= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=1073741822, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_8=2, var_1_9=1073741823] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1073741822, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_8=2, var_1_9=1073741823] [L101] RET assume_abort_if_not(var_1_11 >= 1073741823) VAL [isInitial=1, var_1_10=1073741822, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_8=2, var_1_9=1073741823] [L102] CALL assume_abort_if_not(var_1_11 <= 2147483646) VAL [\old(cond)=1, isInitial=1, var_1_10=1073741822, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_8=2, var_1_9=1073741823] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1073741822, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_8=2, var_1_9=1073741823] [L102] RET assume_abort_if_not(var_1_11 <= 2147483646) VAL [isInitial=1, var_1_10=1073741822, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_8=2, var_1_9=1073741823] [L103] var_1_14 = __VERIFIER_nondet_float() [L104] CALL assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 2305843.009213691390e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1073741822, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_8=2, var_1_9=1073741823] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1073741822, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_8=2, var_1_9=1073741823] [L104] RET assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 2305843.009213691390e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1073741822, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_8=2, var_1_9=1073741823] [L105] var_1_15 = __VERIFIER_nondet_float() [L106] CALL assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 2305843.009213691390e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1073741822, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_8=2, var_1_9=1073741823] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1073741822, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_8=2, var_1_9=1073741823] [L106] RET assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 2305843.009213691390e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1073741822, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_8=2, var_1_9=1073741823] [L107] var_1_18 = __VERIFIER_nondet_uchar() [L108] CALL assume_abort_if_not(var_1_18 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=1073741822, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_8=2, var_1_9=1073741823] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1073741822, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_8=2, var_1_9=1073741823] [L108] RET assume_abort_if_not(var_1_18 >= 1) VAL [isInitial=1, var_1_10=1073741822, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_8=2, var_1_9=1073741823] [L109] CALL assume_abort_if_not(var_1_18 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=1073741822, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_8=2, var_1_9=1073741823] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1073741822, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_8=2, var_1_9=1073741823] [L109] RET assume_abort_if_not(var_1_18 <= 1) VAL [isInitial=1, var_1_10=1073741822, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_8=2, var_1_9=1073741823] [L122] RET updateVariables() [L123] CALL step() [L44] COND FALSE !(\read(var_1_2)) [L51] var_1_1 = var_1_5 VAL [isInitial=1, var_1_10=1073741822, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=2, var_1_2=0, var_1_5=2, var_1_8=2, var_1_9=1073741823] [L53] var_1_8 = (((var_1_9 + var_1_10) - var_1_3) - (var_1_11 - ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))))) VAL [isInitial=1, var_1_10=1073741822, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=2, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=2, var_1_8=1073741822, var_1_9=1073741823] [L54] COND TRUE ((((var_1_3) < (var_1_9)) ? (var_1_3) : (var_1_9))) >= (var_1_4 - var_1_11) [L55] var_1_12 = var_1_7 VAL [isInitial=1, var_1_10=1073741822, var_1_11=1073741823, var_1_12=3, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=2, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=2, var_1_7=3, var_1_8=1073741822, var_1_9=1073741823] [L57] COND TRUE var_1_8 < var_1_11 [L58] var_1_13 = ((7.3868261718112563E18f - (var_1_14 + var_1_15)) - 5.4f) VAL [isInitial=1, var_1_10=1073741822, var_1_11=1073741823, var_1_12=3, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=2, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=2, var_1_7=3, var_1_8=1073741822, var_1_9=1073741823] [L62] COND FALSE !((((((- var_1_15)) > ((var_1_13 * var_1_6))) ? ((- var_1_15)) : ((var_1_13 * var_1_6)))) < var_1_5) VAL [isInitial=1, var_1_10=1073741822, var_1_11=1073741823, var_1_12=3, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=2, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=2, var_1_7=3, var_1_8=1073741822, var_1_9=1073741823] [L69] var_1_17 = (((var_1_3 * var_1_9) >= ((((var_1_16) > (var_1_8)) ? (var_1_16) : (var_1_8)))) || var_1_18) VAL [isInitial=1, var_1_10=1073741822, var_1_11=1073741823, var_1_12=3, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=2, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=2, var_1_7=3, var_1_8=1073741822, var_1_9=1073741823] [L70] COND TRUE \read(var_1_17) VAL [isInitial=1, var_1_10=1073741822, var_1_11=1073741823, var_1_12=3, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=2, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=2, var_1_7=3, var_1_8=1073741822, var_1_9=1073741823] [L71] COND TRUE var_1_7 > (((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5))) * (var_1_13 * 63.375)) [L72] var_1_19 = var_1_18 VAL [isInitial=1, var_1_10=1073741822, var_1_11=1073741823, var_1_12=3, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=2, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=2, var_1_7=3, var_1_8=1073741822, var_1_9=1073741823] [L123] RET step() [L124] CALL, EXPR property() [L114-L115] return ((((((var_1_2 ? ((var_1_3 >= var_1_4) ? (var_1_1 == ((double) (var_1_5 + var_1_6))) : (var_1_1 == ((double) (4.125 - var_1_7)))) : (var_1_1 == ((double) var_1_5))) && (var_1_8 == ((signed long int) (((var_1_9 + var_1_10) - var_1_3) - (var_1_11 - ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4)))))))) && ((((((var_1_3) < (var_1_9)) ? (var_1_3) : (var_1_9))) >= (var_1_4 - var_1_11)) ? (var_1_12 == ((float) var_1_7)) : 1)) && ((var_1_8 < var_1_11) ? (var_1_13 == ((float) ((7.3868261718112563E18f - (var_1_14 + var_1_15)) - 5.4f))) : (var_1_13 == ((float) (var_1_15 + ((((var_1_14) < (var_1_5)) ? (var_1_14) : (var_1_5)))))))) && (((((((- var_1_15)) > ((var_1_13 * var_1_6))) ? ((- var_1_15)) : ((var_1_13 * var_1_6)))) < var_1_5) ? ((var_1_11 != ((((var_1_8) < (var_1_10)) ? (var_1_8) : (var_1_10)))) ? (var_1_2 ? (var_1_16 == ((signed long int) var_1_3)) : 1) : 1) : 1)) && (var_1_17 == ((unsigned char) (((var_1_3 * var_1_9) >= ((((var_1_16) > (var_1_8)) ? (var_1_16) : (var_1_8)))) || var_1_18)))) && (var_1_17 ? ((var_1_7 > (((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5))) * (var_1_13 * 63.375))) ? (var_1_19 == ((unsigned char) var_1_18)) : 1) : (var_1_19 == ((unsigned char) var_1_18))) ; VAL [\result=0, isInitial=1, var_1_10=1073741822, var_1_11=1073741823, var_1_12=3, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=2, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=2, var_1_7=3, var_1_8=1073741822, var_1_9=1073741823] [L124] RET, EXPR property() [L124] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=1073741822, var_1_11=1073741823, var_1_12=3, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=2, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=2, var_1_7=3, var_1_8=1073741822, var_1_9=1073741823] [L19] reach_error() VAL [isInitial=1, var_1_10=1073741822, var_1_11=1073741823, var_1_12=3, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=2, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=2, var_1_7=3, var_1_8=1073741822, var_1_9=1073741823] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 60 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.9s, OverallIterations: 3, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 129 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 128 mSDsluCounter, 223 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 81 mSDsCounter, 115 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 115 IncrementalHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 115 mSolverCounterUnsat, 142 mSDtfsCounter, 115 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 382 GetRequests, 367 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=61occurred in iteration=2, InterpolantAutomatonStates: 11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 740 NumberOfCodeBlocks, 740 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 610 ConstructedInterpolants, 0 QuantifiedInterpolants, 832 SizeOfPredicates, 7 NumberOfNonLiveVariables, 564 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 5 InterpolantComputations, 1 PerfectInterpolantSequences, 3375/3420 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:36:53,777 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_normal_file-6.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 14d46b3452c5154f69b317613614954cdc9bf43a13d2d7e7de582291df0d6a41 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 20:36:55,694 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 20:36:55,801 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:36:55,809 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 20:36:55,809 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 20:36:55,833 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 20:36:55,833 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 20:36:55,833 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 20:36:55,833 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 20:36:55,833 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 20:36:55,834 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 20:36:55,834 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 20:36:55,834 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 20:36:55,834 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 20:36:55,834 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 20:36:55,834 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 20:36:55,834 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 20:36:55,834 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 20:36:55,835 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 20:36:55,835 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 20:36:55,835 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 20:36:55,835 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 20:36:55,835 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 20:36:55,835 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-05 20:36:55,835 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-05 20:36:55,835 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-05 20:36:55,835 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 20:36:55,835 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 20:36:55,835 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 20:36:55,835 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 20:36:55,836 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 20:36:55,836 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 20:36:55,836 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 20:36:55,836 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 20:36:55,836 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 20:36:55,836 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 20:36:55,836 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 20:36:55,836 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 20:36:55,836 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 20:36:55,836 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-05 20:36:55,836 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-05 20:36:55,836 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 20:36:55,837 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 20:36:55,837 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 20:36:55,837 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 20:36:55,837 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 -> 14d46b3452c5154f69b317613614954cdc9bf43a13d2d7e7de582291df0d6a41 [2025-02-05 20:36:56,078 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 20:36:56,086 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 20:36:56,088 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 20:36:56,089 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 20:36:56,089 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 20:36:56,089 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-6.i [2025-02-05 20:36:57,251 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/010fa7e51/d0d5d375a7d5428cbef4a2da586b037e/FLAG01150d2b0 [2025-02-05 20:36:57,478 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 20:36:57,479 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-6.i [2025-02-05 20:36:57,485 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/010fa7e51/d0d5d375a7d5428cbef4a2da586b037e/FLAG01150d2b0 [2025-02-05 20:36:57,848 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/010fa7e51/d0d5d375a7d5428cbef4a2da586b037e [2025-02-05 20:36:57,851 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 20:36:57,852 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 20:36:57,853 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 20:36:57,854 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 20:36:57,856 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 20:36:57,857 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 08:36:57" (1/1) ... [2025-02-05 20:36:57,858 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@133b921d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:36:57, skipping insertion in model container [2025-02-05 20:36:57,859 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 08:36:57" (1/1) ... [2025-02-05 20:36:57,874 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 20:36:57,974 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_normal_file-6.i[912,925] [2025-02-05 20:36:58,024 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 20:36:58,039 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 20:36:58,048 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_normal_file-6.i[912,925] [2025-02-05 20:36:58,065 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 20:36:58,078 INFO L204 MainTranslator]: Completed translation [2025-02-05 20:36:58,079 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:36:58 WrapperNode [2025-02-05 20:36:58,080 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 20:36:58,080 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 20:36:58,080 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 20:36:58,081 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 20:36:58,085 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:36:58" (1/1) ... [2025-02-05 20:36:58,096 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:36:58" (1/1) ... [2025-02-05 20:36:58,118 INFO L138 Inliner]: procedures = 27, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 125 [2025-02-05 20:36:58,119 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 20:36:58,119 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 20:36:58,119 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 20:36:58,119 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 20:36:58,126 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:36:58" (1/1) ... [2025-02-05 20:36:58,126 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:36:58" (1/1) ... [2025-02-05 20:36:58,130 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:36:58" (1/1) ... [2025-02-05 20:36:58,142 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:36:58,142 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:36:58" (1/1) ... [2025-02-05 20:36:58,143 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:36:58" (1/1) ... [2025-02-05 20:36:58,157 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:36:58" (1/1) ... [2025-02-05 20:36:58,162 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:36:58" (1/1) ... [2025-02-05 20:36:58,163 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:36:58" (1/1) ... [2025-02-05 20:36:58,164 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:36:58" (1/1) ... [2025-02-05 20:36:58,170 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 20:36:58,171 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 20:36:58,171 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 20:36:58,171 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 20:36:58,172 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:36:58" (1/1) ... [2025-02-05 20:36:58,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 20:36:58,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:36:58,200 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:36:58,202 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:36:58,220 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 20:36:58,220 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-05 20:36:58,220 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 20:36:58,220 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 20:36:58,220 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 20:36:58,220 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 20:36:58,289 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 20:36:58,292 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 20:37:24,064 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-02-05 20:37:24,064 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 20:37:24,072 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 20:37:24,073 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 20:37:24,073 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 08:37:24 BoogieIcfgContainer [2025-02-05 20:37:24,073 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 20:37:24,075 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 20:37:24,075 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 20:37:24,079 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 20:37:24,079 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 08:36:57" (1/3) ... [2025-02-05 20:37:24,080 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56871027 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 08:37:24, skipping insertion in model container [2025-02-05 20:37:24,080 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:36:58" (2/3) ... [2025-02-05 20:37:24,080 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56871027 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 08:37:24, skipping insertion in model container [2025-02-05 20:37:24,080 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 08:37:24" (3/3) ... [2025-02-05 20:37:24,082 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_normal_file-6.i [2025-02-05 20:37:24,092 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 20:37:24,093 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_normal_file-6.i that has 2 procedures, 60 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 20:37:24,153 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 20:37:24,162 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;@78632a5a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 20:37:24,162 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 20:37:24,165 INFO L276 IsEmpty]: Start isEmpty. Operand has 60 states, 38 states have (on average 1.3421052631578947) internal successors, (51), 39 states have internal predecessors, (51), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-02-05 20:37:24,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-02-05 20:37:24,175 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:37:24,176 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:37:24,176 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:37:24,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:37:24,180 INFO L85 PathProgramCache]: Analyzing trace with hash 1591482478, now seen corresponding path program 1 times [2025-02-05 20:37:24,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 20:37:24,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1856603200] [2025-02-05 20:37:24,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:37:24,188 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:37:24,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 20:37:24,192 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:37:24,193 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:37:24,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-05 20:37:24,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-05 20:37:24,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:37:24,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:37:24,849 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 20:37:24,854 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:37:24,877 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 260 proven. 0 refuted. 0 times theorem prover too weak. 424 trivial. 0 not checked. [2025-02-05 20:37:24,878 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 20:37:24,878 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 20:37:24,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1856603200] [2025-02-05 20:37:24,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1856603200] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:37:24,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:37:24,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 20:37:24,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027561533] [2025-02-05 20:37:24,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:37:24,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 20:37:24,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 20:37:24,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 20:37:24,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 20:37:24,894 INFO L87 Difference]: Start difference. First operand has 60 states, 38 states have (on average 1.3421052631578947) internal successors, (51), 39 states have internal predecessors, (51), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-02-05 20:37:24,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:37:24,907 INFO L93 Difference]: Finished difference Result 114 states and 192 transitions. [2025-02-05 20:37:24,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 20:37:24,908 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 123 [2025-02-05 20:37:24,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:37:24,912 INFO L225 Difference]: With dead ends: 114 [2025-02-05 20:37:24,912 INFO L226 Difference]: Without dead ends: 57 [2025-02-05 20:37:24,914 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 122 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:37:24,915 INFO L435 NwaCegarLoop]: 84 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, 84 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:37:24,915 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 20:37:24,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-02-05 20:37:24,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2025-02-05 20:37:24,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 36 states have internal predecessors, (46), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-02-05 20:37:24,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 84 transitions. [2025-02-05 20:37:24,938 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 84 transitions. Word has length 123 [2025-02-05 20:37:24,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:37:24,938 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 84 transitions. [2025-02-05 20:37:24,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-02-05 20:37:24,939 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 84 transitions. [2025-02-05 20:37:24,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-02-05 20:37:24,940 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:37:24,940 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:37:24,961 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 (2)] Forceful destruction successful, exit code 0 [2025-02-05 20:37:25,145 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:37:25,145 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:37:25,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:37:25,146 INFO L85 PathProgramCache]: Analyzing trace with hash 598702991, now seen corresponding path program 1 times [2025-02-05 20:37:25,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 20:37:25,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [90613221] [2025-02-05 20:37:25,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:37:25,147 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:37:25,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 20:37:25,149 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:37:25,150 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:37:25,196 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-05 20:37:25,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-05 20:37:25,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:37:25,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:37:25,882 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-05 20:37:25,908 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:37:26,854 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 120 proven. 3 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-02-05 20:37:26,854 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 20:37:28,763 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 51 proven. 3 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2025-02-05 20:37:28,764 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 20:37:28,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [90613221] [2025-02-05 20:37:28,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [90613221] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 20:37:28,766 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-05 20:37:28,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2025-02-05 20:37:28,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3865547] [2025-02-05 20:37:28,766 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-05 20:37:28,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 20:37:28,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 20:37:28,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 20:37:28,769 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-02-05 20:37:28,769 INFO L87 Difference]: Start difference. First operand 57 states and 84 transitions. Second operand has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 2 states have call successors, (20), 2 states have call predecessors, (20), 4 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-02-05 20:37:36,200 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.32s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-05 20:37:40,216 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-05 20:37:44,220 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-05 20:37:44,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:37:44,226 INFO L93 Difference]: Finished difference Result 117 states and 170 transitions. [2025-02-05 20:37:44,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 20:37:44,327 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 2 states have call successors, (20), 2 states have call predecessors, (20), 4 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 123 [2025-02-05 20:37:44,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:37:44,330 INFO L225 Difference]: With dead ends: 117 [2025-02-05 20:37:44,330 INFO L226 Difference]: Without dead ends: 63 [2025-02-05 20:37:44,330 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 237 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=76, Invalid=134, Unknown=0, NotChecked=0, Total=210 [2025-02-05 20:37:44,331 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 118 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 112 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.7s IncrementalHoareTripleChecker+Time [2025-02-05 20:37:44,332 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 135 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 108 Invalid, 3 Unknown, 0 Unchecked, 14.7s Time] [2025-02-05 20:37:44,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-02-05 20:37:44,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 61. [2025-02-05 20:37:44,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 39 states have internal predecessors, (48), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-02-05 20:37:44,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 86 transitions. [2025-02-05 20:37:44,341 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 86 transitions. Word has length 123 [2025-02-05 20:37:44,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:37:44,341 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 86 transitions. [2025-02-05 20:37:44,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 2 states have call successors, (20), 2 states have call predecessors, (20), 4 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-02-05 20:37:44,342 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 86 transitions. [2025-02-05 20:37:44,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-02-05 20:37:44,343 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:37:44,343 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:37:44,368 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 (3)] Ended with exit code 0 [2025-02-05 20:37:44,543 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:37:44,543 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:37:44,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:37:44,546 INFO L85 PathProgramCache]: Analyzing trace with hash 1409537750, now seen corresponding path program 1 times [2025-02-05 20:37:44,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 20:37:44,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1387276144] [2025-02-05 20:37:44,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:37:44,546 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:37:44,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 20:37:44,549 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:37:44,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 (4)] Waiting until timeout for monitored process [2025-02-05 20:37:44,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-02-05 20:37:46,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-02-05 20:37:46,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:37:46,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:37:46,507 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-02-05 20:37:46,512 INFO L279 TraceCheckSpWp]: Computing forward predicates...