./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-23.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-23.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 ecb657514b6ca34f15abfe6004ba02d38bdfc8908a67ac6501ada0716f98bd40 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 09:46:31,739 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 09:46:31,789 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 09:46:31,798 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 09:46:31,799 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 09:46:31,812 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 09:46:31,813 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 09:46:31,813 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 09:46:31,813 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 09:46:31,813 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 09:46:31,813 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 09:46:31,814 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 09:46:31,814 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 09:46:31,814 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 09:46:31,814 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 09:46:31,814 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 09:46:31,814 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 09:46:31,814 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 09:46:31,814 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 09:46:31,814 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 09:46:31,815 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 09:46:31,815 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 09:46:31,815 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 09:46:31,815 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 09:46:31,815 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 09:46:31,815 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 09:46:31,815 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 09:46:31,815 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 09:46:31,815 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 09:46:31,815 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 09:46:31,815 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 09:46:31,815 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 09:46:31,816 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 09:46:31,816 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 09:46:31,816 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 09:46:31,816 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 09:46:31,816 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 09:46:31,816 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 09:46:31,816 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 09:46:31,816 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 09:46:31,816 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 09:46:31,816 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 09:46:31,816 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 09:46:31,816 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/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 -> ecb657514b6ca34f15abfe6004ba02d38bdfc8908a67ac6501ada0716f98bd40 [2025-03-08 09:46:32,048 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 09:46:32,054 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 09:46:32,058 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 09:46:32,059 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 09:46:32,059 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 09:46:32,060 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-23.i [2025-03-08 09:46:33,207 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c0070100/54891ccc725d4bc6a6fed2a120f8f643/FLAG9d5729531 [2025-03-08 09:46:33,469 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 09:46:33,470 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-23.i [2025-03-08 09:46:33,479 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c0070100/54891ccc725d4bc6a6fed2a120f8f643/FLAG9d5729531 [2025-03-08 09:46:33,494 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c0070100/54891ccc725d4bc6a6fed2a120f8f643 [2025-03-08 09:46:33,496 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 09:46:33,497 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 09:46:33,498 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 09:46:33,498 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 09:46:33,501 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 09:46:33,502 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:46:33" (1/1) ... [2025-03-08 09:46:33,504 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5540f65f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:46:33, skipping insertion in model container [2025-03-08 09:46:33,504 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:46:33" (1/1) ... [2025-03-08 09:46:33,519 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 09:46:33,627 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-23.i[919,932] [2025-03-08 09:46:33,689 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 09:46:33,698 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 09:46:33,706 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-23.i[919,932] [2025-03-08 09:46:33,731 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 09:46:33,747 INFO L204 MainTranslator]: Completed translation [2025-03-08 09:46:33,747 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:46:33 WrapperNode [2025-03-08 09:46:33,747 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 09:46:33,748 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 09:46:33,748 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 09:46:33,748 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 09:46:33,752 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:46:33" (1/1) ... [2025-03-08 09:46:33,759 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:46:33" (1/1) ... [2025-03-08 09:46:33,780 INFO L138 Inliner]: procedures = 26, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 138 [2025-03-08 09:46:33,780 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 09:46:33,781 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 09:46:33,781 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 09:46:33,781 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 09:46:33,790 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:46:33" (1/1) ... [2025-03-08 09:46:33,791 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:46:33" (1/1) ... [2025-03-08 09:46:33,793 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:46:33" (1/1) ... [2025-03-08 09:46:33,803 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-03-08 09:46:33,803 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:46:33" (1/1) ... [2025-03-08 09:46:33,803 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:46:33" (1/1) ... [2025-03-08 09:46:33,808 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:46:33" (1/1) ... [2025-03-08 09:46:33,809 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:46:33" (1/1) ... [2025-03-08 09:46:33,811 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:46:33" (1/1) ... [2025-03-08 09:46:33,811 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:46:33" (1/1) ... [2025-03-08 09:46:33,813 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 09:46:33,814 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 09:46:33,814 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 09:46:33,814 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 09:46:33,821 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:46:33" (1/1) ... [2025-03-08 09:46:33,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 09:46:33,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 09:46:33,847 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 09:46:33,852 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 09:46:33,867 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 09:46:33,867 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 09:46:33,867 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 09:46:33,867 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 09:46:33,867 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 09:46:33,867 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 09:46:33,922 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 09:46:33,923 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 09:46:34,177 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-03-08 09:46:34,178 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 09:46:34,187 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 09:46:34,187 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 09:46:34,188 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:46:34 BoogieIcfgContainer [2025-03-08 09:46:34,188 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 09:46:34,190 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 09:46:34,190 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 09:46:34,193 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 09:46:34,194 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 09:46:33" (1/3) ... [2025-03-08 09:46:34,194 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@371badcc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:46:34, skipping insertion in model container [2025-03-08 09:46:34,195 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:46:33" (2/3) ... [2025-03-08 09:46:34,195 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@371badcc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:46:34, skipping insertion in model container [2025-03-08 09:46:34,195 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:46:34" (3/3) ... [2025-03-08 09:46:34,196 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-23.i [2025-03-08 09:46:34,206 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 09:46:34,208 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_dependencies_file-23.i that has 2 procedures, 62 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 09:46:34,248 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 09:46:34,256 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;@286b890f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 09:46:34,256 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 09:46:34,259 INFO L276 IsEmpty]: Start isEmpty. Operand has 62 states, 38 states have (on average 1.368421052631579) internal successors, (52), 39 states have internal predecessors, (52), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-08 09:46:34,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-08 09:46:34,269 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:46:34,269 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 09:46:34,270 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:46:34,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:46:34,273 INFO L85 PathProgramCache]: Analyzing trace with hash -525947338, now seen corresponding path program 1 times [2025-03-08 09:46:34,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:46:34,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937719815] [2025-03-08 09:46:34,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:46:34,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:46:34,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-08 09:46:34,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-08 09:46:34,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:46:34,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:46:34,532 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2025-03-08 09:46:34,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:46:34,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937719815] [2025-03-08 09:46:34,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937719815] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 09:46:34,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [300552961] [2025-03-08 09:46:34,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:46:34,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 09:46:34,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 09:46:34,538 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 09:46:34,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 09:46:34,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-08 09:46:34,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-08 09:46:34,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:46:34,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:46:34,664 INFO L256 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 09:46:34,673 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 09:46:34,702 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2025-03-08 09:46:34,703 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 09:46:34,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [300552961] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:46:34,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 09:46:34,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 09:46:34,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986934271] [2025-03-08 09:46:34,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:46:34,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 09:46:34,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:46:34,722 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 09:46:34,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 09:46:34,724 INFO L87 Difference]: Start difference. First operand has 62 states, 38 states have (on average 1.368421052631579) internal successors, (52), 39 states have internal predecessors, (52), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-08 09:46:34,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:46:34,746 INFO L93 Difference]: Finished difference Result 118 states and 204 transitions. [2025-03-08 09:46:34,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 09:46:34,748 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 133 [2025-03-08 09:46:34,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:46:34,767 INFO L225 Difference]: With dead ends: 118 [2025-03-08 09:46:34,767 INFO L226 Difference]: Without dead ends: 59 [2025-03-08 09:46:34,770 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 134 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-03-08 09:46:34,772 INFO L435 NwaCegarLoop]: 89 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, 89 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-03-08 09:46:34,772 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 09:46:34,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-03-08 09:46:34,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2025-03-08 09:46:34,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 36 states have internal predecessors, (47), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-08 09:46:34,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 89 transitions. [2025-03-08 09:46:34,806 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 89 transitions. Word has length 133 [2025-03-08 09:46:34,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:46:34,806 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 89 transitions. [2025-03-08 09:46:34,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-08 09:46:34,806 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 89 transitions. [2025-03-08 09:46:34,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-08 09:46:34,808 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:46:34,808 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 09:46:34,815 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 09:46:35,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 09:46:35,009 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:46:35,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:46:35,010 INFO L85 PathProgramCache]: Analyzing trace with hash 1931705647, now seen corresponding path program 1 times [2025-03-08 09:46:35,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:46:35,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688581496] [2025-03-08 09:46:35,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:46:35,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:46:35,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-08 09:46:35,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-08 09:46:35,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:46:35,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 09:46:35,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [363666844] [2025-03-08 09:46:35,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:46:35,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 09:46:35,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 09:46:35,197 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 09:46:35,198 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 09:46:35,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-08 09:46:35,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-08 09:46:35,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:46:35,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:46:35,411 INFO L256 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-03-08 09:46:35,417 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 09:46:36,330 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 462 proven. 21 refuted. 0 times theorem prover too weak. 357 trivial. 0 not checked. [2025-03-08 09:46:36,331 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 09:46:53,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:46:53,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688581496] [2025-03-08 09:46:53,979 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 09:46:53,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [363666844] [2025-03-08 09:46:53,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [363666844] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 09:46:53,979 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-08 09:46:53,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2025-03-08 09:46:53,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147174071] [2025-03-08 09:46:53,979 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-08 09:46:53,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-08 09:46:53,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:46:53,980 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-08 09:46:53,980 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=475, Unknown=0, NotChecked=0, Total=650 [2025-03-08 09:46:53,981 INFO L87 Difference]: Start difference. First operand 59 states and 89 transitions. Second operand has 17 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 15 states have internal predecessors, (46), 4 states have call successors, (21), 4 states have call predecessors, (21), 6 states have return successors, (21), 5 states have call predecessors, (21), 4 states have call successors, (21) [2025-03-08 09:46:55,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:46:55,031 INFO L93 Difference]: Finished difference Result 206 states and 298 transitions. [2025-03-08 09:46:55,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-08 09:46:55,032 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 15 states have internal predecessors, (46), 4 states have call successors, (21), 4 states have call predecessors, (21), 6 states have return successors, (21), 5 states have call predecessors, (21), 4 states have call successors, (21) Word has length 133 [2025-03-08 09:46:55,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:46:55,035 INFO L225 Difference]: With dead ends: 206 [2025-03-08 09:46:55,035 INFO L226 Difference]: Without dead ends: 150 [2025-03-08 09:46:55,037 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 480 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=535, Invalid=1445, Unknown=0, NotChecked=0, Total=1980 [2025-03-08 09:46:55,038 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 277 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 09:46:55,038 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 370 Invalid, 499 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 09:46:55,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2025-03-08 09:46:55,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 123. [2025-03-08 09:46:55,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 74 states have (on average 1.2432432432432432) internal successors, (92), 74 states have internal predecessors, (92), 42 states have call successors, (42), 6 states have call predecessors, (42), 6 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-08 09:46:55,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 176 transitions. [2025-03-08 09:46:55,061 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 176 transitions. Word has length 133 [2025-03-08 09:46:55,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:46:55,062 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 176 transitions. [2025-03-08 09:46:55,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 15 states have internal predecessors, (46), 4 states have call successors, (21), 4 states have call predecessors, (21), 6 states have return successors, (21), 5 states have call predecessors, (21), 4 states have call successors, (21) [2025-03-08 09:46:55,062 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 176 transitions. [2025-03-08 09:46:55,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-08 09:46:55,063 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:46:55,063 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 09:46:55,091 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 09:46:55,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2025-03-08 09:46:55,266 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:46:55,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:46:55,266 INFO L85 PathProgramCache]: Analyzing trace with hash 1932629168, now seen corresponding path program 1 times [2025-03-08 09:46:55,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:46:55,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724700223] [2025-03-08 09:46:55,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:46:55,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:46:55,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-08 09:46:55,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-08 09:46:55,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:46:55,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 09:46:55,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1621257245] [2025-03-08 09:46:55,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:46:55,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 09:46:55,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 09:46:55,339 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 09:46:55,340 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 09:46:55,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-08 09:46:55,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-08 09:46:55,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:46:55,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 09:46:55,437 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 09:46:55,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-08 09:46:55,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-08 09:46:55,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:46:55,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 09:46:55,517 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 09:46:55,517 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 09:46:55,518 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 09:46:55,524 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-08 09:46:55,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 09:46:55,722 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-08 09:46:55,792 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 09:46:55,795 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 09:46:55 BoogieIcfgContainer [2025-03-08 09:46:55,795 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 09:46:55,795 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 09:46:55,795 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 09:46:55,795 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 09:46:55,796 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:46:34" (3/4) ... [2025-03-08 09:46:55,797 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 09:46:55,798 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 09:46:55,798 INFO L158 Benchmark]: Toolchain (without parser) took 22301.93ms. Allocated memory was 167.8MB in the beginning and 343.9MB in the end (delta: 176.2MB). Free memory was 122.7MB in the beginning and 232.6MB in the end (delta: -110.0MB). Peak memory consumption was 62.2MB. Max. memory is 16.1GB. [2025-03-08 09:46:55,799 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 201.3MB. Free memory is still 117.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 09:46:55,799 INFO L158 Benchmark]: CACSL2BoogieTranslator took 249.94ms. Allocated memory is still 167.8MB. Free memory was 122.7MB in the beginning and 108.9MB in the end (delta: 13.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 09:46:55,799 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.31ms. Allocated memory is still 167.8MB. Free memory was 108.9MB in the beginning and 105.3MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 09:46:55,799 INFO L158 Benchmark]: Boogie Preprocessor took 32.69ms. Allocated memory is still 167.8MB. Free memory was 105.3MB in the beginning and 99.1MB in the end (delta: 6.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 09:46:55,799 INFO L158 Benchmark]: IcfgBuilder took 373.74ms. Allocated memory is still 167.8MB. Free memory was 99.1MB in the beginning and 76.6MB in the end (delta: 22.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 09:46:55,800 INFO L158 Benchmark]: TraceAbstraction took 21604.56ms. Allocated memory was 167.8MB in the beginning and 343.9MB in the end (delta: 176.2MB). Free memory was 76.0MB in the beginning and 232.7MB in the end (delta: -156.7MB). Peak memory consumption was 20.3MB. Max. memory is 16.1GB. [2025-03-08 09:46:55,800 INFO L158 Benchmark]: Witness Printer took 2.82ms. Allocated memory is still 343.9MB. Free memory was 232.7MB in the beginning and 232.6MB in the end (delta: 69.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 09:46:55,801 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.25ms. Allocated memory is still 201.3MB. Free memory is still 117.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 249.94ms. Allocated memory is still 167.8MB. Free memory was 122.7MB in the beginning and 108.9MB in the end (delta: 13.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.31ms. Allocated memory is still 167.8MB. Free memory was 108.9MB in the beginning and 105.3MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 32.69ms. Allocated memory is still 167.8MB. Free memory was 105.3MB in the beginning and 99.1MB in the end (delta: 6.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 373.74ms. Allocated memory is still 167.8MB. Free memory was 99.1MB in the beginning and 76.6MB in the end (delta: 22.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 21604.56ms. Allocated memory was 167.8MB in the beginning and 343.9MB in the end (delta: 176.2MB). Free memory was 76.0MB in the beginning and 232.7MB in the end (delta: -156.7MB). Peak memory consumption was 20.3MB. Max. memory is 16.1GB. * Witness Printer took 2.82ms. Allocated memory is still 343.9MB. Free memory was 232.7MB in the beginning and 232.6MB in the end (delta: 69.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 107, overapproximation of someBinaryFLOATComparisonOperation at line 101, overapproximation of someBinaryFLOATComparisonOperation at line 105, overapproximation of someBinaryFLOATComparisonOperation at line 99, overapproximation of someBinaryFLOATComparisonOperation at line 103, overapproximation of someBinaryFLOATComparisonOperation at line 65, overapproximation of someBinaryFLOATComparisonOperation at line 130, overapproximation of someUnaryDOUBLEoperation at line 41, overapproximation of someBinaryDOUBLEComparisonOperation at line 130, overapproximation of someBinaryDOUBLEComparisonOperation at line 64. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 0; [L23] unsigned char var_1_2 = 1; [L24] unsigned char var_1_3 = 0; [L25] float var_1_4 = 1.4; [L26] float var_1_7 = 9.25; [L27] float var_1_8 = 1.2; [L28] float var_1_9 = 0.0; [L29] float var_1_10 = 3.1; [L30] float var_1_11 = 500.5; [L31] signed long int var_1_12 = 0; [L32] unsigned char var_1_13 = 10; [L33] unsigned char var_1_14 = 8; [L34] unsigned char var_1_17 = 64; [L35] unsigned long int var_1_18 = 25; [L36] signed char var_1_19 = -100; [L37] signed short int var_1_20 = -4; [L38] unsigned short int var_1_21 = 200; [L39] unsigned short int var_1_22 = 54878; [L40] double var_1_23 = 9999.8; [L41] float var_1_24 = -0.25; [L42] signed char var_1_25 = 50; [L43] signed char last_1_var_1_19 = -100; VAL [isInitial=0, last_1_var_1_19=-100, var_1_10=31/10, var_1_11=1001/2, var_1_12=0, var_1_13=10, var_1_14=8, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5, var_1_7=37/4, var_1_8=6/5, var_1_9=0] [L134] isInitial = 1 [L135] FCALL initially() [L136] COND TRUE 1 [L137] CALL updateLastVariables() [L127] last_1_var_1_19 = var_1_19 VAL [isInitial=1, last_1_var_1_19=-100, var_1_10=31/10, var_1_11=1001/2, var_1_12=0, var_1_13=10, var_1_14=8, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5, var_1_7=37/4, var_1_8=6/5, var_1_9=0] [L137] RET updateLastVariables() [L138] CALL updateVariables() [L92] var_1_2 = __VERIFIER_nondet_uchar() [L93] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=-100, var_1_10=31/10, var_1_11=1001/2, var_1_12=0, var_1_13=10, var_1_14=8, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_3=0, var_1_4=7/5, var_1_7=37/4, var_1_8=6/5, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=-100, var_1_10=31/10, var_1_11=1001/2, var_1_12=0, var_1_13=10, var_1_14=8, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_3=0, var_1_4=7/5, var_1_7=37/4, var_1_8=6/5, var_1_9=0] [L93] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_19=-100, var_1_10=31/10, var_1_11=1001/2, var_1_12=0, var_1_13=10, var_1_14=8, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_3=0, var_1_4=7/5, var_1_7=37/4, var_1_8=6/5, var_1_9=0] [L94] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=-100, var_1_10=31/10, var_1_11=1001/2, var_1_12=0, var_1_13=10, var_1_14=8, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=0, var_1_3=0, var_1_4=7/5, var_1_7=37/4, var_1_8=6/5, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=-100, var_1_10=31/10, var_1_11=1001/2, var_1_12=0, var_1_13=10, var_1_14=8, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=0, var_1_3=0, var_1_4=7/5, var_1_7=37/4, var_1_8=6/5, var_1_9=0] [L94] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_19=-100, var_1_10=31/10, var_1_11=1001/2, var_1_12=0, var_1_13=10, var_1_14=8, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=0, var_1_3=0, var_1_4=7/5, var_1_7=37/4, var_1_8=6/5, var_1_9=0] [L95] var_1_3 = __VERIFIER_nondet_uchar() [L96] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=-100, var_1_10=31/10, var_1_11=1001/2, var_1_12=0, var_1_13=10, var_1_14=8, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=0, var_1_4=7/5, var_1_7=37/4, var_1_8=6/5, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=-100, var_1_10=31/10, var_1_11=1001/2, var_1_12=0, var_1_13=10, var_1_14=8, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=0, var_1_4=7/5, var_1_7=37/4, var_1_8=6/5, var_1_9=0] [L96] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_19=-100, var_1_10=31/10, var_1_11=1001/2, var_1_12=0, var_1_13=10, var_1_14=8, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=0, var_1_4=7/5, var_1_7=37/4, var_1_8=6/5, var_1_9=0] [L97] CALL assume_abort_if_not(var_1_3 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=-100, var_1_10=31/10, var_1_11=1001/2, var_1_12=0, var_1_13=10, var_1_14=8, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=0, var_1_3=0, var_1_4=7/5, var_1_7=37/4, var_1_8=6/5, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=-100, var_1_10=31/10, var_1_11=1001/2, var_1_12=0, var_1_13=10, var_1_14=8, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=0, var_1_3=0, var_1_4=7/5, var_1_7=37/4, var_1_8=6/5, var_1_9=0] [L97] RET assume_abort_if_not(var_1_3 <= 0) VAL [isInitial=1, last_1_var_1_19=-100, var_1_10=31/10, var_1_11=1001/2, var_1_12=0, var_1_13=10, var_1_14=8, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=0, var_1_3=0, var_1_4=7/5, var_1_7=37/4, var_1_8=6/5, var_1_9=0] [L98] var_1_7 = __VERIFIER_nondet_float() [L99] CALL assume_abort_if_not((var_1_7 >= -922337.2036854765600e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=-100, var_1_10=31/10, var_1_11=1001/2, var_1_12=0, var_1_13=10, var_1_14=8, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=0, var_1_3=0, var_1_4=7/5, var_1_8=6/5, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=-100, var_1_10=31/10, var_1_11=1001/2, var_1_12=0, var_1_13=10, var_1_14=8, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=0, var_1_3=0, var_1_4=7/5, var_1_8=6/5, var_1_9=0] [L99] RET assume_abort_if_not((var_1_7 >= -922337.2036854765600e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_19=-100, var_1_10=31/10, var_1_11=1001/2, var_1_12=0, var_1_13=10, var_1_14=8, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=0, var_1_3=0, var_1_4=7/5, var_1_8=6/5, var_1_9=0] [L100] var_1_8 = __VERIFIER_nondet_float() [L101] CALL assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=-100, var_1_10=31/10, var_1_11=1001/2, var_1_12=0, var_1_13=10, var_1_14=8, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=0, var_1_3=0, var_1_4=7/5, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=-100, var_1_10=31/10, var_1_11=1001/2, var_1_12=0, var_1_13=10, var_1_14=8, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=0, var_1_3=0, var_1_4=7/5, var_1_9=0] [L101] RET assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_19=-100, var_1_10=31/10, var_1_11=1001/2, var_1_12=0, var_1_13=10, var_1_14=8, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=0, var_1_3=0, var_1_4=7/5, var_1_9=0] [L102] var_1_9 = __VERIFIER_nondet_float() [L103] CALL assume_abort_if_not((var_1_9 >= 4611686.018427382800e+12F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=-100, var_1_10=31/10, var_1_11=1001/2, var_1_12=0, var_1_13=10, var_1_14=8, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=0, var_1_3=0, var_1_4=7/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=-100, var_1_10=31/10, var_1_11=1001/2, var_1_12=0, var_1_13=10, var_1_14=8, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=0, var_1_3=0, var_1_4=7/5] [L103] RET assume_abort_if_not((var_1_9 >= 4611686.018427382800e+12F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_19=-100, var_1_10=31/10, var_1_11=1001/2, var_1_12=0, var_1_13=10, var_1_14=8, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=0, var_1_3=0, var_1_4=7/5] [L104] var_1_10 = __VERIFIER_nondet_float() [L105] CALL assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=-100, var_1_11=1001/2, var_1_12=0, var_1_13=10, var_1_14=8, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=0, var_1_3=0, var_1_4=7/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=-100, var_1_11=1001/2, var_1_12=0, var_1_13=10, var_1_14=8, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=0, var_1_3=0, var_1_4=7/5] [L105] RET assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_19=-100, var_1_11=1001/2, var_1_12=0, var_1_13=10, var_1_14=8, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=0, var_1_3=0, var_1_4=7/5] [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 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=-100, var_1_12=0, var_1_13=10, var_1_14=8, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=0, var_1_3=0, var_1_4=7/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=-100, var_1_12=0, var_1_13=10, var_1_14=8, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=0, var_1_3=0, var_1_4=7/5] [L107] RET assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_19=-100, var_1_12=0, var_1_13=10, var_1_14=8, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=0, var_1_3=0, var_1_4=7/5] [L108] var_1_13 = __VERIFIER_nondet_uchar() [L109] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=-100, var_1_12=0, var_1_14=8, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=0, var_1_3=0, var_1_4=7/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=-100, var_1_12=0, var_1_14=8, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=0, var_1_3=0, var_1_4=7/5] [L109] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_19=-100, var_1_12=0, var_1_14=8, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=0, var_1_3=0, var_1_4=7/5] [L110] CALL assume_abort_if_not(var_1_13 <= 64) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=-100, var_1_12=0, var_1_13=-192, var_1_14=8, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=0, var_1_3=0, var_1_4=7/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=-100, var_1_12=0, var_1_13=-192, var_1_14=8, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=0, var_1_3=0, var_1_4=7/5] [L110] RET assume_abort_if_not(var_1_13 <= 64) VAL [isInitial=1, last_1_var_1_19=-100, var_1_12=0, var_1_13=-192, var_1_14=8, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=0, var_1_3=0, var_1_4=7/5] [L111] var_1_14 = __VERIFIER_nondet_uchar() [L112] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=-100, var_1_12=0, var_1_13=-192, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=0, var_1_3=0, var_1_4=7/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=-100, var_1_12=0, var_1_13=-192, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=0, var_1_3=0, var_1_4=7/5] [L112] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_19=-100, var_1_12=0, var_1_13=-192, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=0, var_1_3=0, var_1_4=7/5] [L113] CALL assume_abort_if_not(var_1_14 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=-100, var_1_12=0, var_1_13=-192, var_1_14=256, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=0, var_1_3=0, var_1_4=7/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=-100, var_1_12=0, var_1_13=-192, var_1_14=256, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=0, var_1_3=0, var_1_4=7/5] [L113] RET assume_abort_if_not(var_1_14 <= 127) VAL [isInitial=1, last_1_var_1_19=-100, var_1_12=0, var_1_13=-192, var_1_14=256, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=0, var_1_3=0, var_1_4=7/5] [L114] var_1_17 = __VERIFIER_nondet_uchar() [L115] CALL assume_abort_if_not(var_1_17 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=-100, var_1_12=0, var_1_13=-192, var_1_14=256, var_1_17=123, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=0, var_1_3=0, var_1_4=7/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=-100, var_1_12=0, var_1_13=-192, var_1_14=256, var_1_17=123, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=0, var_1_3=0, var_1_4=7/5] [L115] RET assume_abort_if_not(var_1_17 >= 1) VAL [isInitial=1, last_1_var_1_19=-100, var_1_12=0, var_1_13=-192, var_1_14=256, var_1_17=123, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=0, var_1_3=0, var_1_4=7/5] [L116] CALL assume_abort_if_not(var_1_17 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=-100, var_1_12=0, var_1_13=-192, var_1_14=256, var_1_17=123, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=0, var_1_3=0, var_1_4=7/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=-100, var_1_12=0, var_1_13=-192, var_1_14=256, var_1_17=123, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=0, var_1_3=0, var_1_4=7/5] [L116] RET assume_abort_if_not(var_1_17 <= 126) VAL [isInitial=1, last_1_var_1_19=-100, var_1_12=0, var_1_13=-192, var_1_14=256, var_1_17=123, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=0, var_1_3=0, var_1_4=7/5] [L117] CALL assume_abort_if_not(var_1_17 != 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=-100, var_1_12=0, var_1_13=-192, var_1_14=256, var_1_17=123, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=0, var_1_3=0, var_1_4=7/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=-100, var_1_12=0, var_1_13=-192, var_1_14=256, var_1_17=123, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=0, var_1_3=0, var_1_4=7/5] [L117] RET assume_abort_if_not(var_1_17 != 127) VAL [isInitial=1, last_1_var_1_19=-100, var_1_12=0, var_1_13=-192, var_1_14=256, var_1_17=123, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=0, var_1_3=0, var_1_4=7/5] [L118] var_1_20 = __VERIFIER_nondet_short() [L119] CALL assume_abort_if_not(var_1_20 >= -32768) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=-100, var_1_12=0, var_1_13=-192, var_1_14=256, var_1_17=123, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=101, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=0, var_1_3=0, var_1_4=7/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=-100, var_1_12=0, var_1_13=-192, var_1_14=256, var_1_17=123, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=101, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=0, var_1_3=0, var_1_4=7/5] [L119] RET assume_abort_if_not(var_1_20 >= -32768) VAL [isInitial=1, last_1_var_1_19=-100, var_1_12=0, var_1_13=-192, var_1_14=256, var_1_17=123, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=101, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=0, var_1_3=0, var_1_4=7/5] [L120] CALL assume_abort_if_not(var_1_20 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=-100, var_1_12=0, var_1_13=-192, var_1_14=256, var_1_17=123, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=101, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=0, var_1_3=0, var_1_4=7/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=-100, var_1_12=0, var_1_13=-192, var_1_14=256, var_1_17=123, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=101, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=0, var_1_3=0, var_1_4=7/5] [L120] RET assume_abort_if_not(var_1_20 <= 32767) VAL [isInitial=1, last_1_var_1_19=-100, var_1_12=0, var_1_13=-192, var_1_14=256, var_1_17=123, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=101, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=0, var_1_3=0, var_1_4=7/5] [L121] CALL assume_abort_if_not(var_1_20 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=-100, var_1_12=0, var_1_13=-192, var_1_14=256, var_1_17=123, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=101, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=0, var_1_3=0, var_1_4=7/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=-100, var_1_12=0, var_1_13=-192, var_1_14=256, var_1_17=123, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=101, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=0, var_1_3=0, var_1_4=7/5] [L121] RET assume_abort_if_not(var_1_20 != 0) VAL [isInitial=1, last_1_var_1_19=-100, var_1_12=0, var_1_13=-192, var_1_14=256, var_1_17=123, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=101, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=0, var_1_3=0, var_1_4=7/5] [L122] var_1_22 = __VERIFIER_nondet_ushort() [L123] CALL assume_abort_if_not(var_1_22 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=-100, var_1_12=0, var_1_13=-192, var_1_14=256, var_1_17=123, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=101, var_1_21=200, var_1_22=32767, var_1_23=49999/5, var_1_25=50, var_1_2=0, var_1_3=0, var_1_4=7/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=-100, var_1_12=0, var_1_13=-192, var_1_14=256, var_1_17=123, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=101, var_1_21=200, var_1_22=32767, var_1_23=49999/5, var_1_25=50, var_1_2=0, var_1_3=0, var_1_4=7/5] [L123] RET assume_abort_if_not(var_1_22 >= 32767) VAL [isInitial=1, last_1_var_1_19=-100, var_1_12=0, var_1_13=-192, var_1_14=256, var_1_17=123, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=101, var_1_21=200, var_1_22=32767, var_1_23=49999/5, var_1_25=50, var_1_2=0, var_1_3=0, var_1_4=7/5] [L124] CALL assume_abort_if_not(var_1_22 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=-100, var_1_12=0, var_1_13=-192, var_1_14=256, var_1_17=123, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=101, var_1_21=200, var_1_22=32767, var_1_23=49999/5, var_1_25=50, var_1_2=0, var_1_3=0, var_1_4=7/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=-100, var_1_12=0, var_1_13=-192, var_1_14=256, var_1_17=123, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=101, var_1_21=200, var_1_22=32767, var_1_23=49999/5, var_1_25=50, var_1_2=0, var_1_3=0, var_1_4=7/5] [L124] RET assume_abort_if_not(var_1_22 <= 65534) VAL [isInitial=1, last_1_var_1_19=-100, var_1_12=0, var_1_13=-192, var_1_14=256, var_1_17=123, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=101, var_1_21=200, var_1_22=32767, var_1_23=49999/5, var_1_25=50, var_1_2=0, var_1_3=0, var_1_4=7/5] [L138] RET updateVariables() [L139] CALL step() [L47] COND FALSE !(\read(var_1_2)) VAL [isInitial=1, last_1_var_1_19=-100, var_1_12=0, var_1_13=-192, var_1_14=256, var_1_17=123, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=101, var_1_21=200, var_1_22=32767, var_1_23=49999/5, var_1_25=50, var_1_2=0, var_1_3=0, var_1_4=7/5] [L50] COND TRUE 5 <= var_1_17 [L51] var_1_21 = (var_1_22 - var_1_17) VAL [isInitial=1, last_1_var_1_19=-100, var_1_12=0, var_1_13=-192, var_1_14=256, var_1_17=123, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=101, var_1_21=32644, var_1_22=32767, var_1_23=49999/5, var_1_25=50, var_1_2=0, var_1_3=0, var_1_4=7/5] [L61] var_1_23 = var_1_10 [L62] var_1_24 = 31.75f [L63] var_1_25 = -5 VAL [isInitial=1, last_1_var_1_19=-100, var_1_10=2, var_1_12=0, var_1_13=-192, var_1_14=256, var_1_17=123, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=101, var_1_21=32644, var_1_22=32767, var_1_23=2, var_1_24=127/4, var_1_25=-5, var_1_2=0, var_1_3=0, var_1_4=7/5] [L64] COND TRUE (var_1_23 <= var_1_23) || var_1_1 [L65] var_1_4 = ((((31.5f) > (((((var_1_7) < (var_1_8)) ? (var_1_7) : (var_1_8))))) ? (31.5f) : (((((var_1_7) < (var_1_8)) ? (var_1_7) : (var_1_8)))))) VAL [isInitial=1, last_1_var_1_19=-100, var_1_10=2, var_1_12=0, var_1_13=-192, var_1_14=256, var_1_17=123, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=101, var_1_21=32644, var_1_22=32767, var_1_23=2, var_1_24=127/4, var_1_25=-5, var_1_2=0, var_1_3=0, var_1_4=63/2, var_1_7=0, var_1_8=0] [L69] COND TRUE ((200 - var_1_13) - var_1_14) != var_1_25 [L70] var_1_12 = (var_1_13 + ((((var_1_14) < (var_1_21)) ? (var_1_14) : (var_1_21)))) VAL [isInitial=1, last_1_var_1_19=-100, var_1_10=2, var_1_12=64, var_1_13=-192, var_1_14=256, var_1_17=123, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=101, var_1_21=32644, var_1_22=32767, var_1_23=2, var_1_24=127/4, var_1_25=-5, var_1_2=0, var_1_3=0, var_1_4=63/2, var_1_7=0, var_1_8=0] [L82] COND TRUE (- (var_1_13 / var_1_17)) > var_1_25 [L83] var_1_18 = var_1_13 VAL [isInitial=1, last_1_var_1_19=-100, var_1_10=2, var_1_12=64, var_1_13=-192, var_1_14=256, var_1_17=123, var_1_18=64, var_1_19=-100, var_1_1=0, var_1_20=101, var_1_21=32644, var_1_22=32767, var_1_23=2, var_1_24=127/4, var_1_25=-5, var_1_2=0, var_1_3=0, var_1_4=63/2, var_1_7=0, var_1_8=0] [L85] COND FALSE !((last_1_var_1_19 / ((((var_1_17) < (var_1_20)) ? (var_1_17) : (var_1_20)))) > var_1_21) [L88] var_1_19 = var_1_17 VAL [isInitial=1, last_1_var_1_19=-100, var_1_10=2, var_1_12=64, var_1_13=-192, var_1_14=256, var_1_17=123, var_1_18=64, var_1_19=123, var_1_1=0, var_1_20=101, var_1_21=32644, var_1_22=32767, var_1_23=2, var_1_24=127/4, var_1_25=-5, var_1_2=0, var_1_3=0, var_1_4=63/2, var_1_7=0, var_1_8=0] [L139] RET step() [L140] CALL, EXPR property() [L130-L131] return ((((((((var_1_2 ? (var_1_1 == ((unsigned char) var_1_3)) : 1) && (((var_1_23 <= var_1_23) || var_1_1) ? (var_1_4 == ((float) ((((31.5f) > (((((var_1_7) < (var_1_8)) ? (var_1_7) : (var_1_8))))) ? (31.5f) : (((((var_1_7) < (var_1_8)) ? (var_1_7) : (var_1_8)))))))) : (var_1_4 == ((float) ((var_1_9 - var_1_10) - var_1_11))))) && ((((200 - var_1_13) - var_1_14) != var_1_25) ? (var_1_12 == ((signed long int) (var_1_13 + ((((var_1_14) < (var_1_21)) ? (var_1_14) : (var_1_21)))))) : (((var_1_25 / (128 - var_1_17)) < var_1_13) ? ((var_1_13 >= var_1_25) ? (var_1_12 == ((signed long int) var_1_14)) : (var_1_12 == ((signed long int) var_1_17))) : (var_1_12 == ((signed long int) var_1_17))))) && (((- (var_1_13 / var_1_17)) > var_1_25) ? (var_1_18 == ((unsigned long int) var_1_13)) : 1)) && (((last_1_var_1_19 / ((((var_1_17) < (var_1_20)) ? (var_1_17) : (var_1_20)))) > var_1_21) ? (var_1_19 == ((signed char) ((((var_1_17) > (var_1_13)) ? (var_1_17) : (var_1_13))))) : (var_1_19 == ((signed char) var_1_17)))) && ((5 <= var_1_17) ? (var_1_21 == ((unsigned short int) (var_1_22 - var_1_17))) : (var_1_1 ? (var_1_1 ? (var_1_21 == ((unsigned short int) var_1_17)) : (var_1_21 == ((unsigned short int) var_1_17))) : 1))) && (var_1_23 == ((double) var_1_10))) && (var_1_24 == ((float) 31.75f))) && (var_1_25 == ((signed char) -5)) ; VAL [\result=0, isInitial=1, last_1_var_1_19=-100, var_1_10=2, var_1_12=64, var_1_13=-192, var_1_14=256, var_1_17=123, var_1_18=64, var_1_19=123, var_1_1=0, var_1_20=101, var_1_21=32644, var_1_22=32767, var_1_23=2, var_1_24=127/4, var_1_25=-5, var_1_2=0, var_1_3=0, var_1_4=63/2, var_1_7=0, var_1_8=0] [L140] RET, EXPR property() [L140] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_19=-100, var_1_10=2, var_1_12=64, var_1_13=-192, var_1_14=256, var_1_17=123, var_1_18=64, var_1_19=123, var_1_1=0, var_1_20=101, var_1_21=32644, var_1_22=32767, var_1_23=2, var_1_24=127/4, var_1_25=-5, var_1_2=0, var_1_3=0, var_1_4=63/2, var_1_7=0, var_1_8=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_19=-100, var_1_10=2, var_1_12=64, var_1_13=-192, var_1_14=256, var_1_17=123, var_1_18=64, var_1_19=123, var_1_1=0, var_1_20=101, var_1_21=32644, var_1_22=32767, var_1_23=2, var_1_24=127/4, var_1_25=-5, var_1_2=0, var_1_3=0, var_1_4=63/2, var_1_7=0, var_1_8=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 62 locations, 115 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 21.5s, OverallIterations: 3, TraceHistogramMax: 21, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 277 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 277 mSDsluCounter, 459 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 317 mSDsCounter, 141 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 358 IncrementalHoareTripleChecker+Invalid, 499 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 141 mSolverCounterUnsat, 142 mSDtfsCounter, 358 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 309 GetRequests, 266 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 480 ImplicationChecksByTransitivity, 5.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=123occurred in iteration=2, InterpolantAutomatonStates: 24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 27 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 18.8s InterpolantComputationTime, 798 NumberOfCodeBlocks, 798 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 396 ConstructedInterpolants, 0 QuantifiedInterpolants, 1435 SizeOfPredicates, 8 NumberOfNonLiveVariables, 618 ConjunctsInSsa, 36 ConjunctsInUnsatCore, 3 InterpolantComputations, 1 PerfectInterpolantSequences, 2459/2520 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-03-08 09:46:55,835 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-23.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 ecb657514b6ca34f15abfe6004ba02d38bdfc8908a67ac6501ada0716f98bd40 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 09:46:57,590 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 09:46:57,667 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 09:46:57,676 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 09:46:57,676 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 09:46:57,713 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 09:46:57,714 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 09:46:57,714 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 09:46:57,714 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 09:46:57,714 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 09:46:57,714 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 09:46:57,714 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 09:46:57,714 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 09:46:57,714 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 09:46:57,715 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 09:46:57,715 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 09:46:57,715 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 09:46:57,715 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 09:46:57,715 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 09:46:57,715 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 09:46:57,715 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 09:46:57,715 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 09:46:57,715 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 09:46:57,715 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 09:46:57,715 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 09:46:57,715 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 09:46:57,715 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 09:46:57,715 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 09:46:57,715 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 09:46:57,715 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 09:46:57,715 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 09:46:57,715 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 09:46:57,715 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 09:46:57,715 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 09:46:57,716 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 09:46:57,716 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 09:46:57,716 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 09:46:57,716 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 09:46:57,716 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 09:46:57,716 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 09:46:57,716 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 09:46:57,716 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 09:46:57,716 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 09:46:57,716 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 09:46:57,716 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 09:46:57,716 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/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 -> ecb657514b6ca34f15abfe6004ba02d38bdfc8908a67ac6501ada0716f98bd40 [2025-03-08 09:46:57,943 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 09:46:57,950 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 09:46:57,952 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 09:46:57,953 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 09:46:57,953 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 09:46:57,955 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-23.i [2025-03-08 09:46:59,113 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/35544e547/7770cbdfb99a404a8f0b6f95c77a2c0e/FLAGe28093046 [2025-03-08 09:46:59,329 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 09:46:59,330 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-23.i [2025-03-08 09:46:59,339 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/35544e547/7770cbdfb99a404a8f0b6f95c77a2c0e/FLAGe28093046 [2025-03-08 09:46:59,354 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/35544e547/7770cbdfb99a404a8f0b6f95c77a2c0e [2025-03-08 09:46:59,358 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 09:46:59,359 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 09:46:59,360 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 09:46:59,360 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 09:46:59,364 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 09:46:59,364 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:46:59" (1/1) ... [2025-03-08 09:46:59,366 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@503394c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:46:59, skipping insertion in model container [2025-03-08 09:46:59,366 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:46:59" (1/1) ... [2025-03-08 09:46:59,382 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 09:46:59,488 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-23.i[919,932] [2025-03-08 09:46:59,523 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 09:46:59,538 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 09:46:59,545 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-23.i[919,932] [2025-03-08 09:46:59,562 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 09:46:59,573 INFO L204 MainTranslator]: Completed translation [2025-03-08 09:46:59,574 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:46:59 WrapperNode [2025-03-08 09:46:59,574 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 09:46:59,575 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 09:46:59,575 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 09:46:59,576 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 09:46:59,580 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:46:59" (1/1) ... [2025-03-08 09:46:59,586 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:46:59" (1/1) ... [2025-03-08 09:46:59,600 INFO L138 Inliner]: procedures = 27, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 137 [2025-03-08 09:46:59,601 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 09:46:59,601 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 09:46:59,601 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 09:46:59,602 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 09:46:59,608 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:46:59" (1/1) ... [2025-03-08 09:46:59,609 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:46:59" (1/1) ... [2025-03-08 09:46:59,611 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:46:59" (1/1) ... [2025-03-08 09:46:59,622 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-03-08 09:46:59,622 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:46:59" (1/1) ... [2025-03-08 09:46:59,622 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:46:59" (1/1) ... [2025-03-08 09:46:59,627 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:46:59" (1/1) ... [2025-03-08 09:46:59,628 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:46:59" (1/1) ... [2025-03-08 09:46:59,629 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:46:59" (1/1) ... [2025-03-08 09:46:59,630 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:46:59" (1/1) ... [2025-03-08 09:46:59,631 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 09:46:59,632 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 09:46:59,632 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 09:46:59,632 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 09:46:59,633 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:46:59" (1/1) ... [2025-03-08 09:46:59,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 09:46:59,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 09:46:59,656 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 09:46:59,658 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 09:46:59,673 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 09:46:59,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 09:46:59,673 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 09:46:59,673 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 09:46:59,673 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 09:46:59,673 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 09:46:59,724 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 09:46:59,725 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 09:47:01,000 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-03-08 09:47:01,000 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 09:47:01,006 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 09:47:01,007 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 09:47:01,007 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:47:01 BoogieIcfgContainer [2025-03-08 09:47:01,007 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 09:47:01,009 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 09:47:01,009 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 09:47:01,012 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 09:47:01,012 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 09:46:59" (1/3) ... [2025-03-08 09:47:01,013 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b6f07ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:47:01, skipping insertion in model container [2025-03-08 09:47:01,013 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:46:59" (2/3) ... [2025-03-08 09:47:01,013 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b6f07ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:47:01, skipping insertion in model container [2025-03-08 09:47:01,013 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:47:01" (3/3) ... [2025-03-08 09:47:01,014 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-23.i [2025-03-08 09:47:01,023 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 09:47:01,025 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_dependencies_file-23.i that has 2 procedures, 62 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 09:47:01,067 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 09:47:01,075 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;@47a8f1fa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 09:47:01,075 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 09:47:01,078 INFO L276 IsEmpty]: Start isEmpty. Operand has 62 states, 38 states have (on average 1.368421052631579) internal successors, (52), 39 states have internal predecessors, (52), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-08 09:47:01,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-08 09:47:01,086 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:47:01,086 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 09:47:01,087 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:47:01,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:47:01,090 INFO L85 PathProgramCache]: Analyzing trace with hash -525947338, now seen corresponding path program 1 times [2025-03-08 09:47:01,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 09:47:01,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [380387960] [2025-03-08 09:47:01,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:47:01,098 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-03-08 09:47:01,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 09:47:01,100 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/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-03-08 09:47:01,110 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-08 09:47:01,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-08 09:47:01,381 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-08 09:47:01,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:47:01,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:47:01,394 INFO L256 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 09:47:01,401 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 09:47:01,428 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 296 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 09:47:01,428 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 09:47:01,428 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 09:47:01,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [380387960] [2025-03-08 09:47:01,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [380387960] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:47:01,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:47:01,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 09:47:01,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461795650] [2025-03-08 09:47:01,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:47:01,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 09:47:01,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 09:47:01,450 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 09:47:01,450 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 09:47:01,452 INFO L87 Difference]: Start difference. First operand has 62 states, 38 states have (on average 1.368421052631579) internal successors, (52), 39 states have internal predecessors, (52), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-08 09:47:01,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:47:01,471 INFO L93 Difference]: Finished difference Result 118 states and 204 transitions. [2025-03-08 09:47:01,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 09:47:01,472 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 133 [2025-03-08 09:47:01,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:47:01,476 INFO L225 Difference]: With dead ends: 118 [2025-03-08 09:47:01,476 INFO L226 Difference]: Without dead ends: 59 [2025-03-08 09:47:01,478 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 132 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-03-08 09:47:01,480 INFO L435 NwaCegarLoop]: 89 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, 89 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-03-08 09:47:01,480 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 09:47:01,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-03-08 09:47:01,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2025-03-08 09:47:01,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 36 states have internal predecessors, (47), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-08 09:47:01,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 89 transitions. [2025-03-08 09:47:01,513 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 89 transitions. Word has length 133 [2025-03-08 09:47:01,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:47:01,513 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 89 transitions. [2025-03-08 09:47:01,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-08 09:47:01,513 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 89 transitions. [2025-03-08 09:47:01,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-08 09:47:01,516 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:47:01,519 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 09:47:01,530 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-08 09:47:01,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/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-03-08 09:47:01,720 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:47:01,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:47:01,721 INFO L85 PathProgramCache]: Analyzing trace with hash 1931705647, now seen corresponding path program 1 times [2025-03-08 09:47:01,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 09:47:01,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1442723019] [2025-03-08 09:47:01,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:47:01,722 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-03-08 09:47:01,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 09:47:01,724 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/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-03-08 09:47:01,726 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-08 09:47:01,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-08 09:47:01,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-08 09:47:01,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:47:01,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:47:01,990 INFO L256 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-08 09:47:01,998 INFO L279 TraceCheckSpWp]: Computing forward predicates...