./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-1.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0feebc1024eac08439331e7773a7511b315939c469dc4e0ad2e111de10ff1692 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 22:40:05,894 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 22:40:05,943 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 22:40:05,950 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 22:40:05,950 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 22:40:05,967 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 22:40:05,968 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 22:40:05,968 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 22:40:05,968 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 22:40:05,969 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 22:40:05,969 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 22:40:05,969 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 22:40:05,969 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 22:40:05,969 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 22:40:05,970 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 22:40:05,970 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 22:40:05,970 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 22:40:05,970 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 22:40:05,970 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 22:40:05,970 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 22:40:05,971 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 22:40:05,971 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 22:40:05,971 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 22:40:05,971 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 22:40:05,971 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 22:40:05,971 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 22:40:05,971 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 22:40:05,971 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 22:40:05,971 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 22:40:05,971 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 22:40:05,972 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 22:40:05,972 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 22:40:05,972 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 22:40:05,972 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 22:40:05,972 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 22:40:05,972 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 22:40:05,972 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 22:40:05,973 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 22:40:05,973 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 22:40:05,973 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 22:40:05,973 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 22:40:05,973 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 22:40:05,973 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 22:40:05,973 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0feebc1024eac08439331e7773a7511b315939c469dc4e0ad2e111de10ff1692 [2025-02-05 22:40:06,234 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 22:40:06,244 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 22:40:06,246 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 22:40:06,247 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 22:40:06,247 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 22:40:06,248 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-1.i [2025-02-05 22:40:07,387 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/508c4540d/2ba2bd7d34f44b93b00e0e5d795bc207/FLAG01d6880bb [2025-02-05 22:40:07,633 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 22:40:07,633 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-1.i [2025-02-05 22:40:07,641 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/508c4540d/2ba2bd7d34f44b93b00e0e5d795bc207/FLAG01d6880bb [2025-02-05 22:40:07,969 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/508c4540d/2ba2bd7d34f44b93b00e0e5d795bc207 [2025-02-05 22:40:07,971 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 22:40:07,972 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 22:40:07,973 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 22:40:07,973 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 22:40:07,976 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 22:40:07,977 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:40:07" (1/1) ... [2025-02-05 22:40:07,978 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@bc74ac1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:40:07, skipping insertion in model container [2025-02-05 22:40:07,979 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:40:07" (1/1) ... [2025-02-05 22:40:07,996 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 22:40:08,104 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-1.i[918,931] [2025-02-05 22:40:08,186 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 22:40:08,200 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 22:40:08,209 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-1.i[918,931] [2025-02-05 22:40:08,243 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 22:40:08,258 INFO L204 MainTranslator]: Completed translation [2025-02-05 22:40:08,259 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:40:08 WrapperNode [2025-02-05 22:40:08,259 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 22:40:08,260 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 22:40:08,260 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 22:40:08,260 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 22:40:08,264 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:40:08" (1/1) ... [2025-02-05 22:40:08,277 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:40:08" (1/1) ... [2025-02-05 22:40:08,322 INFO L138 Inliner]: procedures = 26, calls = 52, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 240 [2025-02-05 22:40:08,323 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 22:40:08,324 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 22:40:08,324 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 22:40:08,324 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 22:40:08,331 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:40:08" (1/1) ... [2025-02-05 22:40:08,332 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:40:08" (1/1) ... [2025-02-05 22:40:08,334 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:40:08" (1/1) ... [2025-02-05 22:40:08,361 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-05 22:40:08,361 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:40:08" (1/1) ... [2025-02-05 22:40:08,361 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:40:08" (1/1) ... [2025-02-05 22:40:08,372 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:40:08" (1/1) ... [2025-02-05 22:40:08,373 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:40:08" (1/1) ... [2025-02-05 22:40:08,375 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:40:08" (1/1) ... [2025-02-05 22:40:08,376 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:40:08" (1/1) ... [2025-02-05 22:40:08,378 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 22:40:08,379 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 22:40:08,379 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 22:40:08,380 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 22:40:08,380 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:40:08" (1/1) ... [2025-02-05 22:40:08,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 22:40:08,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 22:40:08,412 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 22:40:08,415 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 22:40:08,434 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 22:40:08,434 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 22:40:08,434 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 22:40:08,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 22:40:08,434 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 22:40:08,434 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 22:40:08,510 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 22:40:08,512 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 22:40:08,852 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2025-02-05 22:40:08,852 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 22:40:08,868 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 22:40:08,868 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 22:40:08,868 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:40:08 BoogieIcfgContainer [2025-02-05 22:40:08,869 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 22:40:08,870 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 22:40:08,871 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 22:40:08,874 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 22:40:08,874 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 10:40:07" (1/3) ... [2025-02-05 22:40:08,875 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@475b4f72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:40:08, skipping insertion in model container [2025-02-05 22:40:08,875 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:40:08" (2/3) ... [2025-02-05 22:40:08,875 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@475b4f72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:40:08, skipping insertion in model container [2025-02-05 22:40:08,875 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:40:08" (3/3) ... [2025-02-05 22:40:08,876 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-co_file-1.i [2025-02-05 22:40:08,887 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 22:40:08,888 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pe-co_file-1.i that has 2 procedures, 107 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 22:40:08,930 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 22:40:08,940 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;@55986d3a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 22:40:08,941 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 22:40:08,945 INFO L276 IsEmpty]: Start isEmpty. Operand has 107 states, 65 states have (on average 1.4307692307692308) internal successors, (93), 66 states have internal predecessors, (93), 39 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-02-05 22:40:08,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2025-02-05 22:40:08,958 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:40:08,958 INFO L218 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:40:08,959 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:40:08,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:40:08,962 INFO L85 PathProgramCache]: Analyzing trace with hash -1187961677, now seen corresponding path program 1 times [2025-02-05 22:40:08,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:40:08,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692977703] [2025-02-05 22:40:08,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:40:08,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:40:09,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 243 statements into 1 equivalence classes. [2025-02-05 22:40:09,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 243 of 243 statements. [2025-02-05 22:40:09,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:40:09,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:40:09,279 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 2888 trivial. 0 not checked. [2025-02-05 22:40:09,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:40:09,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692977703] [2025-02-05 22:40:09,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692977703] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 22:40:09,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1924616286] [2025-02-05 22:40:09,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:40:09,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 22:40:09,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 22:40:09,283 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 22:40:09,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 22:40:09,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 243 statements into 1 equivalence classes. [2025-02-05 22:40:09,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 243 of 243 statements. [2025-02-05 22:40:09,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:40:09,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:40:09,446 INFO L256 TraceCheckSpWp]: Trace formula consists of 544 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 22:40:09,454 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 22:40:09,488 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 2888 trivial. 0 not checked. [2025-02-05 22:40:09,489 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 22:40:09,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1924616286] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:40:09,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 22:40:09,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-05 22:40:09,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754384189] [2025-02-05 22:40:09,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:40:09,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 22:40:09,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:40:09,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 22:40:09,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 22:40:09,513 INFO L87 Difference]: Start difference. First operand has 107 states, 65 states have (on average 1.4307692307692308) internal successors, (93), 66 states have internal predecessors, (93), 39 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) Second operand has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (39), 2 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 2 states have call successors, (39) [2025-02-05 22:40:09,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:40:09,543 INFO L93 Difference]: Finished difference Result 208 states and 376 transitions. [2025-02-05 22:40:09,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 22:40:09,545 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (39), 2 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 2 states have call successors, (39) Word has length 243 [2025-02-05 22:40:09,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:40:09,551 INFO L225 Difference]: With dead ends: 208 [2025-02-05 22:40:09,552 INFO L226 Difference]: Without dead ends: 104 [2025-02-05 22:40:09,555 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 244 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 22:40:09,558 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 22:40:09,558 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 163 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 22:40:09,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-02-05 22:40:09,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2025-02-05 22:40:09,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 63 states have (on average 1.380952380952381) internal successors, (87), 63 states have internal predecessors, (87), 39 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-02-05 22:40:09,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 165 transitions. [2025-02-05 22:40:09,606 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 165 transitions. Word has length 243 [2025-02-05 22:40:09,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:40:09,606 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 165 transitions. [2025-02-05 22:40:09,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (39), 2 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 2 states have call successors, (39) [2025-02-05 22:40:09,607 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 165 transitions. [2025-02-05 22:40:09,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2025-02-05 22:40:09,612 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:40:09,612 INFO L218 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:40:09,620 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-05 22:40:09,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-05 22:40:09,813 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:40:09,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:40:09,814 INFO L85 PathProgramCache]: Analyzing trace with hash -365233741, now seen corresponding path program 1 times [2025-02-05 22:40:09,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:40:09,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974286259] [2025-02-05 22:40:09,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:40:09,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:40:09,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 243 statements into 1 equivalence classes. [2025-02-05 22:40:09,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 243 of 243 statements. [2025-02-05 22:40:09,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:40:09,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:40:10,076 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2025-02-05 22:40:10,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:40:10,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974286259] [2025-02-05 22:40:10,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974286259] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:40:10,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:40:10,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 22:40:10,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290714676] [2025-02-05 22:40:10,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:40:10,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 22:40:10,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:40:10,082 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 22:40:10,082 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 22:40:10,082 INFO L87 Difference]: Start difference. First operand 104 states and 165 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, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2025-02-05 22:40:10,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:40:10,162 INFO L93 Difference]: Finished difference Result 205 states and 327 transitions. [2025-02-05 22:40:10,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 22:40:10,163 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, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 243 [2025-02-05 22:40:10,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:40:10,165 INFO L225 Difference]: With dead ends: 205 [2025-02-05 22:40:10,165 INFO L226 Difference]: Without dead ends: 104 [2025-02-05 22:40:10,166 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 22:40:10,166 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 0 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 22:40:10,166 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 290 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 22:40:10,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-02-05 22:40:10,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2025-02-05 22:40:10,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 63 states have (on average 1.3650793650793651) internal successors, (86), 63 states have internal predecessors, (86), 39 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-02-05 22:40:10,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 164 transitions. [2025-02-05 22:40:10,181 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 164 transitions. Word has length 243 [2025-02-05 22:40:10,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:40:10,182 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 164 transitions. [2025-02-05 22:40:10,182 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, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2025-02-05 22:40:10,182 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 164 transitions. [2025-02-05 22:40:10,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2025-02-05 22:40:10,184 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:40:10,184 INFO L218 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:40:10,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 22:40:10,185 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:40:10,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:40:10,185 INFO L85 PathProgramCache]: Analyzing trace with hash -394641074, now seen corresponding path program 1 times [2025-02-05 22:40:10,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:40:10,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637119007] [2025-02-05 22:40:10,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:40:10,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:40:10,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 244 statements into 1 equivalence classes. [2025-02-05 22:40:10,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 244 of 244 statements. [2025-02-05 22:40:10,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:40:10,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:40:10,365 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2025-02-05 22:40:10,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:40:10,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637119007] [2025-02-05 22:40:10,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637119007] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:40:10,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:40:10,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 22:40:10,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5500967] [2025-02-05 22:40:10,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:40:10,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 22:40:10,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:40:10,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 22:40:10,370 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 22:40:10,370 INFO L87 Difference]: Start difference. First operand 104 states and 164 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2025-02-05 22:40:10,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:40:10,443 INFO L93 Difference]: Finished difference Result 304 states and 482 transitions. [2025-02-05 22:40:10,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 22:40:10,444 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 244 [2025-02-05 22:40:10,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:40:10,450 INFO L225 Difference]: With dead ends: 304 [2025-02-05 22:40:10,450 INFO L226 Difference]: Without dead ends: 203 [2025-02-05 22:40:10,451 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 22:40:10,452 INFO L435 NwaCegarLoop]: 280 mSDtfsCounter, 147 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 22:40:10,452 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 425 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 22:40:10,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2025-02-05 22:40:10,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 201. [2025-02-05 22:40:10,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 120 states have (on average 1.3416666666666666) internal successors, (161), 120 states have internal predecessors, (161), 78 states have call successors, (78), 2 states have call predecessors, (78), 2 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) [2025-02-05 22:40:10,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 317 transitions. [2025-02-05 22:40:10,487 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 317 transitions. Word has length 244 [2025-02-05 22:40:10,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:40:10,488 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 317 transitions. [2025-02-05 22:40:10,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2025-02-05 22:40:10,488 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 317 transitions. [2025-02-05 22:40:10,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2025-02-05 22:40:10,491 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:40:10,491 INFO L218 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:40:10,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 22:40:10,491 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:40:10,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:40:10,492 INFO L85 PathProgramCache]: Analyzing trace with hash -118202858, now seen corresponding path program 1 times [2025-02-05 22:40:10,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:40:10,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182289974] [2025-02-05 22:40:10,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:40:10,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:40:10,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 245 statements into 1 equivalence classes. [2025-02-05 22:40:10,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 245 of 245 statements. [2025-02-05 22:40:10,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:40:10,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:40:10,696 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2025-02-05 22:40:10,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:40:10,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182289974] [2025-02-05 22:40:10,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182289974] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:40:10,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:40:10,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 22:40:10,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237695574] [2025-02-05 22:40:10,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:40:10,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 22:40:10,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:40:10,698 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 22:40:10,698 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 22:40:10,699 INFO L87 Difference]: Start difference. First operand 201 states and 317 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2025-02-05 22:40:10,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:40:10,785 INFO L93 Difference]: Finished difference Result 587 states and 929 transitions. [2025-02-05 22:40:10,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 22:40:10,785 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 245 [2025-02-05 22:40:10,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:40:10,788 INFO L225 Difference]: With dead ends: 587 [2025-02-05 22:40:10,789 INFO L226 Difference]: Without dead ends: 389 [2025-02-05 22:40:10,790 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 22:40:10,790 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 149 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 22:40:10,790 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 274 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 22:40:10,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2025-02-05 22:40:10,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 229. [2025-02-05 22:40:10,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 148 states have (on average 1.3716216216216217) internal successors, (203), 148 states have internal predecessors, (203), 78 states have call successors, (78), 2 states have call predecessors, (78), 2 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) [2025-02-05 22:40:10,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 359 transitions. [2025-02-05 22:40:10,834 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 359 transitions. Word has length 245 [2025-02-05 22:40:10,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:40:10,835 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 359 transitions. [2025-02-05 22:40:10,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2025-02-05 22:40:10,836 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 359 transitions. [2025-02-05 22:40:10,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2025-02-05 22:40:10,839 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:40:10,839 INFO L218 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:40:10,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 22:40:10,839 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:40:10,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:40:10,840 INFO L85 PathProgramCache]: Analyzing trace with hash 93148055, now seen corresponding path program 1 times [2025-02-05 22:40:10,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:40:10,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445738939] [2025-02-05 22:40:10,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:40:10,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:40:10,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 245 statements into 1 equivalence classes. [2025-02-05 22:40:10,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 245 of 245 statements. [2025-02-05 22:40:10,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:40:10,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:40:11,012 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2025-02-05 22:40:11,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:40:11,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445738939] [2025-02-05 22:40:11,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445738939] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:40:11,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:40:11,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 22:40:11,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726822108] [2025-02-05 22:40:11,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:40:11,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 22:40:11,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:40:11,014 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 22:40:11,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 22:40:11,014 INFO L87 Difference]: Start difference. First operand 229 states and 359 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2025-02-05 22:40:11,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:40:11,082 INFO L93 Difference]: Finished difference Result 455 states and 715 transitions. [2025-02-05 22:40:11,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 22:40:11,083 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 245 [2025-02-05 22:40:11,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:40:11,085 INFO L225 Difference]: With dead ends: 455 [2025-02-05 22:40:11,086 INFO L226 Difference]: Without dead ends: 229 [2025-02-05 22:40:11,086 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 22:40:11,087 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 0 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 22:40:11,087 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 289 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 22:40:11,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2025-02-05 22:40:11,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 229. [2025-02-05 22:40:11,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 148 states have (on average 1.3581081081081081) internal successors, (201), 148 states have internal predecessors, (201), 78 states have call successors, (78), 2 states have call predecessors, (78), 2 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) [2025-02-05 22:40:11,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 357 transitions. [2025-02-05 22:40:11,103 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 357 transitions. Word has length 245 [2025-02-05 22:40:11,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:40:11,104 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 357 transitions. [2025-02-05 22:40:11,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2025-02-05 22:40:11,104 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 357 transitions. [2025-02-05 22:40:11,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2025-02-05 22:40:11,105 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:40:11,106 INFO L218 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:40:11,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 22:40:11,106 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:40:11,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:40:11,106 INFO L85 PathProgramCache]: Analyzing trace with hash -412410570, now seen corresponding path program 1 times [2025-02-05 22:40:11,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:40:11,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895331846] [2025-02-05 22:40:11,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:40:11,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:40:11,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 245 statements into 1 equivalence classes. [2025-02-05 22:40:11,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 245 of 245 statements. [2025-02-05 22:40:11,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:40:11,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:40:11,265 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2025-02-05 22:40:11,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:40:11,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895331846] [2025-02-05 22:40:11,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895331846] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:40:11,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:40:11,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 22:40:11,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960029162] [2025-02-05 22:40:11,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:40:11,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 22:40:11,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:40:11,267 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 22:40:11,267 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 22:40:11,267 INFO L87 Difference]: Start difference. First operand 229 states and 357 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2025-02-05 22:40:11,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:40:11,367 INFO L93 Difference]: Finished difference Result 615 states and 961 transitions. [2025-02-05 22:40:11,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 22:40:11,368 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 245 [2025-02-05 22:40:11,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:40:11,371 INFO L225 Difference]: With dead ends: 615 [2025-02-05 22:40:11,371 INFO L226 Difference]: Without dead ends: 389 [2025-02-05 22:40:11,371 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 22:40:11,375 INFO L435 NwaCegarLoop]: 255 mSDtfsCounter, 123 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 22:40:11,375 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 384 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 22:40:11,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2025-02-05 22:40:11,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 243. [2025-02-05 22:40:11,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 162 states have (on average 1.3518518518518519) internal successors, (219), 162 states have internal predecessors, (219), 78 states have call successors, (78), 2 states have call predecessors, (78), 2 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) [2025-02-05 22:40:11,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 375 transitions. [2025-02-05 22:40:11,419 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 375 transitions. Word has length 245 [2025-02-05 22:40:11,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:40:11,420 INFO L471 AbstractCegarLoop]: Abstraction has 243 states and 375 transitions. [2025-02-05 22:40:11,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2025-02-05 22:40:11,421 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 375 transitions. [2025-02-05 22:40:11,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2025-02-05 22:40:11,423 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:40:11,423 INFO L218 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:40:11,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 22:40:11,423 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:40:11,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:40:11,424 INFO L85 PathProgramCache]: Analyzing trace with hash -1688446244, now seen corresponding path program 1 times [2025-02-05 22:40:11,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:40:11,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142146644] [2025-02-05 22:40:11,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:40:11,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:40:11,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 245 statements into 1 equivalence classes. [2025-02-05 22:40:11,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 245 of 245 statements. [2025-02-05 22:40:11,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:40:11,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:40:11,813 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2025-02-05 22:40:11,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:40:11,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142146644] [2025-02-05 22:40:11,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142146644] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:40:11,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:40:11,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 22:40:11,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031552706] [2025-02-05 22:40:11,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:40:11,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 22:40:11,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:40:11,815 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 22:40:11,815 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 22:40:11,816 INFO L87 Difference]: Start difference. First operand 243 states and 375 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2025-02-05 22:40:12,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:40:12,098 INFO L93 Difference]: Finished difference Result 790 states and 1220 transitions. [2025-02-05 22:40:12,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 22:40:12,098 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 245 [2025-02-05 22:40:12,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:40:12,102 INFO L225 Difference]: With dead ends: 790 [2025-02-05 22:40:12,102 INFO L226 Difference]: Without dead ends: 550 [2025-02-05 22:40:12,103 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 22:40:12,103 INFO L435 NwaCegarLoop]: 238 mSDtfsCounter, 238 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 22:40:12,103 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 516 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 22:40:12,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2025-02-05 22:40:12,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 400. [2025-02-05 22:40:12,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 259 states have (on average 1.332046332046332) internal successors, (345), 261 states have internal predecessors, (345), 136 states have call successors, (136), 4 states have call predecessors, (136), 4 states have return successors, (136), 134 states have call predecessors, (136), 136 states have call successors, (136) [2025-02-05 22:40:12,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 617 transitions. [2025-02-05 22:40:12,165 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 617 transitions. Word has length 245 [2025-02-05 22:40:12,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:40:12,165 INFO L471 AbstractCegarLoop]: Abstraction has 400 states and 617 transitions. [2025-02-05 22:40:12,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2025-02-05 22:40:12,166 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 617 transitions. [2025-02-05 22:40:12,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2025-02-05 22:40:12,168 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:40:12,168 INFO L218 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:40:12,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 22:40:12,169 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:40:12,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:40:12,169 INFO L85 PathProgramCache]: Analyzing trace with hash -800942563, now seen corresponding path program 1 times [2025-02-05 22:40:12,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:40:12,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084324490] [2025-02-05 22:40:12,169 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:40:12,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:40:12,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 245 statements into 1 equivalence classes. [2025-02-05 22:40:12,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 245 of 245 statements. [2025-02-05 22:40:12,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:40:12,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-05 22:40:12,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1510692383] [2025-02-05 22:40:12,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:40:12,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 22:40:12,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 22:40:12,325 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 22:40:12,326 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 22:40:12,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 245 statements into 1 equivalence classes. [2025-02-05 22:40:12,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 245 of 245 statements. [2025-02-05 22:40:12,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:40:12,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 22:40:12,448 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-05 22:40:12,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 245 statements into 1 equivalence classes. [2025-02-05 22:40:12,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 245 of 245 statements. [2025-02-05 22:40:12,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:40:12,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 22:40:12,640 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-05 22:40:12,640 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-05 22:40:12,641 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-05 22:40:12,651 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-05 22:40:12,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 22:40:12,847 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:40:12,972 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-05 22:40:12,974 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 10:40:12 BoogieIcfgContainer [2025-02-05 22:40:12,974 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-05 22:40:12,977 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-05 22:40:12,977 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-05 22:40:12,978 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-05 22:40:12,978 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:40:08" (3/4) ... [2025-02-05 22:40:12,980 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-05 22:40:12,981 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-05 22:40:12,982 INFO L158 Benchmark]: Toolchain (without parser) took 5009.67ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 113.4MB in the beginning and 67.4MB in the end (delta: 46.0MB). Peak memory consumption was 83.3MB. Max. memory is 16.1GB. [2025-02-05 22:40:12,982 INFO L158 Benchmark]: CDTParser took 1.04ms. Allocated memory is still 201.3MB. Free memory is still 123.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 22:40:12,982 INFO L158 Benchmark]: CACSL2BoogieTranslator took 286.25ms. Allocated memory is still 142.6MB. Free memory was 113.4MB in the beginning and 97.6MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-05 22:40:12,983 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.77ms. Allocated memory is still 142.6MB. Free memory was 97.6MB in the beginning and 93.5MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 22:40:12,983 INFO L158 Benchmark]: Boogie Preprocessor took 54.56ms. Allocated memory is still 142.6MB. Free memory was 93.5MB in the beginning and 89.3MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 22:40:12,983 INFO L158 Benchmark]: IcfgBuilder took 489.38ms. Allocated memory is still 142.6MB. Free memory was 89.3MB in the beginning and 59.7MB in the end (delta: 29.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-05 22:40:12,983 INFO L158 Benchmark]: TraceAbstraction took 4103.84ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 59.2MB in the beginning and 67.5MB in the end (delta: -8.2MB). Peak memory consumption was 24.6MB. Max. memory is 16.1GB. [2025-02-05 22:40:12,984 INFO L158 Benchmark]: Witness Printer took 3.55ms. Allocated memory is still 176.2MB. Free memory was 67.5MB in the beginning and 67.4MB in the end (delta: 33.1kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 22:40:12,985 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.04ms. Allocated memory is still 201.3MB. Free memory is still 123.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 286.25ms. Allocated memory is still 142.6MB. Free memory was 113.4MB in the beginning and 97.6MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.77ms. Allocated memory is still 142.6MB. Free memory was 97.6MB in the beginning and 93.5MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 54.56ms. Allocated memory is still 142.6MB. Free memory was 93.5MB in the beginning and 89.3MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 489.38ms. Allocated memory is still 142.6MB. Free memory was 89.3MB in the beginning and 59.7MB in the end (delta: 29.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 4103.84ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 59.2MB in the beginning and 67.5MB in the end (delta: -8.2MB). Peak memory consumption was 24.6MB. Max. memory is 16.1GB. * Witness Printer took 3.55ms. Allocated memory is still 176.2MB. Free memory was 67.5MB in the beginning and 67.4MB in the end (delta: 33.1kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 143, overapproximation of someBinaryFLOATComparisonOperation at line 118, overapproximation of someBinaryFLOATComparisonOperation at line 204, overapproximation of someBinaryFLOATComparisonOperation at line 148, overapproximation of someBinaryDOUBLEComparisonOperation at line 141, overapproximation of someBinaryDOUBLEComparisonOperation at line 204. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 64; [L23] double var_1_6 = 31.5; [L24] double var_1_9 = 1000000000.25; [L25] float var_1_10 = 1.1; [L26] float var_1_11 = 8.75; [L27] float var_1_12 = 63.8; [L28] unsigned char var_1_13 = 1; [L29] float var_1_14 = 127.5; [L30] signed char var_1_15 = -2; [L31] signed char var_1_16 = 1; [L32] signed char var_1_17 = 1; [L33] signed char var_1_18 = 1; [L34] signed char var_1_19 = -2; [L35] signed char var_1_20 = 16; [L36] signed char var_1_21 = 2; [L37] signed char var_1_22 = 8; [L38] unsigned char var_1_23 = 0; [L39] unsigned char var_1_24 = 0; [L40] unsigned char var_1_25 = 0; [L41] unsigned char var_1_26 = 0; [L42] unsigned char var_1_27 = 32; [L43] unsigned char var_1_28 = 1; [L44] unsigned long int var_1_33 = 10; [L45] unsigned long int var_1_35 = 2632045268; [L46] signed long int var_1_36 = 32; [L47] unsigned long int var_1_37 = 128; [L48] unsigned long int var_1_39 = 1877460848; [L49] unsigned long int var_1_40 = 1831388024; [L50] unsigned long int var_1_41 = 1967003719; [L51] unsigned char var_1_42 = 0; [L52] unsigned char var_1_43 = 0; [L53] unsigned char var_1_45 = 0; [L54] unsigned char var_1_46 = 0; [L55] unsigned char var_1_47 = 1; [L56] unsigned char var_1_48 = 1; [L57] unsigned short int var_1_49 = 0; VAL [isInitial=0, var_1_10=11/10, var_1_11=35/4, var_1_12=319/5, var_1_13=1, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2, var_1_9=4000000001/4] [L208] isInitial = 1 [L209] FCALL initially() [L210] COND TRUE 1 [L211] FCALL updateLastVariables() [L212] CALL updateVariables() [L140] var_1_9 = __VERIFIER_nondet_double() [L141] CALL assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_11=35/4, var_1_12=319/5, var_1_13=1, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_11=35/4, var_1_12=319/5, var_1_13=1, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L141] RET assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=11/10, var_1_11=35/4, var_1_12=319/5, var_1_13=1, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L142] var_1_11 = __VERIFIER_nondet_float() [L143] CALL assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=1, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=1, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L143] RET assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=1, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L144] var_1_13 = __VERIFIER_nondet_uchar() [L145] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L145] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L146] CALL assume_abort_if_not(var_1_13 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L146] RET assume_abort_if_not(var_1_13 <= 1) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L147] var_1_14 = __VERIFIER_nondet_float() [L148] CALL assume_abort_if_not((var_1_14 >= -922337.2036854765600e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L148] RET assume_abort_if_not((var_1_14 >= -922337.2036854765600e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L149] var_1_16 = __VERIFIER_nondet_char() [L150] CALL assume_abort_if_not(var_1_16 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L150] RET assume_abort_if_not(var_1_16 >= -1) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L151] CALL assume_abort_if_not(var_1_16 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L151] RET assume_abort_if_not(var_1_16 <= 126) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L152] var_1_17 = __VERIFIER_nondet_char() [L153] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L153] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L154] CALL assume_abort_if_not(var_1_17 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L154] RET assume_abort_if_not(var_1_17 <= 126) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L155] var_1_19 = __VERIFIER_nondet_char() [L156] CALL assume_abort_if_not(var_1_19 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L156] RET assume_abort_if_not(var_1_19 >= -63) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L157] CALL assume_abort_if_not(var_1_19 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L157] RET assume_abort_if_not(var_1_19 <= 63) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L158] var_1_20 = __VERIFIER_nondet_char() [L159] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L159] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L160] CALL assume_abort_if_not(var_1_20 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L160] RET assume_abort_if_not(var_1_20 <= 63) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L161] var_1_21 = __VERIFIER_nondet_char() [L162] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L162] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L163] CALL assume_abort_if_not(var_1_21 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L163] RET assume_abort_if_not(var_1_21 <= 63) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L164] var_1_22 = __VERIFIER_nondet_char() [L165] CALL assume_abort_if_not(var_1_22 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L165] RET assume_abort_if_not(var_1_22 >= -63) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L166] CALL assume_abort_if_not(var_1_22 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L166] RET assume_abort_if_not(var_1_22 <= 63) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L167] var_1_24 = __VERIFIER_nondet_uchar() [L168] CALL assume_abort_if_not(var_1_24 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L168] RET assume_abort_if_not(var_1_24 >= 1) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L169] CALL assume_abort_if_not(var_1_24 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L169] RET assume_abort_if_not(var_1_24 <= 1) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L170] var_1_25 = __VERIFIER_nondet_uchar() [L171] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L171] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L172] CALL assume_abort_if_not(var_1_25 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L172] RET assume_abort_if_not(var_1_25 <= 0) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L173] var_1_26 = __VERIFIER_nondet_uchar() [L174] CALL assume_abort_if_not(var_1_26 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L174] RET assume_abort_if_not(var_1_26 >= 1) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L175] CALL assume_abort_if_not(var_1_26 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L175] RET assume_abort_if_not(var_1_26 <= 1) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L176] var_1_35 = __VERIFIER_nondet_ulong() [L177] CALL assume_abort_if_not(var_1_35 >= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L177] RET assume_abort_if_not(var_1_35 >= 2147483647) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L178] CALL assume_abort_if_not(var_1_35 <= 4294967294) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L178] RET assume_abort_if_not(var_1_35 <= 4294967294) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L179] var_1_39 = __VERIFIER_nondet_ulong() [L180] CALL assume_abort_if_not(var_1_39 >= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=1073741823, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=1073741823, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L180] RET assume_abort_if_not(var_1_39 >= 1073741823) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=1073741823, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L181] CALL assume_abort_if_not(var_1_39 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=1073741823, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=1073741823, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L181] RET assume_abort_if_not(var_1_39 <= 2147483647) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=1073741823, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L182] var_1_40 = __VERIFIER_nondet_ulong() [L183] CALL assume_abort_if_not(var_1_40 >= 1073741824) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=1073741823, var_1_40=1073741824, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=1073741823, var_1_40=1073741824, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L183] RET assume_abort_if_not(var_1_40 >= 1073741824) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=1073741823, var_1_40=1073741824, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L184] CALL assume_abort_if_not(var_1_40 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=1073741823, var_1_40=1073741824, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=1073741823, var_1_40=1073741824, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L184] RET assume_abort_if_not(var_1_40 <= 2147483647) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=1073741823, var_1_40=1073741824, var_1_41=1967003719, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L185] var_1_41 = __VERIFIER_nondet_ulong() [L186] CALL assume_abort_if_not(var_1_41 >= 1073741824) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=1073741823, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=1073741823, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L186] RET assume_abort_if_not(var_1_41 >= 1073741824) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=1073741823, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L187] CALL assume_abort_if_not(var_1_41 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=1073741823, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=1073741823, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L187] RET assume_abort_if_not(var_1_41 <= 2147483647) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=1073741823, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L188] var_1_43 = __VERIFIER_nondet_uchar() [L189] CALL assume_abort_if_not(var_1_43 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=1073741823, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=1073741823, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L189] RET assume_abort_if_not(var_1_43 >= 0) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=1073741823, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L190] CALL assume_abort_if_not(var_1_43 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=1073741823, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=1073741823, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L190] RET assume_abort_if_not(var_1_43 <= 0) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=1073741823, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L191] var_1_45 = __VERIFIER_nondet_uchar() [L192] CALL assume_abort_if_not(var_1_45 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=1073741823, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=1073741823, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L192] RET assume_abort_if_not(var_1_45 >= 0) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=1073741823, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L193] CALL assume_abort_if_not(var_1_45 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=1073741823, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=1073741823, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L193] RET assume_abort_if_not(var_1_45 <= 0) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=1073741823, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L194] var_1_47 = __VERIFIER_nondet_uchar() [L195] CALL assume_abort_if_not(var_1_47 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=1073741823, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=1073741823, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L195] RET assume_abort_if_not(var_1_47 >= 1) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=1073741823, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L196] CALL assume_abort_if_not(var_1_47 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=1073741823, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=1073741823, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L196] RET assume_abort_if_not(var_1_47 <= 1) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=1073741823, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L197] var_1_48 = __VERIFIER_nondet_uchar() [L198] CALL assume_abort_if_not(var_1_48 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=1073741823, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=1073741823, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L198] RET assume_abort_if_not(var_1_48 >= 1) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=1073741823, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L199] CALL assume_abort_if_not(var_1_48 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=1073741823, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=1073741823, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L199] RET assume_abort_if_not(var_1_48 <= 1) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=1073741823, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L212] RET updateVariables() [L213] CALL step() [L61] var_1_15 = (var_1_16 - var_1_17) [L62] var_1_27 = var_1_21 [L63] unsigned char stepLocal_1 = var_1_27; [L64] unsigned char stepLocal_0 = var_1_27; VAL [isInitial=1, stepLocal_0=0, stepLocal_1=0, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=1073741823, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L65] COND TRUE (var_1_27 + var_1_27) <= stepLocal_1 [L66] var_1_1 = (128 + var_1_27) VAL [isInitial=1, stepLocal_0=0, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=1073741823, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L74] COND FALSE !(var_1_27 < (var_1_27 - var_1_27)) VAL [isInitial=1, stepLocal_0=0, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=1073741823, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L77] unsigned char stepLocal_2 = var_1_27; VAL [isInitial=1, stepLocal_0=0, stepLocal_2=0, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=1073741823, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L78] COND FALSE !(var_1_27 > stepLocal_2) [L81] var_1_10 = 9.75f VAL [isInitial=1, stepLocal_0=0, var_1_10=39/4, var_1_12=319/5, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=1073741823, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L83] COND TRUE ((((var_1_27) < (var_1_27)) ? (var_1_27) : (var_1_27))) < 25u [L84] var_1_18 = (((((var_1_19) > ((var_1_20 - var_1_21))) ? (var_1_19) : ((var_1_20 - var_1_21)))) + (((((((var_1_22) < 0 ) ? -(var_1_22) : (var_1_22))) < 0 ) ? -((((var_1_22) < 0 ) ? -(var_1_22) : (var_1_22))) : ((((var_1_22) < 0 ) ? -(var_1_22) : (var_1_22)))))) VAL [isInitial=1, stepLocal_0=0, var_1_10=39/4, var_1_12=319/5, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=1073741823, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L86] signed long int stepLocal_5 = ~ var_1_21; VAL [isInitial=1, stepLocal_0=0, stepLocal_5=-1, var_1_10=39/4, var_1_12=319/5, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=1073741823, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L87] COND FALSE !(\read(var_1_13)) VAL [isInitial=1, stepLocal_0=0, stepLocal_5=-1, var_1_10=39/4, var_1_12=319/5, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=1073741823, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L96] unsigned char stepLocal_4 = var_1_18 >= var_1_27; [L97] unsigned char stepLocal_3 = var_1_27; VAL [isInitial=1, stepLocal_0=0, stepLocal_3=0, stepLocal_4=1, stepLocal_5=-1, var_1_10=39/4, var_1_12=319/5, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=1073741823, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L98] COND FALSE !(var_1_23 && stepLocal_4) VAL [isInitial=1, stepLocal_0=0, stepLocal_3=0, stepLocal_5=-1, var_1_10=39/4, var_1_12=319/5, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=1073741823, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L101] COND TRUE 1 >= stepLocal_3 [L102] var_1_12 = var_1_11 VAL [isInitial=1, stepLocal_0=0, stepLocal_5=-1, var_1_10=39/4, var_1_11=2, var_1_12=2, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=1073741823, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L107] EXPR var_1_27 | (var_1_27 + var_1_27) VAL [isInitial=1, stepLocal_0=0, stepLocal_5=-1, var_1_10=39/4, var_1_11=2, var_1_12=2, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=1073741823, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L107] COND FALSE !(var_1_27 < (var_1_27 | (var_1_27 + var_1_27))) [L110] EXPR var_1_27 >> var_1_27 VAL [isInitial=1, stepLocal_0=0, stepLocal_5=-1, var_1_10=39/4, var_1_11=2, var_1_12=2, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=1073741823, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L110] COND TRUE var_1_27 >= (var_1_27 >> var_1_27) [L111] COND FALSE !(var_1_23 || (var_1_27 < var_1_27)) VAL [isInitial=1, stepLocal_0=0, stepLocal_5=-1, var_1_10=39/4, var_1_11=2, var_1_12=2, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=1073741823, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L115] COND FALSE !(var_1_27 > (var_1_27 / var_1_35)) VAL [isInitial=1, stepLocal_0=0, stepLocal_5=-1, var_1_10=39/4, var_1_11=2, var_1_12=2, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=1073741823, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L118] COND TRUE 63.75f <= var_1_10 [L119] var_1_37 = ((var_1_39 + ((((var_1_40) > (var_1_41)) ? (var_1_40) : (var_1_41)))) - ((((var_1_15) < 0 ) ? -(var_1_15) : (var_1_15)))) VAL [isInitial=1, stepLocal_0=0, stepLocal_5=-1, var_1_10=39/4, var_1_11=2, var_1_12=2, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=2147483647, var_1_39=1073741823, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L121] COND FALSE !(var_1_41 < ((((var_1_27) < (var_1_1)) ? (var_1_27) : (var_1_1)))) [L124] var_1_42 = (var_1_45 || var_1_43) VAL [isInitial=1, stepLocal_0=0, stepLocal_5=-1, var_1_10=39/4, var_1_11=2, var_1_12=2, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=2147483647, var_1_39=1073741823, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L126] COND FALSE !(\read(var_1_23)) VAL [isInitial=1, stepLocal_0=0, stepLocal_5=-1, var_1_10=39/4, var_1_11=2, var_1_12=2, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=2147483647, var_1_39=1073741823, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L133] COND FALSE !((var_1_39 - ((((-50) < 0 ) ? -(-50) : (-50)))) < var_1_18) VAL [isInitial=1, stepLocal_0=0, stepLocal_5=-1, var_1_10=39/4, var_1_11=2, var_1_12=2, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=2147483647, var_1_39=1073741823, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L213] RET step() [L214] CALL, EXPR property() [L204-L205] return (((((((((var_1_27 + var_1_27) <= var_1_27) ? (var_1_1 == ((signed short int) (128 + var_1_27))) : ((var_1_27 >= (var_1_27 * var_1_27)) ? (var_1_1 == ((signed short int) var_1_27)) : (var_1_1 == ((signed short int) 1)))) && ((var_1_27 < (var_1_27 - var_1_27)) ? (var_1_6 == ((double) var_1_9)) : 1)) && ((var_1_27 > var_1_27) ? (var_1_10 == ((float) (1.00000000000009E13f - var_1_11))) : (var_1_10 == ((float) 9.75f)))) && ((var_1_23 && (var_1_18 >= var_1_27)) ? (var_1_12 == ((float) var_1_11)) : ((1 >= var_1_27) ? (var_1_12 == ((float) var_1_11)) : (var_1_12 == ((float) var_1_14))))) && (var_1_15 == ((signed char) (var_1_16 - var_1_17)))) && ((((((var_1_27) < (var_1_27)) ? (var_1_27) : (var_1_27))) < 25u) ? (var_1_18 == ((signed char) (((((var_1_19) > ((var_1_20 - var_1_21))) ? (var_1_19) : ((var_1_20 - var_1_21)))) + (((((((var_1_22) < 0 ) ? -(var_1_22) : (var_1_22))) < 0 ) ? -((((var_1_22) < 0 ) ? -(var_1_22) : (var_1_22))) : ((((var_1_22) < 0 ) ? -(var_1_22) : (var_1_22)))))))) : 1)) && (var_1_13 ? (((~ var_1_21) > var_1_27) ? (var_1_23 == ((unsigned char) (var_1_24 && (! var_1_25)))) : (var_1_24 ? (var_1_23 == ((unsigned char) ((! var_1_25) || var_1_26))) : 1)) : 1)) && (var_1_27 == ((unsigned char) var_1_21)) ; VAL [\result=0, isInitial=1, var_1_10=39/4, var_1_11=2, var_1_12=2, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=2147483647, var_1_39=1073741823, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L214] RET, EXPR property() [L214] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=39/4, var_1_11=2, var_1_12=2, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=2147483647, var_1_39=1073741823, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] [L19] reach_error() VAL [isInitial=1, var_1_10=39/4, var_1_11=2, var_1_12=2, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=2147483647, var_1_39=1073741823, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_43=0, var_1_45=0, var_1_46=0, var_1_47=1, var_1_48=1, var_1_49=0, var_1_6=63/2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 107 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.9s, OverallIterations: 8, TraceHistogramMax: 39, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 657 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 657 mSDsluCounter, 2341 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 937 mSDsCounter, 21 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 368 IncrementalHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 21 mSolverCounterUnsat, 1404 mSDtfsCounter, 368 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 265 GetRequests, 258 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=400occurred in iteration=7, InterpolantAutomatonStates: 21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 7 MinimizatonAttempts, 458 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 2443 NumberOfCodeBlocks, 2443 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1945 ConstructedInterpolants, 0 QuantifiedInterpolants, 2200 SizeOfPredicates, 0 NumberOfNonLiveVariables, 544 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 8 InterpolantComputations, 7 PerfectInterpolantSequences, 23636/23712 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-02-05 22:40:13,005 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-1.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0feebc1024eac08439331e7773a7511b315939c469dc4e0ad2e111de10ff1692 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 22:40:14,833 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 22:40:14,897 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-02-05 22:40:14,907 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 22:40:14,907 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 22:40:14,922 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 22:40:14,922 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 22:40:14,923 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 22:40:14,923 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 22:40:14,923 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 22:40:14,923 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 22:40:14,923 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 22:40:14,923 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 22:40:14,923 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 22:40:14,923 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 22:40:14,924 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 22:40:14,924 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 22:40:14,924 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 22:40:14,924 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 22:40:14,924 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 22:40:14,924 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 22:40:14,924 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 22:40:14,924 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 22:40:14,924 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-05 22:40:14,924 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-05 22:40:14,924 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-05 22:40:14,925 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 22:40:14,925 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 22:40:14,925 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 22:40:14,925 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 22:40:14,925 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 22:40:14,925 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 22:40:14,925 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 22:40:14,925 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 22:40:14,925 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 22:40:14,925 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 22:40:14,925 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 22:40:14,926 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 22:40:14,926 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 22:40:14,926 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-05 22:40:14,926 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-05 22:40:14,926 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 22:40:14,926 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 22:40:14,926 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 22:40:14,926 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 22:40:14,926 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0feebc1024eac08439331e7773a7511b315939c469dc4e0ad2e111de10ff1692 [2025-02-05 22:40:15,141 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 22:40:15,150 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 22:40:15,151 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 22:40:15,152 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 22:40:15,152 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 22:40:15,153 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-1.i [2025-02-05 22:40:16,355 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/aee7a5a1f/6ba362c3cb314f5ba3e8fc61b912638b/FLAGebf34df58 [2025-02-05 22:40:16,585 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 22:40:16,589 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-1.i [2025-02-05 22:40:16,596 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/aee7a5a1f/6ba362c3cb314f5ba3e8fc61b912638b/FLAGebf34df58 [2025-02-05 22:40:16,925 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/aee7a5a1f/6ba362c3cb314f5ba3e8fc61b912638b [2025-02-05 22:40:16,927 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 22:40:16,928 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 22:40:16,929 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 22:40:16,929 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 22:40:16,932 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 22:40:16,932 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:40:16" (1/1) ... [2025-02-05 22:40:16,933 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@182b0836 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:40:16, skipping insertion in model container [2025-02-05 22:40:16,933 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:40:16" (1/1) ... [2025-02-05 22:40:16,950 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 22:40:17,047 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-1.i[918,931] [2025-02-05 22:40:17,118 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 22:40:17,134 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 22:40:17,142 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-1.i[918,931] [2025-02-05 22:40:17,186 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 22:40:17,203 INFO L204 MainTranslator]: Completed translation [2025-02-05 22:40:17,203 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:40:17 WrapperNode [2025-02-05 22:40:17,203 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 22:40:17,204 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 22:40:17,204 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 22:40:17,204 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 22:40:17,209 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:40:17" (1/1) ... [2025-02-05 22:40:17,223 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:40:17" (1/1) ... [2025-02-05 22:40:17,252 INFO L138 Inliner]: procedures = 27, calls = 52, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 218 [2025-02-05 22:40:17,252 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 22:40:17,256 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 22:40:17,256 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 22:40:17,256 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 22:40:17,263 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:40:17" (1/1) ... [2025-02-05 22:40:17,263 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:40:17" (1/1) ... [2025-02-05 22:40:17,265 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:40:17" (1/1) ... [2025-02-05 22:40:17,281 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-05 22:40:17,282 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:40:17" (1/1) ... [2025-02-05 22:40:17,282 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:40:17" (1/1) ... [2025-02-05 22:40:17,292 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:40:17" (1/1) ... [2025-02-05 22:40:17,293 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:40:17" (1/1) ... [2025-02-05 22:40:17,295 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:40:17" (1/1) ... [2025-02-05 22:40:17,299 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:40:17" (1/1) ... [2025-02-05 22:40:17,302 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 22:40:17,302 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 22:40:17,302 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 22:40:17,303 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 22:40:17,303 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:40:17" (1/1) ... [2025-02-05 22:40:17,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 22:40:17,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 22:40:17,327 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 22:40:17,330 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 22:40:17,347 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 22:40:17,347 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-05 22:40:17,347 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 22:40:17,347 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 22:40:17,347 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 22:40:17,347 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 22:40:17,414 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 22:40:17,415 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 22:40:17,786 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2025-02-05 22:40:17,786 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 22:40:17,794 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 22:40:17,795 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 22:40:17,796 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:40:17 BoogieIcfgContainer [2025-02-05 22:40:17,796 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 22:40:17,798 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 22:40:17,798 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 22:40:17,801 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 22:40:17,802 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 10:40:16" (1/3) ... [2025-02-05 22:40:17,802 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f50c6b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:40:17, skipping insertion in model container [2025-02-05 22:40:17,803 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:40:17" (2/3) ... [2025-02-05 22:40:17,803 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f50c6b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:40:17, skipping insertion in model container [2025-02-05 22:40:17,803 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:40:17" (3/3) ... [2025-02-05 22:40:17,804 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-co_file-1.i [2025-02-05 22:40:17,814 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 22:40:17,815 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pe-co_file-1.i that has 2 procedures, 102 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 22:40:17,858 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 22:40:17,866 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;@5ca11cba, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 22:40:17,867 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 22:40:17,869 INFO L276 IsEmpty]: Start isEmpty. Operand has 102 states, 60 states have (on average 1.4166666666666667) internal successors, (85), 61 states have internal predecessors, (85), 39 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-02-05 22:40:17,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2025-02-05 22:40:17,882 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:40:17,883 INFO L218 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:40:17,883 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:40:17,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:40:17,887 INFO L85 PathProgramCache]: Analyzing trace with hash 1308330033, now seen corresponding path program 1 times [2025-02-05 22:40:17,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 22:40:17,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [48875017] [2025-02-05 22:40:17,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:40:17,897 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 22:40:17,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 22:40:17,899 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-05 22:40:17,917 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-02-05 22:40:18,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 241 statements into 1 equivalence classes. [2025-02-05 22:40:18,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 241 of 241 statements. [2025-02-05 22:40:18,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:40:18,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:40:18,201 INFO L256 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 22:40:18,212 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 22:40:18,258 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 620 proven. 0 refuted. 0 times theorem prover too weak. 2344 trivial. 0 not checked. [2025-02-05 22:40:18,259 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 22:40:18,259 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 22:40:18,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [48875017] [2025-02-05 22:40:18,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [48875017] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:40:18,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:40:18,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 22:40:18,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143182260] [2025-02-05 22:40:18,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:40:18,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 22:40:18,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 22:40:18,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 22:40:18,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 22:40:18,282 INFO L87 Difference]: Start difference. First operand has 102 states, 60 states have (on average 1.4166666666666667) internal successors, (85), 61 states have internal predecessors, (85), 39 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) Second operand has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (39), 2 states have call predecessors, (39), 2 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39) [2025-02-05 22:40:18,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:40:18,303 INFO L93 Difference]: Finished difference Result 198 states and 360 transitions. [2025-02-05 22:40:18,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 22:40:18,305 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (39), 2 states have call predecessors, (39), 2 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39) Word has length 241 [2025-02-05 22:40:18,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:40:18,309 INFO L225 Difference]: With dead ends: 198 [2025-02-05 22:40:18,309 INFO L226 Difference]: Without dead ends: 99 [2025-02-05 22:40:18,312 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 22:40:18,313 INFO L435 NwaCegarLoop]: 156 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, 156 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 22:40:18,314 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 22:40:18,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-02-05 22:40:18,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2025-02-05 22:40:18,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 58 states have (on average 1.3448275862068966) internal successors, (78), 58 states have internal predecessors, (78), 39 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-02-05 22:40:18,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 156 transitions. [2025-02-05 22:40:18,358 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 156 transitions. Word has length 241 [2025-02-05 22:40:18,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:40:18,358 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 156 transitions. [2025-02-05 22:40:18,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (39), 2 states have call predecessors, (39), 2 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39) [2025-02-05 22:40:18,359 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 156 transitions. [2025-02-05 22:40:18,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2025-02-05 22:40:18,361 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:40:18,362 INFO L218 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:40:18,370 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-02-05 22:40:18,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 22:40:18,563 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:40:18,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:40:18,563 INFO L85 PathProgramCache]: Analyzing trace with hash 1219693968, now seen corresponding path program 1 times [2025-02-05 22:40:18,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 22:40:18,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [575902618] [2025-02-05 22:40:18,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:40:18,564 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 22:40:18,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 22:40:18,567 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-05 22:40:18,568 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-02-05 22:40:18,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 242 statements into 1 equivalence classes. [2025-02-05 22:40:18,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 242 of 242 statements. [2025-02-05 22:40:18,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:40:18,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:40:18,862 INFO L256 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-05 22:40:18,871 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 22:40:19,500 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 1391 proven. 144 refuted. 0 times theorem prover too weak. 1429 trivial. 0 not checked. [2025-02-05 22:40:19,500 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 22:40:19,694 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2025-02-05 22:40:19,695 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 22:40:19,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [575902618] [2025-02-05 22:40:19,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [575902618] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-05 22:40:19,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 22:40:19,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2025-02-05 22:40:19,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287885457] [2025-02-05 22:40:19,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:40:19,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 22:40:19,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 22:40:19,700 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 22:40:19,700 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-02-05 22:40:19,700 INFO L87 Difference]: Start difference. First operand 99 states and 156 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, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2025-02-05 22:40:19,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:40:19,916 INFO L93 Difference]: Finished difference Result 206 states and 329 transitions. [2025-02-05 22:40:19,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 22:40:19,919 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, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 242 [2025-02-05 22:40:19,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:40:19,921 INFO L225 Difference]: With dead ends: 206 [2025-02-05 22:40:19,921 INFO L226 Difference]: Without dead ends: 110 [2025-02-05 22:40:19,922 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 482 GetRequests, 473 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-02-05 22:40:19,922 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 19 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 22:40:19,923 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 289 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 22:40:19,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-02-05 22:40:19,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 99. [2025-02-05 22:40:19,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 58 states have (on average 1.3275862068965518) internal successors, (77), 58 states have internal predecessors, (77), 39 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-02-05 22:40:19,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 155 transitions. [2025-02-05 22:40:19,933 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 155 transitions. Word has length 242 [2025-02-05 22:40:19,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:40:19,934 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 155 transitions. [2025-02-05 22:40:19,935 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, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2025-02-05 22:40:19,935 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 155 transitions. [2025-02-05 22:40:19,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2025-02-05 22:40:19,937 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:40:19,937 INFO L218 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:40:19,946 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-02-05 22:40:20,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 22:40:20,138 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:40:20,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:40:20,139 INFO L85 PathProgramCache]: Analyzing trace with hash 222621615, now seen corresponding path program 1 times [2025-02-05 22:40:20,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 22:40:20,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [130293439] [2025-02-05 22:40:20,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:40:20,140 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 22:40:20,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 22:40:20,142 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-05 22:40:20,143 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-02-05 22:40:20,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 242 statements into 1 equivalence classes. [2025-02-05 22:40:20,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 242 of 242 statements. [2025-02-05 22:40:20,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:40:20,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:40:20,374 INFO L256 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 22:40:20,381 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 22:40:20,700 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2025-02-05 22:40:20,700 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 22:40:20,700 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 22:40:20,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [130293439] [2025-02-05 22:40:20,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [130293439] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:40:20,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:40:20,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 22:40:20,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597997069] [2025-02-05 22:40:20,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:40:20,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 22:40:20,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 22:40:20,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 22:40:20,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 22:40:20,701 INFO L87 Difference]: Start difference. First operand 99 states and 155 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 2 states have internal predecessors, (50), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2025-02-05 22:40:20,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:40:20,785 INFO L93 Difference]: Finished difference Result 289 states and 455 transitions. [2025-02-05 22:40:20,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 22:40:20,787 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 2 states have internal predecessors, (50), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 242 [2025-02-05 22:40:20,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:40:20,789 INFO L225 Difference]: With dead ends: 289 [2025-02-05 22:40:20,789 INFO L226 Difference]: Without dead ends: 193 [2025-02-05 22:40:20,790 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 22:40:20,791 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 26 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 22:40:20,791 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 299 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 22:40:20,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2025-02-05 22:40:20,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 191. [2025-02-05 22:40:20,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 110 states have (on average 1.290909090909091) internal successors, (142), 110 states have internal predecessors, (142), 78 states have call successors, (78), 2 states have call predecessors, (78), 2 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) [2025-02-05 22:40:20,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 298 transitions. [2025-02-05 22:40:20,811 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 298 transitions. Word has length 242 [2025-02-05 22:40:20,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:40:20,812 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 298 transitions. [2025-02-05 22:40:20,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 2 states have internal predecessors, (50), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2025-02-05 22:40:20,812 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 298 transitions. [2025-02-05 22:40:20,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2025-02-05 22:40:20,814 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:40:20,815 INFO L218 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:40:20,824 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-02-05 22:40:21,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 22:40:21,015 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:40:21,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:40:21,016 INFO L85 PathProgramCache]: Analyzing trace with hash -779670093, now seen corresponding path program 1 times [2025-02-05 22:40:21,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 22:40:21,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1219131493] [2025-02-05 22:40:21,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:40:21,017 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 22:40:21,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 22:40:21,020 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-05 22:40:21,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-02-05 22:40:21,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 243 statements into 1 equivalence classes. [2025-02-05 22:40:21,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 243 of 243 statements. [2025-02-05 22:40:21,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:40:21,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:40:21,233 INFO L256 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-05 22:40:21,241 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 22:40:21,472 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 1364 proven. 75 refuted. 0 times theorem prover too weak. 1525 trivial. 0 not checked. [2025-02-05 22:40:21,472 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 22:40:21,522 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 22:40:21,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1219131493] [2025-02-05 22:40:21,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1219131493] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 22:40:21,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1971960658] [2025-02-05 22:40:21,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:40:21,522 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-02-05 22:40:21,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-02-05 22:40:21,545 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-02-05 22:40:21,547 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2025-02-05 22:40:21,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 243 statements into 1 equivalence classes. [2025-02-05 22:40:21,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 243 of 243 statements. [2025-02-05 22:40:21,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:40:21,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:40:21,835 INFO L256 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 22:40:21,838 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 22:40:21,865 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2025-02-05 22:40:21,865 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 22:40:21,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1971960658] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:40:21,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 22:40:21,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-02-05 22:40:21,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260140164] [2025-02-05 22:40:21,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:40:21,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 22:40:21,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 22:40:21,867 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 22:40:21,867 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-05 22:40:21,867 INFO L87 Difference]: Start difference. First operand 191 states and 298 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, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2025-02-05 22:40:21,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:40:21,946 INFO L93 Difference]: Finished difference Result 387 states and 604 transitions. [2025-02-05 22:40:21,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 22:40:21,948 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, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 243 [2025-02-05 22:40:21,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:40:21,950 INFO L225 Difference]: With dead ends: 387 [2025-02-05 22:40:21,951 INFO L226 Difference]: Without dead ends: 199 [2025-02-05 22:40:21,952 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 508 GetRequests, 501 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-05 22:40:21,952 INFO L435 NwaCegarLoop]: 280 mSDtfsCounter, 140 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 22:40:21,953 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 418 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 22:40:21,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2025-02-05 22:40:21,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 197. [2025-02-05 22:40:21,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 116 states have (on average 1.2844827586206897) internal successors, (149), 116 states have internal predecessors, (149), 78 states have call successors, (78), 2 states have call predecessors, (78), 2 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) [2025-02-05 22:40:21,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 305 transitions. [2025-02-05 22:40:21,978 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 305 transitions. Word has length 243 [2025-02-05 22:40:21,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:40:21,979 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 305 transitions. [2025-02-05 22:40:21,979 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, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2025-02-05 22:40:21,980 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 305 transitions. [2025-02-05 22:40:21,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2025-02-05 22:40:21,981 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:40:21,982 INFO L218 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:40:21,986 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Ended with exit code 0 [2025-02-05 22:40:22,192 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2025-02-05 22:40:22,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 22:40:22,383 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:40:22,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:40:22,383 INFO L85 PathProgramCache]: Analyzing trace with hash 1512853330, now seen corresponding path program 1 times [2025-02-05 22:40:22,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 22:40:22,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1043435902] [2025-02-05 22:40:22,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:40:22,384 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 22:40:22,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 22:40:22,386 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-05 22:40:22,387 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2025-02-05 22:40:22,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 243 statements into 1 equivalence classes. [2025-02-05 22:40:22,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 243 of 243 statements. [2025-02-05 22:40:22,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:40:22,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:40:22,624 INFO L256 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-02-05 22:40:22,627 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 22:40:23,138 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 1391 proven. 144 refuted. 0 times theorem prover too weak. 1429 trivial. 0 not checked. [2025-02-05 22:40:23,138 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 22:40:23,423 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2025-02-05 22:40:23,424 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 22:40:23,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1043435902] [2025-02-05 22:40:23,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1043435902] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-05 22:40:23,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 22:40:23,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 14 [2025-02-05 22:40:23,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430644074] [2025-02-05 22:40:23,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:40:23,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 22:40:23,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 22:40:23,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 22:40:23,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2025-02-05 22:40:23,426 INFO L87 Difference]: Start difference. First operand 197 states and 305 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2025-02-05 22:40:24,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:40:24,315 INFO L93 Difference]: Finished difference Result 758 states and 1176 transitions. [2025-02-05 22:40:24,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 22:40:24,316 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 243 [2025-02-05 22:40:24,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:40:24,320 INFO L225 Difference]: With dead ends: 758 [2025-02-05 22:40:24,320 INFO L226 Difference]: Without dead ends: 564 [2025-02-05 22:40:24,321 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 485 GetRequests, 471 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2025-02-05 22:40:24,325 INFO L435 NwaCegarLoop]: 237 mSDtfsCounter, 312 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 22:40:24,325 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [312 Valid, 583 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 22:40:24,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2025-02-05 22:40:24,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 238. [2025-02-05 22:40:24,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 157 states have (on average 1.3121019108280254) internal successors, (206), 157 states have internal predecessors, (206), 78 states have call successors, (78), 2 states have call predecessors, (78), 2 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) [2025-02-05 22:40:24,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 362 transitions. [2025-02-05 22:40:24,371 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 362 transitions. Word has length 243 [2025-02-05 22:40:24,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:40:24,372 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 362 transitions. [2025-02-05 22:40:24,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2025-02-05 22:40:24,373 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 362 transitions. [2025-02-05 22:40:24,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2025-02-05 22:40:24,376 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:40:24,376 INFO L218 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:40:24,387 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2025-02-05 22:40:24,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 22:40:24,577 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:40:24,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:40:24,577 INFO L85 PathProgramCache]: Analyzing trace with hash -165518414, now seen corresponding path program 1 times [2025-02-05 22:40:24,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 22:40:24,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1028260015] [2025-02-05 22:40:24,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:40:24,578 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 22:40:24,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 22:40:24,580 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-05 22:40:24,581 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2025-02-05 22:40:24,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 243 statements into 1 equivalence classes. [2025-02-05 22:40:24,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 243 of 243 statements. [2025-02-05 22:40:24,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:40:24,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:40:24,795 INFO L256 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 22:40:24,798 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 22:40:24,833 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2025-02-05 22:40:24,833 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 22:40:24,833 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 22:40:24,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1028260015] [2025-02-05 22:40:24,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1028260015] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:40:24,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:40:24,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 22:40:24,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095256104] [2025-02-05 22:40:24,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:40:24,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 22:40:24,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 22:40:24,834 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 22:40:24,834 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 22:40:24,835 INFO L87 Difference]: Start difference. First operand 238 states and 362 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, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2025-02-05 22:40:24,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:40:24,917 INFO L93 Difference]: Finished difference Result 547 states and 835 transitions. [2025-02-05 22:40:24,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 22:40:24,918 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, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 243 [2025-02-05 22:40:24,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:40:24,920 INFO L225 Difference]: With dead ends: 547 [2025-02-05 22:40:24,920 INFO L226 Difference]: Without dead ends: 312 [2025-02-05 22:40:24,921 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 241 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 22:40:24,922 INFO L435 NwaCegarLoop]: 259 mSDtfsCounter, 140 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 22:40:24,922 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 368 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 22:40:24,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2025-02-05 22:40:24,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 238. [2025-02-05 22:40:24,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 157 states have (on average 1.2929936305732483) internal successors, (203), 157 states have internal predecessors, (203), 78 states have call successors, (78), 2 states have call predecessors, (78), 2 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) [2025-02-05 22:40:24,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 359 transitions. [2025-02-05 22:40:24,939 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 359 transitions. Word has length 243 [2025-02-05 22:40:24,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:40:24,939 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 359 transitions. [2025-02-05 22:40:24,939 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, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2025-02-05 22:40:24,939 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 359 transitions. [2025-02-05 22:40:24,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2025-02-05 22:40:24,941 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:40:24,941 INFO L218 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:40:24,950 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2025-02-05 22:40:25,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 22:40:25,142 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:40:25,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:40:25,142 INFO L85 PathProgramCache]: Analyzing trace with hash 1577291921, now seen corresponding path program 1 times [2025-02-05 22:40:25,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 22:40:25,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [901206980] [2025-02-05 22:40:25,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:40:25,143 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 22:40:25,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 22:40:25,144 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-05 22:40:25,145 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2025-02-05 22:40:25,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 243 statements into 1 equivalence classes. [2025-02-05 22:40:25,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 243 of 243 statements. [2025-02-05 22:40:25,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:40:25,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:40:25,369 INFO L256 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-05 22:40:25,380 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 22:40:25,855 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 1975 proven. 117 refuted. 0 times theorem prover too weak. 872 trivial. 0 not checked. [2025-02-05 22:40:25,855 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 22:40:26,200 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 87 proven. 27 refuted. 0 times theorem prover too weak. 2850 trivial. 0 not checked. [2025-02-05 22:40:26,200 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 22:40:26,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [901206980] [2025-02-05 22:40:26,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [901206980] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 22:40:26,201 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-05 22:40:26,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 7] total 18 [2025-02-05 22:40:26,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259573338] [2025-02-05 22:40:26,201 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-05 22:40:26,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-05 22:40:26,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 22:40:26,202 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-05 22:40:26,202 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2025-02-05 22:40:26,202 INFO L87 Difference]: Start difference. First operand 238 states and 359 transitions. Second operand has 18 states, 18 states have (on average 5.444444444444445) internal successors, (98), 17 states have internal predecessors, (98), 5 states have call successors, (64), 4 states have call predecessors, (64), 7 states have return successors, (65), 5 states have call predecessors, (65), 5 states have call successors, (65) [2025-02-05 22:40:27,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:40:27,440 INFO L93 Difference]: Finished difference Result 693 states and 1007 transitions. [2025-02-05 22:40:27,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-02-05 22:40:27,441 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.444444444444445) internal successors, (98), 17 states have internal predecessors, (98), 5 states have call successors, (64), 4 states have call predecessors, (64), 7 states have return successors, (65), 5 states have call predecessors, (65), 5 states have call successors, (65) Word has length 243 [2025-02-05 22:40:27,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:40:27,444 INFO L225 Difference]: With dead ends: 693 [2025-02-05 22:40:27,444 INFO L226 Difference]: Without dead ends: 458 [2025-02-05 22:40:27,445 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 503 GetRequests, 470 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=360, Invalid=830, Unknown=0, NotChecked=0, Total=1190 [2025-02-05 22:40:27,446 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 549 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 749 mSolverCounterSat, 327 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 550 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 1076 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 327 IncrementalHoareTripleChecker+Valid, 749 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-05 22:40:27,446 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [550 Valid, 391 Invalid, 1076 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [327 Valid, 749 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-05 22:40:27,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2025-02-05 22:40:27,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 270. [2025-02-05 22:40:27,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 181 states have (on average 1.2375690607734806) internal successors, (224), 181 states have internal predecessors, (224), 78 states have call successors, (78), 10 states have call predecessors, (78), 10 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) [2025-02-05 22:40:27,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 380 transitions. [2025-02-05 22:40:27,481 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 380 transitions. Word has length 243 [2025-02-05 22:40:27,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:40:27,481 INFO L471 AbstractCegarLoop]: Abstraction has 270 states and 380 transitions. [2025-02-05 22:40:27,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.444444444444445) internal successors, (98), 17 states have internal predecessors, (98), 5 states have call successors, (64), 4 states have call predecessors, (64), 7 states have return successors, (65), 5 states have call predecessors, (65), 5 states have call successors, (65) [2025-02-05 22:40:27,481 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 380 transitions. [2025-02-05 22:40:27,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2025-02-05 22:40:27,484 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:40:27,484 INFO L218 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:40:27,493 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2025-02-05 22:40:27,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 22:40:27,685 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:40:27,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:40:27,686 INFO L85 PathProgramCache]: Analyzing trace with hash -1830171694, now seen corresponding path program 1 times [2025-02-05 22:40:27,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 22:40:27,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [607096797] [2025-02-05 22:40:27,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:40:27,686 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 22:40:27,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 22:40:27,688 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-05 22:40:27,689 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2025-02-05 22:40:27,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 243 statements into 1 equivalence classes. [2025-02-05 22:40:27,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 243 of 243 statements. [2025-02-05 22:40:27,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:40:27,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:40:27,912 INFO L256 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-02-05 22:40:27,920 INFO L279 TraceCheckSpWp]: Computing forward predicates...