./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-93.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_steplocals_file-93.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 bd91f8319b366f9e737c54eb1f99b1168442b9ac934a3b601c547c20154488fd --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 10:19:31,375 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 10:19:31,433 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 10:19:31,439 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 10:19:31,441 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 10:19:31,462 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 10:19:31,463 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 10:19:31,463 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 10:19:31,463 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 10:19:31,464 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 10:19:31,464 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 10:19:31,464 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 10:19:31,465 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 10:19:31,465 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 10:19:31,465 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 10:19:31,465 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 10:19:31,465 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 10:19:31,465 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 10:19:31,465 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 10:19:31,465 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 10:19:31,465 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 10:19:31,465 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 10:19:31,465 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 10:19:31,465 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 10:19:31,465 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 10:19:31,465 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 10:19:31,465 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 10:19:31,465 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 10:19:31,465 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 10:19:31,465 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 10:19:31,465 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 10:19:31,465 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 10:19:31,465 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 10:19:31,466 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 10:19:31,466 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 10:19:31,466 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 10:19:31,466 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 10:19:31,466 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 10:19:31,466 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 10:19:31,466 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 10:19:31,466 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 10:19:31,466 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 10:19:31,466 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 10:19:31,466 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 -> bd91f8319b366f9e737c54eb1f99b1168442b9ac934a3b601c547c20154488fd [2025-03-08 10:19:31,672 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 10:19:31,680 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 10:19:31,682 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 10:19:31,683 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 10:19:31,683 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 10:19:31,684 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-93.i [2025-03-08 10:19:32,790 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba5ce3140/8e91b3acc55546dc8fa36d2d01300559/FLAGdba6b6d0f [2025-03-08 10:19:33,021 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 10:19:33,024 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-93.i [2025-03-08 10:19:33,033 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba5ce3140/8e91b3acc55546dc8fa36d2d01300559/FLAGdba6b6d0f [2025-03-08 10:19:33,050 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba5ce3140/8e91b3acc55546dc8fa36d2d01300559 [2025-03-08 10:19:33,052 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 10:19:33,053 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 10:19:33,055 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 10:19:33,055 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 10:19:33,058 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 10:19:33,059 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:19:33" (1/1) ... [2025-03-08 10:19:33,061 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21b6642a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:19:33, skipping insertion in model container [2025-03-08 10:19:33,061 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:19:33" (1/1) ... [2025-03-08 10:19:33,074 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 10:19:33,181 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_steplocals_file-93.i[917,930] [2025-03-08 10:19:33,233 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 10:19:33,242 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 10:19:33,252 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_steplocals_file-93.i[917,930] [2025-03-08 10:19:33,280 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 10:19:33,292 INFO L204 MainTranslator]: Completed translation [2025-03-08 10:19:33,293 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:19:33 WrapperNode [2025-03-08 10:19:33,293 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 10:19:33,294 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 10:19:33,294 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 10:19:33,294 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 10:19:33,298 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:19:33" (1/1) ... [2025-03-08 10:19:33,303 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:19:33" (1/1) ... [2025-03-08 10:19:33,335 INFO L138 Inliner]: procedures = 26, calls = 45, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 179 [2025-03-08 10:19:33,339 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 10:19:33,339 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 10:19:33,339 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 10:19:33,339 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 10:19:33,346 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:19:33" (1/1) ... [2025-03-08 10:19:33,346 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:19:33" (1/1) ... [2025-03-08 10:19:33,352 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:19:33" (1/1) ... [2025-03-08 10:19:33,368 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 10:19:33,371 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:19:33" (1/1) ... [2025-03-08 10:19:33,372 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:19:33" (1/1) ... [2025-03-08 10:19:33,377 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:19:33" (1/1) ... [2025-03-08 10:19:33,383 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:19:33" (1/1) ... [2025-03-08 10:19:33,383 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:19:33" (1/1) ... [2025-03-08 10:19:33,384 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:19:33" (1/1) ... [2025-03-08 10:19:33,385 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 10:19:33,386 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 10:19:33,386 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 10:19:33,386 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 10:19:33,387 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:19:33" (1/1) ... [2025-03-08 10:19:33,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 10:19:33,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:19:33,409 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 10:19:33,413 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 10:19:33,426 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 10:19:33,426 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 10:19:33,426 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 10:19:33,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 10:19:33,426 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 10:19:33,426 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 10:19:33,478 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 10:19:33,479 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 10:19:33,690 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2025-03-08 10:19:33,690 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 10:19:33,702 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 10:19:33,704 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 10:19:33,704 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:19:33 BoogieIcfgContainer [2025-03-08 10:19:33,704 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 10:19:33,705 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 10:19:33,706 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 10:19:33,709 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 10:19:33,709 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 10:19:33" (1/3) ... [2025-03-08 10:19:33,710 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c3de71e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:19:33, skipping insertion in model container [2025-03-08 10:19:33,710 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:19:33" (2/3) ... [2025-03-08 10:19:33,710 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c3de71e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:19:33, skipping insertion in model container [2025-03-08 10:19:33,710 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:19:33" (3/3) ... [2025-03-08 10:19:33,711 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-93.i [2025-03-08 10:19:33,720 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 10:19:33,722 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_steplocals_file-93.i that has 2 procedures, 81 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 10:19:33,772 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 10:19:33,781 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;@12786ad7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 10:19:33,781 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 10:19:33,786 INFO L276 IsEmpty]: Start isEmpty. Operand has 81 states, 46 states have (on average 1.326086956521739) internal successors, (61), 47 states have internal predecessors, (61), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-08 10:19:33,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-03-08 10:19:33,800 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:19:33,801 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:19:33,801 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:19:33,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:19:33,805 INFO L85 PathProgramCache]: Analyzing trace with hash -1863272572, now seen corresponding path program 1 times [2025-03-08 10:19:33,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:19:33,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840343773] [2025-03-08 10:19:33,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:19:33,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:19:33,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-03-08 10:19:33,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-03-08 10:19:33,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:19:33,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:19:34,110 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 1922 trivial. 0 not checked. [2025-03-08 10:19:34,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:19:34,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840343773] [2025-03-08 10:19:34,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840343773] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 10:19:34,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [56750391] [2025-03-08 10:19:34,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:19:34,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 10:19:34,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:19:34,116 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 10:19:34,118 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 10:19:34,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-03-08 10:19:34,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-03-08 10:19:34,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:19:34,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:19:34,306 INFO L256 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 10:19:34,314 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 10:19:34,350 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 1922 trivial. 0 not checked. [2025-03-08 10:19:34,354 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 10:19:34,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [56750391] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:19:34,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 10:19:34,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 10:19:34,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965474811] [2025-03-08 10:19:34,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:19:34,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 10:19:34,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:19:34,381 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 10:19:34,381 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 10:19:34,383 INFO L87 Difference]: Start difference. First operand has 81 states, 46 states have (on average 1.326086956521739) internal successors, (61), 47 states have internal predecessors, (61), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) [2025-03-08 10:19:34,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:19:34,411 INFO L93 Difference]: Finished difference Result 156 states and 277 transitions. [2025-03-08 10:19:34,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 10:19:34,413 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) Word has length 196 [2025-03-08 10:19:34,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:19:34,417 INFO L225 Difference]: With dead ends: 156 [2025-03-08 10:19:34,418 INFO L226 Difference]: Without dead ends: 78 [2025-03-08 10:19:34,421 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 197 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 10:19:34,425 INFO L435 NwaCegarLoop]: 120 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, 120 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 10:19:34,425 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 10:19:34,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-03-08 10:19:34,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2025-03-08 10:19:34,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 44 states have (on average 1.2727272727272727) internal successors, (56), 44 states have internal predecessors, (56), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-08 10:19:34,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 120 transitions. [2025-03-08 10:19:34,466 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 120 transitions. Word has length 196 [2025-03-08 10:19:34,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:19:34,466 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 120 transitions. [2025-03-08 10:19:34,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) [2025-03-08 10:19:34,467 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 120 transitions. [2025-03-08 10:19:34,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-03-08 10:19:34,469 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:19:34,470 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:19:34,477 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 10:19:34,670 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 10:19:34,670 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:19:34,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:19:34,671 INFO L85 PathProgramCache]: Analyzing trace with hash -1686606720, now seen corresponding path program 1 times [2025-03-08 10:19:34,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:19:34,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817186956] [2025-03-08 10:19:34,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:19:34,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:19:34,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-03-08 10:19:34,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-03-08 10:19:34,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:19:34,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:19:34,877 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-03-08 10:19:34,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:19:34,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817186956] [2025-03-08 10:19:34,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817186956] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:19:34,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:19:34,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 10:19:34,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801878175] [2025-03-08 10:19:34,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:19:34,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 10:19:34,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:19:34,878 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 10:19:34,878 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 10:19:34,879 INFO L87 Difference]: Start difference. First operand 78 states and 120 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-08 10:19:34,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:19:34,922 INFO L93 Difference]: Finished difference Result 188 states and 286 transitions. [2025-03-08 10:19:34,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 10:19:34,925 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 196 [2025-03-08 10:19:34,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:19:34,928 INFO L225 Difference]: With dead ends: 188 [2025-03-08 10:19:34,929 INFO L226 Difference]: Without dead ends: 113 [2025-03-08 10:19:34,929 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 10:19:34,931 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 48 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 10:19:34,932 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 254 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 10:19:34,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2025-03-08 10:19:34,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 110. [2025-03-08 10:19:34,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 65 states have (on average 1.2461538461538462) internal successors, (81), 66 states have internal predecessors, (81), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-08 10:19:34,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 165 transitions. [2025-03-08 10:19:34,946 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 165 transitions. Word has length 196 [2025-03-08 10:19:34,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:19:34,947 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 165 transitions. [2025-03-08 10:19:34,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-08 10:19:34,947 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 165 transitions. [2025-03-08 10:19:34,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2025-03-08 10:19:34,953 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:19:34,953 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:19:34,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 10:19:34,953 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:19:34,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:19:34,954 INFO L85 PathProgramCache]: Analyzing trace with hash 1840611205, now seen corresponding path program 1 times [2025-03-08 10:19:34,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:19:34,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102187718] [2025-03-08 10:19:34,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:19:34,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:19:34,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-03-08 10:19:35,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-03-08 10:19:35,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:19:35,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 10:19:35,136 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 10:19:35,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-03-08 10:19:35,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-03-08 10:19:35,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:19:35,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 10:19:35,280 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 10:19:35,281 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 10:19:35,282 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 10:19:35,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 10:19:35,286 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-08 10:19:35,387 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 10:19:35,392 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 10:19:35 BoogieIcfgContainer [2025-03-08 10:19:35,393 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 10:19:35,394 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 10:19:35,394 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 10:19:35,394 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 10:19:35,394 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:19:33" (3/4) ... [2025-03-08 10:19:35,396 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 10:19:35,396 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 10:19:35,397 INFO L158 Benchmark]: Toolchain (without parser) took 2344.26ms. Allocated memory is still 142.6MB. Free memory was 112.5MB in the beginning and 65.8MB in the end (delta: 46.7MB). Peak memory consumption was 44.8MB. Max. memory is 16.1GB. [2025-03-08 10:19:35,398 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 123.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 10:19:35,398 INFO L158 Benchmark]: CACSL2BoogieTranslator took 238.48ms. Allocated memory is still 142.6MB. Free memory was 112.5MB in the beginning and 98.3MB in the end (delta: 14.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 10:19:35,398 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.14ms. Allocated memory is still 142.6MB. Free memory was 98.3MB in the beginning and 95.8MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 10:19:35,399 INFO L158 Benchmark]: Boogie Preprocessor took 46.51ms. Allocated memory is still 142.6MB. Free memory was 95.8MB in the beginning and 93.2MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 10:19:35,399 INFO L158 Benchmark]: IcfgBuilder took 318.04ms. Allocated memory is still 142.6MB. Free memory was 93.2MB in the beginning and 72.7MB in the end (delta: 20.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-08 10:19:35,399 INFO L158 Benchmark]: TraceAbstraction took 1687.77ms. Allocated memory is still 142.6MB. Free memory was 72.2MB in the beginning and 65.8MB in the end (delta: 6.4MB). Peak memory consumption was 2.9MB. Max. memory is 16.1GB. [2025-03-08 10:19:35,399 INFO L158 Benchmark]: Witness Printer took 2.88ms. Allocated memory is still 142.6MB. Free memory was 65.8MB in the beginning and 65.8MB in the end (delta: 24.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 10:19:35,401 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.18ms. Allocated memory is still 201.3MB. Free memory is still 123.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 238.48ms. Allocated memory is still 142.6MB. Free memory was 112.5MB in the beginning and 98.3MB in the end (delta: 14.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.14ms. Allocated memory is still 142.6MB. Free memory was 98.3MB in the beginning and 95.8MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 46.51ms. Allocated memory is still 142.6MB. Free memory was 95.8MB in the beginning and 93.2MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 318.04ms. Allocated memory is still 142.6MB. Free memory was 93.2MB in the beginning and 72.7MB in the end (delta: 20.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 1687.77ms. Allocated memory is still 142.6MB. Free memory was 72.2MB in the beginning and 65.8MB in the end (delta: 6.4MB). Peak memory consumption was 2.9MB. Max. memory is 16.1GB. * Witness Printer took 2.88ms. Allocated memory is still 142.6MB. Free memory was 65.8MB in the beginning and 65.8MB in the end (delta: 24.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 121, overapproximation of someBinaryFLOATComparisonOperation at line 120, overapproximation of someBinaryFLOATComparisonOperation at line 76, overapproximation of someBinaryFLOATComparisonOperation at line 153, overapproximation of someBinaryFLOATComparisonOperation at line 113, overapproximation of someBinaryFLOATComparisonOperation at line 115, overapproximation of someBinaryFLOATComparisonOperation at line 109, overapproximation of someBinaryFLOATComparisonOperation at line 64, overapproximation of someBinaryFLOATComparisonOperation at line 111, overapproximation of someUnaryDOUBLEoperation at line 34, overapproximation of someBinaryArithmeticFLOAToperation at line 76. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] float var_1_1 = 0.5; [L23] unsigned short int var_1_2 = 0; [L24] unsigned short int var_1_3 = 64; [L25] signed long int var_1_4 = 2; [L26] float var_1_5 = 0.0; [L27] float var_1_6 = 4.2; [L28] float var_1_7 = 31.25; [L29] float var_1_8 = 1.375; [L30] unsigned short int var_1_9 = 32; [L31] unsigned char var_1_10 = 1; [L32] float var_1_11 = 0.625; [L33] unsigned short int var_1_12 = 1; [L34] float var_1_13 = -0.25; [L35] signed short int var_1_14 = 4; [L36] unsigned char var_1_15 = 1; [L37] unsigned char var_1_16 = 0; [L38] signed short int var_1_17 = 8; [L39] signed short int var_1_18 = 5; [L40] signed short int var_1_19 = 128; [L41] signed long int var_1_20 = -50; [L42] signed short int var_1_21 = -16; [L43] signed short int var_1_22 = 16; [L44] signed short int var_1_23 = 32; [L45] signed short int var_1_24 = 2; [L46] signed short int var_1_25 = -4; VAL [isInitial=0, var_1_10=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_2=0, var_1_3=64, var_1_4=2, var_1_5=0, var_1_6=21/5, var_1_7=125/4, var_1_8=11/8, var_1_9=32] [L157] isInitial = 1 [L158] FCALL initially() [L159] COND TRUE 1 [L160] FCALL updateLastVariables() [L161] CALL updateVariables() [L99] var_1_2 = __VERIFIER_nondet_ushort() [L100] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_3=64, var_1_4=2, var_1_5=0, var_1_6=21/5, var_1_7=125/4, var_1_8=11/8, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_3=64, var_1_4=2, var_1_5=0, var_1_6=21/5, var_1_7=125/4, var_1_8=11/8, var_1_9=32] [L100] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_3=64, var_1_4=2, var_1_5=0, var_1_6=21/5, var_1_7=125/4, var_1_8=11/8, var_1_9=32] [L101] CALL assume_abort_if_not(var_1_2 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_3=64, var_1_4=2, var_1_5=0, var_1_6=21/5, var_1_7=125/4, var_1_8=11/8, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_3=64, var_1_4=2, var_1_5=0, var_1_6=21/5, var_1_7=125/4, var_1_8=11/8, var_1_9=32] [L101] RET assume_abort_if_not(var_1_2 <= 65535) VAL [isInitial=1, var_1_10=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_3=64, var_1_4=2, var_1_5=0, var_1_6=21/5, var_1_7=125/4, var_1_8=11/8, var_1_9=32] [L102] var_1_3 = __VERIFIER_nondet_ushort() [L103] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=2, var_1_5=0, var_1_6=21/5, var_1_7=125/4, var_1_8=11/8, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=2, var_1_5=0, var_1_6=21/5, var_1_7=125/4, var_1_8=11/8, var_1_9=32] [L103] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=2, var_1_5=0, var_1_6=21/5, var_1_7=125/4, var_1_8=11/8, var_1_9=32] [L104] CALL assume_abort_if_not(var_1_3 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=2, var_1_5=0, var_1_6=21/5, var_1_7=125/4, var_1_8=11/8, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=2, var_1_5=0, var_1_6=21/5, var_1_7=125/4, var_1_8=11/8, var_1_9=32] [L104] RET assume_abort_if_not(var_1_3 <= 65535) VAL [isInitial=1, var_1_10=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=2, var_1_5=0, var_1_6=21/5, var_1_7=125/4, var_1_8=11/8, var_1_9=32] [L105] var_1_4 = __VERIFIER_nondet_long() [L106] CALL assume_abort_if_not(var_1_4 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_5=0, var_1_6=21/5, var_1_7=125/4, var_1_8=11/8, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_5=0, var_1_6=21/5, var_1_7=125/4, var_1_8=11/8, var_1_9=32] [L106] RET assume_abort_if_not(var_1_4 >= -2147483648) VAL [isInitial=1, var_1_10=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_5=0, var_1_6=21/5, var_1_7=125/4, var_1_8=11/8, var_1_9=32] [L107] CALL assume_abort_if_not(var_1_4 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_5=0, var_1_6=21/5, var_1_7=125/4, var_1_8=11/8, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_5=0, var_1_6=21/5, var_1_7=125/4, var_1_8=11/8, var_1_9=32] [L107] RET assume_abort_if_not(var_1_4 <= 2147483647) VAL [isInitial=1, var_1_10=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_5=0, var_1_6=21/5, var_1_7=125/4, var_1_8=11/8, var_1_9=32] [L108] var_1_5 = __VERIFIER_nondet_float() [L109] CALL assume_abort_if_not((var_1_5 >= 4611686.018427382800e+12F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_6=21/5, var_1_7=125/4, var_1_8=11/8, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_6=21/5, var_1_7=125/4, var_1_8=11/8, var_1_9=32] [L109] RET assume_abort_if_not((var_1_5 >= 4611686.018427382800e+12F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_6=21/5, var_1_7=125/4, var_1_8=11/8, var_1_9=32] [L110] var_1_6 = __VERIFIER_nondet_float() [L111] CALL assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 4611686.018427382800e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_7=125/4, var_1_8=11/8, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_7=125/4, var_1_8=11/8, var_1_9=32] [L111] RET assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 4611686.018427382800e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_7=125/4, var_1_8=11/8, var_1_9=32] [L112] var_1_7 = __VERIFIER_nondet_float() [L113] CALL assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_8=11/8, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_8=11/8, var_1_9=32] [L113] RET assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_8=11/8, var_1_9=32] [L114] var_1_8 = __VERIFIER_nondet_float() [L115] CALL assume_abort_if_not((var_1_8 >= -461168.6018427382800e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_9=32] [L115] RET assume_abort_if_not((var_1_8 >= -461168.6018427382800e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_9=32] [L116] var_1_10 = __VERIFIER_nondet_uchar() [L117] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_9=32] [L117] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_9=32] [L118] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_9=32] [L118] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, var_1_10=0, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_9=32] [L119] var_1_11 = __VERIFIER_nondet_float() [L120] CALL assume_abort_if_not((var_1_11 >= -922337.2036854776000e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854776000e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_9=32] [L120] RET assume_abort_if_not((var_1_11 >= -922337.2036854776000e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854776000e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_9=32] [L121] CALL assume_abort_if_not(var_1_11 != 0.0F) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_9=32] [L121] RET assume_abort_if_not(var_1_11 != 0.0F) VAL [isInitial=1, var_1_10=0, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_9=32] [L122] var_1_12 = __VERIFIER_nondet_ushort() [L123] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_9=32] [L123] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, var_1_10=0, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_9=32] [L124] CALL assume_abort_if_not(var_1_12 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_9=32] [L124] RET assume_abort_if_not(var_1_12 <= 65534) VAL [isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_9=32] [L125] var_1_15 = __VERIFIER_nondet_uchar() [L126] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_9=32] [L126] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_9=32] [L127] CALL assume_abort_if_not(var_1_15 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_9=32] [L127] RET assume_abort_if_not(var_1_15 <= 1) VAL [isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_9=32] [L128] var_1_16 = __VERIFIER_nondet_uchar() [L129] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_9=32] [L129] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_9=32] [L130] CALL assume_abort_if_not(var_1_16 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_9=32] [L130] RET assume_abort_if_not(var_1_16 <= 1) VAL [isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_9=32] [L131] var_1_17 = __VERIFIER_nondet_short() [L132] CALL assume_abort_if_not(var_1_17 >= -32767) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=0, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=0, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_9=32] [L132] RET assume_abort_if_not(var_1_17 >= -32767) VAL [isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=0, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_9=32] [L133] CALL assume_abort_if_not(var_1_17 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=0, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=0, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_9=32] [L133] RET assume_abort_if_not(var_1_17 <= 32766) VAL [isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=0, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_9=32] [L134] var_1_18 = __VERIFIER_nondet_short() [L135] CALL assume_abort_if_not(var_1_18 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=0, var_1_18=8216, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=0, var_1_18=8216, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_9=32] [L135] RET assume_abort_if_not(var_1_18 >= -1) VAL [isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=0, var_1_18=8216, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_9=32] [L136] CALL assume_abort_if_not(var_1_18 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=0, var_1_18=8216, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=0, var_1_18=8216, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_9=32] [L136] RET assume_abort_if_not(var_1_18 <= 32766) VAL [isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=0, var_1_18=8216, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_9=32] [L137] var_1_19 = __VERIFIER_nondet_short() [L138] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=0, var_1_18=8216, var_1_19=8216, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=0, var_1_18=8216, var_1_19=8216, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_9=32] [L138] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=0, var_1_18=8216, var_1_19=8216, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_9=32] [L139] CALL assume_abort_if_not(var_1_19 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=0, var_1_18=8216, var_1_19=8216, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=0, var_1_18=8216, var_1_19=8216, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_9=32] [L139] RET assume_abort_if_not(var_1_19 <= 32766) VAL [isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=0, var_1_18=8216, var_1_19=8216, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_9=32] [L140] var_1_22 = __VERIFIER_nondet_short() [L141] CALL assume_abort_if_not(var_1_22 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=0, var_1_18=8216, var_1_19=8216, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=8190, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=0, var_1_18=8216, var_1_19=8216, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=8190, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_9=32] [L141] RET assume_abort_if_not(var_1_22 >= 0) VAL [isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=0, var_1_18=8216, var_1_19=8216, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=8190, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_9=32] [L142] CALL assume_abort_if_not(var_1_22 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=0, var_1_18=8216, var_1_19=8216, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=8190, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=0, var_1_18=8216, var_1_19=8216, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=8190, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_9=32] [L142] RET assume_abort_if_not(var_1_22 <= 16383) VAL [isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=0, var_1_18=8216, var_1_19=8216, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=8190, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_9=32] [L143] var_1_24 = __VERIFIER_nondet_short() [L144] CALL assume_abort_if_not(var_1_24 >= -8192) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=0, var_1_18=8216, var_1_19=8216, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=8190, var_1_23=32, var_1_24=0, var_1_25=-4, var_1_4=0, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=0, var_1_18=8216, var_1_19=8216, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=8190, var_1_23=32, var_1_24=0, var_1_25=-4, var_1_4=0, var_1_9=32] [L144] RET assume_abort_if_not(var_1_24 >= -8192) VAL [isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=0, var_1_18=8216, var_1_19=8216, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=8190, var_1_23=32, var_1_24=0, var_1_25=-4, var_1_4=0, var_1_9=32] [L145] CALL assume_abort_if_not(var_1_24 <= 8192) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=0, var_1_18=8216, var_1_19=8216, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=8190, var_1_23=32, var_1_24=0, var_1_25=-4, var_1_4=0, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=0, var_1_18=8216, var_1_19=8216, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=8190, var_1_23=32, var_1_24=0, var_1_25=-4, var_1_4=0, var_1_9=32] [L145] RET assume_abort_if_not(var_1_24 <= 8192) VAL [isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=0, var_1_18=8216, var_1_19=8216, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=8190, var_1_23=32, var_1_24=0, var_1_25=-4, var_1_4=0, var_1_9=32] [L146] var_1_25 = __VERIFIER_nondet_short() [L147] CALL assume_abort_if_not(var_1_25 >= -8191) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=0, var_1_18=8216, var_1_19=8216, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=8190, var_1_23=32, var_1_24=0, var_1_25=-8191, var_1_4=0, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=0, var_1_18=8216, var_1_19=8216, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=8190, var_1_23=32, var_1_24=0, var_1_25=-8191, var_1_4=0, var_1_9=32] [L147] RET assume_abort_if_not(var_1_25 >= -8191) VAL [isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=0, var_1_18=8216, var_1_19=8216, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=8190, var_1_23=32, var_1_24=0, var_1_25=-8191, var_1_4=0, var_1_9=32] [L148] CALL assume_abort_if_not(var_1_25 <= 8191) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=0, var_1_18=8216, var_1_19=8216, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=8190, var_1_23=32, var_1_24=0, var_1_25=-8191, var_1_4=0, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=0, var_1_18=8216, var_1_19=8216, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=8190, var_1_23=32, var_1_24=0, var_1_25=-8191, var_1_4=0, var_1_9=32] [L148] RET assume_abort_if_not(var_1_25 <= 8191) VAL [isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=0, var_1_18=8216, var_1_19=8216, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=8190, var_1_23=32, var_1_24=0, var_1_25=-8191, var_1_4=0, var_1_9=32] [L161] RET updateVariables() [L162] CALL step() [L50] signed long int stepLocal_2 = var_1_4; [L51] signed long int stepLocal_1 = var_1_4; [L52] signed long int stepLocal_0 = var_1_4; VAL [isInitial=1, stepLocal_0=0, stepLocal_1=0, stepLocal_2=0, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=0, var_1_18=8216, var_1_19=8216, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=8190, var_1_23=32, var_1_24=0, var_1_25=-8191, var_1_4=0, var_1_9=32] [L53] COND FALSE !((var_1_2 + var_1_3) < stepLocal_1) [L62] var_1_1 = var_1_8 VAL [isInitial=1, stepLocal_0=0, stepLocal_2=0, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=0, var_1_18=8216, var_1_19=8216, var_1_1=8221, var_1_20=-50, var_1_21=-16, var_1_22=8190, var_1_23=32, var_1_24=0, var_1_25=-8191, var_1_2=1, var_1_3=0, var_1_4=0, var_1_8=8221, var_1_9=32] [L64] unsigned char stepLocal_4 = var_1_1 < (var_1_8 / var_1_11); [L65] unsigned char stepLocal_3 = var_1_10; VAL [isInitial=1, stepLocal_0=0, stepLocal_2=0, stepLocal_3=0, stepLocal_4=0, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=0, var_1_18=8216, var_1_19=8216, var_1_1=8221, var_1_20=-50, var_1_21=-16, var_1_22=8190, var_1_23=32, var_1_24=0, var_1_25=-8191, var_1_2=1, var_1_3=0, var_1_4=0, var_1_8=8221, var_1_9=32] [L66] COND FALSE !(var_1_10 || stepLocal_4) [L71] var_1_9 = var_1_12 VAL [isInitial=1, stepLocal_0=0, stepLocal_2=0, stepLocal_3=0, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=0, var_1_18=8216, var_1_19=8216, var_1_1=8221, var_1_20=-50, var_1_21=-16, var_1_22=8190, var_1_23=32, var_1_24=0, var_1_25=-8191, var_1_2=1, var_1_3=0, var_1_4=0, var_1_8=8221, var_1_9=-2] [L73] COND FALSE !(\read(var_1_10)) [L76] var_1_13 = ((((10.15f) < ((var_1_6 + var_1_8))) ? (10.15f) : ((var_1_6 + var_1_8)))) VAL [isInitial=1, stepLocal_0=0, stepLocal_2=0, stepLocal_3=0, var_1_10=0, var_1_12=-2, var_1_13=203/20, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=0, var_1_18=8216, var_1_19=8216, var_1_1=8221, var_1_20=-50, var_1_21=-16, var_1_22=8190, var_1_23=32, var_1_24=0, var_1_25=-8191, var_1_2=1, var_1_3=0, var_1_4=0, var_1_8=8221, var_1_9=-2] [L78] unsigned char stepLocal_5 = ! (var_1_10 || var_1_15); VAL [isInitial=1, stepLocal_0=0, stepLocal_2=0, stepLocal_3=0, stepLocal_5=0, var_1_10=0, var_1_12=-2, var_1_13=203/20, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=0, var_1_18=8216, var_1_19=8216, var_1_1=8221, var_1_20=-50, var_1_21=-16, var_1_22=8190, var_1_23=32, var_1_24=0, var_1_25=-8191, var_1_2=1, var_1_3=0, var_1_4=0, var_1_8=8221, var_1_9=-2] [L79] COND TRUE stepLocal_5 || var_1_16 [L80] var_1_14 = ((((var_1_17) > ((var_1_18 - var_1_19))) ? (var_1_17) : ((var_1_18 - var_1_19)))) VAL [isInitial=1, stepLocal_0=0, stepLocal_2=0, stepLocal_3=0, var_1_10=0, var_1_12=-2, var_1_13=203/20, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=0, var_1_18=8216, var_1_19=8216, var_1_1=8221, var_1_20=-50, var_1_21=-16, var_1_22=8190, var_1_23=32, var_1_24=0, var_1_25=-8191, var_1_2=1, var_1_3=0, var_1_4=0, var_1_8=8221, var_1_9=-2] [L82] COND TRUE \read(var_1_16) [L83] var_1_20 = (var_1_3 - 50) VAL [isInitial=1, stepLocal_0=0, stepLocal_2=0, stepLocal_3=0, var_1_10=0, var_1_12=-2, var_1_13=203/20, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=0, var_1_18=8216, var_1_19=8216, var_1_1=8221, var_1_20=-50, var_1_21=-16, var_1_22=8190, var_1_23=32, var_1_24=0, var_1_25=-8191, var_1_2=1, var_1_3=0, var_1_4=0, var_1_8=8221, var_1_9=-2] [L85] COND TRUE \read(var_1_15) [L86] var_1_21 = ((var_1_22 + 25) - var_1_19) VAL [isInitial=1, stepLocal_0=0, stepLocal_2=0, stepLocal_3=0, var_1_10=0, var_1_12=-2, var_1_13=203/20, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=0, var_1_18=8216, var_1_19=8216, var_1_1=8221, var_1_20=-50, var_1_21=-1, var_1_22=8190, var_1_23=32, var_1_24=0, var_1_25=-8191, var_1_2=1, var_1_3=0, var_1_4=0, var_1_8=8221, var_1_9=-2] [L88] COND FALSE !(\read(var_1_10)) VAL [isInitial=1, stepLocal_0=0, stepLocal_2=0, stepLocal_3=0, var_1_10=0, var_1_12=-2, var_1_13=203/20, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=0, var_1_18=8216, var_1_19=8216, var_1_1=8221, var_1_20=-50, var_1_21=-1, var_1_22=8190, var_1_23=32, var_1_24=0, var_1_25=-8191, var_1_2=1, var_1_3=0, var_1_4=0, var_1_8=8221, var_1_9=-2] [L91] COND TRUE \read(var_1_16) [L92] var_1_23 = var_1_24 VAL [isInitial=1, stepLocal_0=0, stepLocal_2=0, stepLocal_3=0, var_1_10=0, var_1_12=-2, var_1_13=203/20, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=0, var_1_18=8216, var_1_19=8216, var_1_1=8221, var_1_20=-50, var_1_21=-1, var_1_22=8190, var_1_23=0, var_1_24=0, var_1_25=-8191, var_1_2=1, var_1_3=0, var_1_4=0, var_1_8=8221, var_1_9=-2] [L162] RET step() [L163] CALL, EXPR property() [L153-L154] return ((((((((var_1_2 + var_1_3) < var_1_4) ? ((var_1_4 <= (var_1_3 - var_1_2)) ? ((var_1_4 < var_1_3) ? (var_1_1 == ((float) ((var_1_5 - var_1_6) - var_1_7))) : 1) : (var_1_1 == ((float) (((((var_1_6) < (var_1_8)) ? (var_1_6) : (var_1_8))) + 3.25f)))) : (var_1_1 == ((float) var_1_8))) && ((var_1_10 || (var_1_1 < (var_1_8 / var_1_11))) ? ((var_1_10 || (var_1_1 != var_1_11)) ? (var_1_9 == ((unsigned short int) 8)) : 1) : (var_1_9 == ((unsigned short int) var_1_12)))) && (var_1_10 ? (var_1_13 == ((float) ((((var_1_7) > (var_1_5)) ? (var_1_7) : (var_1_5))))) : (var_1_13 == ((float) ((((10.15f) < ((var_1_6 + var_1_8))) ? (10.15f) : ((var_1_6 + var_1_8)))))))) && (((! (var_1_10 || var_1_15)) || var_1_16) ? (var_1_14 == ((signed short int) ((((var_1_17) > ((var_1_18 - var_1_19))) ? (var_1_17) : ((var_1_18 - var_1_19)))))) : 1)) && (var_1_16 ? (var_1_20 == ((signed long int) (var_1_3 - 50))) : 1)) && (var_1_15 ? (var_1_21 == ((signed short int) ((var_1_22 + 25) - var_1_19))) : 1)) && (var_1_10 ? (var_1_23 == ((signed short int) (var_1_22 + (((((var_1_24) < 0 ) ? -(var_1_24) : (var_1_24))) + var_1_25)))) : (var_1_16 ? (var_1_23 == ((signed short int) var_1_24)) : (var_1_23 == ((signed short int) var_1_17)))) ; VAL [\result=0, isInitial=1, var_1_10=0, var_1_12=-2, var_1_13=203/20, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=0, var_1_18=8216, var_1_19=8216, var_1_1=8221, var_1_20=-50, var_1_21=-1, var_1_22=8190, var_1_23=0, var_1_24=0, var_1_25=-8191, var_1_2=1, var_1_3=0, var_1_4=0, var_1_8=8221, var_1_9=-2] [L163] RET, EXPR property() [L163] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=0, var_1_12=-2, var_1_13=203/20, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=0, var_1_18=8216, var_1_19=8216, var_1_1=8221, var_1_20=-50, var_1_21=-1, var_1_22=8190, var_1_23=0, var_1_24=0, var_1_25=-8191, var_1_2=1, var_1_3=0, var_1_4=0, var_1_8=8221, var_1_9=-2] [L19] reach_error() VAL [isInitial=1, var_1_10=0, var_1_12=-2, var_1_13=203/20, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=0, var_1_18=8216, var_1_19=8216, var_1_1=8221, var_1_20=-50, var_1_21=-1, var_1_22=8190, var_1_23=0, var_1_24=0, var_1_25=-8191, var_1_2=1, var_1_3=0, var_1_4=0, var_1_8=8221, var_1_9=-2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 81 locations, 157 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.5s, OverallIterations: 3, TraceHistogramMax: 32, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 48 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 48 mSDsluCounter, 374 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 106 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 14 IncrementalHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 268 mSDtfsCounter, 14 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 200 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=110occurred in iteration=2, InterpolantAutomatonStates: 5, 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, 3 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 785 NumberOfCodeBlocks, 785 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 585 ConstructedInterpolants, 0 QuantifiedInterpolants, 589 SizeOfPredicates, 0 NumberOfNonLiveVariables, 437 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 5890/5952 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 10:19:35,417 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_steplocals_file-93.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 bd91f8319b366f9e737c54eb1f99b1168442b9ac934a3b601c547c20154488fd --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 10:19:37,174 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 10:19:37,259 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 10:19:37,267 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 10:19:37,270 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 10:19:37,289 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 10:19:37,290 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 10:19:37,290 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 10:19:37,291 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 10:19:37,291 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 10:19:37,291 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 10:19:37,292 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 10:19:37,292 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 10:19:37,292 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 10:19:37,292 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 10:19:37,292 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 10:19:37,292 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 10:19:37,292 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 10:19:37,292 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 10:19:37,293 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 10:19:37,293 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 10:19:37,293 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 10:19:37,293 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 10:19:37,293 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 10:19:37,293 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 10:19:37,293 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 10:19:37,293 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 10:19:37,293 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 10:19:37,293 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 10:19:37,293 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 10:19:37,293 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 10:19:37,293 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 10:19:37,293 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 10:19:37,293 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 10:19:37,293 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 10:19:37,293 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 10:19:37,294 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 10:19:37,294 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 10:19:37,294 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 10:19:37,294 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 10:19:37,294 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 10:19:37,294 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 10:19:37,294 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 10:19:37,294 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 10:19:37,294 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 10:19:37,294 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 -> bd91f8319b366f9e737c54eb1f99b1168442b9ac934a3b601c547c20154488fd [2025-03-08 10:19:37,548 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 10:19:37,554 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 10:19:37,558 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 10:19:37,560 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 10:19:37,560 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 10:19:37,561 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-93.i [2025-03-08 10:19:38,752 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5018c6d7/b865e12fbb1f456fb5ede59b7548b75f/FLAG703381dc9 [2025-03-08 10:19:38,944 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 10:19:38,945 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-93.i [2025-03-08 10:19:38,952 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5018c6d7/b865e12fbb1f456fb5ede59b7548b75f/FLAG703381dc9 [2025-03-08 10:19:38,969 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5018c6d7/b865e12fbb1f456fb5ede59b7548b75f [2025-03-08 10:19:38,971 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 10:19:38,973 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 10:19:38,974 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 10:19:38,974 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 10:19:38,977 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 10:19:38,977 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:19:38" (1/1) ... [2025-03-08 10:19:38,979 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7844a0af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:19:38, skipping insertion in model container [2025-03-08 10:19:38,979 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:19:38" (1/1) ... [2025-03-08 10:19:38,998 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 10:19:39,112 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_steplocals_file-93.i[917,930] [2025-03-08 10:19:39,176 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 10:19:39,195 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 10:19:39,203 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_steplocals_file-93.i[917,930] [2025-03-08 10:19:39,239 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 10:19:39,256 INFO L204 MainTranslator]: Completed translation [2025-03-08 10:19:39,257 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:19:39 WrapperNode [2025-03-08 10:19:39,258 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 10:19:39,259 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 10:19:39,259 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 10:19:39,259 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 10:19:39,265 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:19:39" (1/1) ... [2025-03-08 10:19:39,279 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:19:39" (1/1) ... [2025-03-08 10:19:39,304 INFO L138 Inliner]: procedures = 27, calls = 45, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 172 [2025-03-08 10:19:39,308 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 10:19:39,308 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 10:19:39,309 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 10:19:39,309 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 10:19:39,317 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:19:39" (1/1) ... [2025-03-08 10:19:39,318 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:19:39" (1/1) ... [2025-03-08 10:19:39,320 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:19:39" (1/1) ... [2025-03-08 10:19:39,336 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 10:19:39,341 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:19:39" (1/1) ... [2025-03-08 10:19:39,341 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:19:39" (1/1) ... [2025-03-08 10:19:39,351 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:19:39" (1/1) ... [2025-03-08 10:19:39,355 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:19:39" (1/1) ... [2025-03-08 10:19:39,357 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:19:39" (1/1) ... [2025-03-08 10:19:39,363 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:19:39" (1/1) ... [2025-03-08 10:19:39,366 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 10:19:39,370 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 10:19:39,370 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 10:19:39,370 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 10:19:39,371 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:19:39" (1/1) ... [2025-03-08 10:19:39,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 10:19:39,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:19:39,399 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 10:19:39,404 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 10:19:39,419 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 10:19:39,419 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 10:19:39,419 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 10:19:39,419 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 10:19:39,419 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 10:19:39,419 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 10:19:39,486 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 10:19:39,487 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 10:19:45,142 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2025-03-08 10:19:45,143 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 10:19:45,152 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 10:19:45,153 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 10:19:45,153 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:19:45 BoogieIcfgContainer [2025-03-08 10:19:45,153 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 10:19:45,155 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 10:19:45,155 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 10:19:45,158 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 10:19:45,159 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 10:19:38" (1/3) ... [2025-03-08 10:19:45,159 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d062077 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:19:45, skipping insertion in model container [2025-03-08 10:19:45,160 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:19:39" (2/3) ... [2025-03-08 10:19:45,160 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d062077 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:19:45, skipping insertion in model container [2025-03-08 10:19:45,160 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:19:45" (3/3) ... [2025-03-08 10:19:45,161 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-93.i [2025-03-08 10:19:45,170 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 10:19:45,171 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_steplocals_file-93.i that has 2 procedures, 81 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 10:19:45,209 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 10:19:45,216 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;@9ff6a20, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 10:19:45,216 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 10:19:45,218 INFO L276 IsEmpty]: Start isEmpty. Operand has 81 states, 46 states have (on average 1.326086956521739) internal successors, (61), 47 states have internal predecessors, (61), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-08 10:19:45,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-03-08 10:19:45,226 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:19:45,226 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:19:45,227 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:19:45,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:19:45,230 INFO L85 PathProgramCache]: Analyzing trace with hash -1863272572, now seen corresponding path program 1 times [2025-03-08 10:19:45,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 10:19:45,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [384565497] [2025-03-08 10:19:45,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:19:45,237 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 10:19:45,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 10:19:45,239 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 10:19:45,240 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 10:19:45,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-03-08 10:19:45,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-03-08 10:19:45,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:19:45,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:19:45,570 INFO L256 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 10:19:45,577 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 10:19:45,614 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 662 proven. 0 refuted. 0 times theorem prover too weak. 1322 trivial. 0 not checked. [2025-03-08 10:19:45,616 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 10:19:45,616 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 10:19:45,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [384565497] [2025-03-08 10:19:45,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [384565497] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:19:45,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:19:45,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 10:19:45,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249400677] [2025-03-08 10:19:45,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:19:45,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 10:19:45,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 10:19:45,638 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 10:19:45,638 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 10:19:45,640 INFO L87 Difference]: Start difference. First operand has 81 states, 46 states have (on average 1.326086956521739) internal successors, (61), 47 states have internal predecessors, (61), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2025-03-08 10:19:45,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:19:45,660 INFO L93 Difference]: Finished difference Result 156 states and 277 transitions. [2025-03-08 10:19:45,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 10:19:45,661 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 196 [2025-03-08 10:19:45,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:19:45,665 INFO L225 Difference]: With dead ends: 156 [2025-03-08 10:19:45,666 INFO L226 Difference]: Without dead ends: 78 [2025-03-08 10:19:45,668 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 195 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 10:19:45,670 INFO L435 NwaCegarLoop]: 120 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, 120 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 10:19:45,670 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 10:19:45,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-03-08 10:19:45,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2025-03-08 10:19:45,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 44 states have (on average 1.2727272727272727) internal successors, (56), 44 states have internal predecessors, (56), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-08 10:19:45,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 120 transitions. [2025-03-08 10:19:45,712 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 120 transitions. Word has length 196 [2025-03-08 10:19:45,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:19:45,712 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 120 transitions. [2025-03-08 10:19:45,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2025-03-08 10:19:45,714 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 120 transitions. [2025-03-08 10:19:45,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-03-08 10:19:45,717 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:19:45,718 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:19:45,729 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 10:19:45,919 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 10:19:45,920 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:19:45,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:19:45,920 INFO L85 PathProgramCache]: Analyzing trace with hash -1686606720, now seen corresponding path program 1 times [2025-03-08 10:19:45,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 10:19:45,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1459171556] [2025-03-08 10:19:45,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:19:45,921 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 10:19:45,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 10:19:45,923 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 10:19:45,924 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 10:19:46,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-03-08 10:19:46,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-03-08 10:19:46,273 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:19:46,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:19:46,286 INFO L256 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 10:19:46,291 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 10:19:46,374 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-03-08 10:19:46,375 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 10:19:46,375 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 10:19:46,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1459171556] [2025-03-08 10:19:46,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1459171556] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:19:46,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:19:46,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 10:19:46,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035760504] [2025-03-08 10:19:46,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:19:46,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 10:19:46,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 10:19:46,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 10:19:46,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 10:19:46,378 INFO L87 Difference]: Start difference. First operand 78 states and 120 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-08 10:19:47,594 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 10:19:51,043 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.33s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 10:19:51,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:19:51,140 INFO L93 Difference]: Finished difference Result 188 states and 286 transitions. [2025-03-08 10:19:51,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 10:19:51,141 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 196 [2025-03-08 10:19:51,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:19:51,143 INFO L225 Difference]: With dead ends: 188 [2025-03-08 10:19:51,143 INFO L226 Difference]: Without dead ends: 113 [2025-03-08 10:19:51,143 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 10:19:51,144 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 44 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2025-03-08 10:19:51,144 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 253 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2025-03-08 10:19:51,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2025-03-08 10:19:51,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 110. [2025-03-08 10:19:51,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 65 states have (on average 1.2461538461538462) internal successors, (81), 66 states have internal predecessors, (81), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-08 10:19:51,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 165 transitions. [2025-03-08 10:19:51,163 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 165 transitions. Word has length 196 [2025-03-08 10:19:51,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:19:51,163 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 165 transitions. [2025-03-08 10:19:51,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-08 10:19:51,163 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 165 transitions. [2025-03-08 10:19:51,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2025-03-08 10:19:51,167 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:19:51,168 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:19:51,179 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 (3)] Ended with exit code 0 [2025-03-08 10:19:51,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /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 10:19:51,368 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:19:51,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:19:51,369 INFO L85 PathProgramCache]: Analyzing trace with hash 1840611205, now seen corresponding path program 1 times [2025-03-08 10:19:51,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 10:19:51,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [347106507] [2025-03-08 10:19:51,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:19:51,370 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 10:19:51,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 10:19:51,373 INFO L229 MonitoredProcess]: Starting monitored process 4 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 10:19:51,374 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 (4)] Waiting until timeout for monitored process [2025-03-08 10:19:51,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-03-08 10:19:51,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-03-08 10:19:51,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:19:51,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:19:51,739 INFO L256 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-08 10:19:51,746 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 10:20:26,887 WARN L286 SmtUtils]: Spent 7.91s on a formula simplification that was a NOOP. DAG size: 43 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-03-08 10:20:50,306 WARN L286 SmtUtils]: Spent 6.09s on a formula simplification that was a NOOP. DAG size: 41 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)