./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-11.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-11.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 bb4a5dbd9bd36a08553228e3579f9c0fa33ebcb9ef473081910f145eb5cf5929 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 20:30:13,038 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 20:30:13,082 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:30:13,086 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 20:30:13,089 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 20:30:13,103 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 20:30:13,104 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 20:30:13,104 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 20:30:13,104 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 20:30:13,104 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 20:30:13,104 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 20:30:13,104 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 20:30:13,104 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 20:30:13,104 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 20:30:13,104 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 20:30:13,104 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 20:30:13,104 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 20:30:13,105 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 20:30:13,105 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 20:30:13,105 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 20:30:13,105 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 20:30:13,105 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 20:30:13,105 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 20:30:13,105 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 20:30:13,105 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 20:30:13,105 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 20:30:13,105 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 20:30:13,105 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 20:30:13,105 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 20:30:13,105 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 20:30:13,105 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 20:30:13,105 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 20:30:13,105 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 20:30:13,105 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 20:30:13,106 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 20:30:13,106 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 20:30:13,106 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 20:30:13,106 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 20:30:13,106 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 20:30:13,106 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 20:30:13,106 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 20:30:13,106 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 20:30:13,106 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 20:30:13,106 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 -> bb4a5dbd9bd36a08553228e3579f9c0fa33ebcb9ef473081910f145eb5cf5929 [2025-02-05 20:30:13,335 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 20:30:13,343 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 20:30:13,345 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 20:30:13,346 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 20:30:13,346 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 20:30:13,347 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-11.i [2025-02-05 20:30:14,482 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a7e9f444b/30414ac8123c469cbe28a056a67d365d/FLAG5f8fc0d7f [2025-02-05 20:30:14,747 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 20:30:14,748 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-11.i [2025-02-05 20:30:14,754 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a7e9f444b/30414ac8123c469cbe28a056a67d365d/FLAG5f8fc0d7f [2025-02-05 20:30:14,769 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a7e9f444b/30414ac8123c469cbe28a056a67d365d [2025-02-05 20:30:14,771 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 20:30:14,773 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 20:30:14,775 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 20:30:14,775 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 20:30:14,778 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 20:30:14,779 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 08:30:14" (1/1) ... [2025-02-05 20:30:14,780 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a16044e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:30:14, skipping insertion in model container [2025-02-05 20:30:14,780 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 08:30:14" (1/1) ... [2025-02-05 20:30:14,797 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 20:30:14,909 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-11.i[913,926] [2025-02-05 20:30:14,965 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 20:30:14,982 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 20:30:14,990 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-11.i[913,926] [2025-02-05 20:30:15,020 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 20:30:15,037 INFO L204 MainTranslator]: Completed translation [2025-02-05 20:30:15,037 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:30:15 WrapperNode [2025-02-05 20:30:15,038 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 20:30:15,039 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 20:30:15,039 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 20:30:15,039 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 20:30:15,043 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:30:15" (1/1) ... [2025-02-05 20:30:15,054 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:30:15" (1/1) ... [2025-02-05 20:30:15,077 INFO L138 Inliner]: procedures = 26, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 142 [2025-02-05 20:30:15,077 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 20:30:15,078 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 20:30:15,078 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 20:30:15,078 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 20:30:15,084 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:30:15" (1/1) ... [2025-02-05 20:30:15,084 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:30:15" (1/1) ... [2025-02-05 20:30:15,090 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:30:15" (1/1) ... [2025-02-05 20:30:15,100 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:30:15,101 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:30:15" (1/1) ... [2025-02-05 20:30:15,101 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:30:15" (1/1) ... [2025-02-05 20:30:15,104 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:30:15" (1/1) ... [2025-02-05 20:30:15,105 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:30:15" (1/1) ... [2025-02-05 20:30:15,106 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:30:15" (1/1) ... [2025-02-05 20:30:15,106 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:30:15" (1/1) ... [2025-02-05 20:30:15,108 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 20:30:15,108 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 20:30:15,108 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 20:30:15,109 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 20:30:15,109 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:30:15" (1/1) ... [2025-02-05 20:30:15,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 20:30:15,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:30:15,135 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:30:15,138 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:30:15,154 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 20:30:15,155 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 20:30:15,155 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 20:30:15,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 20:30:15,155 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 20:30:15,155 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 20:30:15,215 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 20:30:15,217 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 20:30:15,438 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-02-05 20:30:15,438 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 20:30:15,446 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 20:30:15,448 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 20:30:15,448 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 08:30:15 BoogieIcfgContainer [2025-02-05 20:30:15,448 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 20:30:15,451 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 20:30:15,451 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 20:30:15,455 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 20:30:15,455 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 08:30:14" (1/3) ... [2025-02-05 20:30:15,456 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6aabe5db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 08:30:15, skipping insertion in model container [2025-02-05 20:30:15,456 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:30:15" (2/3) ... [2025-02-05 20:30:15,457 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6aabe5db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 08:30:15, skipping insertion in model container [2025-02-05 20:30:15,457 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 08:30:15" (3/3) ... [2025-02-05 20:30:15,458 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_normal_file-11.i [2025-02-05 20:30:15,468 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 20:30:15,473 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_normal_file-11.i that has 2 procedures, 66 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 20:30:15,522 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 20:30:15,533 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;@1a76f1ec, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 20:30:15,533 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 20:30:15,537 INFO L276 IsEmpty]: Start isEmpty. Operand has 66 states, 40 states have (on average 1.35) internal successors, (54), 41 states have internal predecessors, (54), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-02-05 20:30:15,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-02-05 20:30:15,546 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:30:15,546 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:15,547 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:30:15,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:30:15,551 INFO L85 PathProgramCache]: Analyzing trace with hash 2124740957, now seen corresponding path program 1 times [2025-02-05 20:30:15,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:30:15,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567390170] [2025-02-05 20:30:15,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:30:15,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:30:15,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-02-05 20:30:15,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-02-05 20:30:15,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:30:15,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:30:15,783 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2025-02-05 20:30:15,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:30:15,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567390170] [2025-02-05 20:30:15,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567390170] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 20:30:15,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [962812586] [2025-02-05 20:30:15,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:30:15,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:30:15,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:30:15,790 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:30:15,791 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:30:15,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-02-05 20:30:15,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-02-05 20:30:15,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:30:15,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:30:15,926 INFO L256 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 20:30:15,947 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:30:15,970 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2025-02-05 20:30:15,971 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 20:30:15,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [962812586] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:30:15,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 20:30:15,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-05 20:30:15,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320418766] [2025-02-05 20:30:15,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:30:15,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 20:30:15,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:30:15,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 20:30:15,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 20:30:15,993 INFO L87 Difference]: Start difference. First operand has 66 states, 40 states have (on average 1.35) internal successors, (54), 41 states have internal predecessors, (54), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-02-05 20:30:16,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:30:16,016 INFO L93 Difference]: Finished difference Result 126 states and 218 transitions. [2025-02-05 20:30:16,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 20:30:16,019 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 144 [2025-02-05 20:30:16,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:30:16,023 INFO L225 Difference]: With dead ends: 126 [2025-02-05 20:30:16,024 INFO L226 Difference]: Without dead ends: 63 [2025-02-05 20:30:16,027 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 145 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:30:16,031 INFO L435 NwaCegarLoop]: 95 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, 95 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:30:16,032 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 20:30:16,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-02-05 20:30:16,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2025-02-05 20:30:16,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 38 states have (on average 1.2894736842105263) internal successors, (49), 38 states have internal predecessors, (49), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-02-05 20:30:16,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 95 transitions. [2025-02-05 20:30:16,071 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 95 transitions. Word has length 144 [2025-02-05 20:30:16,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:30:16,071 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 95 transitions. [2025-02-05 20:30:16,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-02-05 20:30:16,071 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 95 transitions. [2025-02-05 20:30:16,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-02-05 20:30:16,074 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:30:16,074 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:16,081 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:30:16,274 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:30:16,275 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:30:16,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:30:16,276 INFO L85 PathProgramCache]: Analyzing trace with hash 710228064, now seen corresponding path program 1 times [2025-02-05 20:30:16,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:30:16,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350039855] [2025-02-05 20:30:16,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:30:16,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:30:16,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-02-05 20:30:16,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-02-05 20:30:16,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:30:16,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:30:16,465 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-02-05 20:30:16,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:30:16,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350039855] [2025-02-05 20:30:16,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350039855] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:30:16,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:30:16,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 20:30:16,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968341298] [2025-02-05 20:30:16,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:30:16,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 20:30:16,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:30:16,467 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 20:30:16,467 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 20:30:16,467 INFO L87 Difference]: Start difference. First operand 63 states and 95 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-05 20:30:16,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:30:16,509 INFO L93 Difference]: Finished difference Result 135 states and 202 transitions. [2025-02-05 20:30:16,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 20:30:16,512 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 144 [2025-02-05 20:30:16,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:30:16,515 INFO L225 Difference]: With dead ends: 135 [2025-02-05 20:30:16,515 INFO L226 Difference]: Without dead ends: 75 [2025-02-05 20:30:16,516 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 20:30:16,516 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 13 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 20:30:16,517 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 177 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 20:30:16,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-02-05 20:30:16,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 67. [2025-02-05 20:30:16,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 42 states have internal predecessors, (55), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-02-05 20:30:16,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 101 transitions. [2025-02-05 20:30:16,533 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 101 transitions. Word has length 144 [2025-02-05 20:30:16,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:30:16,538 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 101 transitions. [2025-02-05 20:30:16,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-05 20:30:16,538 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 101 transitions. [2025-02-05 20:30:16,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-02-05 20:30:16,539 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:30:16,539 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:16,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 20:30:16,540 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:30:16,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:30:16,540 INFO L85 PathProgramCache]: Analyzing trace with hash 711151585, now seen corresponding path program 1 times [2025-02-05 20:30:16,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:30:16,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781254566] [2025-02-05 20:30:16,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:30:16,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:30:16,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-02-05 20:30:16,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-02-05 20:30:16,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:30:16,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:30:17,194 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 45 proven. 21 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-02-05 20:30:17,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:30:17,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781254566] [2025-02-05 20:30:17,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781254566] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 20:30:17,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [840228748] [2025-02-05 20:30:17,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:30:17,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:30:17,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:30:17,201 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:30:17,203 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:30:17,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-02-05 20:30:17,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-02-05 20:30:17,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:30:17,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:30:17,560 INFO L256 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-02-05 20:30:17,567 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:30:19,130 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 758 proven. 108 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-02-05 20:30:19,131 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 20:30:20,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [840228748] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 20:30:20,051 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-05 20:30:20,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 18] total 25 [2025-02-05 20:30:20,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423539881] [2025-02-05 20:30:20,051 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-05 20:30:20,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-02-05 20:30:20,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:30:20,053 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-02-05 20:30:20,053 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=312, Invalid=1094, Unknown=0, NotChecked=0, Total=1406 [2025-02-05 20:30:20,056 INFO L87 Difference]: Start difference. First operand 67 states and 101 transitions. Second operand has 25 states, 24 states have (on average 3.0416666666666665) internal successors, (73), 22 states have internal predecessors, (73), 10 states have call successors, (42), 7 states have call predecessors, (42), 10 states have return successors, (42), 10 states have call predecessors, (42), 10 states have call successors, (42) [2025-02-05 20:30:22,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:30:22,295 INFO L93 Difference]: Finished difference Result 261 states and 357 transitions. [2025-02-05 20:30:22,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2025-02-05 20:30:22,296 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 3.0416666666666665) internal successors, (73), 22 states have internal predecessors, (73), 10 states have call successors, (42), 7 states have call predecessors, (42), 10 states have return successors, (42), 10 states have call predecessors, (42), 10 states have call successors, (42) Word has length 144 [2025-02-05 20:30:22,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:30:22,298 INFO L225 Difference]: With dead ends: 261 [2025-02-05 20:30:22,298 INFO L226 Difference]: Without dead ends: 197 [2025-02-05 20:30:22,300 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1321 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1564, Invalid=4136, Unknown=0, NotChecked=0, Total=5700 [2025-02-05 20:30:22,301 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 457 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 853 mSolverCounterSat, 349 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 463 SdHoareTripleChecker+Valid, 546 SdHoareTripleChecker+Invalid, 1202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 349 IncrementalHoareTripleChecker+Valid, 853 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 20:30:22,301 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [463 Valid, 546 Invalid, 1202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [349 Valid, 853 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 20:30:22,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2025-02-05 20:30:22,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 187. [2025-02-05 20:30:22,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 120 states have (on average 1.2083333333333333) internal successors, (145), 121 states have internal predecessors, (145), 52 states have call successors, (52), 14 states have call predecessors, (52), 14 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2025-02-05 20:30:22,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 249 transitions. [2025-02-05 20:30:22,331 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 249 transitions. Word has length 144 [2025-02-05 20:30:22,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:30:22,331 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 249 transitions. [2025-02-05 20:30:22,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 3.0416666666666665) internal successors, (73), 22 states have internal predecessors, (73), 10 states have call successors, (42), 7 states have call predecessors, (42), 10 states have return successors, (42), 10 states have call predecessors, (42), 10 states have call successors, (42) [2025-02-05 20:30:22,332 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 249 transitions. [2025-02-05 20:30:22,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-02-05 20:30:22,333 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:30:22,334 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:22,345 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-05 20:30:22,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:30:22,538 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:30:22,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:30:22,539 INFO L85 PathProgramCache]: Analyzing trace with hash -1085799774, now seen corresponding path program 1 times [2025-02-05 20:30:22,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:30:22,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191113717] [2025-02-05 20:30:22,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:30:22,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:30:22,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-02-05 20:30:22,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-02-05 20:30:22,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:30:22,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:30:22,874 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 45 proven. 21 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-02-05 20:30:22,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:30:22,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191113717] [2025-02-05 20:30:22,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191113717] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 20:30:22,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [574968544] [2025-02-05 20:30:22,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:30:22,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:30:22,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:30:22,877 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:30:22,879 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:30:22,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-02-05 20:30:23,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-02-05 20:30:23,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:30:23,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:30:23,316 INFO L256 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-02-05 20:30:23,319 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:30:24,532 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 758 proven. 108 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-02-05 20:30:24,532 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 20:30:25,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [574968544] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 20:30:25,236 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-05 20:30:25,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 18] total 25 [2025-02-05 20:30:25,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722496052] [2025-02-05 20:30:25,236 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-05 20:30:25,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-02-05 20:30:25,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:30:25,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-02-05 20:30:25,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=1081, Unknown=0, NotChecked=0, Total=1406 [2025-02-05 20:30:25,238 INFO L87 Difference]: Start difference. First operand 187 states and 249 transitions. Second operand has 25 states, 24 states have (on average 3.0833333333333335) internal successors, (74), 22 states have internal predecessors, (74), 11 states have call successors, (42), 7 states have call predecessors, (42), 10 states have return successors, (42), 11 states have call predecessors, (42), 11 states have call successors, (42) [2025-02-05 20:30:26,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:30:26,747 INFO L93 Difference]: Finished difference Result 430 states and 558 transitions. [2025-02-05 20:30:26,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2025-02-05 20:30:26,750 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 3.0833333333333335) internal successors, (74), 22 states have internal predecessors, (74), 11 states have call successors, (42), 7 states have call predecessors, (42), 10 states have return successors, (42), 11 states have call predecessors, (42), 11 states have call successors, (42) Word has length 144 [2025-02-05 20:30:26,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:30:26,752 INFO L225 Difference]: With dead ends: 430 [2025-02-05 20:30:26,752 INFO L226 Difference]: Without dead ends: 256 [2025-02-05 20:30:26,753 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1173 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1448, Invalid=3664, Unknown=0, NotChecked=0, Total=5112 [2025-02-05 20:30:26,754 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 236 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 828 mSolverCounterSat, 156 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 984 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 156 IncrementalHoareTripleChecker+Valid, 828 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 20:30:26,754 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 426 Invalid, 984 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [156 Valid, 828 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 20:30:26,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2025-02-05 20:30:26,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 198. [2025-02-05 20:30:26,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 127 states have (on average 1.188976377952756) internal successors, (151), 128 states have internal predecessors, (151), 54 states have call successors, (54), 16 states have call predecessors, (54), 16 states have return successors, (54), 53 states have call predecessors, (54), 54 states have call successors, (54) [2025-02-05 20:30:26,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 259 transitions. [2025-02-05 20:30:26,785 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 259 transitions. Word has length 144 [2025-02-05 20:30:26,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:30:26,786 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 259 transitions. [2025-02-05 20:30:26,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 3.0833333333333335) internal successors, (74), 22 states have internal predecessors, (74), 11 states have call successors, (42), 7 states have call predecessors, (42), 10 states have return successors, (42), 11 states have call predecessors, (42), 11 states have call successors, (42) [2025-02-05 20:30:26,786 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 259 transitions. [2025-02-05 20:30:26,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-02-05 20:30:26,787 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:30:26,787 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:26,797 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-05 20:30:26,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:30:26,992 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:30:26,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:30:26,992 INFO L85 PathProgramCache]: Analyzing trace with hash 1902633634, now seen corresponding path program 1 times [2025-02-05 20:30:26,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:30:26,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655234659] [2025-02-05 20:30:26,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:30:26,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:30:27,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-02-05 20:30:27,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-02-05 20:30:27,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:30:27,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 20:30:27,096 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-05 20:30:27,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-02-05 20:30:27,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-02-05 20:30:27,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:30:27,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 20:30:27,227 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-05 20:30:27,228 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-05 20:30:27,229 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-05 20:30:27,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 20:30:27,232 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-02-05 20:30:27,314 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-05 20:30:27,316 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 08:30:27 BoogieIcfgContainer [2025-02-05 20:30:27,317 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-05 20:30:27,317 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-05 20:30:27,317 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-05 20:30:27,317 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-05 20:30:27,318 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 08:30:15" (3/4) ... [2025-02-05 20:30:27,319 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-05 20:30:27,320 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-05 20:30:27,321 INFO L158 Benchmark]: Toolchain (without parser) took 12547.48ms. Allocated memory was 142.6MB in the beginning and 268.4MB in the end (delta: 125.8MB). Free memory was 113.8MB in the beginning and 133.5MB in the end (delta: -19.7MB). Peak memory consumption was 106.9MB. Max. memory is 16.1GB. [2025-02-05 20:30:27,321 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 226.5MB. Free memory is still 148.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 20:30:27,321 INFO L158 Benchmark]: CACSL2BoogieTranslator took 262.94ms. Allocated memory is still 142.6MB. Free memory was 113.8MB in the beginning and 100.3MB in the end (delta: 13.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-05 20:30:27,321 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.85ms. Allocated memory is still 142.6MB. Free memory was 100.3MB in the beginning and 98.3MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 20:30:27,321 INFO L158 Benchmark]: Boogie Preprocessor took 30.02ms. Allocated memory is still 142.6MB. Free memory was 98.3MB in the beginning and 95.8MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 20:30:27,322 INFO L158 Benchmark]: IcfgBuilder took 340.14ms. Allocated memory is still 142.6MB. Free memory was 95.8MB in the beginning and 78.2MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-05 20:30:27,322 INFO L158 Benchmark]: TraceAbstraction took 11865.75ms. Allocated memory was 142.6MB in the beginning and 268.4MB in the end (delta: 125.8MB). Free memory was 77.7MB in the beginning and 133.5MB in the end (delta: -55.9MB). Peak memory consumption was 73.4MB. Max. memory is 16.1GB. [2025-02-05 20:30:27,322 INFO L158 Benchmark]: Witness Printer took 2.96ms. Allocated memory is still 268.4MB. Free memory was 133.5MB in the beginning and 133.5MB in the end (delta: 54.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 20:30:27,323 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.20ms. Allocated memory is still 226.5MB. Free memory is still 148.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 262.94ms. Allocated memory is still 142.6MB. Free memory was 113.8MB in the beginning and 100.3MB in the end (delta: 13.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.85ms. Allocated memory is still 142.6MB. Free memory was 100.3MB in the beginning and 98.3MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 30.02ms. Allocated memory is still 142.6MB. Free memory was 98.3MB in the beginning and 95.8MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 340.14ms. Allocated memory is still 142.6MB. Free memory was 95.8MB in the beginning and 78.2MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 11865.75ms. Allocated memory was 142.6MB in the beginning and 268.4MB in the end (delta: 125.8MB). Free memory was 77.7MB in the beginning and 133.5MB in the end (delta: -55.9MB). Peak memory consumption was 73.4MB. Max. memory is 16.1GB. * Witness Printer took 2.96ms. Allocated memory is still 268.4MB. Free memory was 133.5MB in the beginning and 133.5MB in the end (delta: 54.0kB). 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 71, overapproximation of someBinaryFLOATComparisonOperation at line 111, overapproximation of someBinaryFLOATComparisonOperation at line 113, overapproximation of someBinaryFLOATComparisonOperation at line 126, overapproximation of someUnaryDOUBLEoperation at line 80, overapproximation of someBinaryDOUBLEComparisonOperation at line 126, overapproximation of someBinaryDOUBLEComparisonOperation at line 121, overapproximation of someBinaryDOUBLEComparisonOperation at line 80. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] unsigned char var_1_2 = 0; [L24] unsigned char var_1_3 = 0; [L25] signed char var_1_4 = 5; [L26] signed short int var_1_5 = -256; [L27] signed short int var_1_6 = 4; [L28] signed char var_1_7 = 0; [L29] signed char var_1_8 = 16; [L30] signed char var_1_9 = 4; [L31] unsigned long int var_1_10 = 128; [L32] unsigned long int var_1_11 = 1422462314; [L33] signed short int var_1_12 = 8; [L34] float var_1_13 = 49.5; [L35] float var_1_14 = 0.4; [L36] signed short int var_1_15 = -50; [L37] unsigned long int var_1_16 = 1; [L38] unsigned long int var_1_17 = 3609236770; [L39] unsigned long int var_1_18 = 2902762324; [L40] double var_1_19 = 3.8; [L41] double var_1_20 = 255.75; [L42] unsigned short int var_1_21 = 0; VAL [isInitial=0, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-256, var_1_6=4, var_1_7=0, var_1_8=16, var_1_9=4] [L130] isInitial = 1 [L131] FCALL initially() [L132] COND TRUE 1 [L133] FCALL updateLastVariables() [L134] CALL updateVariables() [L86] var_1_2 = __VERIFIER_nondet_uchar() [L87] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_3=0, var_1_4=5, var_1_5=-256, var_1_6=4, var_1_7=0, var_1_8=16, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_3=0, var_1_4=5, var_1_5=-256, var_1_6=4, var_1_7=0, var_1_8=16, var_1_9=4] [L87] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_3=0, var_1_4=5, var_1_5=-256, var_1_6=4, var_1_7=0, var_1_8=16, var_1_9=4] [L88] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-256, var_1_6=4, var_1_7=0, var_1_8=16, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-256, var_1_6=4, var_1_7=0, var_1_8=16, var_1_9=4] [L88] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-256, var_1_6=4, var_1_7=0, var_1_8=16, var_1_9=4] [L89] var_1_3 = __VERIFIER_nondet_uchar() [L90] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_4=5, var_1_5=-256, var_1_6=4, var_1_7=0, var_1_8=16, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_4=5, var_1_5=-256, var_1_6=4, var_1_7=0, var_1_8=16, var_1_9=4] [L90] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_4=5, var_1_5=-256, var_1_6=4, var_1_7=0, var_1_8=16, var_1_9=4] [L91] CALL assume_abort_if_not(var_1_3 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-256, var_1_6=4, var_1_7=0, var_1_8=16, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-256, var_1_6=4, var_1_7=0, var_1_8=16, var_1_9=4] [L91] RET assume_abort_if_not(var_1_3 <= 0) VAL [isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-256, var_1_6=4, var_1_7=0, var_1_8=16, var_1_9=4] [L92] var_1_5 = __VERIFIER_nondet_short() [L93] CALL assume_abort_if_not(var_1_5 >= -32768) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-1, var_1_6=4, var_1_7=0, var_1_8=16, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-1, var_1_6=4, var_1_7=0, var_1_8=16, var_1_9=4] [L93] RET assume_abort_if_not(var_1_5 >= -32768) VAL [isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-1, var_1_6=4, var_1_7=0, var_1_8=16, var_1_9=4] [L94] CALL assume_abort_if_not(var_1_5 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-1, var_1_6=4, var_1_7=0, var_1_8=16, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-1, var_1_6=4, var_1_7=0, var_1_8=16, var_1_9=4] [L94] RET assume_abort_if_not(var_1_5 <= 32767) VAL [isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-1, var_1_6=4, var_1_7=0, var_1_8=16, var_1_9=4] [L95] var_1_6 = __VERIFIER_nondet_short() [L96] CALL assume_abort_if_not(var_1_6 >= -32768) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-1, var_1_6=-1, var_1_7=0, var_1_8=16, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-1, var_1_6=-1, var_1_7=0, var_1_8=16, var_1_9=4] [L96] RET assume_abort_if_not(var_1_6 >= -32768) VAL [isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-1, var_1_6=-1, var_1_7=0, var_1_8=16, var_1_9=4] [L97] CALL assume_abort_if_not(var_1_6 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-1, var_1_6=-1, var_1_7=0, var_1_8=16, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-1, var_1_6=-1, var_1_7=0, var_1_8=16, var_1_9=4] [L97] RET assume_abort_if_not(var_1_6 <= 32767) VAL [isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-1, var_1_6=-1, var_1_7=0, var_1_8=16, var_1_9=4] [L98] var_1_7 = __VERIFIER_nondet_char() [L99] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-1, var_1_6=-1, var_1_7=1, var_1_8=16, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-1, var_1_6=-1, var_1_7=1, var_1_8=16, var_1_9=4] [L99] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-1, var_1_6=-1, var_1_7=1, var_1_8=16, var_1_9=4] [L100] CALL assume_abort_if_not(var_1_7 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-1, var_1_6=-1, var_1_7=1, var_1_8=16, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-1, var_1_6=-1, var_1_7=1, var_1_8=16, var_1_9=4] [L100] RET assume_abort_if_not(var_1_7 <= 63) VAL [isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-1, var_1_6=-1, var_1_7=1, var_1_8=16, var_1_9=4] [L101] var_1_8 = __VERIFIER_nondet_char() [L102] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-1, var_1_6=-1, var_1_7=1, var_1_8=0, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-1, var_1_6=-1, var_1_7=1, var_1_8=0, var_1_9=4] [L102] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-1, var_1_6=-1, var_1_7=1, var_1_8=0, var_1_9=4] [L103] CALL assume_abort_if_not(var_1_8 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-1, var_1_6=-1, var_1_7=1, var_1_8=0, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-1, var_1_6=-1, var_1_7=1, var_1_8=0, var_1_9=4] [L103] RET assume_abort_if_not(var_1_8 <= 63) VAL [isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-1, var_1_6=-1, var_1_7=1, var_1_8=0, var_1_9=4] [L104] var_1_9 = __VERIFIER_nondet_char() [L105] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-1, var_1_6=-1, var_1_7=1, var_1_8=0, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-1, var_1_6=-1, var_1_7=1, var_1_8=0, var_1_9=126] [L105] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-1, var_1_6=-1, var_1_7=1, var_1_8=0, var_1_9=126] [L106] CALL assume_abort_if_not(var_1_9 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-1, var_1_6=-1, var_1_7=1, var_1_8=0, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-1, var_1_6=-1, var_1_7=1, var_1_8=0, var_1_9=126] [L106] RET assume_abort_if_not(var_1_9 <= 126) VAL [isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-1, var_1_6=-1, var_1_7=1, var_1_8=0, var_1_9=126] [L107] var_1_11 = __VERIFIER_nondet_ulong() [L108] CALL assume_abort_if_not(var_1_11 >= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=-2147483650, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-1, var_1_6=-1, var_1_7=1, var_1_8=0, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=-2147483650, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-1, var_1_6=-1, var_1_7=1, var_1_8=0, var_1_9=126] [L108] RET assume_abort_if_not(var_1_11 >= 1073741823) VAL [isInitial=1, var_1_10=128, var_1_11=-2147483650, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-1, var_1_6=-1, var_1_7=1, var_1_8=0, var_1_9=126] [L109] CALL assume_abort_if_not(var_1_11 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=-2147483650, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-1, var_1_6=-1, var_1_7=1, var_1_8=0, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=-2147483650, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-1, var_1_6=-1, var_1_7=1, var_1_8=0, var_1_9=126] [L109] RET assume_abort_if_not(var_1_11 <= 2147483647) VAL [isInitial=1, var_1_10=128, var_1_11=-2147483650, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-1, var_1_6=-1, var_1_7=1, var_1_8=0, var_1_9=126] [L110] var_1_13 = __VERIFIER_nondet_float() [L111] CALL assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=-2147483650, var_1_12=8, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-1, var_1_6=-1, var_1_7=1, var_1_8=0, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=-2147483650, var_1_12=8, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-1, var_1_6=-1, var_1_7=1, var_1_8=0, var_1_9=126] [L111] RET assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=128, var_1_11=-2147483650, var_1_12=8, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-1, var_1_6=-1, var_1_7=1, var_1_8=0, var_1_9=126] [L112] var_1_14 = __VERIFIER_nondet_float() [L113] CALL assume_abort_if_not((var_1_14 >= -922337.2036854776000e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=-2147483650, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-1, var_1_6=-1, var_1_7=1, var_1_8=0, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=-2147483650, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-1, var_1_6=-1, var_1_7=1, var_1_8=0, var_1_9=126] [L113] RET assume_abort_if_not((var_1_14 >= -922337.2036854776000e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=128, var_1_11=-2147483650, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-1, var_1_6=-1, var_1_7=1, var_1_8=0, var_1_9=126] [L114] var_1_17 = __VERIFIER_nondet_ulong() [L115] CALL assume_abort_if_not(var_1_17 >= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=-2147483650, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=2147483648, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-1, var_1_6=-1, var_1_7=1, var_1_8=0, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=-2147483650, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=2147483648, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-1, var_1_6=-1, var_1_7=1, var_1_8=0, var_1_9=126] [L115] RET assume_abort_if_not(var_1_17 >= 2147483647) VAL [isInitial=1, var_1_10=128, var_1_11=-2147483650, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=2147483648, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-1, var_1_6=-1, var_1_7=1, var_1_8=0, var_1_9=126] [L116] CALL assume_abort_if_not(var_1_17 <= 4294967294) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=-2147483650, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=2147483648, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-1, var_1_6=-1, var_1_7=1, var_1_8=0, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=-2147483650, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=2147483648, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-1, var_1_6=-1, var_1_7=1, var_1_8=0, var_1_9=126] [L116] RET assume_abort_if_not(var_1_17 <= 4294967294) VAL [isInitial=1, var_1_10=128, var_1_11=-2147483650, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=2147483648, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-1, var_1_6=-1, var_1_7=1, var_1_8=0, var_1_9=126] [L117] var_1_18 = __VERIFIER_nondet_ulong() [L118] CALL assume_abort_if_not(var_1_18 >= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=-2147483650, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=2147483648, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-1, var_1_6=-1, var_1_7=1, var_1_8=0, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=-2147483650, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=2147483648, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-1, var_1_6=-1, var_1_7=1, var_1_8=0, var_1_9=126] [L118] RET assume_abort_if_not(var_1_18 >= 2147483647) VAL [isInitial=1, var_1_10=128, var_1_11=-2147483650, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=2147483648, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-1, var_1_6=-1, var_1_7=1, var_1_8=0, var_1_9=126] [L119] CALL assume_abort_if_not(var_1_18 <= 4294967294) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=-2147483650, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=2147483648, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-1, var_1_6=-1, var_1_7=1, var_1_8=0, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=-2147483650, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=2147483648, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-1, var_1_6=-1, var_1_7=1, var_1_8=0, var_1_9=126] [L119] RET assume_abort_if_not(var_1_18 <= 4294967294) VAL [isInitial=1, var_1_10=128, var_1_11=-2147483650, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=2147483648, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-1, var_1_6=-1, var_1_7=1, var_1_8=0, var_1_9=126] [L120] var_1_20 = __VERIFIER_nondet_double() [L121] CALL assume_abort_if_not((var_1_20 >= -922337.2036854765600e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=-2147483650, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=2147483648, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-1, var_1_6=-1, var_1_7=1, var_1_8=0, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=-2147483650, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=2147483648, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-1, var_1_6=-1, var_1_7=1, var_1_8=0, var_1_9=126] [L121] RET assume_abort_if_not((var_1_20 >= -922337.2036854765600e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=128, var_1_11=-2147483650, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=2147483648, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-1, var_1_6=-1, var_1_7=1, var_1_8=0, var_1_9=126] [L134] RET updateVariables() [L135] CALL step() [L46] var_1_1 = (var_1_2 || (! var_1_3)) VAL [isInitial=1, var_1_10=128, var_1_11=-2147483650, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=2147483648, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-1, var_1_6=-1, var_1_7=1, var_1_8=0, var_1_9=126] [L47] COND TRUE var_1_5 == var_1_6 [L48] var_1_4 = ((8 + ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8)))) - var_1_9) VAL [isInitial=1, var_1_10=128, var_1_11=-2147483650, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=2147483648, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=-117, var_1_5=-1, var_1_6=-1, var_1_7=1, var_1_8=0, var_1_9=126] [L50] var_1_10 = (4027026809u - (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))) - var_1_7)) VAL [isInitial=1, var_1_10=6174510460, var_1_11=-2147483650, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=2147483648, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=-117, var_1_5=-1, var_1_6=-1, var_1_7=1, var_1_8=0, var_1_9=126] [L51] COND TRUE var_1_6 != var_1_10 VAL [isInitial=1, var_1_10=6174510460, var_1_11=-2147483650, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=2147483648, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=-117, var_1_5=-1, var_1_6=-1, var_1_7=1, var_1_8=0, var_1_9=126] [L52] COND FALSE !(var_1_8 <= var_1_6) VAL [isInitial=1, var_1_10=6174510460, var_1_11=-2147483650, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=2147483648, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=-117, var_1_5=-1, var_1_6=-1, var_1_7=1, var_1_8=0, var_1_9=126] [L60] COND FALSE !(\read(var_1_2)) [L69] var_1_15 = 5 VAL [isInitial=1, var_1_10=6174510460, var_1_11=-2147483650, var_1_12=8, var_1_15=5, var_1_16=1, var_1_17=2147483648, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=-117, var_1_5=-1, var_1_6=-1, var_1_7=1, var_1_8=0, var_1_9=126] [L71] COND TRUE var_1_13 != var_1_14 [L72] var_1_16 = (((((var_1_11) < (var_1_7)) ? (var_1_11) : (var_1_7))) + var_1_8) VAL [isInitial=1, var_1_10=6174510460, var_1_11=-2147483650, var_1_12=8, var_1_15=5, var_1_16=1, var_1_17=2147483648, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=-117, var_1_5=-1, var_1_6=-1, var_1_7=1, var_1_8=0, var_1_9=126] [L80] var_1_19 = ((((((((var_1_20) < 0 ) ? -(var_1_20) : (var_1_20)))) < (1.4)) ? (((((var_1_20) < 0 ) ? -(var_1_20) : (var_1_20)))) : (1.4))) VAL [isInitial=1, var_1_10=6174510460, var_1_11=-2147483650, var_1_12=8, var_1_15=5, var_1_16=1, var_1_17=2147483648, var_1_18=2147483647, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=-117, var_1_5=-1, var_1_6=-1, var_1_7=1, var_1_8=0, var_1_9=126] [L81] COND FALSE !((var_1_12 == (var_1_8 - var_1_9)) && var_1_2) VAL [isInitial=1, var_1_10=6174510460, var_1_11=-2147483650, var_1_12=8, var_1_15=5, var_1_16=1, var_1_17=2147483648, var_1_18=2147483647, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=-117, var_1_5=-1, var_1_6=-1, var_1_7=1, var_1_8=0, var_1_9=126] [L135] RET step() [L136] CALL, EXPR property() [L126-L127] return (((((((var_1_1 == ((unsigned char) (var_1_2 || (! var_1_3)))) && ((var_1_5 == var_1_6) ? (var_1_4 == ((signed char) ((8 + ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8)))) - var_1_9))) : 1)) && (var_1_10 == ((unsigned long int) (4027026809u - (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))) - var_1_7))))) && ((var_1_6 != var_1_10) ? ((var_1_8 <= var_1_6) ? (((- var_1_13) >= var_1_14) ? (var_1_12 == ((signed short int) var_1_8)) : 1) : 1) : (var_1_12 == ((signed short int) var_1_9)))) && (var_1_2 ? ((var_1_13 >= var_1_14) ? ((! var_1_3) ? (var_1_15 == ((signed short int) var_1_8)) : 1) : (var_1_15 == ((signed short int) var_1_7))) : (var_1_15 == ((signed short int) 5)))) && ((var_1_13 != var_1_14) ? (var_1_16 == ((unsigned long int) (((((var_1_11) < (var_1_7)) ? (var_1_11) : (var_1_7))) + var_1_8))) : ((var_1_5 > var_1_12) ? (var_1_16 == ((unsigned long int) (var_1_17 - (var_1_11 - var_1_8)))) : (var_1_16 == ((unsigned long int) (((((var_1_17) > (var_1_18)) ? (var_1_17) : (var_1_18))) - var_1_9)))))) && (var_1_19 == ((double) ((((((((var_1_20) < 0 ) ? -(var_1_20) : (var_1_20)))) < (1.4)) ? (((((var_1_20) < 0 ) ? -(var_1_20) : (var_1_20)))) : (1.4)))))) && (((var_1_12 == (var_1_8 - var_1_9)) && var_1_2) ? (var_1_21 == ((unsigned short int) var_1_9)) : 1) ; VAL [\result=0, isInitial=1, var_1_10=6174510460, var_1_11=-2147483650, var_1_12=8, var_1_15=5, var_1_16=1, var_1_17=2147483648, var_1_18=2147483647, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=-117, var_1_5=-1, var_1_6=-1, var_1_7=1, var_1_8=0, var_1_9=126] [L136] RET, EXPR property() [L136] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=6174510460, var_1_11=-2147483650, var_1_12=8, var_1_15=5, var_1_16=1, var_1_17=2147483648, var_1_18=2147483647, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=-117, var_1_5=-1, var_1_6=-1, var_1_7=1, var_1_8=0, var_1_9=126] [L19] reach_error() VAL [isInitial=1, var_1_10=6174510460, var_1_11=-2147483650, var_1_12=8, var_1_15=5, var_1_16=1, var_1_17=2147483648, var_1_18=2147483647, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=-117, var_1_5=-1, var_1_6=-1, var_1_7=1, var_1_8=0, var_1_9=126] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 66 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.7s, OverallIterations: 5, TraceHistogramMax: 23, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 720 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 706 mSDsluCounter, 1244 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 848 mSDsCounter, 506 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1690 IncrementalHoareTripleChecker+Invalid, 2196 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 506 mSolverCounterUnsat, 396 mSDtfsCounter, 1690 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 730 GetRequests, 585 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2494 ImplicationChecksByTransitivity, 3.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=198occurred in iteration=4, InterpolantAutomatonStates: 95, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 76 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 5.6s InterpolantComputationTime, 1153 NumberOfCodeBlocks, 1153 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1001 ConstructedInterpolants, 0 QuantifiedInterpolants, 6897 SizeOfPredicates, 10 NumberOfNonLiveVariables, 988 ConjunctsInSsa, 63 ConjunctsInUnsatCore, 7 InterpolantComputations, 2 PerfectInterpolantSequences, 6782/7084 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:30:27,339 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-11.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 bb4a5dbd9bd36a08553228e3579f9c0fa33ebcb9ef473081910f145eb5cf5929 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 20:30:29,226 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 20:30:29,303 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:30:29,308 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 20:30:29,311 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 20:30:29,334 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 20:30:29,335 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 20:30:29,335 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 20:30:29,336 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 20:30:29,336 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 20:30:29,336 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 20:30:29,337 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 20:30:29,337 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 20:30:29,337 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 20:30:29,337 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 20:30:29,337 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 20:30:29,337 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 20:30:29,338 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 20:30:29,338 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 20:30:29,338 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 20:30:29,338 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 20:30:29,338 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 20:30:29,338 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 20:30:29,338 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-05 20:30:29,338 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-05 20:30:29,338 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-05 20:30:29,338 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 20:30:29,338 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 20:30:29,339 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 20:30:29,339 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 20:30:29,339 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 20:30:29,339 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 20:30:29,339 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 20:30:29,339 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 20:30:29,340 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 20:30:29,340 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 20:30:29,340 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 20:30:29,340 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 20:30:29,340 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 20:30:29,340 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-05 20:30:29,340 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-05 20:30:29,340 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 20:30:29,340 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 20:30:29,341 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 20:30:29,341 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 20:30:29,341 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 -> bb4a5dbd9bd36a08553228e3579f9c0fa33ebcb9ef473081910f145eb5cf5929 [2025-02-05 20:30:29,588 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 20:30:29,595 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 20:30:29,598 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 20:30:29,600 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 20:30:29,600 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 20:30:29,603 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-11.i [2025-02-05 20:30:30,883 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cbeb5309c/09850110337f476aa59f3d745fa8293a/FLAG4f0ed7a79 [2025-02-05 20:30:31,066 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 20:30:31,068 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-11.i [2025-02-05 20:30:31,075 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cbeb5309c/09850110337f476aa59f3d745fa8293a/FLAG4f0ed7a79 [2025-02-05 20:30:31,432 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cbeb5309c/09850110337f476aa59f3d745fa8293a [2025-02-05 20:30:31,433 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 20:30:31,434 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 20:30:31,435 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 20:30:31,435 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 20:30:31,438 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 20:30:31,438 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 08:30:31" (1/1) ... [2025-02-05 20:30:31,439 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2201fb3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:30:31, skipping insertion in model container [2025-02-05 20:30:31,439 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 08:30:31" (1/1) ... [2025-02-05 20:30:31,450 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 20:30:31,544 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-11.i[913,926] [2025-02-05 20:30:31,589 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 20:30:31,603 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 20:30:31,611 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-11.i[913,926] [2025-02-05 20:30:31,632 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 20:30:31,644 INFO L204 MainTranslator]: Completed translation [2025-02-05 20:30:31,645 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:30:31 WrapperNode [2025-02-05 20:30:31,645 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 20:30:31,646 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 20:30:31,646 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 20:30:31,646 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 20:30:31,650 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:30:31" (1/1) ... [2025-02-05 20:30:31,657 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:30:31" (1/1) ... [2025-02-05 20:30:31,676 INFO L138 Inliner]: procedures = 27, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 137 [2025-02-05 20:30:31,677 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 20:30:31,677 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 20:30:31,677 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 20:30:31,677 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 20:30:31,684 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:30:31" (1/1) ... [2025-02-05 20:30:31,685 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:30:31" (1/1) ... [2025-02-05 20:30:31,689 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:30:31" (1/1) ... [2025-02-05 20:30:31,702 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:30:31,702 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:30:31" (1/1) ... [2025-02-05 20:30:31,702 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:30:31" (1/1) ... [2025-02-05 20:30:31,709 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:30:31" (1/1) ... [2025-02-05 20:30:31,710 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:30:31" (1/1) ... [2025-02-05 20:30:31,711 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:30:31" (1/1) ... [2025-02-05 20:30:31,712 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:30:31" (1/1) ... [2025-02-05 20:30:31,714 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 20:30:31,715 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 20:30:31,715 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 20:30:31,715 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 20:30:31,715 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:30:31" (1/1) ... [2025-02-05 20:30:31,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 20:30:31,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:30:31,747 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:30:31,750 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:30:31,771 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 20:30:31,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-05 20:30:31,771 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 20:30:31,771 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 20:30:31,771 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 20:30:31,771 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 20:30:31,830 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 20:30:31,831 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 20:30:32,065 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-02-05 20:30:32,066 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 20:30:32,072 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 20:30:32,072 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 20:30:32,072 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 08:30:32 BoogieIcfgContainer [2025-02-05 20:30:32,072 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 20:30:32,074 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 20:30:32,074 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 20:30:32,077 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 20:30:32,077 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 08:30:31" (1/3) ... [2025-02-05 20:30:32,078 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15c57116 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 08:30:32, skipping insertion in model container [2025-02-05 20:30:32,078 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:30:31" (2/3) ... [2025-02-05 20:30:32,078 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15c57116 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 08:30:32, skipping insertion in model container [2025-02-05 20:30:32,079 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 08:30:32" (3/3) ... [2025-02-05 20:30:32,081 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_normal_file-11.i [2025-02-05 20:30:32,091 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 20:30:32,092 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_normal_file-11.i that has 2 procedures, 66 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 20:30:32,129 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 20:30:32,137 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;@7104cccd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 20:30:32,137 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 20:30:32,140 INFO L276 IsEmpty]: Start isEmpty. Operand has 66 states, 40 states have (on average 1.35) internal successors, (54), 41 states have internal predecessors, (54), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-02-05 20:30:32,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-02-05 20:30:32,150 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:30:32,151 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:32,151 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:30:32,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:30:32,156 INFO L85 PathProgramCache]: Analyzing trace with hash 2124740957, now seen corresponding path program 1 times [2025-02-05 20:30:32,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 20:30:32,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1050710442] [2025-02-05 20:30:32,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:30:32,164 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:30:32,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 20:30:32,166 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:30:32,167 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:30:32,243 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-02-05 20:30:32,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-02-05 20:30:32,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:30:32,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:30:32,354 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 20:30:32,376 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:30:32,413 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 464 proven. 0 refuted. 0 times theorem prover too weak. 548 trivial. 0 not checked. [2025-02-05 20:30:32,413 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 20:30:32,414 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 20:30:32,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1050710442] [2025-02-05 20:30:32,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1050710442] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:30:32,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:30:32,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 20:30:32,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384022298] [2025-02-05 20:30:32,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:30:32,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 20:30:32,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 20:30:32,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 20:30:32,434 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 20:30:32,436 INFO L87 Difference]: Start difference. First operand has 66 states, 40 states have (on average 1.35) internal successors, (54), 41 states have internal predecessors, (54), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-02-05 20:30:32,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:30:32,458 INFO L93 Difference]: Finished difference Result 126 states and 218 transitions. [2025-02-05 20:30:32,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 20:30:32,460 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 144 [2025-02-05 20:30:32,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:30:32,464 INFO L225 Difference]: With dead ends: 126 [2025-02-05 20:30:32,464 INFO L226 Difference]: Without dead ends: 63 [2025-02-05 20:30:32,466 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 143 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:30:32,468 INFO L435 NwaCegarLoop]: 95 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, 95 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:30:32,468 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 20:30:32,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-02-05 20:30:32,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2025-02-05 20:30:32,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 38 states have (on average 1.2894736842105263) internal successors, (49), 38 states have internal predecessors, (49), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-02-05 20:30:32,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 95 transitions. [2025-02-05 20:30:32,510 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 95 transitions. Word has length 144 [2025-02-05 20:30:32,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:30:32,510 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 95 transitions. [2025-02-05 20:30:32,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-02-05 20:30:32,510 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 95 transitions. [2025-02-05 20:30:32,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-02-05 20:30:32,512 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:30:32,512 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:32,519 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:30:32,713 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:30:32,713 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:30:32,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:30:32,714 INFO L85 PathProgramCache]: Analyzing trace with hash 710228064, now seen corresponding path program 1 times [2025-02-05 20:30:32,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 20:30:32,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [451788882] [2025-02-05 20:30:32,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:30:32,715 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:30:32,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 20:30:32,716 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:30:32,717 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:30:32,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-02-05 20:30:32,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-02-05 20:30:32,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:30:32,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:30:32,877 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 20:30:32,882 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:30:32,917 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-02-05 20:30:32,917 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 20:30:32,917 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 20:30:32,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [451788882] [2025-02-05 20:30:32,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [451788882] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:30:32,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:30:32,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 20:30:32,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946854937] [2025-02-05 20:30:32,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:30:32,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 20:30:32,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 20:30:32,919 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 20:30:32,919 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 20:30:32,919 INFO L87 Difference]: Start difference. First operand 63 states and 95 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-05 20:30:32,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:30:32,973 INFO L93 Difference]: Finished difference Result 135 states and 202 transitions. [2025-02-05 20:30:32,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 20:30:32,978 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 144 [2025-02-05 20:30:32,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:30:32,979 INFO L225 Difference]: With dead ends: 135 [2025-02-05 20:30:32,979 INFO L226 Difference]: Without dead ends: 75 [2025-02-05 20:30:32,980 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 20:30:32,980 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 13 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 20:30:32,980 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 176 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 20:30:32,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-02-05 20:30:32,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 67. [2025-02-05 20:30:32,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 42 states have internal predecessors, (55), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-02-05 20:30:32,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 101 transitions. [2025-02-05 20:30:32,991 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 101 transitions. Word has length 144 [2025-02-05 20:30:32,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:30:32,993 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 101 transitions. [2025-02-05 20:30:32,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-05 20:30:32,993 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 101 transitions. [2025-02-05 20:30:32,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-02-05 20:30:32,994 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:30:32,995 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:33,002 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:30:33,195 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:30:33,195 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:30:33,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:30:33,196 INFO L85 PathProgramCache]: Analyzing trace with hash 711151585, now seen corresponding path program 1 times [2025-02-05 20:30:33,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 20:30:33,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [751299767] [2025-02-05 20:30:33,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:30:33,196 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:30:33,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 20:30:33,198 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:30:33,199 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:30:33,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-02-05 20:30:33,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-02-05 20:30:33,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:30:33,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:30:33,336 INFO L256 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-05 20:30:33,344 INFO L279 TraceCheckSpWp]: Computing forward predicates...