./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 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_fillercode_fillercodestructure_filler-pr-ci_file-2.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 8c967b3ea73611668e07001cededa057f95ebe8c171b4725500e4449faff4d5b --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 01:19:53,588 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 01:19:53,640 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 01:19:53,643 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 01:19:53,643 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 01:19:53,661 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 01:19:53,662 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 01:19:53,662 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 01:19:53,663 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 01:19:53,663 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 01:19:53,663 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 01:19:53,663 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 01:19:53,663 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 01:19:53,663 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 01:19:53,663 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 01:19:53,663 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 01:19:53,664 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 01:19:53,664 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 01:19:53,664 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 01:19:53,665 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 01:19:53,665 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 01:19:53,665 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 01:19:53,665 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 01:19:53,665 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 01:19:53,665 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 01:19:53,665 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 01:19:53,665 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 01:19:53,665 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 01:19:53,665 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 01:19:53,665 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 01:19:53,665 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 01:19:53,665 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 01:19:53,665 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 01:19:53,666 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 01:19:53,666 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 01:19:53,666 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 01:19:53,666 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 01:19:53,666 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 01:19:53,666 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 01:19:53,666 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 01:19:53,666 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 01:19:53,666 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 01:19:53,666 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 01:19:53,666 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 -> 8c967b3ea73611668e07001cededa057f95ebe8c171b4725500e4449faff4d5b [2025-03-17 01:19:53,888 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 01:19:53,896 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 01:19:53,898 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 01:19:53,899 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 01:19:53,899 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 01:19:53,901 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-2.i [2025-03-17 01:19:55,039 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/836079e33/db23228f0638402ea8c8c361175982c3/FLAGc24b73e6d [2025-03-17 01:19:55,255 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 01:19:55,259 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-2.i [2025-03-17 01:19:55,265 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/836079e33/db23228f0638402ea8c8c361175982c3/FLAGc24b73e6d [2025-03-17 01:19:55,608 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/836079e33/db23228f0638402ea8c8c361175982c3 [2025-03-17 01:19:55,609 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 01:19:55,610 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 01:19:55,611 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 01:19:55,611 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 01:19:55,614 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 01:19:55,615 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 01:19:55" (1/1) ... [2025-03-17 01:19:55,615 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79273220 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:19:55, skipping insertion in model container [2025-03-17 01:19:55,616 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 01:19:55" (1/1) ... [2025-03-17 01:19:55,631 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 01:19:55,728 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_fillercode_fillercodestructure_filler-pr-ci_file-2.i[918,931] [2025-03-17 01:19:55,785 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 01:19:55,801 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 01:19:55,810 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_fillercode_fillercodestructure_filler-pr-ci_file-2.i[918,931] [2025-03-17 01:19:55,836 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 01:19:55,849 INFO L204 MainTranslator]: Completed translation [2025-03-17 01:19:55,849 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:19:55 WrapperNode [2025-03-17 01:19:55,851 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 01:19:55,852 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 01:19:55,852 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 01:19:55,852 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 01:19:55,856 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:19:55" (1/1) ... [2025-03-17 01:19:55,864 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:19:55" (1/1) ... [2025-03-17 01:19:55,888 INFO L138 Inliner]: procedures = 26, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 184 [2025-03-17 01:19:55,888 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 01:19:55,889 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 01:19:55,889 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 01:19:55,889 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 01:19:55,894 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:19:55" (1/1) ... [2025-03-17 01:19:55,895 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:19:55" (1/1) ... [2025-03-17 01:19:55,897 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:19:55" (1/1) ... [2025-03-17 01:19:55,913 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-17 01:19:55,918 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:19:55" (1/1) ... [2025-03-17 01:19:55,919 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:19:55" (1/1) ... [2025-03-17 01:19:55,928 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:19:55" (1/1) ... [2025-03-17 01:19:55,932 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:19:55" (1/1) ... [2025-03-17 01:19:55,934 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:19:55" (1/1) ... [2025-03-17 01:19:55,937 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:19:55" (1/1) ... [2025-03-17 01:19:55,940 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 01:19:55,943 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 01:19:55,943 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 01:19:55,943 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 01:19:55,944 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:19:55" (1/1) ... [2025-03-17 01:19:55,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 01:19:55,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 01:19:55,972 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-17 01:19:55,977 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-17 01:19:55,992 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 01:19:55,992 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 01:19:55,992 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 01:19:55,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 01:19:55,992 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 01:19:55,992 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 01:19:56,045 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 01:19:56,047 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 01:19:56,326 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-03-17 01:19:56,327 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 01:19:56,344 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 01:19:56,345 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 01:19:56,345 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 01:19:56 BoogieIcfgContainer [2025-03-17 01:19:56,345 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 01:19:56,346 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 01:19:56,346 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 01:19:56,350 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 01:19:56,351 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 01:19:55" (1/3) ... [2025-03-17 01:19:56,351 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@196aeeb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 01:19:56, skipping insertion in model container [2025-03-17 01:19:56,352 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:19:55" (2/3) ... [2025-03-17 01:19:56,352 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@196aeeb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 01:19:56, skipping insertion in model container [2025-03-17 01:19:56,352 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 01:19:56" (3/3) ... [2025-03-17 01:19:56,353 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-2.i [2025-03-17 01:19:56,363 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 01:19:56,366 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-2.i that has 2 procedures, 74 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 01:19:56,415 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 01:19:56,424 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;@392b6f27, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 01:19:56,425 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 01:19:56,429 INFO L276 IsEmpty]: Start isEmpty. Operand has 74 states, 52 states have (on average 1.5576923076923077) internal successors, (81), 53 states have internal predecessors, (81), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-17 01:19:56,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-17 01:19:56,439 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:19:56,439 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:19:56,440 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:19:56,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:19:56,445 INFO L85 PathProgramCache]: Analyzing trace with hash -335795485, now seen corresponding path program 1 times [2025-03-17 01:19:56,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:19:56,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823329076] [2025-03-17 01:19:56,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:19:56,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:19:56,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-17 01:19:56,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-17 01:19:56,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:19:56,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:19:56,693 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2025-03-17 01:19:56,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:19:56,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823329076] [2025-03-17 01:19:56,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823329076] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 01:19:56,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [369575183] [2025-03-17 01:19:56,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:19:56,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 01:19:56,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 01:19:56,700 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-17 01:19:56,702 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-17 01:19:56,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-17 01:19:56,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-17 01:19:56,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:19:56,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:19:56,842 INFO L256 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 01:19:56,847 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 01:19:56,872 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2025-03-17 01:19:56,872 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 01:19:56,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [369575183] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:19:56,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 01:19:56,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 01:19:56,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620966656] [2025-03-17 01:19:56,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:19:56,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 01:19:56,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:19:56,893 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 01:19:56,894 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 01:19:56,895 INFO L87 Difference]: Start difference. First operand has 74 states, 52 states have (on average 1.5576923076923077) internal successors, (81), 53 states have internal predecessors, (81), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-17 01:19:56,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:19:56,934 INFO L93 Difference]: Finished difference Result 145 states and 255 transitions. [2025-03-17 01:19:56,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 01:19:56,936 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 129 [2025-03-17 01:19:56,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:19:56,942 INFO L225 Difference]: With dead ends: 145 [2025-03-17 01:19:56,942 INFO L226 Difference]: Without dead ends: 72 [2025-03-17 01:19:56,946 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 130 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-17 01:19:56,948 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 01:19:56,949 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 111 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 01:19:56,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-03-17 01:19:56,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2025-03-17 01:19:56,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 51 states have (on average 1.4705882352941178) internal successors, (75), 51 states have internal predecessors, (75), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-17 01:19:56,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 113 transitions. [2025-03-17 01:19:56,985 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 113 transitions. Word has length 129 [2025-03-17 01:19:56,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:19:56,986 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 113 transitions. [2025-03-17 01:19:56,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-17 01:19:56,987 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 113 transitions. [2025-03-17 01:19:56,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-17 01:19:56,992 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:19:56,992 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:19:56,999 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 01:19:57,193 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-17 01:19:57,193 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:19:57,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:19:57,194 INFO L85 PathProgramCache]: Analyzing trace with hash -399497789, now seen corresponding path program 1 times [2025-03-17 01:19:57,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:19:57,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672782049] [2025-03-17 01:19:57,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:19:57,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:19:57,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-17 01:19:57,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-17 01:19:57,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:19:57,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 01:19:57,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1462157211] [2025-03-17 01:19:57,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:19:57,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 01:19:57,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 01:19:57,354 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 01:19:57,356 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 01:19:57,418 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-17 01:19:57,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-17 01:19:57,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:19:57,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:19:57,498 INFO L256 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 01:19:57,501 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 01:19:57,990 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 360 proven. 0 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2025-03-17 01:19:57,990 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 01:19:57,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:19:57,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672782049] [2025-03-17 01:19:57,990 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 01:19:57,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1462157211] [2025-03-17 01:19:57,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1462157211] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:19:57,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:19:57,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 01:19:57,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581001129] [2025-03-17 01:19:57,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:19:57,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 01:19:57,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:19:57,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 01:19:57,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 01:19:57,992 INFO L87 Difference]: Start difference. First operand 72 states and 113 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-17 01:19:58,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:19:58,290 INFO L93 Difference]: Finished difference Result 204 states and 312 transitions. [2025-03-17 01:19:58,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 01:19:58,290 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 130 [2025-03-17 01:19:58,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:19:58,292 INFO L225 Difference]: With dead ends: 204 [2025-03-17 01:19:58,292 INFO L226 Difference]: Without dead ends: 133 [2025-03-17 01:19:58,293 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 01:19:58,293 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 193 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 01:19:58,293 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 199 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 01:19:58,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2025-03-17 01:19:58,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 104. [2025-03-17 01:19:58,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 73 states have (on average 1.4109589041095891) internal successors, (103), 74 states have internal predecessors, (103), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-17 01:19:58,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 159 transitions. [2025-03-17 01:19:58,317 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 159 transitions. Word has length 130 [2025-03-17 01:19:58,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:19:58,318 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 159 transitions. [2025-03-17 01:19:58,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-17 01:19:58,318 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 159 transitions. [2025-03-17 01:19:58,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-17 01:19:58,321 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:19:58,321 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:19:58,329 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-17 01:19:58,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2025-03-17 01:19:58,522 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:19:58,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:19:58,522 INFO L85 PathProgramCache]: Analyzing trace with hash -370868638, now seen corresponding path program 1 times [2025-03-17 01:19:58,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:19:58,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421502762] [2025-03-17 01:19:58,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:19:58,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:19:58,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-17 01:19:58,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-17 01:19:58,589 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:19:58,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:19:58,922 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-17 01:19:58,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:19:58,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421502762] [2025-03-17 01:19:58,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421502762] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:19:58,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:19:58,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 01:19:58,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202035638] [2025-03-17 01:19:58,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:19:58,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 01:19:58,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:19:58,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 01:19:58,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 01:19:58,925 INFO L87 Difference]: Start difference. First operand 104 states and 159 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-17 01:19:59,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:19:59,061 INFO L93 Difference]: Finished difference Result 249 states and 376 transitions. [2025-03-17 01:19:59,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 01:19:59,062 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 130 [2025-03-17 01:19:59,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:19:59,065 INFO L225 Difference]: With dead ends: 249 [2025-03-17 01:19:59,065 INFO L226 Difference]: Without dead ends: 151 [2025-03-17 01:19:59,065 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 01:19:59,067 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 162 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 01:19:59,067 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 160 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 01:19:59,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2025-03-17 01:19:59,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 103. [2025-03-17 01:19:59,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 81 states have (on average 1.4691358024691359) internal successors, (119), 81 states have internal predecessors, (119), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-17 01:19:59,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 157 transitions. [2025-03-17 01:19:59,091 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 157 transitions. Word has length 130 [2025-03-17 01:19:59,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:19:59,091 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 157 transitions. [2025-03-17 01:19:59,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-17 01:19:59,091 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 157 transitions. [2025-03-17 01:19:59,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-17 01:19:59,092 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:19:59,093 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:19:59,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 01:19:59,093 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:19:59,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:19:59,093 INFO L85 PathProgramCache]: Analyzing trace with hash 1072273256, now seen corresponding path program 1 times [2025-03-17 01:19:59,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:19:59,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046636398] [2025-03-17 01:19:59,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:19:59,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:19:59,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-17 01:19:59,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-17 01:19:59,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:19:59,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 01:19:59,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2136852385] [2025-03-17 01:19:59,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:19:59,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 01:19:59,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 01:19:59,177 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 01:19:59,180 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 01:19:59,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-17 01:19:59,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-17 01:19:59,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:19:59,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 01:19:59,294 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 01:19:59,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-17 01:19:59,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-17 01:19:59,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:19:59,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 01:19:59,401 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 01:19:59,401 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 01:19:59,402 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 01:19:59,410 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-17 01:19:59,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 01:19:59,606 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-17 01:19:59,670 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 01:19:59,672 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 01:19:59 BoogieIcfgContainer [2025-03-17 01:19:59,672 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 01:19:59,673 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 01:19:59,673 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 01:19:59,673 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 01:19:59,674 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 01:19:56" (3/4) ... [2025-03-17 01:19:59,675 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 01:19:59,676 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 01:19:59,676 INFO L158 Benchmark]: Toolchain (without parser) took 4065.90ms. Allocated memory is still 167.8MB. Free memory was 132.7MB in the beginning and 81.7MB in the end (delta: 51.0MB). Peak memory consumption was 47.2MB. Max. memory is 16.1GB. [2025-03-17 01:19:59,676 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 126.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 01:19:59,677 INFO L158 Benchmark]: CACSL2BoogieTranslator took 239.68ms. Allocated memory is still 167.8MB. Free memory was 132.3MB in the beginning and 117.2MB in the end (delta: 15.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 01:19:59,677 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.60ms. Allocated memory is still 167.8MB. Free memory was 117.2MB in the beginning and 113.9MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 01:19:59,677 INFO L158 Benchmark]: Boogie Preprocessor took 52.22ms. Allocated memory is still 167.8MB. Free memory was 113.9MB in the beginning and 108.8MB in the end (delta: 5.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 01:19:59,677 INFO L158 Benchmark]: IcfgBuilder took 402.29ms. Allocated memory is still 167.8MB. Free memory was 108.8MB in the beginning and 84.1MB in the end (delta: 24.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-17 01:19:59,677 INFO L158 Benchmark]: TraceAbstraction took 3326.01ms. Allocated memory is still 167.8MB. Free memory was 83.7MB in the beginning and 81.7MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 01:19:59,678 INFO L158 Benchmark]: Witness Printer took 2.80ms. Allocated memory is still 167.8MB. Free memory was 81.7MB in the beginning and 81.7MB in the end (delta: 50.8kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 01:19:59,679 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.21ms. Allocated memory is still 201.3MB. Free memory is still 126.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 239.68ms. Allocated memory is still 167.8MB. Free memory was 132.3MB in the beginning and 117.2MB in the end (delta: 15.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.60ms. Allocated memory is still 167.8MB. Free memory was 117.2MB in the beginning and 113.9MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 52.22ms. Allocated memory is still 167.8MB. Free memory was 113.9MB in the beginning and 108.8MB in the end (delta: 5.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 402.29ms. Allocated memory is still 167.8MB. Free memory was 108.8MB in the beginning and 84.1MB in the end (delta: 24.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 3326.01ms. Allocated memory is still 167.8MB. Free memory was 83.7MB in the beginning and 81.7MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.80ms. Allocated memory is still 167.8MB. Free memory was 81.7MB in the beginning and 81.7MB in the end (delta: 50.8kB). 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 someBinaryArithmeticDOUBLEoperation at line 74, overapproximation of someBinaryArithmeticDOUBLEoperation at line 124, overapproximation of someBinaryFLOATComparisonOperation at line 140, overapproximation of someBinaryFLOATComparisonOperation at line 134, overapproximation of someBinaryFLOATComparisonOperation at line 141, overapproximation of someBinaryFLOATComparisonOperation at line 123, overapproximation of someBinaryFLOATComparisonOperation at line 67, overapproximation of someBinaryFLOATComparisonOperation at line 169, overapproximation of someBinaryFLOATComparisonOperation at line 143, overapproximation of someBinaryFLOATComparisonOperation at line 145, overapproximation of someBinaryFLOATComparisonOperation at line 62, overapproximation of someBinaryFLOATComparisonOperation at line 106, overapproximation of someBinaryFLOATComparisonOperation at line 136, overapproximation of someUnaryDOUBLEoperation at line 74, overapproximation of someBinaryDOUBLEComparisonOperation at line 76, overapproximation of someBinaryDOUBLEComparisonOperation at line 61, overapproximation of someBinaryDOUBLEComparisonOperation at line 74, overapproximation of someBinaryDOUBLEComparisonOperation at line 169, overapproximation of someBinaryDOUBLEComparisonOperation at line 159, overapproximation of someBinaryDOUBLEComparisonOperation at line 84, overapproximation of someBinaryDOUBLEComparisonOperation at line 80, overapproximation of someBinaryDOUBLEComparisonOperation at line 138, overapproximation of someBinaryArithmeticFLOAToperation at line 62, overapproximation of someBinaryArithmeticFLOAToperation at line 121. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] float var_1_1 = 3.95; [L23] float var_1_4 = 9999999.8; [L24] float var_1_5 = 8.6; [L25] unsigned long int var_1_6 = 10000; [L26] double var_1_8 = 64.5; [L27] float var_1_10 = 255.25; [L28] float var_1_11 = 7.5; [L29] float var_1_12 = 0.0; [L30] float var_1_13 = 64.8; [L31] double var_1_14 = 127.75; [L32] signed char var_1_15 = 8; [L33] signed char var_1_16 = 32; [L34] unsigned char var_1_17 = 0; [L35] unsigned char var_1_18 = 0; [L36] double var_1_19 = 2.25; [L37] unsigned char var_1_20 = 0; [L38] unsigned short int var_1_21 = 256; [L39] float var_1_22 = 256.5; [L40] signed char var_1_27 = -64; [L41] signed char var_1_30 = -10; [L42] unsigned long int var_1_31 = 8; [L43] double var_1_32 = 499.75; [L44] double var_1_36 = 3.15; [L45] unsigned char var_1_38 = 8; [L46] float var_1_40 = 255.8; [L47] signed short int var_1_41 = 256; [L48] signed char var_1_42 = -32; [L49] unsigned long int last_1_var_1_6 = 10000; [L173] isInitial = 1 [L174] FCALL initially() [L175] COND TRUE 1 [L176] CALL updateLastVariables() [L166] last_1_var_1_6 = var_1_6 [L176] RET updateLastVariables() [L177] CALL updateVariables() [L133] var_1_4 = __VERIFIER_nondet_float() [L134] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_11=15/2, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_5=43/5, var_1_6=10000, var_1_8=129/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_11=15/2, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_5=43/5, var_1_6=10000, var_1_8=129/2] [L134] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_11=15/2, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_5=43/5, var_1_6=10000, var_1_8=129/2] [L135] var_1_5 = __VERIFIER_nondet_float() [L136] CALL assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_11=15/2, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000, var_1_8=129/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_11=15/2, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000, var_1_8=129/2] [L136] RET assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_11=15/2, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000, var_1_8=129/2] [L137] var_1_8 = __VERIFIER_nondet_double() [L138] CALL assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_11=15/2, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_11=15/2, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L138] RET assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_11=15/2, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L139] var_1_11 = __VERIFIER_nondet_float() [L140] 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, last_1_var_1_6=10000, var_1_10=1021/4, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L140] 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, last_1_var_1_6=10000, var_1_10=1021/4, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L141] CALL assume_abort_if_not(var_1_11 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L141] RET assume_abort_if_not(var_1_11 != 0.0F) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L142] var_1_12 = __VERIFIER_nondet_float() [L143] CALL assume_abort_if_not((var_1_12 >= 4611686.018427382800e+12F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L143] RET assume_abort_if_not((var_1_12 >= 4611686.018427382800e+12F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L144] var_1_13 = __VERIFIER_nondet_float() [L145] CALL assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L145] RET assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L146] var_1_15 = __VERIFIER_nondet_char() [L147] CALL assume_abort_if_not(var_1_15 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L147] RET assume_abort_if_not(var_1_15 >= -1) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L148] CALL assume_abort_if_not(var_1_15 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L148] RET assume_abort_if_not(var_1_15 <= 127) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L149] var_1_16 = __VERIFIER_nondet_char() [L150] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L150] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L151] CALL assume_abort_if_not(var_1_16 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L151] RET assume_abort_if_not(var_1_16 <= 127) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L152] var_1_18 = __VERIFIER_nondet_uchar() [L153] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L153] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L154] CALL assume_abort_if_not(var_1_18 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L154] RET assume_abort_if_not(var_1_18 <= 0) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L155] var_1_30 = __VERIFIER_nondet_char() [L156] CALL assume_abort_if_not(var_1_30 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-127, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-127, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L156] RET assume_abort_if_not(var_1_30 >= -127) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-127, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L157] CALL assume_abort_if_not(var_1_30 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-127, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-127, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L157] RET assume_abort_if_not(var_1_30 <= 126) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-127, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L158] var_1_36 = __VERIFIER_nondet_double() [L159] CALL assume_abort_if_not((var_1_36 >= 0.0F && var_1_36 <= -1.0e-20F) || (var_1_36 <= 2305843.009213691390e+12F && var_1_36 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-127, var_1_31=8, var_1_32=1999/4, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-127, var_1_31=8, var_1_32=1999/4, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L159] RET assume_abort_if_not((var_1_36 >= 0.0F && var_1_36 <= -1.0e-20F) || (var_1_36 <= 2305843.009213691390e+12F && var_1_36 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-127, var_1_31=8, var_1_32=1999/4, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L160] var_1_42 = __VERIFIER_nondet_char() [L161] CALL assume_abort_if_not(var_1_42 >= -128) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-127, var_1_31=8, var_1_32=1999/4, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=2, var_1_6=10000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-127, var_1_31=8, var_1_32=1999/4, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=2, var_1_6=10000] [L161] RET assume_abort_if_not(var_1_42 >= -128) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-127, var_1_31=8, var_1_32=1999/4, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=2, var_1_6=10000] [L162] CALL assume_abort_if_not(var_1_42 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-127, var_1_31=8, var_1_32=1999/4, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=2, var_1_6=10000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-127, var_1_31=8, var_1_32=1999/4, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=2, var_1_6=10000] [L162] RET assume_abort_if_not(var_1_42 <= 127) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-127, var_1_31=8, var_1_32=1999/4, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=2, var_1_6=10000] [L163] CALL assume_abort_if_not(var_1_42 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-127, var_1_31=8, var_1_32=1999/4, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=2, var_1_6=10000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-127, var_1_31=8, var_1_32=1999/4, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=2, var_1_6=10000] [L163] RET assume_abort_if_not(var_1_42 != 0) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-127, var_1_31=8, var_1_32=1999/4, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=2, var_1_6=10000] [L177] RET updateVariables() [L178] CALL step() [L53] COND TRUE (var_1_15 - ((((0) < (var_1_16)) ? (0) : (var_1_16)))) > last_1_var_1_6 [L54] var_1_14 = var_1_12 VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_12=2, var_1_14=2, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-127, var_1_31=8, var_1_32=1999/4, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=2, var_1_6=10000] [L56] COND FALSE !(var_1_6 < (~ var_1_30)) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_12=2, var_1_14=2, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-127, var_1_31=8, var_1_32=1999/4, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=2, var_1_6=10000] [L61] COND TRUE (var_1_5 / var_1_11) >= (var_1_8 - var_1_4) [L62] var_1_10 = (((((var_1_5 - (var_1_12 - var_1_13))) < (var_1_4)) ? ((var_1_5 - (var_1_12 - var_1_13))) : (var_1_4))) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=3, var_1_12=2, var_1_14=2, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-127, var_1_31=8, var_1_32=1999/4, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=2, var_1_4=0, var_1_6=10000] [L66] var_1_20 = var_1_16 VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=3, var_1_12=2, var_1_14=2, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=1, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-127, var_1_31=8, var_1_32=1999/4, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=2, var_1_4=0, var_1_6=10000] [L67] COND FALSE !(var_1_13 == var_1_13) [L74] var_1_32 = (((((((var_1_12 - 9.5) < 0 ) ? -(var_1_12 - 9.5) : (var_1_12 - 9.5))) < 0 ) ? -((((var_1_12 - 9.5) < 0 ) ? -(var_1_12 - 9.5) : (var_1_12 - 9.5))) : ((((var_1_12 - 9.5) < 0 ) ? -(var_1_12 - 9.5) : (var_1_12 - 9.5))))) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=3, var_1_12=2, var_1_14=2, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=1, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-127, var_1_31=8, var_1_32=4, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=2, var_1_4=0, var_1_6=10000] [L76] COND FALSE !(! (var_1_4 <= var_1_36)) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=3, var_1_12=2, var_1_14=2, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=1, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-127, var_1_31=8, var_1_32=4, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=2, var_1_4=0, var_1_6=10000] [L79] EXPR (var_1_16 >> 4) & var_1_16 VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=3, var_1_12=2, var_1_14=2, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=1, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-127, var_1_31=8, var_1_32=4, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=2, var_1_4=0, var_1_6=10000] [L79] COND TRUE 128 != ((var_1_16 >> 4) & var_1_16) [L80] var_1_40 = ((((var_1_36) > (var_1_13)) ? (var_1_36) : (var_1_13))) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=3, var_1_12=2, var_1_13=0, var_1_14=2, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=1, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-127, var_1_31=8, var_1_32=4, var_1_36=5, var_1_38=8, var_1_40=5, var_1_41=256, var_1_42=2, var_1_4=0, var_1_6=10000] [L82] var_1_21 = var_1_16 VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=3, var_1_12=2, var_1_13=0, var_1_14=2, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=1, var_1_21=1, var_1_22=513/2, var_1_27=-64, var_1_30=-127, var_1_31=8, var_1_32=4, var_1_36=5, var_1_38=8, var_1_40=5, var_1_41=256, var_1_42=2, var_1_4=0, var_1_6=10000] [L83] COND TRUE var_1_21 <= (var_1_16 * var_1_20) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=3, var_1_12=2, var_1_13=0, var_1_14=2, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=1, var_1_21=1, var_1_22=513/2, var_1_27=-64, var_1_30=-127, var_1_31=8, var_1_32=4, var_1_36=5, var_1_38=8, var_1_40=5, var_1_41=256, var_1_42=2, var_1_4=0, var_1_6=10000] [L84] COND TRUE (var_1_5 + var_1_14) <= 127.025f [L85] var_1_17 = var_1_18 VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=3, var_1_12=2, var_1_13=0, var_1_14=2, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=1, var_1_21=1, var_1_22=513/2, var_1_27=-64, var_1_30=-127, var_1_31=8, var_1_32=4, var_1_36=5, var_1_38=8, var_1_40=5, var_1_41=256, var_1_42=2, var_1_4=0, var_1_6=10000] [L92] unsigned char stepLocal_0 = var_1_20 != var_1_20; VAL [isInitial=1, last_1_var_1_6=10000, stepLocal_0=0, var_1_10=3, var_1_12=2, var_1_13=0, var_1_14=2, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=1, var_1_21=1, var_1_22=513/2, var_1_27=-64, var_1_30=-127, var_1_31=8, var_1_32=4, var_1_36=5, var_1_38=8, var_1_40=5, var_1_41=256, var_1_42=2, var_1_4=0, var_1_6=10000] [L93] COND FALSE !(\read(var_1_17)) [L104] var_1_6 = var_1_20 VAL [isInitial=1, last_1_var_1_6=10000, stepLocal_0=0, var_1_10=3, var_1_12=2, var_1_13=0, var_1_14=2, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=1, var_1_21=1, var_1_22=513/2, var_1_27=-64, var_1_30=-127, var_1_31=8, var_1_32=4, var_1_36=5, var_1_38=8, var_1_40=5, var_1_41=256, var_1_42=2, var_1_4=0, var_1_6=1] [L106] COND FALSE !(((var_1_12 + 127.75f) * var_1_13) < var_1_13) VAL [isInitial=1, last_1_var_1_6=10000, stepLocal_0=0, var_1_10=3, var_1_12=2, var_1_13=0, var_1_14=2, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=1, var_1_21=1, var_1_22=513/2, var_1_27=-64, var_1_30=-127, var_1_31=8, var_1_32=4, var_1_36=5, var_1_38=8, var_1_40=5, var_1_41=256, var_1_42=2, var_1_4=0, var_1_6=1] [L111] COND TRUE var_1_6 <= var_1_6 VAL [isInitial=1, last_1_var_1_6=10000, stepLocal_0=0, var_1_10=3, var_1_12=2, var_1_13=0, var_1_14=2, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=1, var_1_21=1, var_1_22=513/2, var_1_27=-64, var_1_30=-127, var_1_31=8, var_1_32=4, var_1_36=5, var_1_38=8, var_1_40=5, var_1_41=256, var_1_42=2, var_1_4=0, var_1_6=1] [L112] COND FALSE !(var_1_6 > var_1_6) [L115] var_1_1 = var_1_5 VAL [isInitial=1, last_1_var_1_6=10000, stepLocal_0=0, var_1_10=3, var_1_12=2, var_1_13=0, var_1_14=2, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=6, var_1_20=1, var_1_21=1, var_1_22=513/2, var_1_27=-64, var_1_30=-127, var_1_31=8, var_1_32=4, var_1_36=5, var_1_38=8, var_1_40=5, var_1_41=256, var_1_42=2, var_1_4=0, var_1_5=6, var_1_6=1] [L120] COND TRUE var_1_16 >= var_1_20 [L121] var_1_22 = (var_1_13 + var_1_13) VAL [isInitial=1, last_1_var_1_6=10000, stepLocal_0=0, var_1_10=3, var_1_12=2, var_1_13=0, var_1_14=2, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=6, var_1_20=1, var_1_21=1, var_1_27=-64, var_1_30=-127, var_1_31=8, var_1_32=4, var_1_36=5, var_1_38=8, var_1_40=5, var_1_41=256, var_1_42=2, var_1_4=0, var_1_5=6, var_1_6=1] [L123] COND TRUE var_1_1 < var_1_11 [L124] var_1_19 = (var_1_13 - 256.4) VAL [isInitial=1, last_1_var_1_6=10000, stepLocal_0=0, var_1_10=3, var_1_12=2, var_1_13=0, var_1_14=2, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_1=6, var_1_20=1, var_1_21=1, var_1_27=-64, var_1_30=-127, var_1_31=8, var_1_32=4, var_1_36=5, var_1_38=8, var_1_40=5, var_1_41=256, var_1_42=2, var_1_4=0, var_1_5=6, var_1_6=1] [L126] COND TRUE (var_1_6 / var_1_42) < var_1_21 [L127] var_1_41 = ((((((((((var_1_30) > (var_1_21)) ? (var_1_30) : (var_1_21))) < 0 ) ? -((((var_1_30) > (var_1_21)) ? (var_1_30) : (var_1_21))) : ((((var_1_30) > (var_1_21)) ? (var_1_30) : (var_1_21))))) < 0 ) ? -(((((((var_1_30) > (var_1_21)) ? (var_1_30) : (var_1_21))) < 0 ) ? -((((var_1_30) > (var_1_21)) ? (var_1_30) : (var_1_21))) : ((((var_1_30) > (var_1_21)) ? (var_1_30) : (var_1_21))))) : (((((((var_1_30) > (var_1_21)) ? (var_1_30) : (var_1_21))) < 0 ) ? -((((var_1_30) > (var_1_21)) ? (var_1_30) : (var_1_21))) : ((((var_1_30) > (var_1_21)) ? (var_1_30) : (var_1_21))))))) VAL [isInitial=1, last_1_var_1_6=10000, stepLocal_0=0, var_1_10=3, var_1_12=2, var_1_13=0, var_1_14=2, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_1=6, var_1_20=1, var_1_21=1, var_1_27=-64, var_1_30=-127, var_1_31=8, var_1_32=4, var_1_36=5, var_1_38=8, var_1_40=5, var_1_41=1, var_1_42=2, var_1_4=0, var_1_5=6, var_1_6=1] [L178] RET step() [L179] CALL, EXPR property() [L169-L170] return ((((((((var_1_6 <= var_1_6) ? ((var_1_6 > var_1_6) ? (var_1_1 == ((float) (var_1_4 - var_1_5))) : (var_1_1 == ((float) var_1_5))) : (var_1_1 == ((float) var_1_4))) && (var_1_17 ? ((((((var_1_14) > (((((var_1_5) > (199.78)) ? (var_1_5) : (199.78))))) ? (var_1_14) : (((((var_1_5) > (199.78)) ? (var_1_5) : (199.78)))))) != (var_1_4 - var_1_8)) ? (((var_1_20 != var_1_20) || var_1_17) ? (var_1_6 == ((unsigned long int) var_1_20)) : (var_1_6 == ((unsigned long int) 5u))) : (var_1_6 == ((unsigned long int) var_1_20))) : (var_1_6 == ((unsigned long int) var_1_20)))) && (((var_1_5 / var_1_11) >= (var_1_8 - var_1_4)) ? (var_1_10 == ((float) (((((var_1_5 - (var_1_12 - var_1_13))) < (var_1_4)) ? ((var_1_5 - (var_1_12 - var_1_13))) : (var_1_4))))) : (var_1_10 == ((float) 4.2f)))) && (((var_1_15 - ((((0) < (var_1_16)) ? (0) : (var_1_16)))) > last_1_var_1_6) ? (var_1_14 == ((double) var_1_12)) : 1)) && ((var_1_21 <= (var_1_16 * var_1_20)) ? (((var_1_5 + var_1_14) <= 127.025f) ? (var_1_17 == ((unsigned char) var_1_18)) : (var_1_17 == ((unsigned char) var_1_18))) : (var_1_17 == ((unsigned char) var_1_18)))) && ((var_1_1 < var_1_11) ? (var_1_19 == ((double) (var_1_13 - 256.4))) : 1)) && (var_1_20 == ((unsigned char) var_1_16))) && (var_1_21 == ((unsigned short int) var_1_16)) ; [L179] RET, EXPR property() [L179] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=3, var_1_12=2, var_1_13=0, var_1_14=2, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_1=6, var_1_20=1, var_1_21=1, var_1_27=-64, var_1_30=-127, var_1_31=8, var_1_32=4, var_1_36=5, var_1_38=8, var_1_40=5, var_1_41=1, var_1_42=2, var_1_4=0, var_1_5=6, var_1_6=1] [L19] reach_error() VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=3, var_1_12=2, var_1_13=0, var_1_14=2, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_1=6, var_1_20=1, var_1_21=1, var_1_27=-64, var_1_30=-127, var_1_31=8, var_1_32=4, var_1_36=5, var_1_38=8, var_1_40=5, var_1_41=1, var_1_42=2, var_1_4=0, var_1_5=6, var_1_6=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 74 locations, 138 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.2s, OverallIterations: 4, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 355 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 355 mSDsluCounter, 470 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 155 mSDsCounter, 43 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 231 IncrementalHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 43 mSolverCounterUnsat, 315 mSDtfsCounter, 231 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 265 GetRequests, 259 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=104occurred in iteration=2, InterpolantAutomatonStates: 12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 77 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 910 NumberOfCodeBlocks, 910 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 514 ConstructedInterpolants, 0 QuantifiedInterpolants, 935 SizeOfPredicates, 2 NumberOfNonLiveVariables, 638 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 4 InterpolantComputations, 3 PerfectInterpolantSequences, 2700/2736 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-17 01:19:59,694 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/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_fillercode_fillercodestructure_filler-pr-ci_file-2.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 8c967b3ea73611668e07001cededa057f95ebe8c171b4725500e4449faff4d5b --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 01:20:01,479 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 01:20:01,555 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-17 01:20:01,560 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 01:20:01,562 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 01:20:01,577 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 01:20:01,577 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 01:20:01,578 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 01:20:01,578 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 01:20:01,578 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 01:20:01,578 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 01:20:01,578 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 01:20:01,578 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 01:20:01,578 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 01:20:01,578 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 01:20:01,579 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 01:20:01,579 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 01:20:01,579 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 01:20:01,579 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 01:20:01,579 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 01:20:01,579 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 01:20:01,579 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 01:20:01,579 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 01:20:01,579 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 01:20:01,579 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 01:20:01,579 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 01:20:01,580 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 01:20:01,580 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 01:20:01,580 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 01:20:01,580 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 01:20:01,580 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 01:20:01,580 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 01:20:01,580 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 01:20:01,580 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 01:20:01,580 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 01:20:01,580 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 01:20:01,580 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 01:20:01,580 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 01:20:01,580 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 01:20:01,580 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 01:20:01,581 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 01:20:01,581 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 01:20:01,581 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 01:20:01,581 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 01:20:01,581 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 01:20:01,581 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 -> 8c967b3ea73611668e07001cededa057f95ebe8c171b4725500e4449faff4d5b [2025-03-17 01:20:01,816 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 01:20:01,826 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 01:20:01,828 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 01:20:01,829 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 01:20:01,830 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 01:20:01,832 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-2.i [2025-03-17 01:20:02,995 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ffdf5ce32/a984fd31fb0946b0998482189fea2105/FLAG2096bcd0f [2025-03-17 01:20:03,200 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 01:20:03,201 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-2.i [2025-03-17 01:20:03,210 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ffdf5ce32/a984fd31fb0946b0998482189fea2105/FLAG2096bcd0f [2025-03-17 01:20:03,227 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ffdf5ce32/a984fd31fb0946b0998482189fea2105 [2025-03-17 01:20:03,230 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 01:20:03,231 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 01:20:03,233 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 01:20:03,233 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 01:20:03,236 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 01:20:03,237 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 01:20:03" (1/1) ... [2025-03-17 01:20:03,239 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2163a56a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:20:03, skipping insertion in model container [2025-03-17 01:20:03,239 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 01:20:03" (1/1) ... [2025-03-17 01:20:03,258 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 01:20:03,365 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_fillercode_fillercodestructure_filler-pr-ci_file-2.i[918,931] [2025-03-17 01:20:03,435 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 01:20:03,448 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 01:20:03,457 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_fillercode_fillercodestructure_filler-pr-ci_file-2.i[918,931] [2025-03-17 01:20:03,494 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 01:20:03,510 INFO L204 MainTranslator]: Completed translation [2025-03-17 01:20:03,511 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:20:03 WrapperNode [2025-03-17 01:20:03,511 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 01:20:03,514 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 01:20:03,514 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 01:20:03,514 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 01:20:03,521 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:20:03" (1/1) ... [2025-03-17 01:20:03,536 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:20:03" (1/1) ... [2025-03-17 01:20:03,566 INFO L138 Inliner]: procedures = 27, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 162 [2025-03-17 01:20:03,567 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 01:20:03,567 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 01:20:03,569 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 01:20:03,570 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 01:20:03,577 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:20:03" (1/1) ... [2025-03-17 01:20:03,577 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:20:03" (1/1) ... [2025-03-17 01:20:03,581 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:20:03" (1/1) ... [2025-03-17 01:20:03,601 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-17 01:20:03,605 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:20:03" (1/1) ... [2025-03-17 01:20:03,605 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:20:03" (1/1) ... [2025-03-17 01:20:03,619 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:20:03" (1/1) ... [2025-03-17 01:20:03,620 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:20:03" (1/1) ... [2025-03-17 01:20:03,626 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:20:03" (1/1) ... [2025-03-17 01:20:03,627 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:20:03" (1/1) ... [2025-03-17 01:20:03,629 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 01:20:03,630 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 01:20:03,630 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 01:20:03,630 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 01:20:03,631 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:20:03" (1/1) ... [2025-03-17 01:20:03,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 01:20:03,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 01:20:03,655 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-17 01:20:03,658 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 01:20:03,674 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 01:20:03,674 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 01:20:03,674 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 01:20:03,674 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 01:20:03,674 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 01:20:03,674 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 01:20:03,729 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 01:20:03,731 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 01:20:23,249 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-03-17 01:20:23,249 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 01:20:23,257 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 01:20:23,258 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 01:20:23,258 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 01:20:23 BoogieIcfgContainer [2025-03-17 01:20:23,258 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 01:20:23,260 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 01:20:23,260 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 01:20:23,264 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 01:20:23,264 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 01:20:03" (1/3) ... [2025-03-17 01:20:23,265 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2faa74a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 01:20:23, skipping insertion in model container [2025-03-17 01:20:23,265 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:20:03" (2/3) ... [2025-03-17 01:20:23,265 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2faa74a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 01:20:23, skipping insertion in model container [2025-03-17 01:20:23,266 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 01:20:23" (3/3) ... [2025-03-17 01:20:23,267 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-2.i [2025-03-17 01:20:23,276 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 01:20:23,279 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-2.i that has 2 procedures, 68 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 01:20:23,323 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 01:20:23,331 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;@3e88b9d0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 01:20:23,331 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 01:20:23,334 INFO L276 IsEmpty]: Start isEmpty. Operand has 68 states, 46 states have (on average 1.5434782608695652) internal successors, (71), 47 states have internal predecessors, (71), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-17 01:20:23,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-17 01:20:23,342 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:20:23,342 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:20:23,343 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:20:23,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:20:23,346 INFO L85 PathProgramCache]: Analyzing trace with hash -1120023255, now seen corresponding path program 1 times [2025-03-17 01:20:23,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 01:20:23,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1624138602] [2025-03-17 01:20:23,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:20:23,354 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-17 01:20:23,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 01:20:23,356 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-17 01:20:23,357 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-17 01:20:23,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-17 01:20:24,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-17 01:20:24,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:20:24,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:20:24,115 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 01:20:24,122 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 01:20:24,149 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 356 proven. 0 refuted. 0 times theorem prover too weak. 328 trivial. 0 not checked. [2025-03-17 01:20:24,149 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 01:20:24,150 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 01:20:24,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1624138602] [2025-03-17 01:20:24,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1624138602] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:20:24,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:20:24,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 01:20:24,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929821809] [2025-03-17 01:20:24,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:20:24,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 01:20:24,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 01:20:24,188 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 01:20:24,188 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 01:20:24,190 INFO L87 Difference]: Start difference. First operand has 68 states, 46 states have (on average 1.5434782608695652) internal successors, (71), 47 states have internal predecessors, (71), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-17 01:20:24,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:20:24,208 INFO L93 Difference]: Finished difference Result 133 states and 235 transitions. [2025-03-17 01:20:24,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 01:20:24,209 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 128 [2025-03-17 01:20:24,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:20:24,214 INFO L225 Difference]: With dead ends: 133 [2025-03-17 01:20:24,214 INFO L226 Difference]: Without dead ends: 66 [2025-03-17 01:20:24,217 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 127 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-17 01:20:24,218 INFO L435 NwaCegarLoop]: 101 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, 101 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-17 01:20:24,219 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 01:20:24,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2025-03-17 01:20:24,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2025-03-17 01:20:24,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 45 states have (on average 1.4) internal successors, (63), 45 states have internal predecessors, (63), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-17 01:20:24,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 101 transitions. [2025-03-17 01:20:24,251 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 101 transitions. Word has length 128 [2025-03-17 01:20:24,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:20:24,251 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 101 transitions. [2025-03-17 01:20:24,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-17 01:20:24,252 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 101 transitions. [2025-03-17 01:20:24,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-17 01:20:24,255 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:20:24,256 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:20:24,282 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-17 01:20:24,456 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-17 01:20:24,457 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:20:24,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:20:24,457 INFO L85 PathProgramCache]: Analyzing trace with hash 818686299, now seen corresponding path program 1 times [2025-03-17 01:20:24,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 01:20:24,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1509569820] [2025-03-17 01:20:24,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:20:24,458 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-17 01:20:24,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 01:20:24,460 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-17 01:20:24,462 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-17 01:20:24,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-17 01:20:25,163 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-17 01:20:25,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:20:25,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:20:25,198 INFO L256 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 01:20:25,202 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 01:20:27,968 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 318 proven. 36 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2025-03-17 01:20:27,968 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 01:20:29,399 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 18 proven. 36 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2025-03-17 01:20:29,399 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 01:20:29,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1509569820] [2025-03-17 01:20:29,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1509569820] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 01:20:29,399 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 01:20:29,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2025-03-17 01:20:29,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832837147] [2025-03-17 01:20:29,400 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 01:20:29,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 01:20:29,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 01:20:29,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 01:20:29,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-17 01:20:29,403 INFO L87 Difference]: Start difference. First operand 66 states and 101 transitions. Second operand has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 3 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (32), 3 states have call predecessors, (32), 3 states have call successors, (32) [2025-03-17 01:20:34,397 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.69s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-17 01:20:41,681 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.23s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-17 01:20:45,688 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-17 01:20:49,695 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-17 01:20:49,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:20:49,698 INFO L93 Difference]: Finished difference Result 137 states and 206 transitions. [2025-03-17 01:20:49,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 01:20:49,756 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 3 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (32), 3 states have call predecessors, (32), 3 states have call successors, (32) Word has length 129 [2025-03-17 01:20:49,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:20:49,757 INFO L225 Difference]: With dead ends: 137 [2025-03-17 01:20:49,757 INFO L226 Difference]: Without dead ends: 72 [2025-03-17 01:20:49,758 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 250 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2025-03-17 01:20:49,759 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 52 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 7 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.0s IncrementalHoareTripleChecker+Time [2025-03-17 01:20:49,759 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 169 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 130 Invalid, 3 Unknown, 0 Unchecked, 20.0s Time] [2025-03-17 01:20:49,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-03-17 01:20:49,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2025-03-17 01:20:49,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 48 states have (on average 1.3333333333333333) internal successors, (64), 48 states have internal predecessors, (64), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-17 01:20:49,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 102 transitions. [2025-03-17 01:20:49,770 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 102 transitions. Word has length 129 [2025-03-17 01:20:49,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:20:49,770 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 102 transitions. [2025-03-17 01:20:49,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 3 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (32), 3 states have call predecessors, (32), 3 states have call successors, (32) [2025-03-17 01:20:49,770 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 102 transitions. [2025-03-17 01:20:49,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-17 01:20:49,772 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:20:49,772 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:20:49,799 INFO L540 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)] Forceful destruction successful, exit code 0 [2025-03-17 01:20:49,976 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-17 01:20:49,976 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:20:49,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:20:49,977 INFO L85 PathProgramCache]: Analyzing trace with hash 2003802396, now seen corresponding path program 1 times [2025-03-17 01:20:49,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 01:20:49,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [553277700] [2025-03-17 01:20:49,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:20:49,977 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-17 01:20:49,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 01:20:49,981 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-17 01:20:49,983 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-17 01:20:50,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-17 01:20:50,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-17 01:20:50,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:20:50,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:20:50,771 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 01:20:50,775 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 01:20:52,237 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 360 proven. 27 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked. [2025-03-17 01:20:52,237 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 01:20:54,287 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 27 proven. 27 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2025-03-17 01:20:54,287 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 01:20:54,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [553277700] [2025-03-17 01:20:54,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [553277700] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 01:20:54,287 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 01:20:54,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2025-03-17 01:20:54,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587115736] [2025-03-17 01:20:54,287 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 01:20:54,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 01:20:54,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 01:20:54,288 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 01:20:54,289 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2025-03-17 01:20:54,289 INFO L87 Difference]: Start difference. First operand 70 states and 102 transitions. Second operand has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 11 states have internal predecessors, (56), 2 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2025-03-17 01:20:59,871 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 01:21:04,319 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 01:21:08,323 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 01:21:12,330 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 01:21:13,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:21:13,153 INFO L93 Difference]: Finished difference Result 172 states and 242 transitions. [2025-03-17 01:21:13,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 01:21:13,154 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 11 states have internal predecessors, (56), 2 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 131 [2025-03-17 01:21:13,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:21:13,156 INFO L225 Difference]: With dead ends: 172 [2025-03-17 01:21:13,156 INFO L226 Difference]: Without dead ends: 103 [2025-03-17 01:21:13,156 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 250 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=97, Invalid=175, Unknown=0, NotChecked=0, Total=272 [2025-03-17 01:21:13,157 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 140 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 45 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.3s IncrementalHoareTripleChecker+Time [2025-03-17 01:21:13,157 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 243 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 329 Invalid, 3 Unknown, 0 Unchecked, 18.3s Time] [2025-03-17 01:21:13,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-03-17 01:21:13,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 98. [2025-03-17 01:21:13,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 64 states have (on average 1.203125) internal successors, (77), 65 states have internal predecessors, (77), 28 states have call successors, (28), 5 states have call predecessors, (28), 5 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-17 01:21:13,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 133 transitions. [2025-03-17 01:21:13,172 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 133 transitions. Word has length 131 [2025-03-17 01:21:13,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:21:13,172 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 133 transitions. [2025-03-17 01:21:13,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 11 states have internal predecessors, (56), 2 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2025-03-17 01:21:13,173 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 133 transitions. [2025-03-17 01:21:13,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-17 01:21:13,174 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:21:13,174 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:21:13,200 INFO L540 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)] Forceful destruction successful, exit code 0 [2025-03-17 01:21:13,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /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-17 01:21:13,375 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:21:13,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:21:13,375 INFO L85 PathProgramCache]: Analyzing trace with hash 519959849, now seen corresponding path program 1 times [2025-03-17 01:21:13,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 01:21:13,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2092303628] [2025-03-17 01:21:13,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:21:13,376 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-17 01:21:13,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 01:21:13,378 INFO L229 MonitoredProcess]: Starting monitored process 5 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-17 01:21:13,379 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 (5)] Waiting until timeout for monitored process [2025-03-17 01:21:13,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-17 01:21:14,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-17 01:21:14,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:21:14,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:21:14,426 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-17 01:21:14,431 INFO L279 TraceCheckSpWp]: Computing forward predicates...