./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-32.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-32.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 337f1a610115f3933d4f6e6746b25f8a38b025e0dccc86320876e3bf05f68b4e --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 20:19:38,726 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 20:19:38,787 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:19:38,793 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 20:19:38,795 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 20:19:38,816 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 20:19:38,817 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 20:19:38,817 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 20:19:38,818 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 20:19:38,818 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 20:19:38,819 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 20:19:38,819 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 20:19:38,819 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 20:19:38,819 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 20:19:38,820 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 20:19:38,820 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 20:19:38,820 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 20:19:38,820 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 20:19:38,820 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 20:19:38,820 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 20:19:38,820 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 20:19:38,820 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 20:19:38,820 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 20:19:38,820 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 20:19:38,821 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 20:19:38,821 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 20:19:38,821 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 20:19:38,821 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 20:19:38,821 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 20:19:38,821 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 20:19:38,821 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 20:19:38,821 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 20:19:38,822 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 20:19:38,822 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 20:19:38,822 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 20:19:38,822 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 20:19:38,822 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 20:19:38,822 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 20:19:38,822 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 20:19:38,822 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 20:19:38,822 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 20:19:38,822 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 20:19:38,822 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 20:19:38,822 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 -> 337f1a610115f3933d4f6e6746b25f8a38b025e0dccc86320876e3bf05f68b4e [2025-02-05 20:19:39,047 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 20:19:39,055 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 20:19:39,057 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 20:19:39,058 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 20:19:39,058 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 20:19:39,059 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-32.i [2025-02-05 20:19:40,298 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/14fe71c00/183aaecbd7c2463d880b5e7981f4bfe8/FLAG8de319c08 [2025-02-05 20:19:40,540 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 20:19:40,553 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-32.i [2025-02-05 20:19:40,567 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/14fe71c00/183aaecbd7c2463d880b5e7981f4bfe8/FLAG8de319c08 [2025-02-05 20:19:40,584 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/14fe71c00/183aaecbd7c2463d880b5e7981f4bfe8 [2025-02-05 20:19:40,585 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 20:19:40,586 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 20:19:40,587 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 20:19:40,588 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 20:19:40,591 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 20:19:40,591 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 08:19:40" (1/1) ... [2025-02-05 20:19:40,593 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@248d912d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:19:40, skipping insertion in model container [2025-02-05 20:19:40,593 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 08:19:40" (1/1) ... [2025-02-05 20:19:40,607 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 20:19:40,706 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-32.i[919,932] [2025-02-05 20:19:40,763 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 20:19:40,774 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 20:19:40,782 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-32.i[919,932] [2025-02-05 20:19:40,812 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 20:19:40,827 INFO L204 MainTranslator]: Completed translation [2025-02-05 20:19:40,827 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:19:40 WrapperNode [2025-02-05 20:19:40,827 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 20:19:40,828 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 20:19:40,828 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 20:19:40,828 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 20:19:40,833 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:19:40" (1/1) ... [2025-02-05 20:19:40,839 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:19:40" (1/1) ... [2025-02-05 20:19:40,858 INFO L138 Inliner]: procedures = 26, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 135 [2025-02-05 20:19:40,859 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 20:19:40,860 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 20:19:40,860 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 20:19:40,860 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 20:19:40,865 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:19:40" (1/1) ... [2025-02-05 20:19:40,865 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:19:40" (1/1) ... [2025-02-05 20:19:40,867 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:19:40" (1/1) ... [2025-02-05 20:19:40,880 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:19:40,880 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:19:40" (1/1) ... [2025-02-05 20:19:40,880 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:19:40" (1/1) ... [2025-02-05 20:19:40,885 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:19:40" (1/1) ... [2025-02-05 20:19:40,885 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:19:40" (1/1) ... [2025-02-05 20:19:40,888 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:19:40" (1/1) ... [2025-02-05 20:19:40,889 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:19:40" (1/1) ... [2025-02-05 20:19:40,894 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 20:19:40,895 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 20:19:40,895 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 20:19:40,895 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 20:19:40,895 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:19:40" (1/1) ... [2025-02-05 20:19:40,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 20:19:40,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:19:40,924 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:19:40,931 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:19:40,951 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 20:19:40,951 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 20:19:40,951 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 20:19:40,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 20:19:40,951 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 20:19:40,951 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 20:19:41,013 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 20:19:41,014 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 20:19:41,202 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-02-05 20:19:41,202 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 20:19:41,211 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 20:19:41,212 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 20:19:41,212 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 08:19:41 BoogieIcfgContainer [2025-02-05 20:19:41,212 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 20:19:41,214 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 20:19:41,214 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 20:19:41,217 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 20:19:41,217 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 08:19:40" (1/3) ... [2025-02-05 20:19:41,217 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51524539 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 08:19:41, skipping insertion in model container [2025-02-05 20:19:41,218 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:19:40" (2/3) ... [2025-02-05 20:19:41,218 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51524539 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 08:19:41, skipping insertion in model container [2025-02-05 20:19:41,218 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 08:19:41" (3/3) ... [2025-02-05 20:19:41,219 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-32.i [2025-02-05 20:19:41,229 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 20:19:41,232 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_dependencies_file-32.i that has 2 procedures, 60 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 20:19:41,262 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 20:19:41,269 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;@280caaf8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 20:19:41,269 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 20:19:41,272 INFO L276 IsEmpty]: Start isEmpty. Operand has 60 states, 38 states have (on average 1.394736842105263) internal successors, (53), 39 states have internal predecessors, (53), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-02-05 20:19:41,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-02-05 20:19:41,278 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:19:41,278 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:19:41,278 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:19:41,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:19:41,281 INFO L85 PathProgramCache]: Analyzing trace with hash 953019654, now seen corresponding path program 1 times [2025-02-05 20:19:41,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:19:41,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014695988] [2025-02-05 20:19:41,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:19:41,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:19:41,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-02-05 20:19:41,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-02-05 20:19:41,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:19:41,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:19:41,486 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2025-02-05 20:19:41,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:19:41,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014695988] [2025-02-05 20:19:41,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014695988] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 20:19:41,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1687081899] [2025-02-05 20:19:41,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:19:41,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:19:41,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:19:41,492 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:19:41,494 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:19:41,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-02-05 20:19:41,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-02-05 20:19:41,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:19:41,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:19:41,649 INFO L256 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 20:19:41,654 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:19:41,671 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2025-02-05 20:19:41,672 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 20:19:41,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1687081899] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:19:41,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 20:19:41,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-05 20:19:41,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148726283] [2025-02-05 20:19:41,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:19:41,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 20:19:41,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:19:41,690 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 20:19:41,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 20:19:41,696 INFO L87 Difference]: Start difference. First operand has 60 states, 38 states have (on average 1.394736842105263) internal successors, (53), 39 states have internal predecessors, (53), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-02-05 20:19:41,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:19:41,711 INFO L93 Difference]: Finished difference Result 114 states and 196 transitions. [2025-02-05 20:19:41,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 20:19:41,712 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 122 [2025-02-05 20:19:41,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:19:41,716 INFO L225 Difference]: With dead ends: 114 [2025-02-05 20:19:41,716 INFO L226 Difference]: Without dead ends: 57 [2025-02-05 20:19:41,718 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 123 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:19:41,720 INFO L435 NwaCegarLoop]: 86 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, 86 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:19:41,720 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 20:19:41,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-02-05 20:19:41,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2025-02-05 20:19:41,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 36 states have (on average 1.3333333333333333) internal successors, (48), 36 states have internal predecessors, (48), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-02-05 20:19:41,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 86 transitions. [2025-02-05 20:19:41,744 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 86 transitions. Word has length 122 [2025-02-05 20:19:41,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:19:41,745 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 86 transitions. [2025-02-05 20:19:41,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-02-05 20:19:41,745 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 86 transitions. [2025-02-05 20:19:41,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-02-05 20:19:41,748 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:19:41,748 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:19:41,755 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:19:41,949 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:19:41,949 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:19:41,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:19:41,950 INFO L85 PathProgramCache]: Analyzing trace with hash 1579344419, now seen corresponding path program 1 times [2025-02-05 20:19:41,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:19:41,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151295770] [2025-02-05 20:19:41,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:19:41,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:19:41,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-02-05 20:19:41,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-02-05 20:19:41,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:19:41,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:19:42,149 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-02-05 20:19:42,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:19:42,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151295770] [2025-02-05 20:19:42,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151295770] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:19:42,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:19:42,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 20:19:42,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928550942] [2025-02-05 20:19:42,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:19:42,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 20:19:42,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:19:42,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 20:19:42,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 20:19:42,151 INFO L87 Difference]: Start difference. First operand 57 states and 86 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-02-05 20:19:42,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:19:42,189 INFO L93 Difference]: Finished difference Result 165 states and 252 transitions. [2025-02-05 20:19:42,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 20:19:42,190 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 122 [2025-02-05 20:19:42,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:19:42,194 INFO L225 Difference]: With dead ends: 165 [2025-02-05 20:19:42,196 INFO L226 Difference]: Without dead ends: 111 [2025-02-05 20:19:42,196 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:19:42,197 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 42 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 158 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:19:42,198 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 158 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 20:19:42,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-02-05 20:19:42,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 108. [2025-02-05 20:19:42,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 67 states have (on average 1.328358208955224) internal successors, (89), 67 states have internal predecessors, (89), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-02-05 20:19:42,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 165 transitions. [2025-02-05 20:19:42,224 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 165 transitions. Word has length 122 [2025-02-05 20:19:42,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:19:42,225 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 165 transitions. [2025-02-05 20:19:42,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-02-05 20:19:42,225 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 165 transitions. [2025-02-05 20:19:42,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-02-05 20:19:42,230 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:19:42,230 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:19:42,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 20:19:42,230 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:19:42,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:19:42,231 INFO L85 PathProgramCache]: Analyzing trace with hash 1580267940, now seen corresponding path program 1 times [2025-02-05 20:19:42,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:19:42,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350695091] [2025-02-05 20:19:42,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:19:42,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:19:42,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-02-05 20:19:42,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-02-05 20:19:42,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:19:42,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:19:42,509 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 42 proven. 12 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2025-02-05 20:19:42,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:19:42,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350695091] [2025-02-05 20:19:42,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350695091] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 20:19:42,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [714467958] [2025-02-05 20:19:42,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:19:42,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:19:42,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:19:42,515 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:19:42,516 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:19:42,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-02-05 20:19:42,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-02-05 20:19:42,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:19:42,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:19:42,632 INFO L256 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-05 20:19:42,640 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:19:42,720 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 270 proven. 12 refuted. 0 times theorem prover too weak. 402 trivial. 0 not checked. [2025-02-05 20:19:42,721 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 20:19:42,840 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 42 proven. 12 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2025-02-05 20:19:42,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [714467958] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 20:19:42,841 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 20:19:42,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-02-05 20:19:42,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481421439] [2025-02-05 20:19:42,841 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 20:19:42,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 20:19:42,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:19:42,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 20:19:42,846 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 20:19:42,846 INFO L87 Difference]: Start difference. First operand 108 states and 165 transitions. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 2 states have call successors, (23), 2 states have call predecessors, (23), 4 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-02-05 20:19:43,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:19:43,105 INFO L93 Difference]: Finished difference Result 251 states and 377 transitions. [2025-02-05 20:19:43,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 20:19:43,105 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 2 states have call successors, (23), 2 states have call predecessors, (23), 4 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 122 [2025-02-05 20:19:43,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:19:43,111 INFO L225 Difference]: With dead ends: 251 [2025-02-05 20:19:43,111 INFO L226 Difference]: Without dead ends: 146 [2025-02-05 20:19:43,111 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 241 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2025-02-05 20:19:43,112 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 87 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 20:19:43,112 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 192 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 20:19:43,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2025-02-05 20:19:43,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 139. [2025-02-05 20:19:43,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 82 states have (on average 1.2439024390243902) internal successors, (102), 83 states have internal predecessors, (102), 52 states have call successors, (52), 4 states have call predecessors, (52), 4 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2025-02-05 20:19:43,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 206 transitions. [2025-02-05 20:19:43,138 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 206 transitions. Word has length 122 [2025-02-05 20:19:43,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:19:43,139 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 206 transitions. [2025-02-05 20:19:43,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 2 states have call successors, (23), 2 states have call predecessors, (23), 4 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-02-05 20:19:43,139 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 206 transitions. [2025-02-05 20:19:43,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-02-05 20:19:43,140 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:19:43,140 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:19:43,147 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-05 20:19:43,345 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:19:43,345 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:19:43,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:19:43,346 INFO L85 PathProgramCache]: Analyzing trace with hash -1464754776, now seen corresponding path program 1 times [2025-02-05 20:19:43,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:19:43,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027646368] [2025-02-05 20:19:43,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:19:43,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:19:43,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-05 20:19:43,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-05 20:19:43,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:19:43,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 20:19:43,421 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-05 20:19:43,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-05 20:19:43,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-05 20:19:43,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:19:43,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 20:19:43,508 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-05 20:19:43,508 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-05 20:19:43,509 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-05 20:19:43,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 20:19:43,515 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-02-05 20:19:43,598 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-05 20:19:43,600 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 08:19:43 BoogieIcfgContainer [2025-02-05 20:19:43,600 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-05 20:19:43,601 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-05 20:19:43,601 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-05 20:19:43,601 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-05 20:19:43,602 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 08:19:41" (3/4) ... [2025-02-05 20:19:43,607 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-05 20:19:43,607 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-05 20:19:43,608 INFO L158 Benchmark]: Toolchain (without parser) took 3021.48ms. Allocated memory is still 142.6MB. Free memory was 114.4MB in the beginning and 67.0MB in the end (delta: 47.4MB). Peak memory consumption was 48.0MB. Max. memory is 16.1GB. [2025-02-05 20:19:43,608 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 201.3MB. Free memory is still 126.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 20:19:43,608 INFO L158 Benchmark]: CACSL2BoogieTranslator took 240.64ms. Allocated memory is still 142.6MB. Free memory was 114.4MB in the beginning and 100.9MB in the end (delta: 13.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-05 20:19:43,608 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.03ms. Allocated memory is still 142.6MB. Free memory was 100.9MB in the beginning and 98.1MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 20:19:43,608 INFO L158 Benchmark]: Boogie Preprocessor took 34.37ms. Allocated memory is still 142.6MB. Free memory was 98.1MB in the beginning and 93.4MB in the end (delta: 4.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 20:19:43,608 INFO L158 Benchmark]: IcfgBuilder took 317.46ms. Allocated memory is still 142.6MB. Free memory was 93.4MB in the beginning and 73.8MB in the end (delta: 19.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-05 20:19:43,609 INFO L158 Benchmark]: TraceAbstraction took 2386.53ms. Allocated memory is still 142.6MB. Free memory was 72.9MB in the beginning and 67.1MB in the end (delta: 5.8MB). Peak memory consumption was 6.1MB. Max. memory is 16.1GB. [2025-02-05 20:19:43,609 INFO L158 Benchmark]: Witness Printer took 6.21ms. Allocated memory is still 142.6MB. Free memory was 67.1MB in the beginning and 67.0MB in the end (delta: 41.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 20:19:43,610 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.15ms. Allocated memory is still 201.3MB. Free memory is still 126.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 240.64ms. Allocated memory is still 142.6MB. Free memory was 114.4MB in the beginning and 100.9MB in the end (delta: 13.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.03ms. Allocated memory is still 142.6MB. Free memory was 100.9MB in the beginning and 98.1MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 34.37ms. Allocated memory is still 142.6MB. Free memory was 98.1MB in the beginning and 93.4MB in the end (delta: 4.7MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 317.46ms. Allocated memory is still 142.6MB. Free memory was 93.4MB in the beginning and 73.8MB in the end (delta: 19.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 2386.53ms. Allocated memory is still 142.6MB. Free memory was 72.9MB in the beginning and 67.1MB in the end (delta: 5.8MB). Peak memory consumption was 6.1MB. Max. memory is 16.1GB. * Witness Printer took 6.21ms. Allocated memory is still 142.6MB. Free memory was 67.1MB in the beginning and 67.0MB in the end (delta: 41.6kB). 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 107, overapproximation of someBinaryFLOATComparisonOperation at line 66, overapproximation of someBinaryFLOATComparisonOperation at line 109, overapproximation of someBinaryFLOATComparisonOperation at line 117, overapproximation of someBinaryFLOATComparisonOperation at line 75, overapproximation of someBinaryFLOATComparisonOperation at line 128, overapproximation of someBinaryDOUBLEComparisonOperation at line 128, overapproximation of someBinaryArithmeticFLOAToperation at line 61. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 2; [L23] unsigned char var_1_4 = 100; [L24] unsigned char var_1_5 = 2; [L25] unsigned char var_1_6 = 64; [L26] unsigned char var_1_7 = 32; [L27] unsigned char var_1_8 = 32; [L28] float var_1_9 = 100.5; [L29] float var_1_11 = 0.8; [L30] float var_1_12 = 2.5; [L31] signed short int var_1_13 = -32; [L32] unsigned char var_1_15 = 1; [L33] unsigned char var_1_16 = 0; [L34] unsigned char var_1_17 = 0; [L35] float var_1_18 = 0.25; [L36] float var_1_19 = 100000000.25; [L37] signed char var_1_20 = 0; [L38] signed char var_1_21 = 10; [L39] double var_1_22 = 1000000.5; [L40] unsigned long int var_1_23 = 256; [L41] unsigned long int var_1_24 = 50; [L42] unsigned char last_1_var_1_1 = 2; [L43] unsigned char last_1_var_1_15 = 1; [L44] signed char last_1_var_1_20 = 0; VAL [isInitial=0, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=100, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L132] isInitial = 1 [L133] FCALL initially() [L134] COND TRUE 1 [L135] CALL updateLastVariables() [L123] last_1_var_1_1 = var_1_1 [L124] last_1_var_1_15 = var_1_15 [L125] last_1_var_1_20 = var_1_20 VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=100, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L135] RET updateLastVariables() [L136] CALL updateVariables() [L91] var_1_4 = __VERIFIER_nondet_uchar() [L92] CALL assume_abort_if_not(var_1_4 >= 95) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=65407, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=65407, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L92] RET assume_abort_if_not(var_1_4 >= 95) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=65407, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L93] CALL assume_abort_if_not(var_1_4 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=65407, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=65407, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L93] RET assume_abort_if_not(var_1_4 <= 127) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=65407, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L94] var_1_5 = __VERIFIER_nondet_uchar() [L95] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=65407, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=65407, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L95] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=65407, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L96] CALL assume_abort_if_not(var_1_5 <= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=65407, var_1_5=0, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=65407, var_1_5=0, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L96] RET assume_abort_if_not(var_1_5 <= 32) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=65407, var_1_5=0, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L97] var_1_6 = __VERIFIER_nondet_uchar() [L98] CALL assume_abort_if_not(var_1_6 >= 64) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=65407, var_1_5=0, var_1_6=127, var_1_7=32, var_1_8=32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=65407, var_1_5=0, var_1_6=127, var_1_7=32, var_1_8=32, var_1_9=201/2] [L98] RET assume_abort_if_not(var_1_6 >= 64) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=65407, var_1_5=0, var_1_6=127, var_1_7=32, var_1_8=32, var_1_9=201/2] [L99] CALL assume_abort_if_not(var_1_6 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=65407, var_1_5=0, var_1_6=127, var_1_7=32, var_1_8=32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=65407, var_1_5=0, var_1_6=127, var_1_7=32, var_1_8=32, var_1_9=201/2] [L99] RET assume_abort_if_not(var_1_6 <= 127) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=65407, var_1_5=0, var_1_6=127, var_1_7=32, var_1_8=32, var_1_9=201/2] [L100] var_1_7 = __VERIFIER_nondet_uchar() [L101] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=65407, var_1_5=0, var_1_6=127, var_1_8=32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=65407, var_1_5=0, var_1_6=127, var_1_8=32, var_1_9=201/2] [L101] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=65407, var_1_5=0, var_1_6=127, var_1_8=32, var_1_9=201/2] [L102] CALL assume_abort_if_not(var_1_7 <= 64) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=65407, var_1_5=0, var_1_6=127, var_1_7=-256, var_1_8=32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=65407, var_1_5=0, var_1_6=127, var_1_7=-256, var_1_8=32, var_1_9=201/2] [L102] RET assume_abort_if_not(var_1_7 <= 64) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=65407, var_1_5=0, var_1_6=127, var_1_7=-256, var_1_8=32, var_1_9=201/2] [L103] var_1_8 = __VERIFIER_nondet_uchar() [L104] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=65407, var_1_5=0, var_1_6=127, var_1_7=-256, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=65407, var_1_5=0, var_1_6=127, var_1_7=-256, var_1_9=201/2] [L104] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=65407, var_1_5=0, var_1_6=127, var_1_7=-256, var_1_9=201/2] [L105] CALL assume_abort_if_not(var_1_8 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=65407, var_1_5=0, var_1_6=127, var_1_7=-256, var_1_8=0, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=65407, var_1_5=0, var_1_6=127, var_1_7=-256, var_1_8=0, var_1_9=201/2] [L105] RET assume_abort_if_not(var_1_8 <= 63) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=65407, var_1_5=0, var_1_6=127, var_1_7=-256, var_1_8=0, var_1_9=201/2] [L106] var_1_11 = __VERIFIER_nondet_float() [L107] CALL assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=65407, var_1_5=0, var_1_6=127, var_1_7=-256, var_1_8=0, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=65407, var_1_5=0, var_1_6=127, var_1_7=-256, var_1_8=0, var_1_9=201/2] [L107] RET assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=65407, var_1_5=0, var_1_6=127, var_1_7=-256, var_1_8=0, var_1_9=201/2] [L108] var_1_12 = __VERIFIER_nondet_float() [L109] CALL assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=65407, var_1_5=0, var_1_6=127, var_1_7=-256, var_1_8=0, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=65407, var_1_5=0, var_1_6=127, var_1_7=-256, var_1_8=0, var_1_9=201/2] [L109] RET assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=65407, var_1_5=0, var_1_6=127, var_1_7=-256, var_1_8=0, var_1_9=201/2] [L110] var_1_16 = __VERIFIER_nondet_uchar() [L111] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=65407, var_1_5=0, var_1_6=127, var_1_7=-256, var_1_8=0, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=65407, var_1_5=0, var_1_6=127, var_1_7=-256, var_1_8=0, var_1_9=201/2] [L111] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=65407, var_1_5=0, var_1_6=127, var_1_7=-256, var_1_8=0, var_1_9=201/2] [L112] CALL assume_abort_if_not(var_1_16 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=65407, var_1_5=0, var_1_6=127, var_1_7=-256, var_1_8=0, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=65407, var_1_5=0, var_1_6=127, var_1_7=-256, var_1_8=0, var_1_9=201/2] [L112] RET assume_abort_if_not(var_1_16 <= 0) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=65407, var_1_5=0, var_1_6=127, var_1_7=-256, var_1_8=0, var_1_9=201/2] [L113] var_1_17 = __VERIFIER_nondet_uchar() [L114] CALL assume_abort_if_not(var_1_17 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=65407, var_1_5=0, var_1_6=127, var_1_7=-256, var_1_8=0, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=65407, var_1_5=0, var_1_6=127, var_1_7=-256, var_1_8=0, var_1_9=201/2] [L114] RET assume_abort_if_not(var_1_17 >= 1) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=65407, var_1_5=0, var_1_6=127, var_1_7=-256, var_1_8=0, var_1_9=201/2] [L115] CALL assume_abort_if_not(var_1_17 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=65407, var_1_5=0, var_1_6=127, var_1_7=-256, var_1_8=0, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=65407, var_1_5=0, var_1_6=127, var_1_7=-256, var_1_8=0, var_1_9=201/2] [L115] RET assume_abort_if_not(var_1_17 <= 1) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=65407, var_1_5=0, var_1_6=127, var_1_7=-256, var_1_8=0, var_1_9=201/2] [L116] var_1_19 = __VERIFIER_nondet_float() [L117] CALL assume_abort_if_not((var_1_19 >= -461168.6018427382800e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=65407, var_1_5=0, var_1_6=127, var_1_7=-256, var_1_8=0, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=65407, var_1_5=0, var_1_6=127, var_1_7=-256, var_1_8=0, var_1_9=201/2] [L117] RET assume_abort_if_not((var_1_19 >= -461168.6018427382800e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=65407, var_1_5=0, var_1_6=127, var_1_7=-256, var_1_8=0, var_1_9=201/2] [L118] var_1_21 = __VERIFIER_nondet_char() [L119] CALL assume_abort_if_not(var_1_21 >= -31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=4, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=65407, var_1_5=0, var_1_6=127, var_1_7=-256, var_1_8=0, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=4, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=65407, var_1_5=0, var_1_6=127, var_1_7=-256, var_1_8=0, var_1_9=201/2] [L119] RET assume_abort_if_not(var_1_21 >= -31) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=4, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=65407, var_1_5=0, var_1_6=127, var_1_7=-256, var_1_8=0, var_1_9=201/2] [L120] CALL assume_abort_if_not(var_1_21 <= 31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=4, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=65407, var_1_5=0, var_1_6=127, var_1_7=-256, var_1_8=0, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=4, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=65407, var_1_5=0, var_1_6=127, var_1_7=-256, var_1_8=0, var_1_9=201/2] [L120] RET assume_abort_if_not(var_1_21 <= 31) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=4, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=65407, var_1_5=0, var_1_6=127, var_1_7=-256, var_1_8=0, var_1_9=201/2] [L136] RET updateVariables() [L137] CALL step() [L48] COND FALSE !(var_1_5 >= var_1_6) [L57] var_1_15 = var_1_17 VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=4, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=65407, var_1_5=0, var_1_6=127, var_1_7=-256, var_1_8=0, var_1_9=201/2] [L59] COND TRUE var_1_17 || var_1_15 VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=4, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=65407, var_1_5=0, var_1_6=127, var_1_7=-256, var_1_8=0, var_1_9=201/2] [L60] COND TRUE var_1_15 && var_1_15 [L61] var_1_18 = (var_1_11 + var_1_19) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=0, var_1_21=4, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=65407, var_1_5=0, var_1_6=127, var_1_7=-256, var_1_8=0, var_1_9=201/2] [L66] COND FALSE !((var_1_12 * ((((var_1_18) < (var_1_11)) ? (var_1_18) : (var_1_11)))) > (- var_1_18)) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=0, var_1_21=4, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=65407, var_1_5=0, var_1_6=127, var_1_7=-256, var_1_8=0, var_1_9=201/2] [L75] COND TRUE var_1_11 == var_1_18 [L76] var_1_20 = ((var_1_5 + var_1_21) + var_1_8) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=4, var_1_21=4, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=65407, var_1_5=0, var_1_6=127, var_1_7=-256, var_1_8=0, var_1_9=201/2] [L78] COND FALSE !((var_1_13 + ((((var_1_13) > (var_1_6)) ? (var_1_13) : (var_1_6)))) == var_1_5) [L81] var_1_9 = var_1_12 VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_12=100000005, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=4, var_1_21=4, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=65407, var_1_5=0, var_1_6=127, var_1_7=-256, var_1_8=0, var_1_9=100000005] [L83] var_1_22 = var_1_12 [L84] var_1_23 = var_1_8 [L85] var_1_24 = var_1_6 VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_12=100000005, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=4, var_1_21=4, var_1_22=100000005, var_1_23=0, var_1_24=127, var_1_4=65407, var_1_5=0, var_1_6=127, var_1_7=-256, var_1_8=0, var_1_9=100000005] [L86] COND FALSE !(-32 < var_1_13) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_12=100000005, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=4, var_1_21=4, var_1_22=100000005, var_1_23=0, var_1_24=127, var_1_4=65407, var_1_5=0, var_1_6=127, var_1_7=-256, var_1_8=0, var_1_9=100000005] [L137] RET step() [L138] CALL, EXPR property() [L128-L129] return (((((((((-32 < var_1_13) ? (var_1_1 == ((unsigned char) (((var_1_4 - var_1_5) + var_1_6) - (var_1_7 + ((((var_1_8) < 0 ) ? -(var_1_8) : (var_1_8))))))) : 1) && (((var_1_13 + ((((var_1_13) > (var_1_6)) ? (var_1_13) : (var_1_6)))) == var_1_5) ? (var_1_9 == ((float) ((4.5f + var_1_11) - var_1_12))) : (var_1_9 == ((float) var_1_12)))) && (((var_1_12 * ((((var_1_18) < (var_1_11)) ? (var_1_18) : (var_1_11)))) > (- var_1_18)) ? ((var_1_6 <= var_1_8) ? (var_1_15 ? (var_1_13 == ((signed short int) var_1_8)) : (var_1_13 == ((signed short int) var_1_5))) : 1) : 1)) && ((var_1_5 >= var_1_6) ? ((last_1_var_1_1 <= last_1_var_1_20) ? (var_1_15 == ((unsigned char) var_1_16)) : ((last_1_var_1_15 || var_1_16) ? (var_1_15 == ((unsigned char) var_1_17)) : 1)) : (var_1_15 == ((unsigned char) var_1_17)))) && ((var_1_17 || var_1_15) ? ((var_1_15 && var_1_15) ? (var_1_18 == ((float) (var_1_11 + var_1_19))) : (var_1_18 == ((float) var_1_19))) : 1)) && ((var_1_11 == var_1_18) ? (var_1_20 == ((signed char) ((var_1_5 + var_1_21) + var_1_8))) : 1)) && (var_1_22 == ((double) var_1_12))) && (var_1_23 == ((unsigned long int) var_1_8))) && (var_1_24 == ((unsigned long int) var_1_6)) ; VAL [\result=0, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_12=100000005, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=4, var_1_21=4, var_1_22=100000005, var_1_23=0, var_1_24=127, var_1_4=65407, var_1_5=0, var_1_6=127, var_1_7=-256, var_1_8=0, var_1_9=100000005] [L138] RET, EXPR property() [L138] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_12=100000005, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=4, var_1_21=4, var_1_22=100000005, var_1_23=0, var_1_24=127, var_1_4=65407, var_1_5=0, var_1_6=127, var_1_7=-256, var_1_8=0, var_1_9=100000005] [L19] reach_error() VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_12=100000005, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=4, var_1_21=4, var_1_22=100000005, var_1_23=0, var_1_24=127, var_1_4=65407, var_1_5=0, var_1_6=127, var_1_7=-256, var_1_8=0, var_1_9=100000005] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 60 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.3s, OverallIterations: 4, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 143 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 129 mSDsluCounter, 436 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 181 mSDsCounter, 33 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 198 IncrementalHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 33 mSolverCounterUnsat, 255 mSDtfsCounter, 198 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 377 GetRequests, 366 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=139occurred in iteration=3, InterpolantAutomatonStates: 14, 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, 3 MinimizatonAttempts, 10 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 733 NumberOfCodeBlocks, 733 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 726 ConstructedInterpolants, 0 QuantifiedInterpolants, 1108 SizeOfPredicates, 0 NumberOfNonLiveVariables, 594 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 6 InterpolantComputations, 2 PerfectInterpolantSequences, 4032/4104 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:19:43,627 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-32.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 337f1a610115f3933d4f6e6746b25f8a38b025e0dccc86320876e3bf05f68b4e --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 20:19:45,562 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 20:19:45,633 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:19:45,639 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 20:19:45,639 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 20:19:45,654 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 20:19:45,655 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 20:19:45,655 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 20:19:45,655 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 20:19:45,655 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 20:19:45,656 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 20:19:45,656 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 20:19:45,656 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 20:19:45,656 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 20:19:45,656 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 20:19:45,656 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 20:19:45,656 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 20:19:45,656 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 20:19:45,656 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 20:19:45,656 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 20:19:45,656 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 20:19:45,656 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 20:19:45,656 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 20:19:45,657 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-05 20:19:45,657 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-05 20:19:45,657 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-05 20:19:45,657 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 20:19:45,657 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 20:19:45,657 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 20:19:45,657 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 20:19:45,657 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 20:19:45,657 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 20:19:45,657 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 20:19:45,657 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 20:19:45,657 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 20:19:45,657 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 20:19:45,657 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 20:19:45,657 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 20:19:45,657 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 20:19:45,657 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-05 20:19:45,657 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-05 20:19:45,657 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 20:19:45,657 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 20:19:45,657 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 20:19:45,657 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 20:19:45,657 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 -> 337f1a610115f3933d4f6e6746b25f8a38b025e0dccc86320876e3bf05f68b4e [2025-02-05 20:19:45,893 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 20:19:45,898 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 20:19:45,900 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 20:19:45,901 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 20:19:45,901 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 20:19:45,901 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-32.i [2025-02-05 20:19:47,120 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/818e470a5/a17f68ff276a4120a7ba9a3a466146cc/FLAG9160890ab [2025-02-05 20:19:47,332 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 20:19:47,333 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-32.i [2025-02-05 20:19:47,341 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/818e470a5/a17f68ff276a4120a7ba9a3a466146cc/FLAG9160890ab [2025-02-05 20:19:47,704 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/818e470a5/a17f68ff276a4120a7ba9a3a466146cc [2025-02-05 20:19:47,706 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 20:19:47,709 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 20:19:47,710 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 20:19:47,711 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 20:19:47,714 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 20:19:47,714 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 08:19:47" (1/1) ... [2025-02-05 20:19:47,715 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@fdc3163 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:19:47, skipping insertion in model container [2025-02-05 20:19:47,715 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 08:19:47" (1/1) ... [2025-02-05 20:19:47,730 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 20:19:47,829 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-32.i[919,932] [2025-02-05 20:19:47,882 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 20:19:47,902 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 20:19:47,910 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-32.i[919,932] [2025-02-05 20:19:47,938 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 20:19:47,956 INFO L204 MainTranslator]: Completed translation [2025-02-05 20:19:47,959 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:19:47 WrapperNode [2025-02-05 20:19:47,959 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 20:19:47,960 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 20:19:47,960 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 20:19:47,961 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 20:19:47,965 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:19:47" (1/1) ... [2025-02-05 20:19:47,978 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:19:47" (1/1) ... [2025-02-05 20:19:48,003 INFO L138 Inliner]: procedures = 27, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 134 [2025-02-05 20:19:48,004 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 20:19:48,004 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 20:19:48,004 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 20:19:48,004 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 20:19:48,010 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:19:47" (1/1) ... [2025-02-05 20:19:48,011 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:19:47" (1/1) ... [2025-02-05 20:19:48,013 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:19:47" (1/1) ... [2025-02-05 20:19:48,021 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:19:48,023 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:19:47" (1/1) ... [2025-02-05 20:19:48,023 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:19:47" (1/1) ... [2025-02-05 20:19:48,034 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:19:47" (1/1) ... [2025-02-05 20:19:48,035 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:19:47" (1/1) ... [2025-02-05 20:19:48,036 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:19:47" (1/1) ... [2025-02-05 20:19:48,041 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:19:47" (1/1) ... [2025-02-05 20:19:48,042 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 20:19:48,043 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 20:19:48,043 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 20:19:48,043 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 20:19:48,047 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:19:47" (1/1) ... [2025-02-05 20:19:48,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 20:19:48,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:19:48,073 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:19:48,083 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:19:48,097 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 20:19:48,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-05 20:19:48,097 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 20:19:48,097 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 20:19:48,097 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 20:19:48,097 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 20:19:48,169 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 20:19:48,170 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 20:19:51,527 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-02-05 20:19:51,527 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 20:19:51,533 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 20:19:51,533 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 20:19:51,533 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 08:19:51 BoogieIcfgContainer [2025-02-05 20:19:51,534 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 20:19:51,535 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 20:19:51,535 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 20:19:51,539 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 20:19:51,539 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 08:19:47" (1/3) ... [2025-02-05 20:19:51,539 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@770123db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 08:19:51, skipping insertion in model container [2025-02-05 20:19:51,539 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:19:47" (2/3) ... [2025-02-05 20:19:51,539 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@770123db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 08:19:51, skipping insertion in model container [2025-02-05 20:19:51,539 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 08:19:51" (3/3) ... [2025-02-05 20:19:51,540 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-32.i [2025-02-05 20:19:51,562 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 20:19:51,567 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_dependencies_file-32.i that has 2 procedures, 60 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 20:19:51,598 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 20:19:51,605 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;@5299a17c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 20:19:51,605 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 20:19:51,608 INFO L276 IsEmpty]: Start isEmpty. Operand has 60 states, 38 states have (on average 1.394736842105263) internal successors, (53), 39 states have internal predecessors, (53), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-02-05 20:19:51,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-02-05 20:19:51,614 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:19:51,615 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:19:51,615 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:19:51,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:19:51,618 INFO L85 PathProgramCache]: Analyzing trace with hash 953019654, now seen corresponding path program 1 times [2025-02-05 20:19:51,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 20:19:51,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1435098257] [2025-02-05 20:19:51,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:19:51,626 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:19:51,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 20:19:51,627 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:19:51,634 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:19:51,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-02-05 20:19:51,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-02-05 20:19:51,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:19:51,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:19:51,839 INFO L256 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 20:19:51,844 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:19:51,870 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 360 proven. 0 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2025-02-05 20:19:51,870 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 20:19:51,871 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 20:19:51,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1435098257] [2025-02-05 20:19:51,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1435098257] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:19:51,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:19:51,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 20:19:51,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582794407] [2025-02-05 20:19:51,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:19:51,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 20:19:51,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 20:19:51,886 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 20:19:51,886 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 20:19:51,887 INFO L87 Difference]: Start difference. First operand has 60 states, 38 states have (on average 1.394736842105263) internal successors, (53), 39 states have internal predecessors, (53), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-02-05 20:19:51,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:19:51,901 INFO L93 Difference]: Finished difference Result 114 states and 196 transitions. [2025-02-05 20:19:51,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 20:19:51,903 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, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 122 [2025-02-05 20:19:51,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:19:51,907 INFO L225 Difference]: With dead ends: 114 [2025-02-05 20:19:51,907 INFO L226 Difference]: Without dead ends: 57 [2025-02-05 20:19:51,909 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 121 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:19:51,911 INFO L435 NwaCegarLoop]: 86 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, 86 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:19:51,911 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 20:19:51,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-02-05 20:19:51,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2025-02-05 20:19:51,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 36 states have (on average 1.3333333333333333) internal successors, (48), 36 states have internal predecessors, (48), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-02-05 20:19:51,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 86 transitions. [2025-02-05 20:19:51,939 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 86 transitions. Word has length 122 [2025-02-05 20:19:51,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:19:51,939 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 86 transitions. [2025-02-05 20:19:51,939 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, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-02-05 20:19:51,939 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 86 transitions. [2025-02-05 20:19:51,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-02-05 20:19:51,942 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:19:51,942 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:19:51,950 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-02-05 20:19:52,146 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:19:52,147 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:19:52,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:19:52,147 INFO L85 PathProgramCache]: Analyzing trace with hash 1579344419, now seen corresponding path program 1 times [2025-02-05 20:19:52,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 20:19:52,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1111699183] [2025-02-05 20:19:52,148 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:19:52,148 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:19:52,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 20:19:52,154 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:19:52,156 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:19:52,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-02-05 20:19:52,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-02-05 20:19:52,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:19:52,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:19:52,358 INFO L256 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-05 20:19:52,368 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:19:52,519 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 270 proven. 12 refuted. 0 times theorem prover too weak. 402 trivial. 0 not checked. [2025-02-05 20:19:52,519 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 20:19:52,710 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 42 proven. 12 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2025-02-05 20:19:52,711 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 20:19:52,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1111699183] [2025-02-05 20:19:52,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1111699183] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 20:19:52,711 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-05 20:19:52,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2025-02-05 20:19:52,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553835391] [2025-02-05 20:19:52,711 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-05 20:19:52,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 20:19:52,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 20:19:52,713 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 20:19:52,713 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 20:19:52,713 INFO L87 Difference]: Start difference. First operand 57 states and 86 transitions. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 2 states have call successors, (23), 2 states have call predecessors, (23), 4 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-02-05 20:19:54,921 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.93s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-05 20:19:55,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:19:55,159 INFO L93 Difference]: Finished difference Result 143 states and 214 transitions. [2025-02-05 20:19:55,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 20:19:55,160 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 2 states have call successors, (23), 2 states have call predecessors, (23), 4 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 122 [2025-02-05 20:19:55,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:19:55,162 INFO L225 Difference]: With dead ends: 143 [2025-02-05 20:19:55,162 INFO L226 Difference]: Without dead ends: 89 [2025-02-05 20:19:55,163 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 236 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2025-02-05 20:19:55,164 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 51 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-02-05 20:19:55,164 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 238 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-02-05 20:19:55,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-02-05 20:19:55,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 84. [2025-02-05 20:19:55,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 48 states have (on average 1.2291666666666667) internal successors, (59), 49 states have internal predecessors, (59), 33 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 32 states have call predecessors, (33), 33 states have call successors, (33) [2025-02-05 20:19:55,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 125 transitions. [2025-02-05 20:19:55,184 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 125 transitions. Word has length 122 [2025-02-05 20:19:55,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:19:55,185 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 125 transitions. [2025-02-05 20:19:55,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 2 states have call successors, (23), 2 states have call predecessors, (23), 4 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-02-05 20:19:55,185 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 125 transitions. [2025-02-05 20:19:55,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-02-05 20:19:55,199 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:19:55,199 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:19:55,210 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:19:55,399 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:19:55,400 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:19:55,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:19:55,401 INFO L85 PathProgramCache]: Analyzing trace with hash -1465678297, now seen corresponding path program 1 times [2025-02-05 20:19:55,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 20:19:55,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [282692810] [2025-02-05 20:19:55,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:19:55,405 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:19:55,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 20:19:55,407 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:19:55,408 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:19:55,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-05 20:19:55,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-05 20:19:55,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:19:55,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:19:55,586 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 20:19:55,589 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:19:55,985 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-02-05 20:19:55,986 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 20:19:55,986 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 20:19:55,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [282692810] [2025-02-05 20:19:55,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [282692810] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:19:55,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:19:55,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 20:19:55,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376244605] [2025-02-05 20:19:55,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:19:55,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 20:19:55,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 20:19:55,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 20:19:55,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 20:19:55,989 INFO L87 Difference]: Start difference. First operand 84 states and 125 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 2 states have internal predecessors, (31), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-02-05 20:19:58,485 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.24s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-05 20:20:00,282 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-05 20:20:00,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:20:00,297 INFO L93 Difference]: Finished difference Result 200 states and 295 transitions. [2025-02-05 20:20:00,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 20:20:00,340 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 2 states have internal predecessors, (31), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 123 [2025-02-05 20:20:00,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:20:00,343 INFO L225 Difference]: With dead ends: 200 [2025-02-05 20:20:00,347 INFO L226 Difference]: Without dead ends: 142 [2025-02-05 20:20:00,348 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 121 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:20:00,348 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 18 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2025-02-05 20:20:00,349 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 156 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2025-02-05 20:20:00,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2025-02-05 20:20:00,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 139. [2025-02-05 20:20:00,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 82 states have (on average 1.2439024390243902) internal successors, (102), 83 states have internal predecessors, (102), 52 states have call successors, (52), 4 states have call predecessors, (52), 4 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2025-02-05 20:20:00,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 206 transitions. [2025-02-05 20:20:00,370 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 206 transitions. Word has length 123 [2025-02-05 20:20:00,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:20:00,371 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 206 transitions. [2025-02-05 20:20:00,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 2 states have internal predecessors, (31), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-02-05 20:20:00,371 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 206 transitions. [2025-02-05 20:20:00,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-02-05 20:20:00,376 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:20:00,376 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:20:00,389 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-02-05 20:20:00,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 20:20:00,577 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:20:00,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:20:00,577 INFO L85 PathProgramCache]: Analyzing trace with hash -1464754776, now seen corresponding path program 1 times [2025-02-05 20:20:00,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 20:20:00,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1977193014] [2025-02-05 20:20:00,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:20:00,578 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:20:00,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 20:20:00,581 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-05 20:20:00,582 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-02-05 20:20:00,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-05 20:20:00,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-05 20:20:00,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:20:00,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:20:00,780 INFO L256 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-05 20:20:00,783 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:20:16,440 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 368 proven. 42 refuted. 0 times theorem prover too weak. 274 trivial. 0 not checked. [2025-02-05 20:20:16,440 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 20:20:38,551 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 20:20:38,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1977193014] [2025-02-05 20:20:38,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1977193014] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 20:20:38,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [630213724] [2025-02-05 20:20:38,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:20:38,551 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-02-05 20:20:38,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-02-05 20:20:38,571 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-02-05 20:20:38,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2025-02-05 20:20:38,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-05 20:20:39,353 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-05 20:20:39,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:20:39,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:20:39,369 INFO L256 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-05 20:20:39,371 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:21:04,339 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 368 proven. 42 refuted. 0 times theorem prover too weak. 274 trivial. 0 not checked. [2025-02-05 20:21:04,341 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 20:21:15,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [630213724] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 20:21:15,707 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-05 20:21:15,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2025-02-05 20:21:15,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458213917] [2025-02-05 20:21:15,707 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-05 20:21:15,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-05 20:21:15,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 20:21:15,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-05 20:21:15,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=115, Unknown=2, NotChecked=0, Total=156 [2025-02-05 20:21:15,709 INFO L87 Difference]: Start difference. First operand 139 states and 206 transitions. Second operand has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 10 states have internal predecessors, (42), 3 states have call successors, (19), 3 states have call predecessors, (19), 4 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2025-02-05 20:21:22,343 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0]