./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-42.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_fillercodesize_ps-cn-25_file-42.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 5f62dbdf30439c22b90c0714165751cfb1215bac5efc8ba17b86c401a925f47d --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 21:47:00,239 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 21:47:00,285 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 21:47:00,290 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 21:47:00,290 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 21:47:00,311 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 21:47:00,311 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 21:47:00,311 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 21:47:00,311 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 21:47:00,311 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 21:47:00,312 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 21:47:00,312 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 21:47:00,312 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 21:47:00,312 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 21:47:00,312 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 21:47:00,312 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 21:47:00,312 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 21:47:00,312 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 21:47:00,312 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 21:47:00,312 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 21:47:00,312 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 21:47:00,312 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 21:47:00,314 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 21:47:00,314 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 21:47:00,314 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 21:47:00,314 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 21:47:00,314 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 21:47:00,314 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 21:47:00,315 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 21:47:00,315 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 21:47:00,315 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 21:47:00,315 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 21:47:00,315 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 21:47:00,315 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 21:47:00,315 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 21:47:00,315 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 21:47:00,315 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 21:47:00,315 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 21:47:00,315 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 21:47:00,315 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 21:47:00,315 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 21:47:00,315 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 21:47:00,315 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 21:47:00,315 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 -> 5f62dbdf30439c22b90c0714165751cfb1215bac5efc8ba17b86c401a925f47d [2025-02-05 21:47:00,524 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 21:47:00,529 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 21:47:00,532 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 21:47:00,533 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 21:47:00,533 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 21:47:00,534 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-42.i [2025-02-05 21:47:01,694 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/849d5d9bd/d3f9c566e3c44d759faf664731f6bf58/FLAGf058c6091 [2025-02-05 21:47:01,936 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 21:47:01,941 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-42.i [2025-02-05 21:47:01,952 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/849d5d9bd/d3f9c566e3c44d759faf664731f6bf58/FLAGf058c6091 [2025-02-05 21:47:02,269 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/849d5d9bd/d3f9c566e3c44d759faf664731f6bf58 [2025-02-05 21:47:02,272 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 21:47:02,274 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 21:47:02,274 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 21:47:02,275 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 21:47:02,279 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 21:47:02,279 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 09:47:02" (1/1) ... [2025-02-05 21:47:02,280 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@191d48b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:47:02, skipping insertion in model container [2025-02-05 21:47:02,281 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 09:47:02" (1/1) ... [2025-02-05 21:47:02,296 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 21:47:02,388 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_fillercodesize_ps-cn-25_file-42.i[915,928] [2025-02-05 21:47:02,434 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 21:47:02,442 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 21:47:02,448 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_fillercodesize_ps-cn-25_file-42.i[915,928] [2025-02-05 21:47:02,471 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 21:47:02,481 INFO L204 MainTranslator]: Completed translation [2025-02-05 21:47:02,482 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:47:02 WrapperNode [2025-02-05 21:47:02,482 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 21:47:02,483 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 21:47:02,483 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 21:47:02,483 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 21:47:02,487 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:47:02" (1/1) ... [2025-02-05 21:47:02,494 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:47:02" (1/1) ... [2025-02-05 21:47:02,522 INFO L138 Inliner]: procedures = 26, calls = 44, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 222 [2025-02-05 21:47:02,522 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 21:47:02,522 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 21:47:02,522 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 21:47:02,522 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 21:47:02,528 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:47:02" (1/1) ... [2025-02-05 21:47:02,529 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:47:02" (1/1) ... [2025-02-05 21:47:02,536 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:47:02" (1/1) ... [2025-02-05 21:47:02,555 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 21:47:02,556 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:47:02" (1/1) ... [2025-02-05 21:47:02,556 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:47:02" (1/1) ... [2025-02-05 21:47:02,562 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:47:02" (1/1) ... [2025-02-05 21:47:02,564 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:47:02" (1/1) ... [2025-02-05 21:47:02,568 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:47:02" (1/1) ... [2025-02-05 21:47:02,569 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:47:02" (1/1) ... [2025-02-05 21:47:02,571 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 21:47:02,572 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 21:47:02,572 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 21:47:02,572 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 21:47:02,573 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:47:02" (1/1) ... [2025-02-05 21:47:02,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 21:47:02,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:47:02,598 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 21:47:02,604 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 21:47:02,619 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 21:47:02,619 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 21:47:02,619 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 21:47:02,619 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 21:47:02,619 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 21:47:02,619 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 21:47:02,679 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 21:47:02,680 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 21:47:02,962 INFO L? ?]: Removed 27 outVars from TransFormulas that were not future-live. [2025-02-05 21:47:02,962 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 21:47:02,976 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 21:47:02,977 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 21:47:02,977 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 09:47:02 BoogieIcfgContainer [2025-02-05 21:47:02,977 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 21:47:02,979 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 21:47:02,979 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 21:47:02,982 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 21:47:02,983 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 09:47:02" (1/3) ... [2025-02-05 21:47:02,983 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2047653e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 09:47:02, skipping insertion in model container [2025-02-05 21:47:02,984 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:47:02" (2/3) ... [2025-02-05 21:47:02,984 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2047653e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 09:47:02, skipping insertion in model container [2025-02-05 21:47:02,984 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 09:47:02" (3/3) ... [2025-02-05 21:47:02,985 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-42.i [2025-02-05 21:47:02,996 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 21:47:02,998 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-42.i that has 2 procedures, 94 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 21:47:03,044 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 21:47:03,056 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;@41681c1a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 21:47:03,056 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 21:47:03,060 INFO L276 IsEmpty]: Start isEmpty. Operand has 94 states, 60 states have (on average 1.3833333333333333) internal successors, (83), 61 states have internal predecessors, (83), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2025-02-05 21:47:03,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2025-02-05 21:47:03,072 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:47:03,073 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:47:03,073 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:47:03,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:47:03,077 INFO L85 PathProgramCache]: Analyzing trace with hash 866591775, now seen corresponding path program 1 times [2025-02-05 21:47:03,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:47:03,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750354501] [2025-02-05 21:47:03,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:47:03,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:47:03,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-02-05 21:47:03,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-02-05 21:47:03,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:47:03,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:47:03,363 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 1800 trivial. 0 not checked. [2025-02-05 21:47:03,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:47:03,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750354501] [2025-02-05 21:47:03,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750354501] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 21:47:03,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [753434029] [2025-02-05 21:47:03,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:47:03,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:47:03,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:47:03,368 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 21:47:03,370 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 21:47:03,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-02-05 21:47:03,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-02-05 21:47:03,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:47:03,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:47:03,537 INFO L256 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 21:47:03,547 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:47:03,571 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 1800 trivial. 0 not checked. [2025-02-05 21:47:03,572 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 21:47:03,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [753434029] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:47:03,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 21:47:03,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-05 21:47:03,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110166601] [2025-02-05 21:47:03,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:47:03,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 21:47:03,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:47:03,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 21:47:03,593 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 21:47:03,595 INFO L87 Difference]: Start difference. First operand has 94 states, 60 states have (on average 1.3833333333333333) internal successors, (83), 61 states have internal predecessors, (83), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) [2025-02-05 21:47:03,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:47:03,624 INFO L93 Difference]: Finished difference Result 182 states and 316 transitions. [2025-02-05 21:47:03,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 21:47:03,627 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) Word has length 201 [2025-02-05 21:47:03,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:47:03,634 INFO L225 Difference]: With dead ends: 182 [2025-02-05 21:47:03,635 INFO L226 Difference]: Without dead ends: 91 [2025-02-05 21:47:03,641 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 202 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 21:47:03,644 INFO L435 NwaCegarLoop]: 138 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, 138 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 21:47:03,645 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 138 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:47:03,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-02-05 21:47:03,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2025-02-05 21:47:03,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 58 states have (on average 1.3448275862068966) internal successors, (78), 58 states have internal predecessors, (78), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2025-02-05 21:47:03,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 140 transitions. [2025-02-05 21:47:03,687 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 140 transitions. Word has length 201 [2025-02-05 21:47:03,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:47:03,687 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 140 transitions. [2025-02-05 21:47:03,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) [2025-02-05 21:47:03,687 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 140 transitions. [2025-02-05 21:47:03,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2025-02-05 21:47:03,692 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:47:03,692 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:47:03,700 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 21:47:03,893 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 21:47:03,894 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:47:03,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:47:03,894 INFO L85 PathProgramCache]: Analyzing trace with hash 302012962, now seen corresponding path program 1 times [2025-02-05 21:47:03,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:47:03,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571781237] [2025-02-05 21:47:03,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:47:03,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:47:03,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-02-05 21:47:03,999 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-02-05 21:47:03,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:47:03,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:47:04,364 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-02-05 21:47:04,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:47:04,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571781237] [2025-02-05 21:47:04,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571781237] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:47:04,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:47:04,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 21:47:04,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067892989] [2025-02-05 21:47:04,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:47:04,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 21:47:04,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:47:04,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 21:47:04,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 21:47:04,368 INFO L87 Difference]: Start difference. First operand 91 states and 140 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-02-05 21:47:04,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:47:04,575 INFO L93 Difference]: Finished difference Result 268 states and 415 transitions. [2025-02-05 21:47:04,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 21:47:04,575 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 201 [2025-02-05 21:47:04,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:47:04,579 INFO L225 Difference]: With dead ends: 268 [2025-02-05 21:47:04,579 INFO L226 Difference]: Without dead ends: 180 [2025-02-05 21:47:04,579 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 21:47:04,580 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 113 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 21:47:04,580 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 396 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 21:47:04,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2025-02-05 21:47:04,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 159. [2025-02-05 21:47:04,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 94 states have (on average 1.297872340425532) internal successors, (122), 94 states have internal predecessors, (122), 62 states have call successors, (62), 2 states have call predecessors, (62), 2 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62) [2025-02-05 21:47:04,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 246 transitions. [2025-02-05 21:47:04,608 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 246 transitions. Word has length 201 [2025-02-05 21:47:04,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:47:04,612 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 246 transitions. [2025-02-05 21:47:04,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-02-05 21:47:04,613 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 246 transitions. [2025-02-05 21:47:04,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2025-02-05 21:47:04,617 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:47:04,617 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:47:04,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 21:47:04,617 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:47:04,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:47:04,618 INFO L85 PathProgramCache]: Analyzing trace with hash -1736785567, now seen corresponding path program 1 times [2025-02-05 21:47:04,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:47:04,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97275815] [2025-02-05 21:47:04,618 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:47:04,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:47:04,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-02-05 21:47:04,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-02-05 21:47:04,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:47:04,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:47:05,038 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-02-05 21:47:05,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:47:05,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97275815] [2025-02-05 21:47:05,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97275815] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:47:05,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:47:05,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 21:47:05,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077987575] [2025-02-05 21:47:05,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:47:05,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 21:47:05,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:47:05,043 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 21:47:05,043 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 21:47:05,043 INFO L87 Difference]: Start difference. First operand 159 states and 246 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-02-05 21:47:05,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:47:05,371 INFO L93 Difference]: Finished difference Result 379 states and 587 transitions. [2025-02-05 21:47:05,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 21:47:05,372 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 202 [2025-02-05 21:47:05,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:47:05,375 INFO L225 Difference]: With dead ends: 379 [2025-02-05 21:47:05,375 INFO L226 Difference]: Without dead ends: 291 [2025-02-05 21:47:05,376 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-02-05 21:47:05,376 INFO L435 NwaCegarLoop]: 180 mSDtfsCounter, 143 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 21:47:05,376 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 523 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 21:47:05,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2025-02-05 21:47:05,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 245. [2025-02-05 21:47:05,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 148 states have (on average 1.3175675675675675) internal successors, (195), 148 states have internal predecessors, (195), 93 states have call successors, (93), 3 states have call predecessors, (93), 3 states have return successors, (93), 93 states have call predecessors, (93), 93 states have call successors, (93) [2025-02-05 21:47:05,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 381 transitions. [2025-02-05 21:47:05,429 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 381 transitions. Word has length 202 [2025-02-05 21:47:05,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:47:05,431 INFO L471 AbstractCegarLoop]: Abstraction has 245 states and 381 transitions. [2025-02-05 21:47:05,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-02-05 21:47:05,431 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 381 transitions. [2025-02-05 21:47:05,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2025-02-05 21:47:05,434 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:47:05,434 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:47:05,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 21:47:05,435 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:47:05,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:47:05,435 INFO L85 PathProgramCache]: Analyzing trace with hash -229233758, now seen corresponding path program 1 times [2025-02-05 21:47:05,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:47:05,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619630860] [2025-02-05 21:47:05,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:47:05,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:47:05,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-02-05 21:47:05,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-02-05 21:47:05,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:47:05,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:47:05,630 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-02-05 21:47:05,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:47:05,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619630860] [2025-02-05 21:47:05,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619630860] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:47:05,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:47:05,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:47:05,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78815828] [2025-02-05 21:47:05,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:47:05,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:47:05,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:47:05,632 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:47:05,632 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:47:05,633 INFO L87 Difference]: Start difference. First operand 245 states and 381 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, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-02-05 21:47:05,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:47:05,684 INFO L93 Difference]: Finished difference Result 419 states and 653 transitions. [2025-02-05 21:47:05,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:47:05,686 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, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 202 [2025-02-05 21:47:05,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:47:05,688 INFO L225 Difference]: With dead ends: 419 [2025-02-05 21:47:05,688 INFO L226 Difference]: Without dead ends: 245 [2025-02-05 21:47:05,690 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:47:05,692 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 0 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:47:05,693 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 260 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:47:05,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2025-02-05 21:47:05,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 245. [2025-02-05 21:47:05,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 148 states have (on average 1.304054054054054) internal successors, (193), 148 states have internal predecessors, (193), 93 states have call successors, (93), 3 states have call predecessors, (93), 3 states have return successors, (93), 93 states have call predecessors, (93), 93 states have call successors, (93) [2025-02-05 21:47:05,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 379 transitions. [2025-02-05 21:47:05,732 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 379 transitions. Word has length 202 [2025-02-05 21:47:05,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:47:05,732 INFO L471 AbstractCegarLoop]: Abstraction has 245 states and 379 transitions. [2025-02-05 21:47:05,732 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, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-02-05 21:47:05,732 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 379 transitions. [2025-02-05 21:47:05,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2025-02-05 21:47:05,735 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:47:05,735 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:47:05,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 21:47:05,736 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:47:05,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:47:05,737 INFO L85 PathProgramCache]: Analyzing trace with hash -2036688221, now seen corresponding path program 1 times [2025-02-05 21:47:05,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:47:05,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336756336] [2025-02-05 21:47:05,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:47:05,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:47:05,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-02-05 21:47:05,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-02-05 21:47:05,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:47:05,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:47:05,915 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-02-05 21:47:05,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:47:05,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336756336] [2025-02-05 21:47:05,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336756336] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:47:05,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:47:05,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:47:05,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129435877] [2025-02-05 21:47:05,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:47:05,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:47:05,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:47:05,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:47:05,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:47:05,918 INFO L87 Difference]: Start difference. First operand 245 states and 379 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, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-02-05 21:47:05,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:47:05,980 INFO L93 Difference]: Finished difference Result 563 states and 866 transitions. [2025-02-05 21:47:05,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:47:05,981 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, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 202 [2025-02-05 21:47:05,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:47:05,986 INFO L225 Difference]: With dead ends: 563 [2025-02-05 21:47:05,987 INFO L226 Difference]: Without dead ends: 387 [2025-02-05 21:47:05,988 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:47:05,989 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 103 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:47:05,990 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 256 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:47:05,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2025-02-05 21:47:06,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 383. [2025-02-05 21:47:06,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 233 states have (on average 1.296137339055794) internal successors, (302), 235 states have internal predecessors, (302), 143 states have call successors, (143), 6 states have call predecessors, (143), 6 states have return successors, (143), 141 states have call predecessors, (143), 143 states have call successors, (143) [2025-02-05 21:47:06,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 588 transitions. [2025-02-05 21:47:06,058 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 588 transitions. Word has length 202 [2025-02-05 21:47:06,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:47:06,059 INFO L471 AbstractCegarLoop]: Abstraction has 383 states and 588 transitions. [2025-02-05 21:47:06,059 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, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-02-05 21:47:06,060 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 588 transitions. [2025-02-05 21:47:06,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2025-02-05 21:47:06,061 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:47:06,061 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:47:06,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 21:47:06,061 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:47:06,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:47:06,061 INFO L85 PathProgramCache]: Analyzing trace with hash 1261206722, now seen corresponding path program 1 times [2025-02-05 21:47:06,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:47:06,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295710026] [2025-02-05 21:47:06,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:47:06,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:47:06,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-02-05 21:47:06,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-02-05 21:47:06,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:47:06,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:47:06,665 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 51 proven. 123 refuted. 0 times theorem prover too weak. 1686 trivial. 0 not checked. [2025-02-05 21:47:06,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:47:06,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295710026] [2025-02-05 21:47:06,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295710026] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 21:47:06,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [680063250] [2025-02-05 21:47:06,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:47:06,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:47:06,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:47:06,668 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 21:47:06,669 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 21:47:06,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-02-05 21:47:06,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-02-05 21:47:06,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:47:06,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:47:06,786 INFO L256 TraceCheckSpWp]: Trace formula consists of 471 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-02-05 21:47:06,790 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:47:07,505 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 947 proven. 123 refuted. 0 times theorem prover too weak. 790 trivial. 0 not checked. [2025-02-05 21:47:07,505 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 21:47:08,009 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 51 proven. 126 refuted. 0 times theorem prover too weak. 1683 trivial. 0 not checked. [2025-02-05 21:47:08,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [680063250] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 21:47:08,009 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 21:47:08,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 15 [2025-02-05 21:47:08,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622346867] [2025-02-05 21:47:08,009 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 21:47:08,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-05 21:47:08,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:47:08,011 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-05 21:47:08,011 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2025-02-05 21:47:08,011 INFO L87 Difference]: Start difference. First operand 383 states and 588 transitions. Second operand has 15 states, 15 states have (on average 5.6) internal successors, (84), 15 states have internal predecessors, (84), 3 states have call successors, (54), 3 states have call predecessors, (54), 7 states have return successors, (56), 3 states have call predecessors, (56), 3 states have call successors, (56) [2025-02-05 21:47:09,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:47:09,084 INFO L93 Difference]: Finished difference Result 1165 states and 1691 transitions. [2025-02-05 21:47:09,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2025-02-05 21:47:09,085 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.6) internal successors, (84), 15 states have internal predecessors, (84), 3 states have call successors, (54), 3 states have call predecessors, (54), 7 states have return successors, (56), 3 states have call predecessors, (56), 3 states have call successors, (56) Word has length 202 [2025-02-05 21:47:09,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:47:09,093 INFO L225 Difference]: With dead ends: 1165 [2025-02-05 21:47:09,093 INFO L226 Difference]: Without dead ends: 1012 [2025-02-05 21:47:09,094 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 447 GetRequests, 400 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 557 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=578, Invalid=1584, Unknown=0, NotChecked=0, Total=2162 [2025-02-05 21:47:09,095 INFO L435 NwaCegarLoop]: 184 mSDtfsCounter, 388 mSDsluCounter, 726 mSDsCounter, 0 mSdLazyCounter, 880 mSolverCounterSat, 162 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 421 SdHoareTripleChecker+Valid, 910 SdHoareTripleChecker+Invalid, 1042 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 162 IncrementalHoareTripleChecker+Valid, 880 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 21:47:09,095 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [421 Valid, 910 Invalid, 1042 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [162 Valid, 880 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 21:47:09,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1012 states. [2025-02-05 21:47:09,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1012 to 608. [2025-02-05 21:47:09,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 608 states, 386 states have (on average 1.2694300518134716) internal successors, (490), 389 states have internal predecessors, (490), 199 states have call successors, (199), 22 states have call predecessors, (199), 22 states have return successors, (199), 196 states have call predecessors, (199), 199 states have call successors, (199) [2025-02-05 21:47:09,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 888 transitions. [2025-02-05 21:47:09,169 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 888 transitions. Word has length 202 [2025-02-05 21:47:09,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:47:09,169 INFO L471 AbstractCegarLoop]: Abstraction has 608 states and 888 transitions. [2025-02-05 21:47:09,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.6) internal successors, (84), 15 states have internal predecessors, (84), 3 states have call successors, (54), 3 states have call predecessors, (54), 7 states have return successors, (56), 3 states have call predecessors, (56), 3 states have call successors, (56) [2025-02-05 21:47:09,169 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 888 transitions. [2025-02-05 21:47:09,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2025-02-05 21:47:09,170 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:47:09,170 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:47:09,177 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 21:47:09,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:47:09,375 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:47:09,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:47:09,376 INFO L85 PathProgramCache]: Analyzing trace with hash 755648097, now seen corresponding path program 1 times [2025-02-05 21:47:09,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:47:09,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051379652] [2025-02-05 21:47:09,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:47:09,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:47:09,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-02-05 21:47:09,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-02-05 21:47:09,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:47:09,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-05 21:47:09,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [491929850] [2025-02-05 21:47:09,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:47:09,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:47:09,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:47:09,460 INFO L229 MonitoredProcess]: Starting monitored process 4 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 21:47:09,462 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-05 21:47:09,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-02-05 21:47:09,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-02-05 21:47:09,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:47:09,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:47:09,567 INFO L256 TraceCheckSpWp]: Trace formula consists of 469 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-02-05 21:47:09,571 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:47:10,268 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 258 proven. 84 refuted. 0 times theorem prover too weak. 1518 trivial. 0 not checked. [2025-02-05 21:47:10,268 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 21:47:10,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:47:10,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051379652] [2025-02-05 21:47:10,683 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-05 21:47:10,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [491929850] [2025-02-05 21:47:10,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [491929850] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 21:47:10,683 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-02-05 21:47:10,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2025-02-05 21:47:10,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984954892] [2025-02-05 21:47:10,684 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-02-05 21:47:10,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 21:47:10,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:47:10,684 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 21:47:10,684 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-02-05 21:47:10,684 INFO L87 Difference]: Start difference. First operand 608 states and 888 transitions. Second operand has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 8 states have internal predecessors, (56), 2 states have call successors, (31), 2 states have call predecessors, (31), 3 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-02-05 21:47:11,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:47:11,290 INFO L93 Difference]: Finished difference Result 1747 states and 2478 transitions. [2025-02-05 21:47:11,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-05 21:47:11,291 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 8 states have internal predecessors, (56), 2 states have call successors, (31), 2 states have call predecessors, (31), 3 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 202 [2025-02-05 21:47:11,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:47:11,297 INFO L225 Difference]: With dead ends: 1747 [2025-02-05 21:47:11,298 INFO L226 Difference]: Without dead ends: 1413 [2025-02-05 21:47:11,299 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 394 GetRequests, 372 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=163, Invalid=389, Unknown=0, NotChecked=0, Total=552 [2025-02-05 21:47:11,300 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 204 mSDsluCounter, 600 mSDsCounter, 0 mSdLazyCounter, 479 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 724 SdHoareTripleChecker+Invalid, 559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 21:47:11,300 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 724 Invalid, 559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 479 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 21:47:11,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1413 states. [2025-02-05 21:47:11,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1413 to 1233. [2025-02-05 21:47:11,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1233 states, 806 states have (on average 1.2617866004962779) internal successors, (1017), 816 states have internal predecessors, (1017), 375 states have call successors, (375), 51 states have call predecessors, (375), 51 states have return successors, (375), 365 states have call predecessors, (375), 375 states have call successors, (375) [2025-02-05 21:47:11,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1233 states to 1233 states and 1767 transitions. [2025-02-05 21:47:11,425 INFO L78 Accepts]: Start accepts. Automaton has 1233 states and 1767 transitions. Word has length 202 [2025-02-05 21:47:11,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:47:11,426 INFO L471 AbstractCegarLoop]: Abstraction has 1233 states and 1767 transitions. [2025-02-05 21:47:11,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 8 states have internal predecessors, (56), 2 states have call successors, (31), 2 states have call predecessors, (31), 3 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-02-05 21:47:11,426 INFO L276 IsEmpty]: Start isEmpty. Operand 1233 states and 1767 transitions. [2025-02-05 21:47:11,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2025-02-05 21:47:11,430 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:47:11,430 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:47:11,437 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-05 21:47:11,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:47:11,631 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:47:11,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:47:11,631 INFO L85 PathProgramCache]: Analyzing trace with hash 462245090, now seen corresponding path program 1 times [2025-02-05 21:47:11,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:47:11,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134394209] [2025-02-05 21:47:11,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:47:11,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:47:11,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-02-05 21:47:11,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-02-05 21:47:11,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:47:11,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-05 21:47:11,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1676046722] [2025-02-05 21:47:11,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:47:11,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:47:11,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:47:11,716 INFO L229 MonitoredProcess]: Starting monitored process 5 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 21:47:11,718 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-05 21:47:11,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-02-05 21:47:11,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-02-05 21:47:11,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:47:11,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:47:11,819 INFO L256 TraceCheckSpWp]: Trace formula consists of 467 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-02-05 21:47:11,839 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:47:13,391 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 258 proven. 84 refuted. 0 times theorem prover too weak. 1518 trivial. 0 not checked. [2025-02-05 21:47:13,391 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 21:47:13,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:47:13,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134394209] [2025-02-05 21:47:13,913 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-05 21:47:13,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1676046722] [2025-02-05 21:47:13,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1676046722] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 21:47:13,913 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-02-05 21:47:13,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2025-02-05 21:47:13,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388781154] [2025-02-05 21:47:13,914 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-02-05 21:47:13,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 21:47:13,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:47:13,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 21:47:13,915 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2025-02-05 21:47:13,915 INFO L87 Difference]: Start difference. First operand 1233 states and 1767 transitions. Second operand has 10 states, 10 states have (on average 5.6) internal successors, (56), 9 states have internal predecessors, (56), 2 states have call successors, (31), 2 states have call predecessors, (31), 3 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-02-05 21:47:14,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:47:14,740 INFO L93 Difference]: Finished difference Result 2370 states and 3386 transitions. [2025-02-05 21:47:14,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-05 21:47:14,742 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 9 states have internal predecessors, (56), 2 states have call successors, (31), 2 states have call predecessors, (31), 3 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 202 [2025-02-05 21:47:14,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:47:14,751 INFO L225 Difference]: With dead ends: 2370 [2025-02-05 21:47:14,753 INFO L226 Difference]: Without dead ends: 1861 [2025-02-05 21:47:14,755 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 394 GetRequests, 370 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=183, Invalid=467, Unknown=0, NotChecked=0, Total=650 [2025-02-05 21:47:14,755 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 181 mSDsluCounter, 722 mSDsCounter, 0 mSdLazyCounter, 608 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 859 SdHoareTripleChecker+Invalid, 683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 21:47:14,755 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 859 Invalid, 683 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 608 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 21:47:14,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1861 states. [2025-02-05 21:47:14,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1861 to 1581. [2025-02-05 21:47:14,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1581 states, 1026 states have (on average 1.2543859649122806) internal successors, (1287), 1038 states have internal predecessors, (1287), 487 states have call successors, (487), 67 states have call predecessors, (487), 67 states have return successors, (487), 475 states have call predecessors, (487), 487 states have call successors, (487) [2025-02-05 21:47:14,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1581 states to 1581 states and 2261 transitions. [2025-02-05 21:47:14,889 INFO L78 Accepts]: Start accepts. Automaton has 1581 states and 2261 transitions. Word has length 202 [2025-02-05 21:47:14,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:47:14,889 INFO L471 AbstractCegarLoop]: Abstraction has 1581 states and 2261 transitions. [2025-02-05 21:47:14,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 9 states have internal predecessors, (56), 2 states have call successors, (31), 2 states have call predecessors, (31), 3 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-02-05 21:47:14,890 INFO L276 IsEmpty]: Start isEmpty. Operand 1581 states and 2261 transitions. [2025-02-05 21:47:14,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-02-05 21:47:14,893 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:47:14,893 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:47:14,900 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-05 21:47:15,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-02-05 21:47:15,095 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:47:15,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:47:15,095 INFO L85 PathProgramCache]: Analyzing trace with hash 94831587, now seen corresponding path program 1 times [2025-02-05 21:47:15,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:47:15,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585672471] [2025-02-05 21:47:15,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:47:15,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:47:15,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-02-05 21:47:15,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-02-05 21:47:15,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:47:15,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-05 21:47:15,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1313657217] [2025-02-05 21:47:15,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:47:15,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:47:15,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:47:15,191 INFO L229 MonitoredProcess]: Starting monitored process 6 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 21:47:15,193 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-05 21:47:15,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-02-05 21:47:15,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-02-05 21:47:15,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:47:15,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 21:47:15,297 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-05 21:47:15,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-02-05 21:47:15,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-02-05 21:47:15,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:47:15,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 21:47:15,449 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-05 21:47:15,450 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-05 21:47:15,451 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-05 21:47:15,459 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-05 21:47:15,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:47:15,655 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:47:15,768 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-05 21:47:15,770 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 09:47:15 BoogieIcfgContainer [2025-02-05 21:47:15,771 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-05 21:47:15,771 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-05 21:47:15,771 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-05 21:47:15,771 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-05 21:47:15,772 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 09:47:02" (3/4) ... [2025-02-05 21:47:15,774 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-05 21:47:15,774 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-05 21:47:15,775 INFO L158 Benchmark]: Toolchain (without parser) took 13501.48ms. Allocated memory was 142.6MB in the beginning and 268.4MB in the end (delta: 125.8MB). Free memory was 113.4MB in the beginning and 148.7MB in the end (delta: -35.2MB). Peak memory consumption was 93.6MB. Max. memory is 16.1GB. [2025-02-05 21:47:15,776 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 125.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 21:47:15,776 INFO L158 Benchmark]: CACSL2BoogieTranslator took 207.94ms. Allocated memory is still 142.6MB. Free memory was 113.0MB in the beginning and 97.7MB in the end (delta: 15.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-05 21:47:15,776 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.13ms. Allocated memory is still 142.6MB. Free memory was 97.7MB in the beginning and 94.1MB in the end (delta: 3.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 21:47:15,777 INFO L158 Benchmark]: Boogie Preprocessor took 49.28ms. Allocated memory is still 142.6MB. Free memory was 94.1MB in the beginning and 88.9MB in the end (delta: 5.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 21:47:15,777 INFO L158 Benchmark]: IcfgBuilder took 405.03ms. Allocated memory is still 142.6MB. Free memory was 88.9MB in the beginning and 62.0MB in the end (delta: 26.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-05 21:47:15,777 INFO L158 Benchmark]: TraceAbstraction took 12791.69ms. Allocated memory was 142.6MB in the beginning and 268.4MB in the end (delta: 125.8MB). Free memory was 61.2MB in the beginning and 151.2MB in the end (delta: -90.0MB). Peak memory consumption was 34.9MB. Max. memory is 16.1GB. [2025-02-05 21:47:15,778 INFO L158 Benchmark]: Witness Printer took 3.40ms. Allocated memory is still 268.4MB. Free memory was 151.2MB in the beginning and 148.7MB in the end (delta: 2.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 21:47:15,779 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 125.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 207.94ms. Allocated memory is still 142.6MB. Free memory was 113.0MB in the beginning and 97.7MB in the end (delta: 15.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.13ms. Allocated memory is still 142.6MB. Free memory was 97.7MB in the beginning and 94.1MB in the end (delta: 3.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 49.28ms. Allocated memory is still 142.6MB. Free memory was 94.1MB in the beginning and 88.9MB in the end (delta: 5.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 405.03ms. Allocated memory is still 142.6MB. Free memory was 88.9MB in the beginning and 62.0MB in the end (delta: 26.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 12791.69ms. Allocated memory was 142.6MB in the beginning and 268.4MB in the end (delta: 125.8MB). Free memory was 61.2MB in the beginning and 151.2MB in the end (delta: -90.0MB). Peak memory consumption was 34.9MB. Max. memory is 16.1GB. * Witness Printer took 3.40ms. Allocated memory is still 268.4MB. Free memory was 151.2MB in the beginning and 148.7MB in the end (delta: 2.5MB). 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 186, overapproximation of someBinaryFLOATComparisonOperation at line 118, overapproximation of someBinaryFLOATComparisonOperation at line 144, overapproximation of someBinaryFLOATComparisonOperation at line 87, overapproximation of someBinaryFLOATComparisonOperation at line 171, overapproximation of someBinaryFLOATComparisonOperation at line 177, overapproximation of someBinaryFLOATComparisonOperation at line 69, overapproximation of someBinaryFLOATComparisonOperation at line 173, overapproximation of someBinaryFLOATComparisonOperation at line 142, overapproximation of someBinaryFLOATComparisonOperation at line 175, overapproximation of someUnaryDOUBLEoperation at line 30, overapproximation of someBinaryArithmeticFLOAToperation at line 69. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 16; [L23] signed char var_1_5 = -8; [L24] unsigned char var_1_6 = 10; [L25] unsigned char var_1_7 = 128; [L26] unsigned char var_1_8 = 1; [L27] unsigned char var_1_11 = 0; [L28] unsigned char var_1_12 = 0; [L29] signed short int var_1_13 = 200; [L30] float var_1_14 = -0.8; [L31] float var_1_15 = 127.25; [L32] float var_1_16 = 3.5; [L33] unsigned short int var_1_17 = 16; [L34] unsigned char var_1_19 = 1; [L35] unsigned char var_1_20 = 0; [L36] unsigned char var_1_21 = 0; [L37] unsigned char var_1_22 = 0; [L38] unsigned char var_1_23 = 1; [L39] signed short int var_1_24 = -32; [L40] unsigned char var_1_25 = 1; [L41] float var_1_26 = 500.65; [L42] signed long int var_1_27 = -8; [L43] unsigned long int var_1_28 = 10; [L44] signed short int var_1_29 = -256; [L45] signed char var_1_30 = 1; [L46] float var_1_31 = 7.8; [L47] float var_1_32 = 63.25; [L48] float var_1_33 = 0.4; [L49] float var_1_34 = 64.875; [L50] float var_1_35 = 1.3; [L51] unsigned short int var_1_36 = 100; [L52] signed short int last_1_var_1_1 = 16; [L53] unsigned char last_1_var_1_6 = 10; [L54] unsigned char last_1_var_1_8 = 1; [L55] signed short int last_1_var_1_13 = 200; VAL [isInitial=0, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=-8, var_1_6=10, var_1_7=128, var_1_8=1] [L190] isInitial = 1 [L191] FCALL initially() [L192] COND TRUE 1 [L193] CALL updateLastVariables() [L180] last_1_var_1_1 = var_1_1 [L181] last_1_var_1_6 = var_1_6 [L182] last_1_var_1_8 = var_1_8 [L183] last_1_var_1_13 = var_1_13 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=-8, var_1_6=10, var_1_7=128, var_1_8=1] [L193] RET updateLastVariables() [L194] CALL updateVariables() [L129] var_1_5 = __VERIFIER_nondet_char() [L130] CALL assume_abort_if_not(var_1_5 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=127, var_1_6=10, var_1_7=128, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=127, var_1_6=10, var_1_7=128, var_1_8=1] [L130] RET assume_abort_if_not(var_1_5 >= -127) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=127, var_1_6=10, var_1_7=128, var_1_8=1] [L131] CALL assume_abort_if_not(var_1_5 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=127, var_1_6=10, var_1_7=128, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=127, var_1_6=10, var_1_7=128, var_1_8=1] [L131] RET assume_abort_if_not(var_1_5 <= 127) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=127, var_1_6=10, var_1_7=128, var_1_8=1] [L132] var_1_7 = __VERIFIER_nondet_uchar() [L133] CALL assume_abort_if_not(var_1_7 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L133] RET assume_abort_if_not(var_1_7 >= 127) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L134] CALL assume_abort_if_not(var_1_7 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L134] RET assume_abort_if_not(var_1_7 <= 254) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L135] var_1_11 = __VERIFIER_nondet_uchar() [L136] CALL assume_abort_if_not(var_1_11 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L136] RET assume_abort_if_not(var_1_11 >= 1) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L137] CALL assume_abort_if_not(var_1_11 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L137] RET assume_abort_if_not(var_1_11 <= 1) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L138] var_1_12 = __VERIFIER_nondet_uchar() [L139] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L139] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L140] CALL assume_abort_if_not(var_1_12 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L140] RET assume_abort_if_not(var_1_12 <= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L141] var_1_15 = __VERIFIER_nondet_float() [L142] CALL assume_abort_if_not((var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L142] RET assume_abort_if_not((var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L143] var_1_16 = __VERIFIER_nondet_float() [L144] CALL assume_abort_if_not((var_1_16 >= -461168.6018427382800e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427382800e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L144] RET assume_abort_if_not((var_1_16 >= -461168.6018427382800e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427382800e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L145] var_1_20 = __VERIFIER_nondet_uchar() [L146] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L146] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L147] CALL assume_abort_if_not(var_1_20 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L147] RET assume_abort_if_not(var_1_20 <= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L148] var_1_22 = __VERIFIER_nondet_uchar() [L149] CALL assume_abort_if_not(var_1_22 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L149] RET assume_abort_if_not(var_1_22 >= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L150] CALL assume_abort_if_not(var_1_22 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L150] RET assume_abort_if_not(var_1_22 <= 1) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L151] var_1_23 = __VERIFIER_nondet_uchar() [L152] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L152] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L153] CALL assume_abort_if_not(var_1_23 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L153] RET assume_abort_if_not(var_1_23 <= 1) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L154] var_1_24 = __VERIFIER_nondet_short() [L155] CALL assume_abort_if_not(var_1_24 >= -32768) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=1, var_1_24=-27, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=1, var_1_24=-27, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L155] RET assume_abort_if_not(var_1_24 >= -32768) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=1, var_1_24=-27, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L156] CALL assume_abort_if_not(var_1_24 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=1, var_1_24=-27, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=1, var_1_24=-27, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L156] RET assume_abort_if_not(var_1_24 <= 32767) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=1, var_1_24=-27, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L157] var_1_25 = __VERIFIER_nondet_uchar() [L158] CALL assume_abort_if_not(var_1_25 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=1, var_1_24=-27, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=1, var_1_24=-27, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L158] RET assume_abort_if_not(var_1_25 >= 1) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=1, var_1_24=-27, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L159] CALL assume_abort_if_not(var_1_25 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=1, var_1_24=-27, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=1, var_1_24=-27, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L159] RET assume_abort_if_not(var_1_25 <= 1) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=1, var_1_24=-27, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L160] var_1_27 = __VERIFIER_nondet_long() [L161] CALL assume_abort_if_not(var_1_27 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=1, var_1_24=-27, var_1_25=1, var_1_26=10013/20, var_1_27=-28, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=1, var_1_24=-27, var_1_25=1, var_1_26=10013/20, var_1_27=-28, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L161] RET assume_abort_if_not(var_1_27 >= -2147483648) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=1, var_1_24=-27, var_1_25=1, var_1_26=10013/20, var_1_27=-28, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L162] CALL assume_abort_if_not(var_1_27 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=1, var_1_24=-27, var_1_25=1, var_1_26=10013/20, var_1_27=-28, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=1, var_1_24=-27, var_1_25=1, var_1_26=10013/20, var_1_27=-28, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L162] RET assume_abort_if_not(var_1_27 <= 2147483647) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=1, var_1_24=-27, var_1_25=1, var_1_26=10013/20, var_1_27=-28, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L163] CALL assume_abort_if_not(var_1_27 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=1, var_1_24=-27, var_1_25=1, var_1_26=10013/20, var_1_27=-28, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=1, var_1_24=-27, var_1_25=1, var_1_26=10013/20, var_1_27=-28, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L163] RET assume_abort_if_not(var_1_27 != 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=1, var_1_24=-27, var_1_25=1, var_1_26=10013/20, var_1_27=-28, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L164] var_1_29 = __VERIFIER_nondet_short() [L165] CALL assume_abort_if_not(var_1_29 >= -32768) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=1, var_1_24=-27, var_1_25=1, var_1_26=10013/20, var_1_27=-28, var_1_28=10, var_1_29=-29, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=1, var_1_24=-27, var_1_25=1, var_1_26=10013/20, var_1_27=-28, var_1_28=10, var_1_29=-29, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L165] RET assume_abort_if_not(var_1_29 >= -32768) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=1, var_1_24=-27, var_1_25=1, var_1_26=10013/20, var_1_27=-28, var_1_28=10, var_1_29=-29, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L166] CALL assume_abort_if_not(var_1_29 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=1, var_1_24=-27, var_1_25=1, var_1_26=10013/20, var_1_27=-28, var_1_28=10, var_1_29=-29, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=1, var_1_24=-27, var_1_25=1, var_1_26=10013/20, var_1_27=-28, var_1_28=10, var_1_29=-29, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L166] RET assume_abort_if_not(var_1_29 <= 32767) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=1, var_1_24=-27, var_1_25=1, var_1_26=10013/20, var_1_27=-28, var_1_28=10, var_1_29=-29, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L167] var_1_30 = __VERIFIER_nondet_char() [L168] CALL assume_abort_if_not(var_1_30 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=1, var_1_24=-27, var_1_25=1, var_1_26=10013/20, var_1_27=-28, var_1_28=10, var_1_29=-29, var_1_30=0, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=1, var_1_24=-27, var_1_25=1, var_1_26=10013/20, var_1_27=-28, var_1_28=10, var_1_29=-29, var_1_30=0, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L168] RET assume_abort_if_not(var_1_30 >= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=1, var_1_24=-27, var_1_25=1, var_1_26=10013/20, var_1_27=-28, var_1_28=10, var_1_29=-29, var_1_30=0, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L169] CALL assume_abort_if_not(var_1_30 <= 16) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=1, var_1_24=-27, var_1_25=1, var_1_26=10013/20, var_1_27=-28, var_1_28=10, var_1_29=-29, var_1_30=0, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=1, var_1_24=-27, var_1_25=1, var_1_26=10013/20, var_1_27=-28, var_1_28=10, var_1_29=-29, var_1_30=0, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L169] RET assume_abort_if_not(var_1_30 <= 16) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=1, var_1_24=-27, var_1_25=1, var_1_26=10013/20, var_1_27=-28, var_1_28=10, var_1_29=-29, var_1_30=0, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L170] var_1_32 = __VERIFIER_nondet_float() [L171] CALL assume_abort_if_not((var_1_32 >= -461168.6018427382800e+13F && var_1_32 <= -1.0e-20F) || (var_1_32 <= 4611686.018427382800e+12F && var_1_32 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=1, var_1_24=-27, var_1_25=1, var_1_26=10013/20, var_1_27=-28, var_1_28=10, var_1_29=-29, var_1_30=0, var_1_31=39/5, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=1, var_1_24=-27, var_1_25=1, var_1_26=10013/20, var_1_27=-28, var_1_28=10, var_1_29=-29, var_1_30=0, var_1_31=39/5, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L171] RET assume_abort_if_not((var_1_32 >= -461168.6018427382800e+13F && var_1_32 <= -1.0e-20F) || (var_1_32 <= 4611686.018427382800e+12F && var_1_32 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=1, var_1_24=-27, var_1_25=1, var_1_26=10013/20, var_1_27=-28, var_1_28=10, var_1_29=-29, var_1_30=0, var_1_31=39/5, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L172] var_1_33 = __VERIFIER_nondet_float() [L173] CALL assume_abort_if_not((var_1_33 >= -461168.6018427382800e+13F && var_1_33 <= -1.0e-20F) || (var_1_33 <= 4611686.018427382800e+12F && var_1_33 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=1, var_1_24=-27, var_1_25=1, var_1_26=10013/20, var_1_27=-28, var_1_28=10, var_1_29=-29, var_1_30=0, var_1_31=39/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=1, var_1_24=-27, var_1_25=1, var_1_26=10013/20, var_1_27=-28, var_1_28=10, var_1_29=-29, var_1_30=0, var_1_31=39/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L173] RET assume_abort_if_not((var_1_33 >= -461168.6018427382800e+13F && var_1_33 <= -1.0e-20F) || (var_1_33 <= 4611686.018427382800e+12F && var_1_33 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=1, var_1_24=-27, var_1_25=1, var_1_26=10013/20, var_1_27=-28, var_1_28=10, var_1_29=-29, var_1_30=0, var_1_31=39/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L174] var_1_34 = __VERIFIER_nondet_float() [L175] CALL assume_abort_if_not((var_1_34 >= -461168.6018427382800e+13F && var_1_34 <= -1.0e-20F) || (var_1_34 <= 4611686.018427382800e+12F && var_1_34 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=1, var_1_24=-27, var_1_25=1, var_1_26=10013/20, var_1_27=-28, var_1_28=10, var_1_29=-29, var_1_30=0, var_1_31=39/5, var_1_35=13/10, var_1_36=100, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=1, var_1_24=-27, var_1_25=1, var_1_26=10013/20, var_1_27=-28, var_1_28=10, var_1_29=-29, var_1_30=0, var_1_31=39/5, var_1_35=13/10, var_1_36=100, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L175] RET assume_abort_if_not((var_1_34 >= -461168.6018427382800e+13F && var_1_34 <= -1.0e-20F) || (var_1_34 <= 4611686.018427382800e+12F && var_1_34 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=1, var_1_24=-27, var_1_25=1, var_1_26=10013/20, var_1_27=-28, var_1_28=10, var_1_29=-29, var_1_30=0, var_1_31=39/5, var_1_35=13/10, var_1_36=100, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L176] var_1_35 = __VERIFIER_nondet_float() [L177] CALL assume_abort_if_not((var_1_35 >= -922337.2036854765600e+13F && var_1_35 <= -1.0e-20F) || (var_1_35 <= 9223372.036854765600e+12F && var_1_35 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=1, var_1_24=-27, var_1_25=1, var_1_26=10013/20, var_1_27=-28, var_1_28=10, var_1_29=-29, var_1_30=0, var_1_31=39/5, var_1_36=100, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=1, var_1_24=-27, var_1_25=1, var_1_26=10013/20, var_1_27=-28, var_1_28=10, var_1_29=-29, var_1_30=0, var_1_31=39/5, var_1_36=100, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L177] RET assume_abort_if_not((var_1_35 >= -922337.2036854765600e+13F && var_1_35 <= -1.0e-20F) || (var_1_35 <= 9223372.036854765600e+12F && var_1_35 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=1, var_1_24=-27, var_1_25=1, var_1_26=10013/20, var_1_27=-28, var_1_28=10, var_1_29=-29, var_1_30=0, var_1_31=39/5, var_1_36=100, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L194] RET updateVariables() [L195] CALL step() [L59] COND TRUE var_1_22 || var_1_23 [L60] var_1_21 = ((var_1_24 > -4) || var_1_25) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_22=-255, var_1_23=1, var_1_24=-27, var_1_25=1, var_1_26=10013/20, var_1_27=-28, var_1_28=10, var_1_29=-29, var_1_30=0, var_1_31=39/5, var_1_36=100, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L62] COND TRUE ((var_1_24 + 25) % var_1_27) < 2 [L63] var_1_26 = 8.5f VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_22=-255, var_1_23=1, var_1_24=-27, var_1_25=1, var_1_26=17/2, var_1_27=-28, var_1_28=10, var_1_29=-29, var_1_30=0, var_1_31=39/5, var_1_36=100, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L65] EXPR var_1_29 >> var_1_30 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_22=-255, var_1_23=1, var_1_24=-27, var_1_25=1, var_1_26=17/2, var_1_27=-28, var_1_28=10, var_1_29=-29, var_1_30=0, var_1_31=39/5, var_1_36=100, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L65] EXPR ((var_1_27) > ((var_1_29 >> var_1_30))) ? (var_1_27) : ((var_1_29 >> var_1_30)) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_22=-255, var_1_23=1, var_1_24=-27, var_1_25=1, var_1_26=17/2, var_1_27=-28, var_1_28=10, var_1_29=-29, var_1_30=0, var_1_31=39/5, var_1_36=100, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L65] COND TRUE var_1_24 > ((((var_1_27) > ((var_1_29 >> var_1_30))) ? (var_1_27) : ((var_1_29 >> var_1_30)))) [L66] var_1_28 = var_1_30 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_22=-255, var_1_23=1, var_1_24=-27, var_1_25=1, var_1_26=17/2, var_1_27=-28, var_1_28=0, var_1_29=-29, var_1_30=0, var_1_31=39/5, var_1_36=100, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L68] COND TRUE var_1_27 > var_1_28 [L69] var_1_31 = (((((var_1_32 + ((((var_1_33) > (var_1_34)) ? (var_1_33) : (var_1_34))))) > (var_1_35)) ? ((var_1_32 + ((((var_1_33) > (var_1_34)) ? (var_1_33) : (var_1_34))))) : (var_1_35))) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_22=-255, var_1_23=1, var_1_24=-27, var_1_25=1, var_1_26=17/2, var_1_27=-28, var_1_28=0, var_1_29=-29, var_1_30=0, var_1_31=2, var_1_35=0, var_1_36=100, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L73] COND FALSE !(((((var_1_28) < 0 ) ? -(var_1_28) : (var_1_28))) < var_1_30) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_22=-255, var_1_23=1, var_1_24=-27, var_1_25=1, var_1_26=17/2, var_1_27=-28, var_1_28=0, var_1_29=-29, var_1_30=0, var_1_31=2, var_1_35=0, var_1_36=100, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L76] signed long int stepLocal_6 = last_1_var_1_1; [L77] unsigned char stepLocal_5 = ((((last_1_var_1_1) < (8)) ? (last_1_var_1_1) : (8))) <= var_1_5; VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_5=1, stepLocal_6=16, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_22=-255, var_1_23=1, var_1_24=-27, var_1_25=1, var_1_26=17/2, var_1_27=-28, var_1_28=0, var_1_29=-29, var_1_30=0, var_1_31=2, var_1_35=0, var_1_36=100, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L78] COND TRUE stepLocal_5 || last_1_var_1_8 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_6=16, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_22=-255, var_1_23=1, var_1_24=-27, var_1_25=1, var_1_26=17/2, var_1_27=-28, var_1_28=0, var_1_29=-29, var_1_30=0, var_1_31=2, var_1_35=0, var_1_36=100, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L79] COND FALSE !(stepLocal_6 <= last_1_var_1_6) [L82] var_1_14 = var_1_16 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=3, var_1_16=3, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_22=-255, var_1_23=1, var_1_24=-27, var_1_25=1, var_1_26=17/2, var_1_27=-28, var_1_28=0, var_1_29=-29, var_1_30=0, var_1_31=2, var_1_35=0, var_1_36=100, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L87] COND FALSE !(var_1_14 <= var_1_15) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=3, var_1_16=3, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_22=-255, var_1_23=1, var_1_24=-27, var_1_25=1, var_1_26=17/2, var_1_27=-28, var_1_28=0, var_1_29=-29, var_1_30=0, var_1_31=2, var_1_35=0, var_1_36=100, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L90] COND TRUE var_1_5 >= -2 [L91] var_1_6 = (var_1_7 - 100) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=3, var_1_16=3, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_22=-255, var_1_23=1, var_1_24=-27, var_1_25=1, var_1_26=17/2, var_1_27=-28, var_1_28=0, var_1_29=-29, var_1_30=0, var_1_31=2, var_1_35=0, var_1_36=100, var_1_5=127, var_1_6=154, var_1_7=-2, var_1_8=1] [L93] unsigned char stepLocal_4 = var_1_6; [L94] signed long int stepLocal_3 = var_1_6 / var_1_7; VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_3=0, stepLocal_4=154, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=3, var_1_16=3, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_22=-255, var_1_23=1, var_1_24=-27, var_1_25=1, var_1_26=17/2, var_1_27=-28, var_1_28=0, var_1_29=-29, var_1_30=0, var_1_31=2, var_1_35=0, var_1_36=100, var_1_5=127, var_1_6=154, var_1_7=-2, var_1_8=1] [L95] COND TRUE last_1_var_1_13 >= stepLocal_3 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_4=154, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=3, var_1_16=3, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_22=-255, var_1_23=1, var_1_24=-27, var_1_25=1, var_1_26=17/2, var_1_27=-28, var_1_28=0, var_1_29=-29, var_1_30=0, var_1_31=2, var_1_35=0, var_1_36=100, var_1_5=127, var_1_6=154, var_1_7=-2, var_1_8=1] [L96] COND TRUE stepLocal_4 != ((((((((var_1_6) > (last_1_var_1_13)) ? (var_1_6) : (last_1_var_1_13)))) > (var_1_5)) ? (((((var_1_6) > (last_1_var_1_13)) ? (var_1_6) : (last_1_var_1_13)))) : (var_1_5))) [L97] var_1_13 = var_1_7 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=254, var_1_14=3, var_1_16=3, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_22=-255, var_1_23=1, var_1_24=-27, var_1_25=1, var_1_26=17/2, var_1_27=-28, var_1_28=0, var_1_29=-29, var_1_30=0, var_1_31=2, var_1_35=0, var_1_36=100, var_1_5=127, var_1_6=154, var_1_7=-2, var_1_8=1] [L104] unsigned char stepLocal_7 = var_1_6; VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_7=154, var_1_11=1, var_1_12=0, var_1_13=254, var_1_14=3, var_1_16=3, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_22=-255, var_1_23=1, var_1_24=-27, var_1_25=1, var_1_26=17/2, var_1_27=-28, var_1_28=0, var_1_29=-29, var_1_30=0, var_1_31=2, var_1_35=0, var_1_36=100, var_1_5=127, var_1_6=154, var_1_7=-2, var_1_8=1] [L105] COND FALSE !(stepLocal_7 > var_1_6) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=254, var_1_14=3, var_1_16=3, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_22=-255, var_1_23=1, var_1_24=-27, var_1_25=1, var_1_26=17/2, var_1_27=-28, var_1_28=0, var_1_29=-29, var_1_30=0, var_1_31=2, var_1_35=0, var_1_36=100, var_1_5=127, var_1_6=154, var_1_7=-2, var_1_8=1] [L108] unsigned char stepLocal_0 = var_1_6; VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_0=154, var_1_11=1, var_1_12=0, var_1_13=254, var_1_14=3, var_1_16=3, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_22=-255, var_1_23=1, var_1_24=-27, var_1_25=1, var_1_26=17/2, var_1_27=-28, var_1_28=0, var_1_29=-29, var_1_30=0, var_1_31=2, var_1_35=0, var_1_36=100, var_1_5=127, var_1_6=154, var_1_7=-2, var_1_8=1] [L109] COND TRUE \read(var_1_19) [L110] var_1_1 = ((((var_1_6) > (var_1_6)) ? (var_1_6) : (var_1_6))) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_0=154, var_1_11=1, var_1_12=0, var_1_13=254, var_1_14=3, var_1_16=3, var_1_17=16, var_1_19=1, var_1_1=154, var_1_20=0, var_1_21=1, var_1_22=-255, var_1_23=1, var_1_24=-27, var_1_25=1, var_1_26=17/2, var_1_27=-28, var_1_28=0, var_1_29=-29, var_1_30=0, var_1_31=2, var_1_35=0, var_1_36=100, var_1_5=127, var_1_6=154, var_1_7=-2, var_1_8=1] [L116] unsigned char stepLocal_2 = var_1_19 && var_1_19; [L117] unsigned char stepLocal_1 = var_1_7; VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_0=154, stepLocal_1=-2, stepLocal_2=1, var_1_11=1, var_1_12=0, var_1_13=254, var_1_14=3, var_1_16=3, var_1_17=16, var_1_19=1, var_1_1=154, var_1_20=0, var_1_21=1, var_1_22=-255, var_1_23=1, var_1_24=-27, var_1_25=1, var_1_26=17/2, var_1_27=-28, var_1_28=0, var_1_29=-29, var_1_30=0, var_1_31=2, var_1_35=0, var_1_36=100, var_1_5=127, var_1_6=154, var_1_7=-2, var_1_8=1] [L118] COND FALSE !((49.5f <= var_1_14) && stepLocal_2) [L125] var_1_8 = var_1_12 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_0=154, stepLocal_1=-2, var_1_11=1, var_1_12=0, var_1_13=254, var_1_14=3, var_1_16=3, var_1_17=16, var_1_19=1, var_1_1=154, var_1_20=0, var_1_21=1, var_1_22=-255, var_1_23=1, var_1_24=-27, var_1_25=1, var_1_26=17/2, var_1_27=-28, var_1_28=0, var_1_29=-29, var_1_30=0, var_1_31=2, var_1_35=0, var_1_36=100, var_1_5=127, var_1_6=154, var_1_7=-2, var_1_8=0] [L195] RET step() [L196] CALL, EXPR property() [L186-L187] return ((((((var_1_19 ? (var_1_1 == ((signed short int) ((((var_1_6) > (var_1_6)) ? (var_1_6) : (var_1_6))))) : ((((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5))) >= var_1_6) ? (var_1_1 == ((signed short int) var_1_5)) : 1)) && ((var_1_5 >= -2) ? (var_1_6 == ((unsigned char) (var_1_7 - 100))) : 1)) && (((49.5f <= var_1_14) && (var_1_19 && var_1_19)) ? ((var_1_13 < var_1_7) ? (var_1_8 == ((unsigned char) (var_1_19 || var_1_11))) : (var_1_8 == ((unsigned char) var_1_11))) : (var_1_8 == ((unsigned char) var_1_12)))) && ((last_1_var_1_13 >= (var_1_6 / var_1_7)) ? ((var_1_6 != ((((((((var_1_6) > (last_1_var_1_13)) ? (var_1_6) : (last_1_var_1_13)))) > (var_1_5)) ? (((((var_1_6) > (last_1_var_1_13)) ? (var_1_6) : (last_1_var_1_13)))) : (var_1_5)))) ? (var_1_13 == ((signed short int) var_1_7)) : (var_1_13 == ((signed short int) last_1_var_1_13))) : (var_1_13 == ((signed short int) var_1_6)))) && (((((((last_1_var_1_1) < (8)) ? (last_1_var_1_1) : (8))) <= var_1_5) || last_1_var_1_8) ? ((last_1_var_1_1 <= last_1_var_1_6) ? (var_1_14 == ((float) (var_1_15 + var_1_16))) : (var_1_14 == ((float) var_1_16))) : (var_1_14 == ((float) var_1_16)))) && ((var_1_6 > var_1_6) ? (var_1_17 == ((unsigned short int) ((((25) > ((var_1_13 + var_1_6))) ? (25) : ((var_1_13 + var_1_6)))))) : 1)) && ((var_1_14 <= var_1_15) ? (var_1_19 == ((unsigned char) (var_1_12 || var_1_20))) : 1) ; VAL [\result=0, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=254, var_1_14=3, var_1_16=3, var_1_17=16, var_1_19=1, var_1_1=154, var_1_20=0, var_1_21=1, var_1_22=-255, var_1_23=1, var_1_24=-27, var_1_25=1, var_1_26=17/2, var_1_27=-28, var_1_28=0, var_1_29=-29, var_1_30=0, var_1_31=2, var_1_35=0, var_1_36=100, var_1_5=127, var_1_6=154, var_1_7=-2, var_1_8=0] [L196] RET, EXPR property() [L196] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=254, var_1_14=3, var_1_16=3, var_1_17=16, var_1_19=1, var_1_1=154, var_1_20=0, var_1_21=1, var_1_22=-255, var_1_23=1, var_1_24=-27, var_1_25=1, var_1_26=17/2, var_1_27=-28, var_1_28=0, var_1_29=-29, var_1_30=0, var_1_31=2, var_1_35=0, var_1_36=100, var_1_5=127, var_1_6=154, var_1_7=-2, var_1_8=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=254, var_1_14=3, var_1_16=3, var_1_17=16, var_1_19=1, var_1_1=154, var_1_20=0, var_1_21=1, var_1_22=-255, var_1_23=1, var_1_24=-27, var_1_25=1, var_1_26=17/2, var_1_27=-28, var_1_28=0, var_1_29=-29, var_1_30=0, var_1_31=2, var_1_35=0, var_1_36=100, var_1_5=127, var_1_6=154, var_1_7=-2, var_1_8=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 94 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 12.6s, OverallIterations: 9, TraceHistogramMax: 31, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1165 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1132 mSDsluCounter, 4066 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2898 mSDsCounter, 506 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2170 IncrementalHoareTripleChecker+Invalid, 2676 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 506 mSolverCounterUnsat, 1168 mSDtfsCounter, 2170 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1462 GetRequests, 1358 SyntacticMatches, 2 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 713 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1581occurred in iteration=8, InterpolantAutomatonStates: 88, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 8 MinimizatonAttempts, 935 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 6.1s InterpolantComputationTime, 2827 NumberOfCodeBlocks, 2827 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 2208 ConstructedInterpolants, 2 QuantifiedInterpolants, 9990 SizeOfPredicates, 15 NumberOfNonLiveVariables, 1884 ConjunctsInSsa, 45 ConjunctsInUnsatCore, 11 InterpolantComputations, 5 PerfectInterpolantSequences, 19860/20460 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 21:47:15,817 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-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_fillercodesize_ps-cn-25_file-42.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 5f62dbdf30439c22b90c0714165751cfb1215bac5efc8ba17b86c401a925f47d --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 21:47:17,691 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 21:47:17,771 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-02-05 21:47:17,777 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 21:47:17,778 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 21:47:17,798 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 21:47:17,799 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 21:47:17,800 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 21:47:17,800 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 21:47:17,800 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 21:47:17,801 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 21:47:17,801 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 21:47:17,801 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 21:47:17,801 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 21:47:17,802 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 21:47:17,802 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 21:47:17,802 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 21:47:17,802 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 21:47:17,802 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 21:47:17,802 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 21:47:17,802 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 21:47:17,802 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 21:47:17,803 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 21:47:17,803 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-05 21:47:17,803 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-05 21:47:17,803 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-05 21:47:17,803 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 21:47:17,803 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 21:47:17,803 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 21:47:17,803 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 21:47:17,803 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 21:47:17,804 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 21:47:17,804 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 21:47:17,804 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 21:47:17,804 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 21:47:17,804 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 21:47:17,804 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 21:47:17,804 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 21:47:17,804 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 21:47:17,804 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-05 21:47:17,804 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-05 21:47:17,804 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 21:47:17,804 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 21:47:17,804 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 21:47:17,804 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 21:47:17,804 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 -> 5f62dbdf30439c22b90c0714165751cfb1215bac5efc8ba17b86c401a925f47d [2025-02-05 21:47:18,028 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 21:47:18,033 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 21:47:18,036 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 21:47:18,036 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 21:47:18,037 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 21:47:18,037 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-42.i [2025-02-05 21:47:19,271 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6d6f96888/d84f40ef6d3548b1a82a8fc19f1dba7c/FLAG04d22541f [2025-02-05 21:47:19,489 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 21:47:19,489 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-42.i [2025-02-05 21:47:19,498 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6d6f96888/d84f40ef6d3548b1a82a8fc19f1dba7c/FLAG04d22541f [2025-02-05 21:47:19,511 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6d6f96888/d84f40ef6d3548b1a82a8fc19f1dba7c [2025-02-05 21:47:19,514 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 21:47:19,515 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 21:47:19,517 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 21:47:19,517 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 21:47:19,520 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 21:47:19,521 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 09:47:19" (1/1) ... [2025-02-05 21:47:19,522 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6dd24da5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:47:19, skipping insertion in model container [2025-02-05 21:47:19,523 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 09:47:19" (1/1) ... [2025-02-05 21:47:19,541 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 21:47:19,651 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_fillercodesize_ps-cn-25_file-42.i[915,928] [2025-02-05 21:47:19,719 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 21:47:19,738 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 21:47:19,749 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_fillercodesize_ps-cn-25_file-42.i[915,928] [2025-02-05 21:47:19,786 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 21:47:19,805 INFO L204 MainTranslator]: Completed translation [2025-02-05 21:47:19,806 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:47:19 WrapperNode [2025-02-05 21:47:19,806 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 21:47:19,807 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 21:47:19,807 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 21:47:19,808 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 21:47:19,813 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:47:19" (1/1) ... [2025-02-05 21:47:19,825 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:47:19" (1/1) ... [2025-02-05 21:47:19,852 INFO L138 Inliner]: procedures = 27, calls = 44, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 198 [2025-02-05 21:47:19,852 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 21:47:19,852 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 21:47:19,852 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 21:47:19,852 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 21:47:19,860 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:47:19" (1/1) ... [2025-02-05 21:47:19,861 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:47:19" (1/1) ... [2025-02-05 21:47:19,865 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:47:19" (1/1) ... [2025-02-05 21:47:19,886 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 21:47:19,886 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:47:19" (1/1) ... [2025-02-05 21:47:19,886 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:47:19" (1/1) ... [2025-02-05 21:47:19,895 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:47:19" (1/1) ... [2025-02-05 21:47:19,902 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:47:19" (1/1) ... [2025-02-05 21:47:19,904 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:47:19" (1/1) ... [2025-02-05 21:47:19,905 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:47:19" (1/1) ... [2025-02-05 21:47:19,909 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 21:47:19,909 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 21:47:19,909 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 21:47:19,909 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 21:47:19,910 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:47:19" (1/1) ... [2025-02-05 21:47:19,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 21:47:19,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:47:19,935 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 21:47:19,940 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 21:47:19,955 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 21:47:19,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-05 21:47:19,955 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 21:47:19,955 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 21:47:19,955 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 21:47:19,955 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 21:47:20,036 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 21:47:20,038 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 21:47:20,521 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2025-02-05 21:47:20,522 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 21:47:20,531 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 21:47:20,531 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 21:47:20,532 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 09:47:20 BoogieIcfgContainer [2025-02-05 21:47:20,532 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 21:47:20,533 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 21:47:20,533 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 21:47:20,537 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 21:47:20,537 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 09:47:19" (1/3) ... [2025-02-05 21:47:20,538 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5dcb1c97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 09:47:20, skipping insertion in model container [2025-02-05 21:47:20,538 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:47:19" (2/3) ... [2025-02-05 21:47:20,538 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5dcb1c97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 09:47:20, skipping insertion in model container [2025-02-05 21:47:20,538 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 09:47:20" (3/3) ... [2025-02-05 21:47:20,540 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-42.i [2025-02-05 21:47:20,549 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 21:47:20,551 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-42.i that has 2 procedures, 88 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 21:47:20,590 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 21:47:20,601 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;@71dd7495, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 21:47:20,601 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 21:47:20,604 INFO L276 IsEmpty]: Start isEmpty. Operand has 88 states, 54 states have (on average 1.3703703703703705) internal successors, (74), 55 states have internal predecessors, (74), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2025-02-05 21:47:20,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2025-02-05 21:47:20,613 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:47:20,613 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:47:20,614 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:47:20,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:47:20,617 INFO L85 PathProgramCache]: Analyzing trace with hash 1431709817, now seen corresponding path program 1 times [2025-02-05 21:47:20,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 21:47:20,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2076764903] [2025-02-05 21:47:20,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:47:20,628 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 21:47:20,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 21:47:20,630 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 21:47:20,632 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 21:47:20,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 199 statements into 1 equivalence classes. [2025-02-05 21:47:20,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 199 of 199 statements. [2025-02-05 21:47:20,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:47:20,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:47:20,994 INFO L256 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 21:47:21,001 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:47:21,059 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 704 proven. 0 refuted. 0 times theorem prover too weak. 1156 trivial. 0 not checked. [2025-02-05 21:47:21,059 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 21:47:21,060 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 21:47:21,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2076764903] [2025-02-05 21:47:21,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2076764903] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:47:21,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:47:21,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 21:47:21,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084808722] [2025-02-05 21:47:21,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:47:21,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 21:47:21,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 21:47:21,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 21:47:21,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 21:47:21,078 INFO L87 Difference]: Start difference. First operand has 88 states, 54 states have (on average 1.3703703703703705) internal successors, (74), 55 states have internal predecessors, (74), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-02-05 21:47:21,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:47:21,101 INFO L93 Difference]: Finished difference Result 170 states and 298 transitions. [2025-02-05 21:47:21,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 21:47:21,102 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 199 [2025-02-05 21:47:21,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:47:21,109 INFO L225 Difference]: With dead ends: 170 [2025-02-05 21:47:21,109 INFO L226 Difference]: Without dead ends: 85 [2025-02-05 21:47:21,111 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 198 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 21:47:21,113 INFO L435 NwaCegarLoop]: 131 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, 131 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 21:47:21,113 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:47:21,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-02-05 21:47:21,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2025-02-05 21:47:21,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 52 states have (on average 1.3269230769230769) internal successors, (69), 52 states have internal predecessors, (69), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2025-02-05 21:47:21,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 131 transitions. [2025-02-05 21:47:21,140 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 131 transitions. Word has length 199 [2025-02-05 21:47:21,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:47:21,140 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 131 transitions. [2025-02-05 21:47:21,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-02-05 21:47:21,141 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 131 transitions. [2025-02-05 21:47:21,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2025-02-05 21:47:21,143 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:47:21,143 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:47:21,155 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 21:47:21,343 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 21:47:21,344 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:47:21,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:47:21,344 INFO L85 PathProgramCache]: Analyzing trace with hash -1451556036, now seen corresponding path program 1 times [2025-02-05 21:47:21,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 21:47:21,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1625119262] [2025-02-05 21:47:21,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:47:21,345 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 21:47:21,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 21:47:21,347 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 21:47:21,348 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 21:47:21,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 199 statements into 1 equivalence classes. [2025-02-05 21:47:21,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 199 of 199 statements. [2025-02-05 21:47:21,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:47:21,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:47:21,683 INFO L256 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-05 21:47:21,688 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:47:21,942 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 587 proven. 24 refuted. 0 times theorem prover too weak. 1249 trivial. 0 not checked. [2025-02-05 21:47:21,943 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 21:47:22,092 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-02-05 21:47:22,092 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 21:47:22,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1625119262] [2025-02-05 21:47:22,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1625119262] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-05 21:47:22,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 21:47:22,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2025-02-05 21:47:22,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989233144] [2025-02-05 21:47:22,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:47:22,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:47:22,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 21:47:22,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:47:22,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-02-05 21:47:22,095 INFO L87 Difference]: Start difference. First operand 85 states and 131 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-02-05 21:47:22,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:47:22,216 INFO L93 Difference]: Finished difference Result 235 states and 364 transitions. [2025-02-05 21:47:22,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:47:22,217 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 199 [2025-02-05 21:47:22,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:47:22,219 INFO L225 Difference]: With dead ends: 235 [2025-02-05 21:47:22,219 INFO L226 Difference]: Without dead ends: 153 [2025-02-05 21:47:22,220 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 396 GetRequests, 388 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-02-05 21:47:22,220 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 104 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:47:22,220 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 247 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:47:22,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2025-02-05 21:47:22,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 150. [2025-02-05 21:47:22,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 91 states have (on average 1.3296703296703296) internal successors, (121), 92 states have internal predecessors, (121), 56 states have call successors, (56), 2 states have call predecessors, (56), 2 states have return successors, (56), 55 states have call predecessors, (56), 56 states have call successors, (56) [2025-02-05 21:47:22,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 233 transitions. [2025-02-05 21:47:22,246 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 233 transitions. Word has length 199 [2025-02-05 21:47:22,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:47:22,246 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 233 transitions. [2025-02-05 21:47:22,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-02-05 21:47:22,246 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 233 transitions. [2025-02-05 21:47:22,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2025-02-05 21:47:22,251 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:47:22,251 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:47:22,263 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 21:47:22,451 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 21:47:22,452 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:47:22,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:47:22,453 INFO L85 PathProgramCache]: Analyzing trace with hash -98246339, now seen corresponding path program 1 times [2025-02-05 21:47:22,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 21:47:22,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1549068361] [2025-02-05 21:47:22,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:47:22,453 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 21:47:22,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 21:47:22,457 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 21:47:22,458 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 21:47:22,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 199 statements into 1 equivalence classes. [2025-02-05 21:47:22,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 199 of 199 statements. [2025-02-05 21:47:22,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:47:22,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:47:22,800 INFO L256 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 21:47:22,804 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:47:23,109 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-02-05 21:47:23,110 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 21:47:23,110 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 21:47:23,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1549068361] [2025-02-05 21:47:23,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1549068361] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:47:23,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:47:23,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:47:23,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748983046] [2025-02-05 21:47:23,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:47:23,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 21:47:23,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 21:47:23,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 21:47:23,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 21:47:23,113 INFO L87 Difference]: Start difference. First operand 150 states and 233 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-02-05 21:47:23,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:47:23,443 INFO L93 Difference]: Finished difference Result 407 states and 631 transitions. [2025-02-05 21:47:23,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 21:47:23,448 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 199 [2025-02-05 21:47:23,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:47:23,451 INFO L225 Difference]: With dead ends: 407 [2025-02-05 21:47:23,451 INFO L226 Difference]: Without dead ends: 260 [2025-02-05 21:47:23,452 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 21:47:23,452 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 94 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 21:47:23,453 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 375 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 21:47:23,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2025-02-05 21:47:23,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 220. [2025-02-05 21:47:23,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 128 states have (on average 1.28125) internal successors, (164), 129 states have internal predecessors, (164), 87 states have call successors, (87), 4 states have call predecessors, (87), 4 states have return successors, (87), 86 states have call predecessors, (87), 87 states have call successors, (87) [2025-02-05 21:47:23,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 338 transitions. [2025-02-05 21:47:23,480 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 338 transitions. Word has length 199 [2025-02-05 21:47:23,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:47:23,480 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 338 transitions. [2025-02-05 21:47:23,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-02-05 21:47:23,480 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 338 transitions. [2025-02-05 21:47:23,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2025-02-05 21:47:23,482 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:47:23,482 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:47:23,494 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 21:47:23,686 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 21:47:23,686 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:47:23,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:47:23,686 INFO L85 PathProgramCache]: Analyzing trace with hash -1259922010, now seen corresponding path program 1 times [2025-02-05 21:47:23,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 21:47:23,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [141029322] [2025-02-05 21:47:23,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:47:23,687 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 21:47:23,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 21:47:23,689 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 21:47:23,691 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 21:47:23,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-02-05 21:47:24,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-02-05 21:47:24,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:47:24,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:47:24,018 INFO L256 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-05 21:47:24,022 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:47:24,739 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-02-05 21:47:24,739 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 21:47:24,739 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 21:47:24,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [141029322] [2025-02-05 21:47:24,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [141029322] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:47:24,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:47:24,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 21:47:24,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139530896] [2025-02-05 21:47:24,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:47:24,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 21:47:24,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 21:47:24,741 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 21:47:24,741 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 21:47:24,741 INFO L87 Difference]: Start difference. First operand 220 states and 338 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-02-05 21:47:25,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:47:25,452 INFO L93 Difference]: Finished difference Result 600 states and 931 transitions. [2025-02-05 21:47:25,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 21:47:25,458 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 200 [2025-02-05 21:47:25,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:47:25,463 INFO L225 Difference]: With dead ends: 600 [2025-02-05 21:47:25,463 INFO L226 Difference]: Without dead ends: 453 [2025-02-05 21:47:25,464 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-02-05 21:47:25,464 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 124 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 21:47:25,464 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 495 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 21:47:25,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2025-02-05 21:47:25,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 365. [2025-02-05 21:47:25,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 215 states have (on average 1.2976744186046512) internal successors, (279), 217 states have internal predecessors, (279), 143 states have call successors, (143), 6 states have call predecessors, (143), 6 states have return successors, (143), 141 states have call predecessors, (143), 143 states have call successors, (143) [2025-02-05 21:47:25,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 565 transitions. [2025-02-05 21:47:25,529 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 565 transitions. Word has length 200 [2025-02-05 21:47:25,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:47:25,529 INFO L471 AbstractCegarLoop]: Abstraction has 365 states and 565 transitions. [2025-02-05 21:47:25,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-02-05 21:47:25,530 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 565 transitions. [2025-02-05 21:47:25,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2025-02-05 21:47:25,532 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:47:25,532 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:47:25,546 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 21:47:25,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 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 21:47:25,733 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:47:25,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:47:25,734 INFO L85 PathProgramCache]: Analyzing trace with hash 247629799, now seen corresponding path program 1 times [2025-02-05 21:47:25,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 21:47:25,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1772607029] [2025-02-05 21:47:25,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:47:25,735 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 21:47:25,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 21:47:25,737 INFO L229 MonitoredProcess]: Starting monitored process 6 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 21:47:25,738 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 (6)] Waiting until timeout for monitored process [2025-02-05 21:47:25,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-02-05 21:47:26,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-02-05 21:47:26,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:47:26,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:47:26,048 INFO L256 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 21:47:26,051 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:47:26,062 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-02-05 21:47:26,062 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 21:47:26,062 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 21:47:26,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1772607029] [2025-02-05 21:47:26,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1772607029] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:47:26,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:47:26,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:47:26,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408572870] [2025-02-05 21:47:26,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:47:26,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:47:26,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 21:47:26,063 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:47:26,063 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:47:26,064 INFO L87 Difference]: Start difference. First operand 365 states and 565 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-02-05 21:47:26,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:47:26,186 INFO L93 Difference]: Finished difference Result 657 states and 1022 transitions. [2025-02-05 21:47:26,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:47:26,194 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 200 [2025-02-05 21:47:26,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:47:26,198 INFO L225 Difference]: With dead ends: 657 [2025-02-05 21:47:26,198 INFO L226 Difference]: Without dead ends: 365 [2025-02-05 21:47:26,199 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 198 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 21:47:26,200 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 0 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:47:26,200 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 246 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:47:26,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2025-02-05 21:47:26,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 365. [2025-02-05 21:47:26,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 215 states have (on average 1.2790697674418605) internal successors, (275), 217 states have internal predecessors, (275), 143 states have call successors, (143), 6 states have call predecessors, (143), 6 states have return successors, (143), 141 states have call predecessors, (143), 143 states have call successors, (143) [2025-02-05 21:47:26,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 561 transitions. [2025-02-05 21:47:26,243 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 561 transitions. Word has length 200 [2025-02-05 21:47:26,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:47:26,244 INFO L471 AbstractCegarLoop]: Abstraction has 365 states and 561 transitions. [2025-02-05 21:47:26,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-02-05 21:47:26,245 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 561 transitions. [2025-02-05 21:47:26,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2025-02-05 21:47:26,247 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:47:26,247 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:47:26,261 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 (6)] Forceful destruction successful, exit code 0 [2025-02-05 21:47:26,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /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 21:47:26,448 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:47:26,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:47:26,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1559824664, now seen corresponding path program 1 times [2025-02-05 21:47:26,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 21:47:26,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1587034511] [2025-02-05 21:47:26,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:47:26,449 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 21:47:26,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 21:47:26,453 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 21:47:26,454 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 21:47:26,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-02-05 21:47:26,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-02-05 21:47:26,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:47:26,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:47:26,775 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-05 21:47:26,778 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:47:27,235 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 947 proven. 123 refuted. 0 times theorem prover too weak. 790 trivial. 0 not checked. [2025-02-05 21:47:27,235 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 21:47:27,573 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 51 proven. 126 refuted. 0 times theorem prover too weak. 1683 trivial. 0 not checked. [2025-02-05 21:47:27,574 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 21:47:27,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1587034511] [2025-02-05 21:47:27,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1587034511] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 21:47:27,574 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-05 21:47:27,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2025-02-05 21:47:27,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319811564] [2025-02-05 21:47:27,574 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-05 21:47:27,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-05 21:47:27,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 21:47:27,575 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-05 21:47:27,575 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2025-02-05 21:47:27,575 INFO L87 Difference]: Start difference. First operand 365 states and 561 transitions. Second operand has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 13 states have internal predecessors, (66), 3 states have call successors, (54), 3 states have call predecessors, (54), 7 states have return successors, (55), 3 states have call predecessors, (55), 3 states have call successors, (55) [2025-02-05 21:47:28,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:47:28,714 INFO L93 Difference]: Finished difference Result 775 states and 1127 transitions. [2025-02-05 21:47:28,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-02-05 21:47:28,715 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 13 states have internal predecessors, (66), 3 states have call successors, (54), 3 states have call predecessors, (54), 7 states have return successors, (55), 3 states have call predecessors, (55), 3 states have call successors, (55) Word has length 200 [2025-02-05 21:47:28,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:47:28,721 INFO L225 Difference]: With dead ends: 775 [2025-02-05 21:47:28,721 INFO L226 Difference]: Without dead ends: 628 [2025-02-05 21:47:28,722 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 420 GetRequests, 388 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=315, Invalid=741, Unknown=0, NotChecked=0, Total=1056 [2025-02-05 21:47:28,723 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 232 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 393 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 21:47:28,723 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 468 Invalid, 517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 393 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 21:47:28,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2025-02-05 21:47:28,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 584. [2025-02-05 21:47:28,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 584 states, 362 states have (on average 1.2541436464088398) internal successors, (454), 365 states have internal predecessors, (454), 199 states have call successors, (199), 22 states have call predecessors, (199), 22 states have return successors, (199), 196 states have call predecessors, (199), 199 states have call successors, (199) [2025-02-05 21:47:28,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 852 transitions. [2025-02-05 21:47:28,773 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 852 transitions. Word has length 200 [2025-02-05 21:47:28,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:47:28,773 INFO L471 AbstractCegarLoop]: Abstraction has 584 states and 852 transitions. [2025-02-05 21:47:28,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 13 states have internal predecessors, (66), 3 states have call successors, (54), 3 states have call predecessors, (54), 7 states have return successors, (55), 3 states have call predecessors, (55), 3 states have call successors, (55) [2025-02-05 21:47:28,773 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 852 transitions. [2025-02-05 21:47:28,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2025-02-05 21:47:28,775 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:47:28,775 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:47:28,786 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 (7)] Ended with exit code 0 [2025-02-05 21:47:28,975 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 21:47:28,975 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:47:28,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:47:28,976 INFO L85 PathProgramCache]: Analyzing trace with hash -2065383289, now seen corresponding path program 1 times [2025-02-05 21:47:28,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 21:47:28,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [372141449] [2025-02-05 21:47:28,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:47:28,976 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 21:47:28,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 21:47:28,978 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 21:47:28,980 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 21:47:29,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-02-05 21:47:29,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-02-05 21:47:29,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:47:29,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:47:29,300 INFO L256 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-05 21:47:29,303 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:47:29,922 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 258 proven. 84 refuted. 0 times theorem prover too weak. 1518 trivial. 0 not checked. [2025-02-05 21:47:29,923 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 21:47:30,279 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 21:47:30,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [372141449] [2025-02-05 21:47:30,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [372141449] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 21:47:30,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [321545698] [2025-02-05 21:47:30,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:47:30,280 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-02-05 21:47:30,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-02-05 21:47:30,303 INFO L229 MonitoredProcess]: Starting monitored process 9 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 21:47:30,304 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2025-02-05 21:47:30,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-02-05 21:47:31,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-02-05 21:47:31,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:47:31,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:47:31,118 INFO L256 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-05 21:47:31,121 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:47:31,588 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-02-05 21:47:31,588 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 21:47:31,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [321545698] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:47:31,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 21:47:31,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2025-02-05 21:47:31,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247276391] [2025-02-05 21:47:31,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:47:31,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 21:47:31,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 21:47:31,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 21:47:31,589 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-02-05 21:47:31,589 INFO L87 Difference]: Start difference. First operand 584 states and 852 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-02-05 21:47:33,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:47:33,201 INFO L93 Difference]: Finished difference Result 1623 states and 2334 transitions. [2025-02-05 21:47:33,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 21:47:33,208 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 200 [2025-02-05 21:47:33,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:47:33,217 INFO L225 Difference]: With dead ends: 1623 [2025-02-05 21:47:33,218 INFO L226 Difference]: Without dead ends: 1301 [2025-02-05 21:47:33,220 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 425 GetRequests, 412 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2025-02-05 21:47:33,220 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 142 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 558 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-02-05 21:47:33,221 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 558 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-02-05 21:47:33,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1301 states. [2025-02-05 21:47:33,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1301 to 1163. [2025-02-05 21:47:33,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1163 states, 743 states have (on average 1.2557200538358009) internal successors, (933), 753 states have internal predecessors, (933), 375 states have call successors, (375), 44 states have call predecessors, (375), 44 states have return successors, (375), 365 states have call predecessors, (375), 375 states have call successors, (375) [2025-02-05 21:47:33,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1163 states to 1163 states and 1683 transitions. [2025-02-05 21:47:33,324 INFO L78 Accepts]: Start accepts. Automaton has 1163 states and 1683 transitions. Word has length 200 [2025-02-05 21:47:33,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:47:33,325 INFO L471 AbstractCegarLoop]: Abstraction has 1163 states and 1683 transitions. [2025-02-05 21:47:33,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-02-05 21:47:33,325 INFO L276 IsEmpty]: Start isEmpty. Operand 1163 states and 1683 transitions. [2025-02-05 21:47:33,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2025-02-05 21:47:33,327 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:47:33,327 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:47:33,339 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 21:47:33,536 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Ended with exit code 0 [2025-02-05 21:47:33,728 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,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-02-05 21:47:33,728 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:47:33,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:47:33,729 INFO L85 PathProgramCache]: Analyzing trace with hash 1936181000, now seen corresponding path program 1 times [2025-02-05 21:47:33,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 21:47:33,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1589986980] [2025-02-05 21:47:33,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:47:33,729 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 21:47:33,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 21:47:33,731 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 21:47:33,732 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 21:47:33,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-02-05 21:47:34,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-02-05 21:47:34,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:47:34,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:47:34,055 INFO L256 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-05 21:47:34,058 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:47:34,665 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 258 proven. 84 refuted. 0 times theorem prover too weak. 1518 trivial. 0 not checked. [2025-02-05 21:47:34,665 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 21:47:34,993 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 21:47:34,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1589986980] [2025-02-05 21:47:34,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1589986980] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 21:47:34,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [128247934] [2025-02-05 21:47:34,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:47:34,993 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-02-05 21:47:34,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-02-05 21:47:34,995 INFO L229 MonitoredProcess]: Starting monitored process 11 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 21:47:34,997 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Waiting until timeout for monitored process [2025-02-05 21:47:35,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-02-05 21:47:35,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-02-05 21:47:35,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:47:35,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:47:35,820 INFO L256 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-05 21:47:35,823 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:47:36,563 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-02-05 21:47:36,563 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 21:47:36,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [128247934] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:47:36,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 21:47:36,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2025-02-05 21:47:36,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979752408] [2025-02-05 21:47:36,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:47:36,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 21:47:36,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 21:47:36,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 21:47:36,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2025-02-05 21:47:36,564 INFO L87 Difference]: Start difference. First operand 1163 states and 1683 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-02-05 21:47:38,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:47:38,445 INFO L93 Difference]: Finished difference Result 2054 states and 2975 transitions. [2025-02-05 21:47:38,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 21:47:38,446 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 200 [2025-02-05 21:47:38,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:47:38,453 INFO L225 Difference]: With dead ends: 2054 [2025-02-05 21:47:38,453 INFO L226 Difference]: Without dead ends: 1563 [2025-02-05 21:47:38,456 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 424 GetRequests, 411 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2025-02-05 21:47:38,456 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 93 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-02-05 21:47:38,457 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 480 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-02-05 21:47:38,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1563 states. [2025-02-05 21:47:38,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1563 to 1483. [2025-02-05 21:47:38,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1483 states, 939 states have (on average 1.2492012779552715) internal successors, (1173), 951 states have internal predecessors, (1173), 487 states have call successors, (487), 56 states have call predecessors, (487), 56 states have return successors, (487), 475 states have call predecessors, (487), 487 states have call successors, (487) [2025-02-05 21:47:38,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1483 states to 1483 states and 2147 transitions. [2025-02-05 21:47:38,575 INFO L78 Accepts]: Start accepts. Automaton has 1483 states and 2147 transitions. Word has length 200 [2025-02-05 21:47:38,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:47:38,576 INFO L471 AbstractCegarLoop]: Abstraction has 1483 states and 2147 transitions. [2025-02-05 21:47:38,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-02-05 21:47:38,576 INFO L276 IsEmpty]: Start isEmpty. Operand 1483 states and 2147 transitions. [2025-02-05 21:47:38,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2025-02-05 21:47:38,579 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:47:38,579 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:47:38,590 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Ended with exit code 0 [2025-02-05 21:47:38,791 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 (10)] Ended with exit code 0 [2025-02-05 21:47:38,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,10 /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 21:47:38,981 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:47:38,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:47:38,982 INFO L85 PathProgramCache]: Analyzing trace with hash -1457795459, now seen corresponding path program 1 times [2025-02-05 21:47:38,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 21:47:38,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [467605228] [2025-02-05 21:47:38,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:47:38,982 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 21:47:38,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 21:47:38,984 INFO L229 MonitoredProcess]: Starting monitored process 12 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 21:47:38,984 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 (12)] Waiting until timeout for monitored process [2025-02-05 21:47:39,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-02-05 21:47:39,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-02-05 21:47:39,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:47:39,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:47:39,285 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-02-05 21:47:39,289 INFO L279 TraceCheckSpWp]: Computing forward predicates...