./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-98.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-98.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 ca686f9256f657bcea08227d4780b5c57890ba4844680a923775ba3d19048603 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 12:57:24,394 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 12:57:24,453 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 12:57:24,457 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 12:57:24,458 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 12:57:24,477 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 12:57:24,478 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 12:57:24,478 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 12:57:24,478 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 12:57:24,478 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 12:57:24,479 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 12:57:24,479 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 12:57:24,479 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 12:57:24,479 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 12:57:24,480 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 12:57:24,480 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 12:57:24,480 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 12:57:24,480 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 12:57:24,480 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 12:57:24,480 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 12:57:24,481 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 12:57:24,481 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 12:57:24,481 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 12:57:24,481 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 12:57:24,481 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 12:57:24,481 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 12:57:24,481 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 12:57:24,481 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 12:57:24,481 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 12:57:24,481 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 12:57:24,481 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 12:57:24,482 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 12:57:24,482 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 12:57:24,482 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 12:57:24,482 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 12:57:24,482 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 12:57:24,482 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 12:57:24,482 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 12:57:24,482 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 12:57:24,482 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 12:57:24,483 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 12:57:24,483 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 12:57:24,483 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 12:57:24,483 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 -> ca686f9256f657bcea08227d4780b5c57890ba4844680a923775ba3d19048603 [2025-03-08 12:57:24,713 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 12:57:24,725 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 12:57:24,726 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 12:57:24,727 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 12:57:24,727 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 12:57:24,728 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-ps-ci_file-98.i [2025-03-08 12:57:25,857 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1dfea19e5/8773b075315a44178975604c1a3d4d59/FLAGcddbe0b4c [2025-03-08 12:57:26,056 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 12:57:26,056 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-98.i [2025-03-08 12:57:26,063 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1dfea19e5/8773b075315a44178975604c1a3d4d59/FLAGcddbe0b4c [2025-03-08 12:57:26,074 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1dfea19e5/8773b075315a44178975604c1a3d4d59 [2025-03-08 12:57:26,075 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 12:57:26,076 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 12:57:26,077 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 12:57:26,077 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 12:57:26,080 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 12:57:26,080 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:57:26" (1/1) ... [2025-03-08 12:57:26,081 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42401383 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:57:26, skipping insertion in model container [2025-03-08 12:57:26,081 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:57:26" (1/1) ... [2025-03-08 12:57:26,099 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 12:57:26,204 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-ps-ci_file-98.i[919,932] [2025-03-08 12:57:26,286 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 12:57:26,299 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 12:57:26,307 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-ps-ci_file-98.i[919,932] [2025-03-08 12:57:26,342 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 12:57:26,360 INFO L204 MainTranslator]: Completed translation [2025-03-08 12:57:26,361 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:57:26 WrapperNode [2025-03-08 12:57:26,362 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 12:57:26,363 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 12:57:26,363 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 12:57:26,363 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 12:57:26,368 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:57:26" (1/1) ... [2025-03-08 12:57:26,379 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:57:26" (1/1) ... [2025-03-08 12:57:26,407 INFO L138 Inliner]: procedures = 26, calls = 46, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 240 [2025-03-08 12:57:26,412 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 12:57:26,412 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 12:57:26,412 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 12:57:26,412 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 12:57:26,420 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:57:26" (1/1) ... [2025-03-08 12:57:26,420 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:57:26" (1/1) ... [2025-03-08 12:57:26,423 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:57:26" (1/1) ... [2025-03-08 12:57:26,442 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 12:57:26,443 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:57:26" (1/1) ... [2025-03-08 12:57:26,443 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:57:26" (1/1) ... [2025-03-08 12:57:26,448 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:57:26" (1/1) ... [2025-03-08 12:57:26,449 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:57:26" (1/1) ... [2025-03-08 12:57:26,450 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:57:26" (1/1) ... [2025-03-08 12:57:26,451 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:57:26" (1/1) ... [2025-03-08 12:57:26,453 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 12:57:26,458 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 12:57:26,458 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 12:57:26,458 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 12:57:26,459 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:57:26" (1/1) ... [2025-03-08 12:57:26,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 12:57:26,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 12:57:26,483 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 12:57:26,488 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 12:57:26,501 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 12:57:26,502 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 12:57:26,502 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 12:57:26,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 12:57:26,502 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 12:57:26,502 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 12:57:26,562 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 12:57:26,563 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 12:57:26,951 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L188: havoc property_#t~bitwise25#1; [2025-03-08 12:57:26,983 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-03-08 12:57:26,983 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 12:57:27,000 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 12:57:27,002 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 12:57:27,002 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:57:27 BoogieIcfgContainer [2025-03-08 12:57:27,002 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 12:57:27,003 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 12:57:27,004 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 12:57:27,007 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 12:57:27,007 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 12:57:26" (1/3) ... [2025-03-08 12:57:27,007 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3dec750a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:57:27, skipping insertion in model container [2025-03-08 12:57:27,008 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:57:26" (2/3) ... [2025-03-08 12:57:27,008 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3dec750a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:57:27, skipping insertion in model container [2025-03-08 12:57:27,008 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:57:27" (3/3) ... [2025-03-08 12:57:27,009 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-98.i [2025-03-08 12:57:27,020 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 12:57:27,021 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-98.i that has 2 procedures, 103 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 12:57:27,061 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 12:57:27,069 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;@1eff3557, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 12:57:27,070 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 12:57:27,072 INFO L276 IsEmpty]: Start isEmpty. Operand has 103 states, 67 states have (on average 1.4328358208955223) internal successors, (96), 68 states have internal predecessors, (96), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-08 12:57:27,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2025-03-08 12:57:27,084 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:57:27,085 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 12:57:27,085 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:57:27,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:57:27,090 INFO L85 PathProgramCache]: Analyzing trace with hash 205750900, now seen corresponding path program 1 times [2025-03-08 12:57:27,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:57:27,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642718421] [2025-03-08 12:57:27,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:57:27,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:57:27,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 211 statements into 1 equivalence classes. [2025-03-08 12:57:27,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 211 of 211 statements. [2025-03-08 12:57:27,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:57:27,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:57:27,388 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 2048 trivial. 0 not checked. [2025-03-08 12:57:27,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:57:27,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642718421] [2025-03-08 12:57:27,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642718421] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 12:57:27,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [504613509] [2025-03-08 12:57:27,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:57:27,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 12:57:27,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 12:57:27,392 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 12:57:27,394 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 12:57:27,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 211 statements into 1 equivalence classes. [2025-03-08 12:57:27,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 211 of 211 statements. [2025-03-08 12:57:27,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:57:27,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:57:27,546 INFO L256 TraceCheckSpWp]: Trace formula consists of 484 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 12:57:27,553 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 12:57:27,587 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 2048 trivial. 0 not checked. [2025-03-08 12:57:27,587 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 12:57:27,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [504613509] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:57:27,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 12:57:27,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 12:57:27,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650694650] [2025-03-08 12:57:27,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:57:27,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 12:57:27,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:57:27,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 12:57:27,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 12:57:27,611 INFO L87 Difference]: Start difference. First operand has 103 states, 67 states have (on average 1.4328358208955223) internal successors, (96), 68 states have internal predecessors, (96), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) Second operand has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (33), 2 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) [2025-03-08 12:57:27,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:57:27,649 INFO L93 Difference]: Finished difference Result 200 states and 352 transitions. [2025-03-08 12:57:27,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 12:57:27,651 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (33), 2 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) Word has length 211 [2025-03-08 12:57:27,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:57:27,657 INFO L225 Difference]: With dead ends: 200 [2025-03-08 12:57:27,658 INFO L226 Difference]: Without dead ends: 100 [2025-03-08 12:57:27,662 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 12:57:27,666 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 12:57:27,667 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 152 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 12:57:27,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-03-08 12:57:27,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2025-03-08 12:57:27,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 65 states have (on average 1.3846153846153846) internal successors, (90), 65 states have internal predecessors, (90), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-08 12:57:27,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 156 transitions. [2025-03-08 12:57:27,706 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 156 transitions. Word has length 211 [2025-03-08 12:57:27,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:57:27,707 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 156 transitions. [2025-03-08 12:57:27,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (33), 2 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) [2025-03-08 12:57:27,709 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 156 transitions. [2025-03-08 12:57:27,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2025-03-08 12:57:27,714 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:57:27,714 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 12:57:27,722 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 12:57:27,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 12:57:27,915 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:57:27,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:57:27,916 INFO L85 PathProgramCache]: Analyzing trace with hash -198059885, now seen corresponding path program 1 times [2025-03-08 12:57:27,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:57:27,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432610180] [2025-03-08 12:57:27,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:57:27,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:57:27,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 211 statements into 1 equivalence classes. [2025-03-08 12:57:28,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 211 of 211 statements. [2025-03-08 12:57:28,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:57:28,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:57:28,646 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-03-08 12:57:28,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:57:28,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432610180] [2025-03-08 12:57:28,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432610180] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:57:28,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:57:28,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 12:57:28,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737317902] [2025-03-08 12:57:28,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:57:28,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 12:57:28,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:57:28,649 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 12:57:28,649 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 12:57:28,649 INFO L87 Difference]: Start difference. First operand 100 states and 156 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-08 12:57:29,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:57:29,061 INFO L93 Difference]: Finished difference Result 309 states and 487 transitions. [2025-03-08 12:57:29,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 12:57:29,062 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 211 [2025-03-08 12:57:29,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:57:29,065 INFO L225 Difference]: With dead ends: 309 [2025-03-08 12:57:29,065 INFO L226 Difference]: Without dead ends: 212 [2025-03-08 12:57:29,066 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 12:57:29,068 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 136 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 12:57:29,069 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 397 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 12:57:29,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2025-03-08 12:57:29,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 199. [2025-03-08 12:57:29,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 130 states have (on average 1.4) internal successors, (182), 130 states have internal predecessors, (182), 66 states have call successors, (66), 2 states have call predecessors, (66), 2 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-08 12:57:29,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 314 transitions. [2025-03-08 12:57:29,111 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 314 transitions. Word has length 211 [2025-03-08 12:57:29,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:57:29,112 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 314 transitions. [2025-03-08 12:57:29,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-08 12:57:29,112 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 314 transitions. [2025-03-08 12:57:29,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2025-03-08 12:57:29,114 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:57:29,114 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 12:57:29,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 12:57:29,115 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:57:29,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:57:29,115 INFO L85 PathProgramCache]: Analyzing trace with hash 1037987560, now seen corresponding path program 1 times [2025-03-08 12:57:29,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:57:29,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967319123] [2025-03-08 12:57:29,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:57:29,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:57:29,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-03-08 12:57:29,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-03-08 12:57:29,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:57:29,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:57:29,336 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-03-08 12:57:29,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:57:29,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967319123] [2025-03-08 12:57:29,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967319123] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:57:29,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:57:29,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 12:57:29,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940685257] [2025-03-08 12:57:29,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:57:29,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 12:57:29,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:57:29,339 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 12:57:29,339 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 12:57:29,339 INFO L87 Difference]: Start difference. First operand 199 states and 314 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-08 12:57:29,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:57:29,411 INFO L93 Difference]: Finished difference Result 395 states and 625 transitions. [2025-03-08 12:57:29,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 12:57:29,412 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 212 [2025-03-08 12:57:29,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:57:29,416 INFO L225 Difference]: With dead ends: 395 [2025-03-08 12:57:29,418 INFO L226 Difference]: Without dead ends: 199 [2025-03-08 12:57:29,418 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 12:57:29,419 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 91 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 12:57:29,419 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 123 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 12:57:29,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2025-03-08 12:57:29,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2025-03-08 12:57:29,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 130 states have (on average 1.3615384615384616) internal successors, (177), 130 states have internal predecessors, (177), 66 states have call successors, (66), 2 states have call predecessors, (66), 2 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-08 12:57:29,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 309 transitions. [2025-03-08 12:57:29,460 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 309 transitions. Word has length 212 [2025-03-08 12:57:29,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:57:29,461 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 309 transitions. [2025-03-08 12:57:29,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-08 12:57:29,462 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 309 transitions. [2025-03-08 12:57:29,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2025-03-08 12:57:29,464 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:57:29,464 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 12:57:29,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 12:57:29,464 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:57:29,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:57:29,465 INFO L85 PathProgramCache]: Analyzing trace with hash 1090615817, now seen corresponding path program 1 times [2025-03-08 12:57:29,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:57:29,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937198885] [2025-03-08 12:57:29,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:57:29,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:57:29,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 213 statements into 1 equivalence classes. [2025-03-08 12:57:29,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 213 of 213 statements. [2025-03-08 12:57:29,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:57:29,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:57:29,654 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-03-08 12:57:29,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:57:29,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937198885] [2025-03-08 12:57:29,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937198885] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:57:29,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:57:29,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 12:57:29,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302169663] [2025-03-08 12:57:29,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:57:29,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 12:57:29,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:57:29,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 12:57:29,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 12:57:29,656 INFO L87 Difference]: Start difference. First operand 199 states and 309 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-08 12:57:29,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:57:29,843 INFO L93 Difference]: Finished difference Result 507 states and 789 transitions. [2025-03-08 12:57:29,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 12:57:29,844 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 213 [2025-03-08 12:57:29,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:57:29,846 INFO L225 Difference]: With dead ends: 507 [2025-03-08 12:57:29,847 INFO L226 Difference]: Without dead ends: 303 [2025-03-08 12:57:29,848 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 12:57:29,849 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 139 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 12:57:29,850 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 428 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 12:57:29,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2025-03-08 12:57:29,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 294. [2025-03-08 12:57:29,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 191 states have (on average 1.356020942408377) internal successors, (259), 191 states have internal predecessors, (259), 99 states have call successors, (99), 3 states have call predecessors, (99), 3 states have return successors, (99), 99 states have call predecessors, (99), 99 states have call successors, (99) [2025-03-08 12:57:29,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 457 transitions. [2025-03-08 12:57:29,905 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 457 transitions. Word has length 213 [2025-03-08 12:57:29,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:57:29,906 INFO L471 AbstractCegarLoop]: Abstraction has 294 states and 457 transitions. [2025-03-08 12:57:29,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-08 12:57:29,906 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 457 transitions. [2025-03-08 12:57:29,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2025-03-08 12:57:29,908 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:57:29,908 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 12:57:29,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 12:57:29,908 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:57:29,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:57:29,909 INFO L85 PathProgramCache]: Analyzing trace with hash 1586447451, now seen corresponding path program 1 times [2025-03-08 12:57:29,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:57:29,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822290819] [2025-03-08 12:57:29,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:57:29,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:57:29,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 213 statements into 1 equivalence classes. [2025-03-08 12:57:29,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 213 of 213 statements. [2025-03-08 12:57:29,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:57:29,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:57:30,254 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-03-08 12:57:30,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:57:30,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822290819] [2025-03-08 12:57:30,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822290819] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:57:30,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:57:30,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 12:57:30,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974374203] [2025-03-08 12:57:30,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:57:30,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 12:57:30,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:57:30,255 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 12:57:30,256 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 12:57:30,256 INFO L87 Difference]: Start difference. First operand 294 states and 457 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-08 12:57:30,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:57:30,367 INFO L93 Difference]: Finished difference Result 660 states and 1027 transitions. [2025-03-08 12:57:30,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 12:57:30,368 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 213 [2025-03-08 12:57:30,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:57:30,370 INFO L225 Difference]: With dead ends: 660 [2025-03-08 12:57:30,371 INFO L226 Difference]: Without dead ends: 369 [2025-03-08 12:57:30,371 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 12:57:30,372 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 54 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 12:57:30,372 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 252 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 12:57:30,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2025-03-08 12:57:30,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 360. [2025-03-08 12:57:30,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 223 states have (on average 1.3228699551569507) internal successors, (295), 223 states have internal predecessors, (295), 132 states have call successors, (132), 4 states have call predecessors, (132), 4 states have return successors, (132), 132 states have call predecessors, (132), 132 states have call successors, (132) [2025-03-08 12:57:30,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 559 transitions. [2025-03-08 12:57:30,413 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 559 transitions. Word has length 213 [2025-03-08 12:57:30,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:57:30,413 INFO L471 AbstractCegarLoop]: Abstraction has 360 states and 559 transitions. [2025-03-08 12:57:30,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-08 12:57:30,414 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 559 transitions. [2025-03-08 12:57:30,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2025-03-08 12:57:30,415 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:57:30,415 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 12:57:30,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 12:57:30,416 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:57:30,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:57:30,416 INFO L85 PathProgramCache]: Analyzing trace with hash -1984752687, now seen corresponding path program 1 times [2025-03-08 12:57:30,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:57:30,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985292155] [2025-03-08 12:57:30,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:57:30,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:57:30,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-03-08 12:57:30,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-03-08 12:57:30,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:57:30,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:57:30,937 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 36 proven. 60 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2025-03-08 12:57:30,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:57:30,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985292155] [2025-03-08 12:57:30,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985292155] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 12:57:30,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1462701113] [2025-03-08 12:57:30,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:57:30,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 12:57:30,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 12:57:30,940 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 12:57:30,941 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 12:57:31,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-03-08 12:57:31,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-03-08 12:57:31,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:57:31,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:57:31,080 INFO L256 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-08 12:57:31,089 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 12:57:32,165 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 1028 proven. 60 refuted. 0 times theorem prover too weak. 1024 trivial. 0 not checked. [2025-03-08 12:57:32,165 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 12:57:33,143 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 36 proven. 60 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2025-03-08 12:57:33,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1462701113] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 12:57:33,144 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 12:57:33,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 10] total 23 [2025-03-08 12:57:33,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558036626] [2025-03-08 12:57:33,144 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 12:57:33,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-08 12:57:33,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:57:33,146 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-08 12:57:33,147 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=408, Unknown=0, NotChecked=0, Total=506 [2025-03-08 12:57:33,147 INFO L87 Difference]: Start difference. First operand 360 states and 559 transitions. Second operand has 23 states, 21 states have (on average 6.380952380952381) internal successors, (134), 23 states have internal predecessors, (134), 9 states have call successors, (99), 4 states have call predecessors, (99), 6 states have return successors, (99), 6 states have call predecessors, (99), 9 states have call successors, (99) [2025-03-08 12:57:36,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:57:36,054 INFO L93 Difference]: Finished difference Result 936 states and 1405 transitions. [2025-03-08 12:57:36,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2025-03-08 12:57:36,055 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 6.380952380952381) internal successors, (134), 23 states have internal predecessors, (134), 9 states have call successors, (99), 4 states have call predecessors, (99), 6 states have return successors, (99), 6 states have call predecessors, (99), 9 states have call successors, (99) Word has length 215 [2025-03-08 12:57:36,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:57:36,060 INFO L225 Difference]: With dead ends: 936 [2025-03-08 12:57:36,060 INFO L226 Difference]: Without dead ends: 642 [2025-03-08 12:57:36,063 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 487 GetRequests, 425 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1166 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=879, Invalid=3153, Unknown=0, NotChecked=0, Total=4032 [2025-03-08 12:57:36,063 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 1089 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 1568 mSolverCounterSat, 803 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1089 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 2371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 803 IncrementalHoareTripleChecker+Valid, 1568 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-08 12:57:36,063 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1089 Valid, 621 Invalid, 2371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [803 Valid, 1568 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-08 12:57:36,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2025-03-08 12:57:36,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 502. [2025-03-08 12:57:36,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 502 states, 322 states have (on average 1.2919254658385093) internal successors, (416), 322 states have internal predecessors, (416), 165 states have call successors, (165), 14 states have call predecessors, (165), 14 states have return successors, (165), 165 states have call predecessors, (165), 165 states have call successors, (165) [2025-03-08 12:57:36,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 746 transitions. [2025-03-08 12:57:36,145 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 746 transitions. Word has length 215 [2025-03-08 12:57:36,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:57:36,145 INFO L471 AbstractCegarLoop]: Abstraction has 502 states and 746 transitions. [2025-03-08 12:57:36,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 6.380952380952381) internal successors, (134), 23 states have internal predecessors, (134), 9 states have call successors, (99), 4 states have call predecessors, (99), 6 states have return successors, (99), 6 states have call predecessors, (99), 9 states have call successors, (99) [2025-03-08 12:57:36,145 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 746 transitions. [2025-03-08 12:57:36,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2025-03-08 12:57:36,147 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:57:36,147 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 12:57:36,154 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-08 12:57:36,351 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,SelfDestructingSolverStorable5 [2025-03-08 12:57:36,351 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:57:36,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:57:36,352 INFO L85 PathProgramCache]: Analyzing trace with hash 463904751, now seen corresponding path program 1 times [2025-03-08 12:57:36,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:57:36,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300425540] [2025-03-08 12:57:36,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:57:36,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:57:36,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-03-08 12:57:36,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-03-08 12:57:36,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:57:36,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 12:57:36,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [448636506] [2025-03-08 12:57:36,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:57:36,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 12:57:36,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 12:57:36,476 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 12:57:36,478 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 12:57:36,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-03-08 12:57:36,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-03-08 12:57:36,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:57:36,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 12:57:36,604 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 12:57:36,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-03-08 12:57:36,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-03-08 12:57:36,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:57:36,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 12:57:36,761 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 12:57:36,762 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 12:57:36,762 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 12:57:36,773 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-08 12:57:36,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 12:57:36,967 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-03-08 12:57:37,074 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 12:57:37,076 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 12:57:37 BoogieIcfgContainer [2025-03-08 12:57:37,076 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 12:57:37,077 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 12:57:37,077 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 12:57:37,077 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 12:57:37,077 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:57:27" (3/4) ... [2025-03-08 12:57:37,079 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 12:57:37,083 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 12:57:37,084 INFO L158 Benchmark]: Toolchain (without parser) took 11007.14ms. Allocated memory was 142.6MB in the beginning and 218.1MB in the end (delta: 75.5MB). Free memory was 114.3MB in the beginning and 163.7MB in the end (delta: -49.5MB). Peak memory consumption was 26.4MB. Max. memory is 16.1GB. [2025-03-08 12:57:37,084 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 201.3MB. Free memory was 122.4MB in the beginning and 122.1MB in the end (delta: 293.8kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 12:57:37,084 INFO L158 Benchmark]: CACSL2BoogieTranslator took 285.23ms. Allocated memory is still 142.6MB. Free memory was 113.8MB in the beginning and 97.9MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 12:57:37,084 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.69ms. Allocated memory is still 142.6MB. Free memory was 97.9MB in the beginning and 94.3MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 12:57:37,084 INFO L158 Benchmark]: Boogie Preprocessor took 41.08ms. Allocated memory is still 142.6MB. Free memory was 94.3MB in the beginning and 89.0MB in the end (delta: 5.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 12:57:37,084 INFO L158 Benchmark]: IcfgBuilder took 544.21ms. Allocated memory is still 142.6MB. Free memory was 89.0MB in the beginning and 57.8MB in the end (delta: 31.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-08 12:57:37,085 INFO L158 Benchmark]: TraceAbstraction took 10072.84ms. Allocated memory was 142.6MB in the beginning and 218.1MB in the end (delta: 75.5MB). Free memory was 57.4MB in the beginning and 163.8MB in the end (delta: -106.4MB). Peak memory consumption was 76.9MB. Max. memory is 16.1GB. [2025-03-08 12:57:37,085 INFO L158 Benchmark]: Witness Printer took 6.37ms. Allocated memory is still 218.1MB. Free memory was 163.8MB in the beginning and 163.7MB in the end (delta: 42.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 12:57:37,086 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 201.3MB. Free memory was 122.4MB in the beginning and 122.1MB in the end (delta: 293.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 285.23ms. Allocated memory is still 142.6MB. Free memory was 113.8MB in the beginning and 97.9MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.69ms. Allocated memory is still 142.6MB. Free memory was 97.9MB in the beginning and 94.3MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 41.08ms. Allocated memory is still 142.6MB. Free memory was 94.3MB in the beginning and 89.0MB in the end (delta: 5.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 544.21ms. Allocated memory is still 142.6MB. Free memory was 89.0MB in the beginning and 57.8MB in the end (delta: 31.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 10072.84ms. Allocated memory was 142.6MB in the beginning and 218.1MB in the end (delta: 75.5MB). Free memory was 57.4MB in the beginning and 163.8MB in the end (delta: -106.4MB). Peak memory consumption was 76.9MB. Max. memory is 16.1GB. * Witness Printer took 6.37ms. Allocated memory is still 218.1MB. Free memory was 163.8MB in the beginning and 163.7MB in the end (delta: 42.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryArithmeticDOUBLEoperation at line 76, overapproximation of someBinaryArithmeticDOUBLEoperation at line 128, overapproximation of someBinaryFLOATComparisonOperation at line 182, overapproximation of bitwiseOr at line 74, overapproximation of bitwiseAnd at line 58, overapproximation of someBinaryDOUBLEComparisonOperation at line 178, overapproximation of someBinaryDOUBLEComparisonOperation at line 180, overapproximation of someBinaryDOUBLEComparisonOperation at line 188, overapproximation of someBinaryDOUBLEComparisonOperation at line 141, overapproximation of someBinaryDOUBLEComparisonOperation at line 143. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = -64; [L23] signed short int var_1_4 = -10; [L24] signed short int var_1_5 = 100; [L25] double var_1_6 = 0.5; [L26] double var_1_7 = 16.5; [L27] double var_1_8 = 7.4; [L28] unsigned short int var_1_9 = 4; [L29] unsigned char var_1_10 = 0; [L30] unsigned long int var_1_11 = 1000000000; [L31] unsigned short int var_1_12 = 256; [L32] signed short int var_1_13 = 16; [L33] signed short int var_1_14 = 64; [L34] unsigned short int var_1_15 = 63836; [L35] unsigned short int var_1_16 = 10; [L36] signed char var_1_17 = -8; [L37] signed char var_1_18 = 8; [L38] signed short int var_1_19 = 50; [L39] signed short int var_1_20 = 10; [L40] signed short int var_1_21 = 10000; [L41] signed char var_1_22 = -2; [L42] float var_1_23 = 3.2; [L43] unsigned long int var_1_27 = 2686167646; [L44] unsigned char var_1_30 = 16; [L45] unsigned char var_1_31 = 0; [L46] signed long int var_1_32 = -2; [L47] unsigned short int var_1_33 = 1; [L48] unsigned long int var_1_34 = 3877983372; [L49] double var_1_35 = 16.75; [L50] double var_1_36 = 0.0; [L51] double var_1_37 = 99999.6; [L52] float var_1_38 = 25.6; [L53] float var_1_39 = 8.75; [L54] signed long int last_1_var_1_1 = -64; VAL [isInitial=0, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-10, var_1_5=100, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L192] isInitial = 1 [L193] FCALL initially() [L194] COND TRUE 1 [L195] CALL updateLastVariables() [L185] last_1_var_1_1 = var_1_1 VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-10, var_1_5=100, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L195] RET updateLastVariables() [L196] CALL updateVariables() [L132] var_1_4 = __VERIFIER_nondet_short() [L133] CALL assume_abort_if_not(var_1_4 >= -32768) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=100, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=100, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L133] RET assume_abort_if_not(var_1_4 >= -32768) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=100, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L134] CALL assume_abort_if_not(var_1_4 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=100, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=100, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L134] RET assume_abort_if_not(var_1_4 <= 32767) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=100, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L135] CALL assume_abort_if_not(var_1_4 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=100, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=100, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L135] RET assume_abort_if_not(var_1_4 != 0) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=100, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L136] var_1_5 = __VERIFIER_nondet_short() [L137] CALL assume_abort_if_not(var_1_5 >= -32768) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L137] RET assume_abort_if_not(var_1_5 >= -32768) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L138] CALL assume_abort_if_not(var_1_5 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L138] RET assume_abort_if_not(var_1_5 <= 32767) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L139] CALL assume_abort_if_not(var_1_5 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L139] RET assume_abort_if_not(var_1_5 != 0) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L140] var_1_7 = __VERIFIER_nondet_double() [L141] CALL assume_abort_if_not((var_1_7 >= -461168.6018427382800e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 4611686.018427382800e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_8=37/5, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_8=37/5, var_1_9=4] [L141] RET assume_abort_if_not((var_1_7 >= -461168.6018427382800e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 4611686.018427382800e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_8=37/5, var_1_9=4] [L142] var_1_8 = __VERIFIER_nondet_double() [L143] CALL assume_abort_if_not((var_1_8 >= -461168.6018427382800e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_9=4] [L143] RET assume_abort_if_not((var_1_8 >= -461168.6018427382800e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_9=4] [L144] var_1_10 = __VERIFIER_nondet_uchar() [L145] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_9=4] [L145] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_1=-64, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_9=4] [L146] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_9=4] [L146] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_9=4] [L147] var_1_13 = __VERIFIER_nondet_short() [L148] CALL assume_abort_if_not(var_1_13 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=2, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=2, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_9=4] [L148] RET assume_abort_if_not(var_1_13 >= -1) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=2, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_9=4] [L149] CALL assume_abort_if_not(var_1_13 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=2, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=2, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_9=4] [L149] RET assume_abort_if_not(var_1_13 <= 32767) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=2, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_9=4] [L150] var_1_14 = __VERIFIER_nondet_short() [L151] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=2, var_1_14=0, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=2, var_1_14=0, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_9=4] [L151] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=2, var_1_14=0, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_9=4] [L152] CALL assume_abort_if_not(var_1_14 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=2, var_1_14=0, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=2, var_1_14=0, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_9=4] [L152] RET assume_abort_if_not(var_1_14 <= 32767) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=2, var_1_14=0, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_9=4] [L153] var_1_15 = __VERIFIER_nondet_ushort() [L154] CALL assume_abort_if_not(var_1_15 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=2, var_1_14=0, var_1_15=32767, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=2, var_1_14=0, var_1_15=32767, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_9=4] [L154] RET assume_abort_if_not(var_1_15 >= 32767) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=2, var_1_14=0, var_1_15=32767, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_9=4] [L155] CALL assume_abort_if_not(var_1_15 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=2, var_1_14=0, var_1_15=32767, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=2, var_1_14=0, var_1_15=32767, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_9=4] [L155] RET assume_abort_if_not(var_1_15 <= 65534) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=2, var_1_14=0, var_1_15=32767, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_9=4] [L156] var_1_16 = __VERIFIER_nondet_ushort() [L157] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=2, var_1_14=0, var_1_15=32767, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=2, var_1_14=0, var_1_15=32767, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_9=4] [L157] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=2, var_1_14=0, var_1_15=32767, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_9=4] [L158] CALL assume_abort_if_not(var_1_16 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=2, var_1_14=0, var_1_15=32767, var_1_16=-32769, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=2, var_1_14=0, var_1_15=32767, var_1_16=-32769, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_9=4] [L158] RET assume_abort_if_not(var_1_16 <= 32767) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=2, var_1_14=0, var_1_15=32767, var_1_16=-32769, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_9=4] [L159] var_1_18 = __VERIFIER_nondet_char() [L160] CALL assume_abort_if_not(var_1_18 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=2, var_1_14=0, var_1_15=32767, var_1_16=-32769, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=2, var_1_14=0, var_1_15=32767, var_1_16=-32769, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_9=4] [L160] RET assume_abort_if_not(var_1_18 >= -127) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=2, var_1_14=0, var_1_15=32767, var_1_16=-32769, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_9=4] [L161] CALL assume_abort_if_not(var_1_18 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=2, var_1_14=0, var_1_15=32767, var_1_16=-32769, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=2, var_1_14=0, var_1_15=32767, var_1_16=-32769, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_9=4] [L161] RET assume_abort_if_not(var_1_18 <= 126) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=2, var_1_14=0, var_1_15=32767, var_1_16=-32769, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_9=4] [L162] var_1_20 = __VERIFIER_nondet_short() [L163] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=2, var_1_14=0, var_1_15=32767, var_1_16=-32769, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=2, var_1_14=0, var_1_15=32767, var_1_16=-32769, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_9=4] [L163] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=2, var_1_14=0, var_1_15=32767, var_1_16=-32769, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_9=4] [L164] CALL assume_abort_if_not(var_1_20 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=2, var_1_14=0, var_1_15=32767, var_1_16=-32769, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=2, var_1_14=0, var_1_15=32767, var_1_16=-32769, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_9=4] [L164] RET assume_abort_if_not(var_1_20 <= 16383) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=2, var_1_14=0, var_1_15=32767, var_1_16=-32769, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_9=4] [L165] var_1_21 = __VERIFIER_nondet_short() [L166] CALL assume_abort_if_not(var_1_21 >= 8191) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=2, var_1_14=0, var_1_15=32767, var_1_16=-32769, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=2, var_1_14=0, var_1_15=32767, var_1_16=-32769, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_9=4] [L166] RET assume_abort_if_not(var_1_21 >= 8191) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=2, var_1_14=0, var_1_15=32767, var_1_16=-32769, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_9=4] [L167] CALL assume_abort_if_not(var_1_21 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=2, var_1_14=0, var_1_15=32767, var_1_16=-32769, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=2, var_1_14=0, var_1_15=32767, var_1_16=-32769, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_9=4] [L167] RET assume_abort_if_not(var_1_21 <= 16383) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=2, var_1_14=0, var_1_15=32767, var_1_16=-32769, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_9=4] [L168] var_1_27 = __VERIFIER_nondet_ulong() [L169] CALL assume_abort_if_not(var_1_27 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=2, var_1_14=0, var_1_15=32767, var_1_16=-32769, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=16/5, var_1_27=3221225471, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=2, var_1_14=0, var_1_15=32767, var_1_16=-32769, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=16/5, var_1_27=3221225471, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_9=4] [L169] RET assume_abort_if_not(var_1_27 >= 2147483647) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=2, var_1_14=0, var_1_15=32767, var_1_16=-32769, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=16/5, var_1_27=3221225471, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_9=4] [L170] CALL assume_abort_if_not(var_1_27 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=2, var_1_14=0, var_1_15=32767, var_1_16=-32769, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=16/5, var_1_27=3221225471, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=2, var_1_14=0, var_1_15=32767, var_1_16=-32769, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=16/5, var_1_27=3221225471, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_9=4] [L170] RET assume_abort_if_not(var_1_27 <= 4294967295) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=2, var_1_14=0, var_1_15=32767, var_1_16=-32769, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=16/5, var_1_27=3221225471, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_9=4] [L171] var_1_31 = __VERIFIER_nondet_uchar() [L172] CALL assume_abort_if_not(var_1_31 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=2, var_1_14=0, var_1_15=32767, var_1_16=-32769, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=16/5, var_1_27=3221225471, var_1_30=16, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=2, var_1_14=0, var_1_15=32767, var_1_16=-32769, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=16/5, var_1_27=3221225471, var_1_30=16, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_9=4] [L172] RET assume_abort_if_not(var_1_31 >= 0) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=2, var_1_14=0, var_1_15=32767, var_1_16=-32769, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=16/5, var_1_27=3221225471, var_1_30=16, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_9=4] [L173] CALL assume_abort_if_not(var_1_31 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=2, var_1_14=0, var_1_15=32767, var_1_16=-32769, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=16/5, var_1_27=3221225471, var_1_30=16, var_1_31=254, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=2, var_1_14=0, var_1_15=32767, var_1_16=-32769, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=16/5, var_1_27=3221225471, var_1_30=16, var_1_31=254, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_9=4] [L173] RET assume_abort_if_not(var_1_31 <= 254) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=2, var_1_14=0, var_1_15=32767, var_1_16=-32769, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=16/5, var_1_27=3221225471, var_1_30=16, var_1_31=254, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_9=4] [L174] var_1_34 = __VERIFIER_nondet_ulong() [L175] CALL assume_abort_if_not(var_1_34 >= 3221225471) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=2, var_1_14=0, var_1_15=32767, var_1_16=-32769, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=16/5, var_1_27=3221225471, var_1_30=16, var_1_31=254, var_1_32=-2, var_1_33=1, var_1_34=-1073741825, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=2, var_1_14=0, var_1_15=32767, var_1_16=-32769, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=16/5, var_1_27=3221225471, var_1_30=16, var_1_31=254, var_1_32=-2, var_1_33=1, var_1_34=-1073741825, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_9=4] [L175] RET assume_abort_if_not(var_1_34 >= 3221225471) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=2, var_1_14=0, var_1_15=32767, var_1_16=-32769, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=16/5, var_1_27=3221225471, var_1_30=16, var_1_31=254, var_1_32=-2, var_1_33=1, var_1_34=-1073741825, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_9=4] [L176] CALL assume_abort_if_not(var_1_34 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=2, var_1_14=0, var_1_15=32767, var_1_16=-32769, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=16/5, var_1_27=3221225471, var_1_30=16, var_1_31=254, var_1_32=-2, var_1_33=1, var_1_34=-1073741825, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=2, var_1_14=0, var_1_15=32767, var_1_16=-32769, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=16/5, var_1_27=3221225471, var_1_30=16, var_1_31=254, var_1_32=-2, var_1_33=1, var_1_34=-1073741825, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_9=4] [L176] RET assume_abort_if_not(var_1_34 <= 4294967295) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=2, var_1_14=0, var_1_15=32767, var_1_16=-32769, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=16/5, var_1_27=3221225471, var_1_30=16, var_1_31=254, var_1_32=-2, var_1_33=1, var_1_34=-1073741825, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_9=4] [L177] var_1_36 = __VERIFIER_nondet_double() [L178] CALL assume_abort_if_not((var_1_36 >= 4611686.018427382800e+12F && var_1_36 <= -1.0e-20F) || (var_1_36 <= 9223372.036854765600e+12F && var_1_36 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=2, var_1_14=0, var_1_15=32767, var_1_16=-32769, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=16/5, var_1_27=3221225471, var_1_30=16, var_1_31=254, var_1_32=-2, var_1_33=1, var_1_34=-1073741825, var_1_35=67/4, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=2, var_1_14=0, var_1_15=32767, var_1_16=-32769, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=16/5, var_1_27=3221225471, var_1_30=16, var_1_31=254, var_1_32=-2, var_1_33=1, var_1_34=-1073741825, var_1_35=67/4, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_9=4] [L178] RET assume_abort_if_not((var_1_36 >= 4611686.018427382800e+12F && var_1_36 <= -1.0e-20F) || (var_1_36 <= 9223372.036854765600e+12F && var_1_36 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=2, var_1_14=0, var_1_15=32767, var_1_16=-32769, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=16/5, var_1_27=3221225471, var_1_30=16, var_1_31=254, var_1_32=-2, var_1_33=1, var_1_34=-1073741825, var_1_35=67/4, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_9=4] [L179] var_1_37 = __VERIFIER_nondet_double() [L180] CALL assume_abort_if_not((var_1_37 >= 0.0F && var_1_37 <= -1.0e-20F) || (var_1_37 <= 4611686.018427382800e+12F && var_1_37 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=2, var_1_14=0, var_1_15=32767, var_1_16=-32769, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=16/5, var_1_27=3221225471, var_1_30=16, var_1_31=254, var_1_32=-2, var_1_33=1, var_1_34=-1073741825, var_1_35=67/4, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=2, var_1_14=0, var_1_15=32767, var_1_16=-32769, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=16/5, var_1_27=3221225471, var_1_30=16, var_1_31=254, var_1_32=-2, var_1_33=1, var_1_34=-1073741825, var_1_35=67/4, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_9=4] [L180] RET assume_abort_if_not((var_1_37 >= 0.0F && var_1_37 <= -1.0e-20F) || (var_1_37 <= 4611686.018427382800e+12F && var_1_37 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=2, var_1_14=0, var_1_15=32767, var_1_16=-32769, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=16/5, var_1_27=3221225471, var_1_30=16, var_1_31=254, var_1_32=-2, var_1_33=1, var_1_34=-1073741825, var_1_35=67/4, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_9=4] [L181] var_1_39 = __VERIFIER_nondet_float() [L182] CALL assume_abort_if_not((var_1_39 >= 0.0F && var_1_39 <= -1.0e-20F) || (var_1_39 <= 9223372.036854765600e+12F && var_1_39 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=2, var_1_14=0, var_1_15=32767, var_1_16=-32769, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=16/5, var_1_27=3221225471, var_1_30=16, var_1_31=254, var_1_32=-2, var_1_33=1, var_1_34=-1073741825, var_1_35=67/4, var_1_38=128/5, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=2, var_1_14=0, var_1_15=32767, var_1_16=-32769, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=16/5, var_1_27=3221225471, var_1_30=16, var_1_31=254, var_1_32=-2, var_1_33=1, var_1_34=-1073741825, var_1_35=67/4, var_1_38=128/5, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_9=4] [L182] RET assume_abort_if_not((var_1_39 >= 0.0F && var_1_39 <= -1.0e-20F) || (var_1_39 <= 9223372.036854765600e+12F && var_1_39 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=2, var_1_14=0, var_1_15=32767, var_1_16=-32769, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=16/5, var_1_27=3221225471, var_1_30=16, var_1_31=254, var_1_32=-2, var_1_33=1, var_1_34=-1073741825, var_1_35=67/4, var_1_38=128/5, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_9=4] [L196] RET updateVariables() [L197] CALL step() [L58] EXPR var_1_11 & var_1_12 VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=2, var_1_14=0, var_1_15=32767, var_1_16=-32769, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=16/5, var_1_27=3221225471, var_1_30=16, var_1_31=254, var_1_32=-2, var_1_33=1, var_1_34=-1073741825, var_1_35=67/4, var_1_38=128/5, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_9=4] [L58] COND FALSE !(((((((((var_1_12) < 0 ) ? -(var_1_12) : (var_1_12)))) > (2u)) ? (((((var_1_12) < 0 ) ? -(var_1_12) : (var_1_12)))) : (2u))) > (var_1_11 & var_1_12)) [L67] var_1_23 = var_1_8 VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=2, var_1_14=0, var_1_15=32767, var_1_16=-32769, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=2, var_1_27=3221225471, var_1_30=16, var_1_31=254, var_1_32=-2, var_1_33=1, var_1_34=-1073741825, var_1_35=67/4, var_1_38=128/5, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_8=2, var_1_9=4] [L69] var_1_30 = var_1_31 [L70] var_1_32 = var_1_31 VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=2, var_1_14=0, var_1_15=32767, var_1_16=-32769, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=2, var_1_27=3221225471, var_1_30=254, var_1_31=254, var_1_32=254, var_1_33=1, var_1_34=-1073741825, var_1_35=67/4, var_1_38=128/5, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_8=2, var_1_9=4] [L71] COND TRUE var_1_16 <= ((var_1_34 - var_1_31) - ((((var_1_12) < (var_1_21)) ? (var_1_12) : (var_1_21)))) [L72] var_1_33 = 128 VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=2, var_1_14=0, var_1_15=32767, var_1_16=-32769, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=2, var_1_27=3221225471, var_1_30=254, var_1_31=254, var_1_32=254, var_1_33=128, var_1_34=-1073741825, var_1_35=67/4, var_1_38=128/5, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_8=2, var_1_9=4] [L74] EXPR var_1_1 | var_1_11 VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=2, var_1_14=0, var_1_15=32767, var_1_16=-32769, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=2, var_1_27=3221225471, var_1_30=254, var_1_31=254, var_1_32=254, var_1_33=128, var_1_34=-1073741825, var_1_35=67/4, var_1_38=128/5, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_8=2, var_1_9=4] [L74] COND TRUE (var_1_1 | var_1_11) > var_1_14 [L75] COND TRUE -16 <= (((((var_1_12 - var_1_31)) > (((((var_1_1) < 0 ) ? -(var_1_1) : (var_1_1))))) ? ((var_1_12 - var_1_31)) : (((((var_1_1) < 0 ) ? -(var_1_1) : (var_1_1)))))) [L76] var_1_35 = (63.2 - 7.4) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=2, var_1_14=0, var_1_15=32767, var_1_16=-32769, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=2, var_1_27=3221225471, var_1_30=254, var_1_31=254, var_1_32=254, var_1_33=128, var_1_34=-1073741825, var_1_38=128/5, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_8=2, var_1_9=4] [L83] COND FALSE !(var_1_27 < var_1_34) [L90] var_1_38 = var_1_36 VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=2, var_1_14=0, var_1_15=32767, var_1_16=-32769, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=2, var_1_27=3221225471, var_1_30=254, var_1_31=254, var_1_32=254, var_1_33=128, var_1_34=-1073741825, var_1_36=3, var_1_38=3, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_8=2, var_1_9=4] [L92] COND TRUE (var_1_5 * (var_1_13 - var_1_14)) <= last_1_var_1_1 [L93] var_1_12 = (var_1_15 - ((((var_1_14) > (var_1_16)) ? (var_1_14) : (var_1_16)))) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=0, var_1_13=2, var_1_14=0, var_1_15=32767, var_1_16=-32769, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=2, var_1_27=3221225471, var_1_30=254, var_1_31=254, var_1_32=254, var_1_33=128, var_1_34=-1073741825, var_1_36=3, var_1_38=3, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_8=2, var_1_9=4] [L95] var_1_11 = (((((((2u) > ((3986216790u - var_1_12))) ? (2u) : ((3986216790u - var_1_12)))) < 0 ) ? -((((2u) > ((3986216790u - var_1_12))) ? (2u) : ((3986216790u - var_1_12)))) : ((((2u) > ((3986216790u - var_1_12))) ? (2u) : ((3986216790u - var_1_12)))))) [L96] unsigned short int stepLocal_3 = var_1_12; [L97] unsigned short int stepLocal_2 = var_1_12; [L98] unsigned short int stepLocal_1 = var_1_12; [L99] unsigned long int stepLocal_0 = var_1_11; VAL [isInitial=1, last_1_var_1_1=-64, stepLocal_0=3986216790, stepLocal_1=0, stepLocal_2=0, stepLocal_3=0, var_1_10=0, var_1_11=3986216790, var_1_12=0, var_1_13=2, var_1_14=0, var_1_15=32767, var_1_16=-32769, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=2, var_1_27=3221225471, var_1_30=254, var_1_31=254, var_1_32=254, var_1_33=128, var_1_34=-1073741825, var_1_36=3, var_1_38=3, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_8=2, var_1_9=4] [L100] EXPR (var_1_11 / var_1_4) & 8 VAL [isInitial=1, last_1_var_1_1=-64, stepLocal_0=3986216790, stepLocal_1=0, stepLocal_2=0, stepLocal_3=0, var_1_10=0, var_1_11=3986216790, var_1_12=0, var_1_13=2, var_1_14=0, var_1_15=32767, var_1_16=-32769, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=2, var_1_27=3221225471, var_1_30=254, var_1_31=254, var_1_32=254, var_1_33=128, var_1_34=-1073741825, var_1_36=3, var_1_38=3, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_8=2, var_1_9=4] [L100] COND TRUE stepLocal_3 <= ((var_1_11 / var_1_4) & 8) [L101] COND FALSE !(-16 <= stepLocal_0) VAL [isInitial=1, last_1_var_1_1=-64, stepLocal_1=0, stepLocal_2=0, var_1_10=0, var_1_11=3986216790, var_1_12=0, var_1_13=2, var_1_14=0, var_1_15=32767, var_1_16=-32769, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=2, var_1_27=3221225471, var_1_30=254, var_1_31=254, var_1_32=254, var_1_33=128, var_1_34=-1073741825, var_1_36=3, var_1_38=3, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_8=2, var_1_9=4] [L115] COND FALSE !(\read(var_1_10)) VAL [isInitial=1, last_1_var_1_1=-64, stepLocal_1=0, stepLocal_2=0, var_1_10=0, var_1_11=3986216790, var_1_12=0, var_1_13=2, var_1_14=0, var_1_15=32767, var_1_16=-32769, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=2, var_1_27=3221225471, var_1_30=254, var_1_31=254, var_1_32=254, var_1_33=128, var_1_34=-1073741825, var_1_36=3, var_1_38=3, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_8=2, var_1_9=4] [L120] var_1_17 = var_1_18 VAL [isInitial=1, last_1_var_1_1=-64, stepLocal_1=0, stepLocal_2=0, var_1_10=0, var_1_11=3986216790, var_1_12=0, var_1_13=2, var_1_14=0, var_1_15=32767, var_1_16=-32769, var_1_17=-127, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=2, var_1_27=3221225471, var_1_30=254, var_1_31=254, var_1_32=254, var_1_33=128, var_1_34=-1073741825, var_1_36=3, var_1_38=3, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_8=2, var_1_9=4] [L121] COND TRUE var_1_13 <= var_1_11 [L122] var_1_19 = ((var_1_12 + 25) + (var_1_20 - (var_1_21 - 1))) VAL [isInitial=1, last_1_var_1_1=-64, stepLocal_1=0, stepLocal_2=0, var_1_10=0, var_1_11=3986216790, var_1_12=0, var_1_13=2, var_1_14=0, var_1_15=32767, var_1_16=-32769, var_1_17=-127, var_1_18=-127, var_1_19=-16357, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=2, var_1_27=3221225471, var_1_30=254, var_1_31=254, var_1_32=254, var_1_33=128, var_1_34=-1073741825, var_1_36=3, var_1_38=3, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_8=2, var_1_9=4] [L126] var_1_22 = var_1_18 VAL [isInitial=1, last_1_var_1_1=-64, stepLocal_1=0, stepLocal_2=0, var_1_10=0, var_1_11=3986216790, var_1_12=0, var_1_13=2, var_1_14=0, var_1_15=32767, var_1_16=-32769, var_1_17=-127, var_1_18=-127, var_1_19=-16357, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-127, var_1_23=2, var_1_27=3221225471, var_1_30=254, var_1_31=254, var_1_32=254, var_1_33=128, var_1_34=-1073741825, var_1_36=3, var_1_38=3, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_8=2, var_1_9=4] [L127] COND TRUE var_1_19 <= var_1_1 [L128] var_1_6 = (var_1_7 + var_1_8) VAL [isInitial=1, last_1_var_1_1=-64, stepLocal_1=0, stepLocal_2=0, var_1_10=0, var_1_11=3986216790, var_1_12=0, var_1_13=2, var_1_14=0, var_1_15=32767, var_1_16=-32769, var_1_17=-127, var_1_18=-127, var_1_19=-16357, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-127, var_1_23=2, var_1_27=3221225471, var_1_30=254, var_1_31=254, var_1_32=254, var_1_33=128, var_1_34=-1073741825, var_1_36=3, var_1_38=3, var_1_4=-64, var_1_5=-32, var_1_8=2, var_1_9=4] [L197] RET step() [L198] CALL, EXPR property() [L188] EXPR (var_1_11 / var_1_4) & 8 VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=3986216790, var_1_12=0, var_1_13=2, var_1_14=0, var_1_15=32767, var_1_16=-32769, var_1_17=-127, var_1_18=-127, var_1_19=-16357, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-127, var_1_23=2, var_1_27=3221225471, var_1_30=254, var_1_31=254, var_1_32=254, var_1_33=128, var_1_34=-1073741825, var_1_36=3, var_1_38=3, var_1_4=-64, var_1_5=-32, var_1_8=2, var_1_9=4] [L188-L189] return ((((((((var_1_12 <= ((var_1_11 / var_1_4) & 8)) ? ((-16 <= var_1_11) ? ((var_1_12 != (var_1_11 / ((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5))))) ? (var_1_1 == ((signed long int) ((((var_1_11) > (var_1_12)) ? (var_1_11) : (var_1_12))))) : (var_1_1 == ((signed long int) ((((var_1_12) < 0 ) ? -(var_1_12) : (var_1_12)))))) : 1) : ((var_1_11 <= var_1_12) ? (var_1_1 == ((signed long int) var_1_4)) : (var_1_1 == ((signed long int) var_1_11)))) && ((var_1_19 <= var_1_1) ? (var_1_6 == ((double) (var_1_7 + var_1_8))) : 1)) && (var_1_10 ? ((var_1_4 < (var_1_12 + var_1_5)) ? (var_1_9 == ((unsigned short int) 16)) : 1) : 1)) && (var_1_11 == ((unsigned long int) (((((((2u) > ((3986216790u - var_1_12))) ? (2u) : ((3986216790u - var_1_12)))) < 0 ) ? -((((2u) > ((3986216790u - var_1_12))) ? (2u) : ((3986216790u - var_1_12)))) : ((((2u) > ((3986216790u - var_1_12))) ? (2u) : ((3986216790u - var_1_12))))))))) && (((var_1_5 * (var_1_13 - var_1_14)) <= last_1_var_1_1) ? (var_1_12 == ((unsigned short int) (var_1_15 - ((((var_1_14) > (var_1_16)) ? (var_1_14) : (var_1_16)))))) : 1)) && (var_1_17 == ((signed char) var_1_18))) && ((var_1_13 <= var_1_11) ? (var_1_19 == ((signed short int) ((var_1_12 + 25) + (var_1_20 - (var_1_21 - 1))))) : (var_1_19 == ((signed short int) ((((((((var_1_18) < 0 ) ? -(var_1_18) : (var_1_18)))) > (var_1_12)) ? (((((var_1_18) < 0 ) ? -(var_1_18) : (var_1_18)))) : (var_1_12))))))) && (var_1_22 == ((signed char) var_1_18)) ; [L198] RET, EXPR property() [L198] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=3986216790, var_1_12=0, var_1_13=2, var_1_14=0, var_1_15=32767, var_1_16=-32769, var_1_17=-127, var_1_18=-127, var_1_19=-16357, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-127, var_1_23=2, var_1_27=3221225471, var_1_30=254, var_1_31=254, var_1_32=254, var_1_33=128, var_1_34=-1073741825, var_1_36=3, var_1_38=3, var_1_4=-64, var_1_5=-32, var_1_8=2, var_1_9=4] [L19] reach_error() VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=3986216790, var_1_12=0, var_1_13=2, var_1_14=0, var_1_15=32767, var_1_16=-32769, var_1_17=-127, var_1_18=-127, var_1_19=-16357, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-127, var_1_23=2, var_1_27=3221225471, var_1_30=254, var_1_31=254, var_1_32=254, var_1_33=128, var_1_34=-1073741825, var_1_36=3, var_1_38=3, var_1_4=-64, var_1_5=-32, var_1_8=2, var_1_9=4] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 103 locations, 195 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.9s, OverallIterations: 7, TraceHistogramMax: 33, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1509 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1509 mSDsluCounter, 1973 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1164 mSDsCounter, 809 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2103 IncrementalHoareTripleChecker+Invalid, 2912 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 809 mSolverCounterUnsat, 809 mSDtfsCounter, 2103 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 720 GetRequests, 648 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1166 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=502occurred in iteration=6, InterpolantAutomatonStates: 63, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 6 MinimizatonAttempts, 171 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 2133 NumberOfCodeBlocks, 2133 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1907 ConstructedInterpolants, 0 QuantifiedInterpolants, 9964 SizeOfPredicates, 3 NumberOfNonLiveVariables, 973 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 9 InterpolantComputations, 5 PerfectInterpolantSequences, 18764/19008 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-08 12:57:37,124 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-ps-ci_file-98.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 ca686f9256f657bcea08227d4780b5c57890ba4844680a923775ba3d19048603 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 12:57:38,902 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 12:57:38,972 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 12:57:38,978 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 12:57:38,978 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 12:57:39,002 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 12:57:39,005 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 12:57:39,005 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 12:57:39,005 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 12:57:39,005 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 12:57:39,005 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 12:57:39,005 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 12:57:39,005 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 12:57:39,005 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 12:57:39,005 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 12:57:39,006 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 12:57:39,006 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 12:57:39,006 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 12:57:39,006 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 12:57:39,006 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 12:57:39,006 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 12:57:39,006 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 12:57:39,006 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 12:57:39,006 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 12:57:39,006 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 12:57:39,006 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 12:57:39,006 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 12:57:39,006 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 12:57:39,006 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 12:57:39,006 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 12:57:39,006 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 12:57:39,006 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 12:57:39,006 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 12:57:39,006 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 12:57:39,006 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 12:57:39,007 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 12:57:39,007 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 12:57:39,007 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 12:57:39,007 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 12:57:39,007 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 12:57:39,007 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 12:57:39,007 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 12:57:39,007 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 12:57:39,007 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 12:57:39,007 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 12:57:39,007 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 -> ca686f9256f657bcea08227d4780b5c57890ba4844680a923775ba3d19048603 [2025-03-08 12:57:39,236 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 12:57:39,243 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 12:57:39,245 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 12:57:39,248 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 12:57:39,248 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 12:57:39,249 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-ps-ci_file-98.i [2025-03-08 12:57:40,447 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5394ee02b/5279e126a9d749e38c37fcf2bc627e99/FLAG9e89cfe60 [2025-03-08 12:57:40,621 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 12:57:40,621 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-98.i [2025-03-08 12:57:40,628 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5394ee02b/5279e126a9d749e38c37fcf2bc627e99/FLAG9e89cfe60 [2025-03-08 12:57:40,644 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5394ee02b/5279e126a9d749e38c37fcf2bc627e99 [2025-03-08 12:57:40,646 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 12:57:40,648 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 12:57:40,649 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 12:57:40,649 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 12:57:40,652 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 12:57:40,653 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:57:40" (1/1) ... [2025-03-08 12:57:40,654 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7fa6e4dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:57:40, skipping insertion in model container [2025-03-08 12:57:40,654 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:57:40" (1/1) ... [2025-03-08 12:57:40,675 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 12:57:40,770 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-ps-ci_file-98.i[919,932] [2025-03-08 12:57:40,842 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 12:57:40,855 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 12:57:40,864 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-ps-ci_file-98.i[919,932] [2025-03-08 12:57:40,898 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 12:57:40,918 INFO L204 MainTranslator]: Completed translation [2025-03-08 12:57:40,919 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:57:40 WrapperNode [2025-03-08 12:57:40,919 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 12:57:40,920 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 12:57:40,920 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 12:57:40,920 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 12:57:40,924 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:57:40" (1/1) ... [2025-03-08 12:57:40,937 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:57:40" (1/1) ... [2025-03-08 12:57:40,963 INFO L138 Inliner]: procedures = 27, calls = 46, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 197 [2025-03-08 12:57:40,964 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 12:57:40,965 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 12:57:40,965 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 12:57:40,965 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 12:57:40,971 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:57:40" (1/1) ... [2025-03-08 12:57:40,972 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:57:40" (1/1) ... [2025-03-08 12:57:40,977 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:57:40" (1/1) ... [2025-03-08 12:57:40,991 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 12:57:40,991 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:57:40" (1/1) ... [2025-03-08 12:57:40,991 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:57:40" (1/1) ... [2025-03-08 12:57:41,005 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:57:40" (1/1) ... [2025-03-08 12:57:41,008 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:57:40" (1/1) ... [2025-03-08 12:57:41,012 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:57:40" (1/1) ... [2025-03-08 12:57:41,016 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:57:40" (1/1) ... [2025-03-08 12:57:41,021 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 12:57:41,024 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 12:57:41,024 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 12:57:41,024 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 12:57:41,025 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:57:40" (1/1) ... [2025-03-08 12:57:41,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 12:57:41,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 12:57:41,050 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 12:57:41,052 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 12:57:41,070 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 12:57:41,071 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 12:57:41,071 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 12:57:41,071 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 12:57:41,071 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 12:57:41,071 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 12:57:41,137 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 12:57:41,139 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 12:57:44,757 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-03-08 12:57:44,757 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 12:57:44,767 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 12:57:44,769 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 12:57:44,770 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:57:44 BoogieIcfgContainer [2025-03-08 12:57:44,770 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 12:57:44,772 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 12:57:44,772 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 12:57:44,776 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 12:57:44,776 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 12:57:40" (1/3) ... [2025-03-08 12:57:44,777 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@902fdc9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:57:44, skipping insertion in model container [2025-03-08 12:57:44,777 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:57:40" (2/3) ... [2025-03-08 12:57:44,778 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@902fdc9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:57:44, skipping insertion in model container [2025-03-08 12:57:44,778 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:57:44" (3/3) ... [2025-03-08 12:57:44,780 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-98.i [2025-03-08 12:57:44,790 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 12:57:44,791 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-98.i that has 2 procedures, 90 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 12:57:44,833 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 12:57:44,840 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;@cb4917c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 12:57:44,842 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 12:57:44,845 INFO L276 IsEmpty]: Start isEmpty. Operand has 90 states, 54 states have (on average 1.3888888888888888) internal successors, (75), 55 states have internal predecessors, (75), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-08 12:57:44,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-03-08 12:57:44,858 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:57:44,858 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 12:57:44,859 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:57:44,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:57:44,864 INFO L85 PathProgramCache]: Analyzing trace with hash 1087887284, now seen corresponding path program 1 times [2025-03-08 12:57:44,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 12:57:44,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1110319808] [2025-03-08 12:57:44,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:57:44,877 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 12:57:44,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 12:57:44,879 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 12:57:44,881 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-08 12:57:44,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-03-08 12:57:45,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-03-08 12:57:45,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:57:45,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:57:45,342 INFO L256 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 12:57:45,349 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 12:57:45,390 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 764 proven. 0 refuted. 0 times theorem prover too weak. 1348 trivial. 0 not checked. [2025-03-08 12:57:45,391 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 12:57:45,391 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 12:57:45,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1110319808] [2025-03-08 12:57:45,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1110319808] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:57:45,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:57:45,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 12:57:45,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201638130] [2025-03-08 12:57:45,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:57:45,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 12:57:45,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 12:57:45,409 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 12:57:45,411 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 12:57:45,412 INFO L87 Difference]: Start difference. First operand has 90 states, 54 states have (on average 1.3888888888888888) internal successors, (75), 55 states have internal predecessors, (75), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2025-03-08 12:57:45,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:57:45,435 INFO L93 Difference]: Finished difference Result 174 states and 310 transitions. [2025-03-08 12:57:45,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 12:57:45,437 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) Word has length 206 [2025-03-08 12:57:45,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:57:45,443 INFO L225 Difference]: With dead ends: 174 [2025-03-08 12:57:45,444 INFO L226 Difference]: Without dead ends: 87 [2025-03-08 12:57:45,447 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 12:57:45,449 INFO L435 NwaCegarLoop]: 136 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, 136 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 12:57:45,450 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 12:57:45,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-03-08 12:57:45,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2025-03-08 12:57:45,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 52 states have (on average 1.3461538461538463) internal successors, (70), 52 states have internal predecessors, (70), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-08 12:57:45,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 136 transitions. [2025-03-08 12:57:45,488 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 136 transitions. Word has length 206 [2025-03-08 12:57:45,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:57:45,488 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 136 transitions. [2025-03-08 12:57:45,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2025-03-08 12:57:45,489 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 136 transitions. [2025-03-08 12:57:45,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-03-08 12:57:45,491 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:57:45,492 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 12:57:45,505 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 (2)] Forceful destruction successful, exit code 0 [2025-03-08 12:57:45,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 12:57:45,693 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:57:45,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:57:45,693 INFO L85 PathProgramCache]: Analyzing trace with hash -653923787, now seen corresponding path program 1 times [2025-03-08 12:57:45,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 12:57:45,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [89541813] [2025-03-08 12:57:45,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:57:45,694 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 12:57:45,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 12:57:45,697 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 12:57:45,698 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-08 12:57:45,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-03-08 12:57:46,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-03-08 12:57:46,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:57:46,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:57:46,114 INFO L256 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 12:57:46,120 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 12:57:47,689 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-03-08 12:57:47,690 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 12:57:47,690 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 12:57:47,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [89541813] [2025-03-08 12:57:47,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [89541813] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:57:47,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:57:47,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 12:57:47,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351595988] [2025-03-08 12:57:47,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:57:47,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 12:57:47,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 12:57:47,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 12:57:47,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 12:57:47,692 INFO L87 Difference]: Start difference. First operand 87 states and 136 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-08 12:57:52,890 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 12:57:54,508 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 12:57:54,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:57:54,581 INFO L93 Difference]: Finished difference Result 239 states and 378 transitions. [2025-03-08 12:57:54,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 12:57:54,585 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 206 [2025-03-08 12:57:54,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:57:54,587 INFO L225 Difference]: With dead ends: 239 [2025-03-08 12:57:54,587 INFO L226 Difference]: Without dead ends: 155 [2025-03-08 12:57:54,588 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 12:57:54,589 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 16 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.9s IncrementalHoareTripleChecker+Time [2025-03-08 12:57:54,589 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 229 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 6.9s Time] [2025-03-08 12:57:54,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2025-03-08 12:57:54,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 151. [2025-03-08 12:57:54,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 82 states have (on average 1.2682926829268293) internal successors, (104), 82 states have internal predecessors, (104), 66 states have call successors, (66), 2 states have call predecessors, (66), 2 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-08 12:57:54,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 236 transitions. [2025-03-08 12:57:54,623 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 236 transitions. Word has length 206 [2025-03-08 12:57:54,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:57:54,624 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 236 transitions. [2025-03-08 12:57:54,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-08 12:57:54,624 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 236 transitions. [2025-03-08 12:57:54,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2025-03-08 12:57:54,628 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:57:54,628 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 12:57:54,643 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-08 12:57:54,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 12:57:54,829 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:57:54,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:57:54,831 INFO L85 PathProgramCache]: Analyzing trace with hash 1000149329, now seen corresponding path program 1 times [2025-03-08 12:57:54,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 12:57:54,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2106116407] [2025-03-08 12:57:54,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:57:54,831 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 12:57:54,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 12:57:54,834 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 12:57:54,836 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-08 12:57:54,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-03-08 12:57:55,163 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-03-08 12:57:55,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:57:55,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:57:55,181 INFO L256 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-08 12:57:55,186 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 12:57:56,322 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 1016 proven. 60 refuted. 0 times theorem prover too weak. 1036 trivial. 0 not checked. [2025-03-08 12:57:56,322 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 12:57:56,411 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 12:57:56,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2106116407] [2025-03-08 12:57:56,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2106116407] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 12:57:56,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [287904875] [2025-03-08 12:57:56,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:57:56,411 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-08 12:57:56,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-08 12:57:56,414 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-08 12:57:56,416 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2025-03-08 12:57:56,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-03-08 12:57:57,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-03-08 12:57:57,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:57:57,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:57:57,397 INFO L256 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 12:57:57,400 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 12:57:57,832 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-03-08 12:57:57,832 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 12:57:57,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [287904875] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:57:57,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 12:57:57,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-03-08 12:57:57,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082873497] [2025-03-08 12:57:57,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:57:57,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 12:57:57,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 12:57:57,834 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 12:57:57,834 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 12:57:57,834 INFO L87 Difference]: Start difference. First operand 151 states and 236 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-08 12:58:00,378 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 12:58:00,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:58:00,379 INFO L93 Difference]: Finished difference Result 317 states and 498 transitions. [2025-03-08 12:58:00,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 12:58:00,393 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 207 [2025-03-08 12:58:00,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:58:00,395 INFO L225 Difference]: With dead ends: 317 [2025-03-08 12:58:00,396 INFO L226 Difference]: Without dead ends: 233 [2025-03-08 12:58:00,397 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 434 GetRequests, 426 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-08 12:58:00,398 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 30 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-03-08 12:58:00,398 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 364 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-03-08 12:58:00,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2025-03-08 12:58:00,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 225. [2025-03-08 12:58:00,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 122 states have (on average 1.2622950819672132) internal successors, (154), 122 states have internal predecessors, (154), 99 states have call successors, (99), 3 states have call predecessors, (99), 3 states have return successors, (99), 99 states have call predecessors, (99), 99 states have call successors, (99) [2025-03-08 12:58:00,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 352 transitions. [2025-03-08 12:58:00,425 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 352 transitions. Word has length 207 [2025-03-08 12:58:00,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:58:00,427 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 352 transitions. [2025-03-08 12:58:00,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-08 12:58:00,427 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 352 transitions. [2025-03-08 12:58:00,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2025-03-08 12:58:00,429 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:58:00,429 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 12:58:00,445 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 (4)] Ended with exit code 0 [2025-03-08 12:58:00,642 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Ended with exit code 0 [2025-03-08 12:58:00,830 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,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-03-08 12:58:00,830 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:58:00,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:58:00,831 INFO L85 PathProgramCache]: Analyzing trace with hash -993315535, now seen corresponding path program 1 times [2025-03-08 12:58:00,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 12:58:00,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [536935139] [2025-03-08 12:58:00,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:58:00,836 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 12:58:00,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 12:58:00,838 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 12:58:00,839 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 (6)] Waiting until timeout for monitored process [2025-03-08 12:58:00,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-03-08 12:58:01,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-03-08 12:58:01,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:58:01,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:58:01,167 INFO L256 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-08 12:58:01,176 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 12:58:01,875 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 1016 proven. 60 refuted. 0 times theorem prover too weak. 1036 trivial. 0 not checked. [2025-03-08 12:58:01,875 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 12:58:01,935 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 12:58:01,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [536935139] [2025-03-08 12:58:01,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [536935139] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 12:58:01,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1156131081] [2025-03-08 12:58:01,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:58:01,936 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-08 12:58:01,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-08 12:58:01,938 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-08 12:58:01,940 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2025-03-08 12:58:02,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-03-08 12:58:03,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-03-08 12:58:03,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:58:03,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:58:03,017 INFO L256 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 12:58:03,020 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 12:58:03,365 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-03-08 12:58:03,365 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 12:58:03,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1156131081] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:58:03,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 12:58:03,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-03-08 12:58:03,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474248750] [2025-03-08 12:58:03,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:58:03,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 12:58:03,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 12:58:03,366 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 12:58:03,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 12:58:03,367 INFO L87 Difference]: Start difference. First operand 225 states and 352 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-08 12:58:05,514 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 12:58:08,337 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 12:58:09,944 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 12:58:09,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:58:09,946 INFO L93 Difference]: Finished difference Result 402 states and 630 transitions. [2025-03-08 12:58:09,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 12:58:09,961 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 207 [2025-03-08 12:58:09,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:58:09,964 INFO L225 Difference]: With dead ends: 402 [2025-03-08 12:58:09,964 INFO L226 Difference]: Without dead ends: 238 [2025-03-08 12:58:09,965 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 434 GetRequests, 426 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-08 12:58:09,966 INFO L435 NwaCegarLoop]: 218 mSDtfsCounter, 85 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2025-03-08 12:58:09,966 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 448 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 6.5s Time] [2025-03-08 12:58:09,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2025-03-08 12:58:09,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 167. [2025-03-08 12:58:09,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 98 states have (on average 1.3061224489795917) internal successors, (128), 98 states have internal predecessors, (128), 66 states have call successors, (66), 2 states have call predecessors, (66), 2 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-08 12:58:09,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 260 transitions. [2025-03-08 12:58:09,981 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 260 transitions. Word has length 207 [2025-03-08 12:58:09,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:58:09,982 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 260 transitions. [2025-03-08 12:58:09,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-08 12:58:09,982 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 260 transitions. [2025-03-08 12:58:09,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2025-03-08 12:58:09,983 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:58:09,985 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 12:58:09,998 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Forceful destruction successful, exit code 0 [2025-03-08 12:58:10,200 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 (6)] Ended with exit code 0 [2025-03-08 12:58:10,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 12:58:10,386 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:58:10,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:58:10,386 INFO L85 PathProgramCache]: Analyzing trace with hash -1189829040, now seen corresponding path program 1 times [2025-03-08 12:58:10,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 12:58:10,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [663128342] [2025-03-08 12:58:10,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:58:10,387 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 12:58:10,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 12:58:10,389 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 12:58:10,389 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 (8)] Waiting until timeout for monitored process [2025-03-08 12:58:10,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-03-08 12:58:10,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-03-08 12:58:10,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:58:10,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:58:10,712 INFO L256 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-08 12:58:10,714 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 12:58:11,324 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 1016 proven. 60 refuted. 0 times theorem prover too weak. 1036 trivial. 0 not checked. [2025-03-08 12:58:11,324 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 12:58:11,388 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 12:58:11,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [663128342] [2025-03-08 12:58:11,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [663128342] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 12:58:11,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [636155191] [2025-03-08 12:58:11,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:58:11,389 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-08 12:58:11,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-08 12:58:11,390 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-08 12:58:11,391 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2025-03-08 12:58:11,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-03-08 12:58:12,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-03-08 12:58:12,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:58:12,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:58:12,392 INFO L256 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 12:58:12,395 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 12:58:12,954 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 1016 proven. 60 refuted. 0 times theorem prover too weak. 1036 trivial. 0 not checked. [2025-03-08 12:58:12,954 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 12:58:12,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [636155191] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 12:58:12,982 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 12:58:12,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2025-03-08 12:58:12,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049557623] [2025-03-08 12:58:12,982 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 12:58:12,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 12:58:12,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 12:58:12,983 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 12:58:12,983 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-08 12:58:12,983 INFO L87 Difference]: Start difference. First operand 167 states and 260 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (33), 2 states have call predecessors, (33), 3 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2025-03-08 12:58:16,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:58:16,140 INFO L93 Difference]: Finished difference Result 497 states and 769 transitions. [2025-03-08 12:58:16,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 12:58:16,153 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (33), 2 states have call predecessors, (33), 3 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) Word has length 207 [2025-03-08 12:58:16,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:58:16,156 INFO L225 Difference]: With dead ends: 497 [2025-03-08 12:58:16,156 INFO L226 Difference]: Without dead ends: 333 [2025-03-08 12:58:16,157 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 457 GetRequests, 449 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2025-03-08 12:58:16,157 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 56 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2025-03-08 12:58:16,157 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 447 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2025-03-08 12:58:16,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2025-03-08 12:58:16,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 322. [2025-03-08 12:58:16,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 183 states have (on average 1.273224043715847) internal successors, (233), 183 states have internal predecessors, (233), 132 states have call successors, (132), 6 states have call predecessors, (132), 6 states have return successors, (132), 132 states have call predecessors, (132), 132 states have call successors, (132) [2025-03-08 12:58:16,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 497 transitions. [2025-03-08 12:58:16,193 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 497 transitions. Word has length 207 [2025-03-08 12:58:16,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:58:16,195 INFO L471 AbstractCegarLoop]: Abstraction has 322 states and 497 transitions. [2025-03-08 12:58:16,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (33), 2 states have call predecessors, (33), 3 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2025-03-08 12:58:16,195 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 497 transitions. [2025-03-08 12:58:16,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2025-03-08 12:58:16,197 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:58:16,197 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 12:58:16,210 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Ended with exit code 0 [2025-03-08 12:58:16,411 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 (8)] Ended with exit code 0 [2025-03-08 12:58:16,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 12:58:16,598 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:58:16,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:58:16,599 INFO L85 PathProgramCache]: Analyzing trace with hash -1831597548, now seen corresponding path program 1 times [2025-03-08 12:58:16,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 12:58:16,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [470575044] [2025-03-08 12:58:16,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:58:16,599 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 12:58:16,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 12:58:16,602 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 12:58:16,603 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 (10)] Waiting until timeout for monitored process [2025-03-08 12:58:16,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-03-08 12:58:16,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-03-08 12:58:16,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:58:16,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:58:16,946 INFO L256 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 12:58:16,949 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 12:58:17,023 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-03-08 12:58:17,023 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 12:58:17,023 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 12:58:17,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [470575044] [2025-03-08 12:58:17,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [470575044] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:58:17,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:58:17,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 12:58:17,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921522358] [2025-03-08 12:58:17,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:58:17,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 12:58:17,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 12:58:17,024 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 12:58:17,024 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 12:58:17,024 INFO L87 Difference]: Start difference. First operand 322 states and 497 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-08 12:58:23,084 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.60s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-08 12:58:25,078 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-08 12:58:26,770 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-08 12:58:26,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:58:26,771 INFO L93 Difference]: Finished difference Result 574 states and 891 transitions. [2025-03-08 12:58:26,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 12:58:26,787 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 208 [2025-03-08 12:58:26,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:58:26,790 INFO L225 Difference]: With dead ends: 574 [2025-03-08 12:58:26,790 INFO L226 Difference]: Without dead ends: 410 [2025-03-08 12:58:26,790 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 12:58:26,791 INFO L435 NwaCegarLoop]: 284 mSDtfsCounter, 214 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 597 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.7s IncrementalHoareTripleChecker+Time [2025-03-08 12:58:26,791 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 597 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 9.7s Time] [2025-03-08 12:58:26,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2025-03-08 12:58:26,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 402. [2025-03-08 12:58:26,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 402 states, 229 states have (on average 1.2707423580786026) internal successors, (291), 229 states have internal predecessors, (291), 165 states have call successors, (165), 7 states have call predecessors, (165), 7 states have return successors, (165), 165 states have call predecessors, (165), 165 states have call successors, (165) [2025-03-08 12:58:26,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 621 transitions. [2025-03-08 12:58:26,844 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 621 transitions. Word has length 208 [2025-03-08 12:58:26,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:58:26,845 INFO L471 AbstractCegarLoop]: Abstraction has 402 states and 621 transitions. [2025-03-08 12:58:26,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-08 12:58:26,845 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 621 transitions. [2025-03-08 12:58:26,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2025-03-08 12:58:26,846 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:58:26,846 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 12:58:26,864 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 (10)] Ended with exit code 0 [2025-03-08 12:58:27,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 12:58:27,047 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:58:27,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:58:27,047 INFO L85 PathProgramCache]: Analyzing trace with hash -1830674027, now seen corresponding path program 1 times [2025-03-08 12:58:27,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 12:58:27,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [435050168] [2025-03-08 12:58:27,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:58:27,048 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 12:58:27,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 12:58:27,049 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 12:58:27,050 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 (11)] Waiting until timeout for monitored process [2025-03-08 12:58:27,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-03-08 12:58:27,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-03-08 12:58:27,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:58:27,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:58:27,407 INFO L256 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-08 12:58:27,412 INFO L279 TraceCheckSpWp]: Computing forward predicates...