./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-27.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-27.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 f14202f951fe89438d327807ffbecb479f5f15295ecb3a059a45561896451f31 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 22:17:57,054 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 22:17:57,114 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 22:17:57,121 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 22:17:57,121 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 22:17:57,144 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 22:17:57,145 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 22:17:57,145 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 22:17:57,145 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 22:17:57,145 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 22:17:57,146 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 22:17:57,147 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 22:17:57,147 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 22:17:57,147 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 22:17:57,148 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 22:17:57,149 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 22:17:57,149 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 22:17:57,149 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 22:17:57,149 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 22:17:57,150 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 22:17:57,150 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 22:17:57,150 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 22:17:57,150 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 22:17:57,150 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 22:17:57,150 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 22:17:57,150 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 22:17:57,150 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 22:17:57,151 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 22:17:57,151 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 22:17:57,151 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 22:17:57,151 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 22:17:57,151 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 22:17:57,151 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 22:17:57,151 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 22:17:57,151 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 22:17:57,151 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 22:17:57,151 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 22:17:57,151 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 22:17:57,151 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 22:17:57,151 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 22:17:57,151 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 22:17:57,152 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 22:17:57,152 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 22:17:57,152 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 -> f14202f951fe89438d327807ffbecb479f5f15295ecb3a059a45561896451f31 [2025-02-05 22:17:57,458 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 22:17:57,465 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 22:17:57,467 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 22:17:57,469 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 22:17:57,469 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 22:17:57,470 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-27.i [2025-02-05 22:17:58,738 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e9581c7f2/f715d809cd4643bfb9f7ebf1298307ac/FLAG857647489 [2025-02-05 22:17:59,075 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 22:17:59,076 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-27.i [2025-02-05 22:17:59,089 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e9581c7f2/f715d809cd4643bfb9f7ebf1298307ac/FLAG857647489 [2025-02-05 22:17:59,109 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e9581c7f2/f715d809cd4643bfb9f7ebf1298307ac [2025-02-05 22:17:59,112 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 22:17:59,113 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 22:17:59,115 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 22:17:59,116 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 22:17:59,119 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 22:17:59,120 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:17:59" (1/1) ... [2025-02-05 22:17:59,123 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@443e8196 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:17:59, skipping insertion in model container [2025-02-05 22:17:59,123 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:17:59" (1/1) ... [2025-02-05 22:17:59,142 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 22:17:59,277 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-27.i[919,932] [2025-02-05 22:17:59,335 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 22:17:59,343 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 22:17:59,352 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-27.i[919,932] [2025-02-05 22:17:59,388 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 22:17:59,408 INFO L204 MainTranslator]: Completed translation [2025-02-05 22:17:59,408 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:17:59 WrapperNode [2025-02-05 22:17:59,409 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 22:17:59,409 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 22:17:59,409 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 22:17:59,410 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 22:17:59,415 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:17:59" (1/1) ... [2025-02-05 22:17:59,423 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:17:59" (1/1) ... [2025-02-05 22:17:59,450 INFO L138 Inliner]: procedures = 26, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 195 [2025-02-05 22:17:59,450 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 22:17:59,451 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 22:17:59,451 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 22:17:59,451 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 22:17:59,463 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:17:59" (1/1) ... [2025-02-05 22:17:59,463 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:17:59" (1/1) ... [2025-02-05 22:17:59,469 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:17:59" (1/1) ... [2025-02-05 22:17:59,488 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-05 22:17:59,489 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:17:59" (1/1) ... [2025-02-05 22:17:59,489 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:17:59" (1/1) ... [2025-02-05 22:17:59,497 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:17:59" (1/1) ... [2025-02-05 22:17:59,498 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:17:59" (1/1) ... [2025-02-05 22:17:59,500 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:17:59" (1/1) ... [2025-02-05 22:17:59,501 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:17:59" (1/1) ... [2025-02-05 22:17:59,504 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 22:17:59,505 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 22:17:59,505 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 22:17:59,505 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 22:17:59,506 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:17:59" (1/1) ... [2025-02-05 22:17:59,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 22:17:59,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 22:17:59,541 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 22:17:59,544 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 22:17:59,563 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 22:17:59,564 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 22:17:59,564 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 22:17:59,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 22:17:59,564 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 22:17:59,564 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 22:17:59,638 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 22:17:59,640 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 22:18:00,048 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L177: havoc property_#t~bitwise19#1;havoc property_#t~short20#1; [2025-02-05 22:18:00,095 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-02-05 22:18:00,095 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 22:18:00,117 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 22:18:00,117 INFO L337 CfgBuilder]: Removed 2 assume(true) statements. [2025-02-05 22:18:00,117 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:18:00 BoogieIcfgContainer [2025-02-05 22:18:00,118 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 22:18:00,120 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 22:18:00,120 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 22:18:00,124 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 22:18:00,124 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 10:17:59" (1/3) ... [2025-02-05 22:18:00,126 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@596a76b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:18:00, skipping insertion in model container [2025-02-05 22:18:00,126 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:17:59" (2/3) ... [2025-02-05 22:18:00,126 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@596a76b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:18:00, skipping insertion in model container [2025-02-05 22:18:00,127 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:18:00" (3/3) ... [2025-02-05 22:18:00,128 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-27.i [2025-02-05 22:18:00,143 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 22:18:00,144 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-27.i that has 2 procedures, 90 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 22:18:00,204 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 22:18:00,217 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;@2ac52c46, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 22:18:00,217 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 22:18:00,223 INFO L276 IsEmpty]: Start isEmpty. Operand has 90 states, 61 states have (on average 1.4426229508196722) internal successors, (88), 62 states have internal predecessors, (88), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-02-05 22:18:00,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-02-05 22:18:00,236 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:18:00,237 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:18:00,237 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:18:00,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:18:00,244 INFO L85 PathProgramCache]: Analyzing trace with hash -2130931707, now seen corresponding path program 1 times [2025-02-05 22:18:00,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:18:00,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989191859] [2025-02-05 22:18:00,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:18:00,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:18:00,347 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-02-05 22:18:00,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-02-05 22:18:00,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:18:00,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:18:00,570 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 1250 trivial. 0 not checked. [2025-02-05 22:18:00,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:18:00,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989191859] [2025-02-05 22:18:00,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989191859] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 22:18:00,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [616759157] [2025-02-05 22:18:00,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:18:00,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 22:18:00,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 22:18:00,578 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 22:18:00,580 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 22:18:00,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-02-05 22:18:00,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-02-05 22:18:00,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:18:00,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:18:00,778 INFO L256 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 22:18:00,789 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 22:18:00,827 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 1250 trivial. 0 not checked. [2025-02-05 22:18:00,829 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 22:18:00,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [616759157] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:18:00,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 22:18:00,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-05 22:18:00,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144488674] [2025-02-05 22:18:00,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:18:00,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 22:18:00,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:18:00,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 22:18:00,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 22:18:00,857 INFO L87 Difference]: Start difference. First operand has 90 states, 61 states have (on average 1.4426229508196722) internal successors, (88), 62 states have internal predecessors, (88), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2025-02-05 22:18:00,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:18:00,890 INFO L93 Difference]: Finished difference Result 174 states and 301 transitions. [2025-02-05 22:18:00,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 22:18:00,893 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) Word has length 172 [2025-02-05 22:18:00,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:18:00,898 INFO L225 Difference]: With dead ends: 174 [2025-02-05 22:18:00,898 INFO L226 Difference]: Without dead ends: 87 [2025-02-05 22:18:00,901 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 22:18:00,903 INFO L435 NwaCegarLoop]: 131 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, 131 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 22:18:00,904 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 131 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 22:18:00,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-02-05 22:18:00,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2025-02-05 22:18:00,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 59 states have (on average 1.3728813559322033) internal successors, (81), 59 states have internal predecessors, (81), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-02-05 22:18:00,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 133 transitions. [2025-02-05 22:18:00,944 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 133 transitions. Word has length 172 [2025-02-05 22:18:00,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:18:00,945 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 133 transitions. [2025-02-05 22:18:00,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2025-02-05 22:18:00,945 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 133 transitions. [2025-02-05 22:18:00,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-02-05 22:18:00,950 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:18:00,951 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:18:00,960 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 22:18:01,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-05 22:18:01,152 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:18:01,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:18:01,152 INFO L85 PathProgramCache]: Analyzing trace with hash -2095207477, now seen corresponding path program 1 times [2025-02-05 22:18:01,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:18:01,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804570532] [2025-02-05 22:18:01,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:18:01,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:18:01,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-02-05 22:18:01,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-02-05 22:18:01,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:18:01,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:18:01,640 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-02-05 22:18:01,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:18:01,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804570532] [2025-02-05 22:18:01,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804570532] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:18:01,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:18:01,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 22:18:01,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768477970] [2025-02-05 22:18:01,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:18:01,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 22:18:01,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:18:01,647 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 22:18:01,647 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 22:18:01,647 INFO L87 Difference]: Start difference. First operand 87 states and 133 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-02-05 22:18:01,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:18:01,760 INFO L93 Difference]: Finished difference Result 255 states and 393 transitions. [2025-02-05 22:18:01,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 22:18:01,760 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 172 [2025-02-05 22:18:01,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:18:01,763 INFO L225 Difference]: With dead ends: 255 [2025-02-05 22:18:01,763 INFO L226 Difference]: Without dead ends: 171 [2025-02-05 22:18:01,764 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 22:18:01,765 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 78 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 22:18:01,765 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 441 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 22:18:01,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2025-02-05 22:18:01,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 167. [2025-02-05 22:18:01,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 112 states have (on average 1.3571428571428572) internal successors, (152), 112 states have internal predecessors, (152), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2025-02-05 22:18:01,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 256 transitions. [2025-02-05 22:18:01,805 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 256 transitions. Word has length 172 [2025-02-05 22:18:01,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:18:01,806 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 256 transitions. [2025-02-05 22:18:01,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-02-05 22:18:01,806 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 256 transitions. [2025-02-05 22:18:01,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-02-05 22:18:01,810 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:18:01,810 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:18:01,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 22:18:01,810 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:18:01,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:18:01,811 INFO L85 PathProgramCache]: Analyzing trace with hash -1182618941, now seen corresponding path program 1 times [2025-02-05 22:18:01,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:18:01,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828752993] [2025-02-05 22:18:01,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:18:01,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:18:01,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-02-05 22:18:01,897 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-02-05 22:18:01,898 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:18:01,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:18:02,359 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-02-05 22:18:02,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:18:02,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828752993] [2025-02-05 22:18:02,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828752993] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:18:02,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:18:02,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 22:18:02,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516919296] [2025-02-05 22:18:02,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:18:02,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 22:18:02,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:18:02,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 22:18:02,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 22:18:02,366 INFO L87 Difference]: Start difference. First operand 167 states and 256 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-02-05 22:18:02,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:18:02,714 INFO L93 Difference]: Finished difference Result 441 states and 672 transitions. [2025-02-05 22:18:02,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 22:18:02,715 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 173 [2025-02-05 22:18:02,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:18:02,719 INFO L225 Difference]: With dead ends: 441 [2025-02-05 22:18:02,720 INFO L226 Difference]: Without dead ends: 277 [2025-02-05 22:18:02,722 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 22:18:02,723 INFO L435 NwaCegarLoop]: 180 mSDtfsCounter, 131 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 518 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 22:18:02,723 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 518 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 22:18:02,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2025-02-05 22:18:02,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 273. [2025-02-05 22:18:02,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 200 states have (on average 1.38) internal successors, (276), 202 states have internal predecessors, (276), 68 states have call successors, (68), 4 states have call predecessors, (68), 4 states have return successors, (68), 66 states have call predecessors, (68), 68 states have call successors, (68) [2025-02-05 22:18:02,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 412 transitions. [2025-02-05 22:18:02,781 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 412 transitions. Word has length 173 [2025-02-05 22:18:02,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:18:02,782 INFO L471 AbstractCegarLoop]: Abstraction has 273 states and 412 transitions. [2025-02-05 22:18:02,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-02-05 22:18:02,782 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 412 transitions. [2025-02-05 22:18:02,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-02-05 22:18:02,787 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:18:02,787 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:18:02,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 22:18:02,787 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:18:02,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:18:02,788 INFO L85 PathProgramCache]: Analyzing trace with hash -1249625694, now seen corresponding path program 1 times [2025-02-05 22:18:02,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:18:02,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662873985] [2025-02-05 22:18:02,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:18:02,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:18:02,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-02-05 22:18:02,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-02-05 22:18:02,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:18:02,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:18:03,114 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-02-05 22:18:03,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:18:03,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662873985] [2025-02-05 22:18:03,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662873985] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:18:03,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:18:03,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 22:18:03,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389074429] [2025-02-05 22:18:03,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:18:03,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 22:18:03,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:18:03,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 22:18:03,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 22:18:03,117 INFO L87 Difference]: Start difference. First operand 273 states and 412 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-02-05 22:18:03,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:18:03,439 INFO L93 Difference]: Finished difference Result 811 states and 1227 transitions. [2025-02-05 22:18:03,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 22:18:03,439 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 173 [2025-02-05 22:18:03,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:18:03,449 INFO L225 Difference]: With dead ends: 811 [2025-02-05 22:18:03,449 INFO L226 Difference]: Without dead ends: 541 [2025-02-05 22:18:03,451 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 22:18:03,453 INFO L435 NwaCegarLoop]: 194 mSDtfsCounter, 152 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 22:18:03,453 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 384 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 22:18:03,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2025-02-05 22:18:03,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 535. [2025-02-05 22:18:03,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 535 states, 390 states have (on average 1.3794871794871795) internal successors, (538), 394 states have internal predecessors, (538), 136 states have call successors, (136), 8 states have call predecessors, (136), 8 states have return successors, (136), 132 states have call predecessors, (136), 136 states have call successors, (136) [2025-02-05 22:18:03,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 810 transitions. [2025-02-05 22:18:03,543 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 810 transitions. Word has length 173 [2025-02-05 22:18:03,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:18:03,544 INFO L471 AbstractCegarLoop]: Abstraction has 535 states and 810 transitions. [2025-02-05 22:18:03,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-02-05 22:18:03,545 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 810 transitions. [2025-02-05 22:18:03,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-02-05 22:18:03,548 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:18:03,548 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:18:03,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 22:18:03,549 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:18:03,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:18:03,550 INFO L85 PathProgramCache]: Analyzing trace with hash -1058110912, now seen corresponding path program 1 times [2025-02-05 22:18:03,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:18:03,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375429169] [2025-02-05 22:18:03,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:18:03,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:18:03,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-02-05 22:18:03,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-02-05 22:18:03,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:18:03,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:18:03,896 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 48 proven. 27 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2025-02-05 22:18:03,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:18:03,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375429169] [2025-02-05 22:18:03,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375429169] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 22:18:03,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1568075299] [2025-02-05 22:18:03,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:18:03,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 22:18:03,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 22:18:03,900 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 22:18:03,903 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 22:18:03,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-02-05 22:18:04,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-02-05 22:18:04,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:18:04,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:18:04,043 INFO L256 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-05 22:18:04,051 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 22:18:04,292 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 633 proven. 27 refuted. 0 times theorem prover too weak. 640 trivial. 0 not checked. [2025-02-05 22:18:04,292 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 22:18:04,566 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 48 proven. 27 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2025-02-05 22:18:04,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1568075299] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 22:18:04,568 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 22:18:04,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-02-05 22:18:04,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258327612] [2025-02-05 22:18:04,568 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 22:18:04,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 22:18:04,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:18:04,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 22:18:04,571 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 22:18:04,572 INFO L87 Difference]: Start difference. First operand 535 states and 810 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 2 states have call successors, (35), 2 states have call predecessors, (35), 4 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2025-02-05 22:18:04,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:18:04,830 INFO L93 Difference]: Finished difference Result 1099 states and 1645 transitions. [2025-02-05 22:18:04,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 22:18:04,830 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 2 states have call successors, (35), 2 states have call predecessors, (35), 4 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) Word has length 174 [2025-02-05 22:18:04,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:18:04,835 INFO L225 Difference]: With dead ends: 1099 [2025-02-05 22:18:04,835 INFO L226 Difference]: Without dead ends: 567 [2025-02-05 22:18:04,837 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 345 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2025-02-05 22:18:04,838 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 129 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 22:18:04,838 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 238 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 22:18:04,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2025-02-05 22:18:04,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 551. [2025-02-05 22:18:04,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 551 states, 402 states have (on average 1.3482587064676617) internal successors, (542), 406 states have internal predecessors, (542), 136 states have call successors, (136), 12 states have call predecessors, (136), 12 states have return successors, (136), 132 states have call predecessors, (136), 136 states have call successors, (136) [2025-02-05 22:18:04,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 814 transitions. [2025-02-05 22:18:04,913 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 814 transitions. Word has length 174 [2025-02-05 22:18:04,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:18:04,914 INFO L471 AbstractCegarLoop]: Abstraction has 551 states and 814 transitions. [2025-02-05 22:18:04,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 2 states have call successors, (35), 2 states have call predecessors, (35), 4 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2025-02-05 22:18:04,914 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 814 transitions. [2025-02-05 22:18:04,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-02-05 22:18:04,916 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:18:04,917 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:18:04,926 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-05 22:18:05,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 22:18:05,118 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:18:05,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:18:05,118 INFO L85 PathProgramCache]: Analyzing trace with hash 1046878015, now seen corresponding path program 1 times [2025-02-05 22:18:05,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:18:05,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077808574] [2025-02-05 22:18:05,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:18:05,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:18:05,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-02-05 22:18:05,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-02-05 22:18:05,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:18:05,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:18:05,873 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 117 proven. 90 refuted. 0 times theorem prover too weak. 1093 trivial. 0 not checked. [2025-02-05 22:18:05,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:18:05,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077808574] [2025-02-05 22:18:05,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077808574] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 22:18:05,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1834159146] [2025-02-05 22:18:05,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:18:05,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 22:18:05,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 22:18:05,876 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 22:18:05,880 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 22:18:05,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-02-05 22:18:06,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-02-05 22:18:06,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:18:06,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:18:06,009 INFO L256 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-02-05 22:18:06,014 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 22:18:06,791 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 788 proven. 90 refuted. 0 times theorem prover too weak. 422 trivial. 0 not checked. [2025-02-05 22:18:06,792 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 22:18:07,428 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 117 proven. 99 refuted. 0 times theorem prover too weak. 1084 trivial. 0 not checked. [2025-02-05 22:18:07,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1834159146] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 22:18:07,429 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 22:18:07,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13, 13] total 23 [2025-02-05 22:18:07,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315885286] [2025-02-05 22:18:07,429 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 22:18:07,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-02-05 22:18:07,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:18:07,431 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-02-05 22:18:07,431 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=379, Unknown=0, NotChecked=0, Total=506 [2025-02-05 22:18:07,431 INFO L87 Difference]: Start difference. First operand 551 states and 814 transitions. Second operand has 23 states, 23 states have (on average 3.4782608695652173) internal successors, (80), 23 states have internal predecessors, (80), 4 states have call successors, (39), 4 states have call predecessors, (39), 10 states have return successors, (42), 4 states have call predecessors, (42), 4 states have call successors, (42) [2025-02-05 22:18:08,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:18:08,899 INFO L93 Difference]: Finished difference Result 1249 states and 1788 transitions. [2025-02-05 22:18:08,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2025-02-05 22:18:08,900 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.4782608695652173) internal successors, (80), 23 states have internal predecessors, (80), 4 states have call successors, (39), 4 states have call predecessors, (39), 10 states have return successors, (42), 4 states have call predecessors, (42), 4 states have call successors, (42) Word has length 174 [2025-02-05 22:18:08,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:18:08,907 INFO L225 Difference]: With dead ends: 1249 [2025-02-05 22:18:08,910 INFO L226 Difference]: Without dead ends: 970 [2025-02-05 22:18:08,913 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 391 GetRequests, 340 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 702 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=638, Invalid=1912, Unknown=0, NotChecked=0, Total=2550 [2025-02-05 22:18:08,915 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 461 mSDsluCounter, 679 mSDsCounter, 0 mSdLazyCounter, 731 mSolverCounterSat, 261 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 495 SdHoareTripleChecker+Valid, 805 SdHoareTripleChecker+Invalid, 992 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 261 IncrementalHoareTripleChecker+Valid, 731 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 22:18:08,915 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [495 Valid, 805 Invalid, 992 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [261 Valid, 731 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 22:18:08,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 970 states. [2025-02-05 22:18:08,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 970 to 765. [2025-02-05 22:18:08,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 765 states, 552 states have (on average 1.3079710144927537) internal successors, (722), 558 states have internal predecessors, (722), 182 states have call successors, (182), 30 states have call predecessors, (182), 30 states have return successors, (182), 176 states have call predecessors, (182), 182 states have call successors, (182) [2025-02-05 22:18:08,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 765 states to 765 states and 1086 transitions. [2025-02-05 22:18:09,001 INFO L78 Accepts]: Start accepts. Automaton has 765 states and 1086 transitions. Word has length 174 [2025-02-05 22:18:09,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:18:09,001 INFO L471 AbstractCegarLoop]: Abstraction has 765 states and 1086 transitions. [2025-02-05 22:18:09,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.4782608695652173) internal successors, (80), 23 states have internal predecessors, (80), 4 states have call successors, (39), 4 states have call predecessors, (39), 10 states have return successors, (42), 4 states have call predecessors, (42), 4 states have call successors, (42) [2025-02-05 22:18:09,002 INFO L276 IsEmpty]: Start isEmpty. Operand 765 states and 1086 transitions. [2025-02-05 22:18:09,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-02-05 22:18:09,004 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:18:09,004 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:18:09,013 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 22:18:09,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 22:18:09,206 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:18:09,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:18:09,206 INFO L85 PathProgramCache]: Analyzing trace with hash -227021380, now seen corresponding path program 1 times [2025-02-05 22:18:09,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:18:09,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203089895] [2025-02-05 22:18:09,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:18:09,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:18:09,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-02-05 22:18:09,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-02-05 22:18:09,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:18:09,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-05 22:18:09,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [505553243] [2025-02-05 22:18:09,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:18:09,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 22:18:09,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 22:18:09,325 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 22:18:09,328 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 22:18:09,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-02-05 22:18:09,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-02-05 22:18:09,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:18:09,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:18:09,606 INFO L256 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-05 22:18:09,610 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 22:18:09,999 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 805 proven. 54 refuted. 0 times theorem prover too weak. 441 trivial. 0 not checked. [2025-02-05 22:18:09,999 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 22:18:10,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:18:10,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203089895] [2025-02-05 22:18:10,325 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-05 22:18:10,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [505553243] [2025-02-05 22:18:10,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [505553243] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 22:18:10,325 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-02-05 22:18:10,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2025-02-05 22:18:10,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704549546] [2025-02-05 22:18:10,326 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-02-05 22:18:10,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 22:18:10,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:18:10,327 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 22:18:10,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2025-02-05 22:18:10,327 INFO L87 Difference]: Start difference. First operand 765 states and 1086 transitions. Second operand has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 3 states have call successors, (26), 3 states have call predecessors, (26), 5 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) [2025-02-05 22:18:10,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:18:10,912 INFO L93 Difference]: Finished difference Result 1887 states and 2603 transitions. [2025-02-05 22:18:10,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-05 22:18:10,913 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 3 states have call successors, (26), 3 states have call predecessors, (26), 5 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) Word has length 174 [2025-02-05 22:18:10,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:18:10,920 INFO L225 Difference]: With dead ends: 1887 [2025-02-05 22:18:10,921 INFO L226 Difference]: Without dead ends: 1146 [2025-02-05 22:18:10,923 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=125, Invalid=255, Unknown=0, NotChecked=0, Total=380 [2025-02-05 22:18:10,924 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 159 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 22:18:10,924 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 452 Invalid, 459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 428 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 22:18:10,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1146 states. [2025-02-05 22:18:11,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1146 to 806. [2025-02-05 22:18:11,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 806 states, 605 states have (on average 1.3008264462809918) internal successors, (787), 608 states have internal predecessors, (787), 158 states have call successors, (158), 42 states have call predecessors, (158), 42 states have return successors, (158), 155 states have call predecessors, (158), 158 states have call successors, (158) [2025-02-05 22:18:11,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 806 states and 1103 transitions. [2025-02-05 22:18:11,016 INFO L78 Accepts]: Start accepts. Automaton has 806 states and 1103 transitions. Word has length 174 [2025-02-05 22:18:11,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:18:11,017 INFO L471 AbstractCegarLoop]: Abstraction has 806 states and 1103 transitions. [2025-02-05 22:18:11,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 3 states have call successors, (26), 3 states have call predecessors, (26), 5 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) [2025-02-05 22:18:11,018 INFO L276 IsEmpty]: Start isEmpty. Operand 806 states and 1103 transitions. [2025-02-05 22:18:11,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-02-05 22:18:11,020 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:18:11,020 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:18:11,030 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-05 22:18:11,224 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,SelfDestructingSolverStorable6 [2025-02-05 22:18:11,225 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:18:11,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:18:11,225 INFO L85 PathProgramCache]: Analyzing trace with hash 946821074, now seen corresponding path program 1 times [2025-02-05 22:18:11,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:18:11,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862177350] [2025-02-05 22:18:11,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:18:11,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:18:11,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-02-05 22:18:11,322 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-02-05 22:18:11,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:18:11,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-05 22:18:11,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1475343396] [2025-02-05 22:18:11,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:18:11,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 22:18:11,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 22:18:11,328 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 22:18:11,331 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 22:18:11,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-02-05 22:18:11,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-02-05 22:18:11,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:18:11,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 22:18:11,831 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-05 22:18:11,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-02-05 22:18:11,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-02-05 22:18:11,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:18:11,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 22:18:12,117 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-05 22:18:12,117 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-05 22:18:12,118 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-05 22:18:12,132 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 22:18:12,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 22:18:12,326 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:18:12,443 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-05 22:18:12,459 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 10:18:12 BoogieIcfgContainer [2025-02-05 22:18:12,459 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-05 22:18:12,459 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-05 22:18:12,459 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-05 22:18:12,459 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-05 22:18:12,460 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:18:00" (3/4) ... [2025-02-05 22:18:12,462 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-05 22:18:12,463 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-05 22:18:12,464 INFO L158 Benchmark]: Toolchain (without parser) took 13350.94ms. Allocated memory was 142.6MB in the beginning and 243.3MB in the end (delta: 100.7MB). Free memory was 112.0MB in the beginning and 206.0MB in the end (delta: -94.0MB). Peak memory consumption was 7.3MB. Max. memory is 16.1GB. [2025-02-05 22:18:12,464 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 123.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 22:18:12,464 INFO L158 Benchmark]: CACSL2BoogieTranslator took 294.18ms. Allocated memory is still 142.6MB. Free memory was 112.0MB in the beginning and 96.7MB in the end (delta: 15.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-05 22:18:12,465 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.90ms. Allocated memory is still 142.6MB. Free memory was 96.7MB in the beginning and 93.1MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 22:18:12,465 INFO L158 Benchmark]: Boogie Preprocessor took 53.51ms. Allocated memory is still 142.6MB. Free memory was 93.1MB in the beginning and 89.7MB in the end (delta: 3.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 22:18:12,465 INFO L158 Benchmark]: IcfgBuilder took 612.75ms. Allocated memory is still 142.6MB. Free memory was 89.7MB in the beginning and 64.1MB in the end (delta: 25.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-05 22:18:12,465 INFO L158 Benchmark]: TraceAbstraction took 12339.10ms. Allocated memory was 142.6MB in the beginning and 243.3MB in the end (delta: 100.7MB). Free memory was 63.7MB in the beginning and 206.1MB in the end (delta: -142.4MB). Peak memory consumption was 91.2MB. Max. memory is 16.1GB. [2025-02-05 22:18:12,466 INFO L158 Benchmark]: Witness Printer took 3.94ms. Allocated memory is still 243.3MB. Free memory was 206.1MB in the beginning and 206.0MB in the end (delta: 48.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 22:18:12,467 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 123.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 294.18ms. Allocated memory is still 142.6MB. Free memory was 112.0MB in the beginning and 96.7MB in the end (delta: 15.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.90ms. Allocated memory is still 142.6MB. Free memory was 96.7MB in the beginning and 93.1MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 53.51ms. Allocated memory is still 142.6MB. Free memory was 93.1MB in the beginning and 89.7MB in the end (delta: 3.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 612.75ms. Allocated memory is still 142.6MB. Free memory was 89.7MB in the beginning and 64.1MB in the end (delta: 25.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 12339.10ms. Allocated memory was 142.6MB in the beginning and 243.3MB in the end (delta: 100.7MB). Free memory was 63.7MB in the beginning and 206.1MB in the end (delta: -142.4MB). Peak memory consumption was 91.2MB. Max. memory is 16.1GB. * Witness Printer took 3.94ms. Allocated memory is still 243.3MB. Free memory was 206.1MB in the beginning and 206.0MB in the end (delta: 48.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of shiftRight at line 60, overapproximation of someBinaryFLOATComparisonOperation at line 144, overapproximation of someBinaryFLOATComparisonOperation at line 109, overapproximation of someBinaryFLOATComparisonOperation at line 177, overapproximation of someBinaryFLOATComparisonOperation at line 142, overapproximation of someBinaryFLOATComparisonOperation at line 55, overapproximation of someBinaryFLOATComparisonOperation at line 152, overapproximation of someBinaryFLOATComparisonOperation at line 151, overapproximation of someBinaryFLOATComparisonOperation at line 146, overapproximation of someBinaryFLOATComparisonOperation at line 140, overapproximation of someBinaryFLOATComparisonOperation at line 89, overapproximation of someBinaryFLOATComparisonOperation at line 177, overapproximation of someBinaryArithmeticFLOAToperation at line 82. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] float var_1_1 = 3.9; [L23] unsigned char var_1_2 = 0; [L24] unsigned char var_1_3 = 0; [L25] float var_1_4 = 31.5; [L26] float var_1_5 = 25.4; [L27] float var_1_6 = 9.5; [L28] float var_1_7 = 63.2; [L29] unsigned long int var_1_8 = 1; [L30] signed short int var_1_10 = -50; [L31] unsigned long int var_1_11 = 8; [L32] unsigned char var_1_12 = 32; [L33] float var_1_13 = 15.625; [L34] unsigned char var_1_14 = 1; [L35] unsigned char var_1_15 = 0; [L36] unsigned char var_1_16 = 1; [L37] unsigned char var_1_17 = 1; [L38] unsigned char var_1_19 = 0; [L39] unsigned char var_1_20 = 8; [L40] unsigned short int var_1_21 = 16; [L41] unsigned short int var_1_22 = 128; [L42] signed short int var_1_23 = 128; [L43] unsigned short int var_1_25 = 32; [L44] unsigned char var_1_29 = 1; [L45] unsigned long int var_1_31 = 0; [L46] unsigned char var_1_32 = 1; [L47] unsigned short int var_1_33 = 1000; [L48] signed char var_1_38 = 25; [L49] unsigned short int var_1_39 = 200; [L50] unsigned char var_1_43 = 10; [L51] unsigned char var_1_47 = 0; VAL [isInitial=0, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=0, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=0, var_1_43=10, var_1_47=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L181] isInitial = 1 [L182] FCALL initially() [L183] COND TRUE 1 [L184] FCALL updateLastVariables() [L185] CALL updateVariables() [L133] var_1_2 = __VERIFIER_nondet_uchar() [L134] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=0, var_1_43=10, var_1_47=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=0, var_1_43=10, var_1_47=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L134] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=0, var_1_43=10, var_1_47=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L135] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=-255, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=0, var_1_43=10, var_1_47=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=-255, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=0, var_1_43=10, var_1_47=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L135] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=-255, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=0, var_1_43=10, var_1_47=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L136] var_1_3 = __VERIFIER_nondet_uchar() [L137] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=-255, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_43=10, var_1_47=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=-255, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_43=10, var_1_47=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L137] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=-255, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_43=10, var_1_47=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L138] CALL assume_abort_if_not(var_1_3 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=-255, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=-255, var_1_43=10, var_1_47=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=-255, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=-255, var_1_43=10, var_1_47=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L138] RET assume_abort_if_not(var_1_3 <= 1) VAL [isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=-255, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=-255, var_1_43=10, var_1_47=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L139] var_1_4 = __VERIFIER_nondet_float() [L140] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=-255, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=-255, var_1_43=10, var_1_47=0, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=-255, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=-255, var_1_43=10, var_1_47=0, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L140] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=-255, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=-255, var_1_43=10, var_1_47=0, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L141] var_1_5 = __VERIFIER_nondet_float() [L142] CALL assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=-255, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=-255, var_1_43=10, var_1_47=0, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=-255, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=-255, var_1_43=10, var_1_47=0, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L142] RET assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=-255, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=-255, var_1_43=10, var_1_47=0, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L143] var_1_6 = __VERIFIER_nondet_float() [L144] CALL assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=-255, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=-255, var_1_43=10, var_1_47=0, var_1_7=316/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=-255, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=-255, var_1_43=10, var_1_47=0, var_1_7=316/5, var_1_8=1] [L144] RET assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=-255, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=-255, var_1_43=10, var_1_47=0, var_1_7=316/5, var_1_8=1] [L145] var_1_7 = __VERIFIER_nondet_float() [L146] CALL assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=-255, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=-255, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=-255, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=-255, var_1_43=10, var_1_47=0, var_1_8=1] [L146] RET assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=-255, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=-255, var_1_43=10, var_1_47=0, var_1_8=1] [L147] var_1_11 = __VERIFIER_nondet_ulong() [L148] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=-255, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=-255, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=-255, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=-255, var_1_43=10, var_1_47=0, var_1_8=1] [L148] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, var_1_10=-50, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=-255, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=-255, var_1_43=10, var_1_47=0, var_1_8=1] [L149] CALL assume_abort_if_not(var_1_11 <= 33) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=4294967305, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=-255, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=-255, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=4294967305, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=-255, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=-255, var_1_43=10, var_1_47=0, var_1_8=1] [L149] RET assume_abort_if_not(var_1_11 <= 33) VAL [isInitial=1, var_1_10=-50, var_1_11=4294967305, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=-255, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=-255, var_1_43=10, var_1_47=0, var_1_8=1] [L150] var_1_13 = __VERIFIER_nondet_float() [L151] CALL assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=4294967305, var_1_12=32, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=-255, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=-255, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=4294967305, var_1_12=32, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=-255, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=-255, var_1_43=10, var_1_47=0, var_1_8=1] [L151] RET assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-50, var_1_11=4294967305, var_1_12=32, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=-255, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=-255, var_1_43=10, var_1_47=0, var_1_8=1] [L152] CALL assume_abort_if_not(var_1_13 != 0.0F) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=4294967305, var_1_12=32, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=-255, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=-255, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=4294967305, var_1_12=32, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=-255, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=-255, var_1_43=10, var_1_47=0, var_1_8=1] [L152] RET assume_abort_if_not(var_1_13 != 0.0F) VAL [isInitial=1, var_1_10=-50, var_1_11=4294967305, var_1_12=32, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=-255, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=-255, var_1_43=10, var_1_47=0, var_1_8=1] [L153] var_1_15 = __VERIFIER_nondet_uchar() [L154] CALL assume_abort_if_not(var_1_15 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=4294967305, var_1_12=32, var_1_14=1, var_1_15=-255, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=-255, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=-255, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=4294967305, var_1_12=32, var_1_14=1, var_1_15=-255, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=-255, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=-255, var_1_43=10, var_1_47=0, var_1_8=1] [L154] RET assume_abort_if_not(var_1_15 >= 1) VAL [isInitial=1, var_1_10=-50, var_1_11=4294967305, var_1_12=32, var_1_14=1, var_1_15=-255, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=-255, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=-255, var_1_43=10, var_1_47=0, var_1_8=1] [L155] CALL assume_abort_if_not(var_1_15 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=4294967305, var_1_12=32, var_1_14=1, var_1_15=-255, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=-255, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=-255, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=4294967305, var_1_12=32, var_1_14=1, var_1_15=-255, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=-255, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=-255, var_1_43=10, var_1_47=0, var_1_8=1] [L155] RET assume_abort_if_not(var_1_15 <= 1) VAL [isInitial=1, var_1_10=-50, var_1_11=4294967305, var_1_12=32, var_1_14=1, var_1_15=-255, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=-255, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=-255, var_1_43=10, var_1_47=0, var_1_8=1] [L156] var_1_16 = __VERIFIER_nondet_uchar() [L157] CALL assume_abort_if_not(var_1_16 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=4294967305, var_1_12=32, var_1_14=1, var_1_15=-255, var_1_16=-255, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=-255, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=-255, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=4294967305, var_1_12=32, var_1_14=1, var_1_15=-255, var_1_16=-255, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=-255, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=-255, var_1_43=10, var_1_47=0, var_1_8=1] [L157] RET assume_abort_if_not(var_1_16 >= 1) VAL [isInitial=1, var_1_10=-50, var_1_11=4294967305, var_1_12=32, var_1_14=1, var_1_15=-255, var_1_16=-255, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=-255, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=-255, var_1_43=10, var_1_47=0, var_1_8=1] [L158] CALL assume_abort_if_not(var_1_16 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=4294967305, var_1_12=32, var_1_14=1, var_1_15=-255, var_1_16=-255, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=-255, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=-255, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=4294967305, var_1_12=32, var_1_14=1, var_1_15=-255, var_1_16=-255, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=-255, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=-255, var_1_43=10, var_1_47=0, var_1_8=1] [L158] RET assume_abort_if_not(var_1_16 <= 1) VAL [isInitial=1, var_1_10=-50, var_1_11=4294967305, var_1_12=32, var_1_14=1, var_1_15=-255, var_1_16=-255, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=-255, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=-255, var_1_43=10, var_1_47=0, var_1_8=1] [L159] var_1_17 = __VERIFIER_nondet_uchar() [L160] CALL assume_abort_if_not(var_1_17 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=4294967305, var_1_12=32, var_1_14=1, var_1_15=-255, var_1_16=-255, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=-255, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=-255, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=4294967305, var_1_12=32, var_1_14=1, var_1_15=-255, var_1_16=-255, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=-255, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=-255, var_1_43=10, var_1_47=0, var_1_8=1] [L160] RET assume_abort_if_not(var_1_17 >= 1) VAL [isInitial=1, var_1_10=-50, var_1_11=4294967305, var_1_12=32, var_1_14=1, var_1_15=-255, var_1_16=-255, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=-255, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=-255, var_1_43=10, var_1_47=0, var_1_8=1] [L161] CALL assume_abort_if_not(var_1_17 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=4294967305, var_1_12=32, var_1_14=1, var_1_15=-255, var_1_16=-255, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=-255, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=-255, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=4294967305, var_1_12=32, var_1_14=1, var_1_15=-255, var_1_16=-255, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=-255, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=-255, var_1_43=10, var_1_47=0, var_1_8=1] [L161] RET assume_abort_if_not(var_1_17 <= 1) VAL [isInitial=1, var_1_10=-50, var_1_11=4294967305, var_1_12=32, var_1_14=1, var_1_15=-255, var_1_16=-255, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=-255, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=-255, var_1_43=10, var_1_47=0, var_1_8=1] [L162] var_1_19 = __VERIFIER_nondet_uchar() [L163] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=4294967305, var_1_12=32, var_1_14=1, var_1_15=-255, var_1_16=-255, var_1_17=1, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=-255, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=-255, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=4294967305, var_1_12=32, var_1_14=1, var_1_15=-255, var_1_16=-255, var_1_17=1, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=-255, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=-255, var_1_43=10, var_1_47=0, var_1_8=1] [L163] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, var_1_10=-50, var_1_11=4294967305, var_1_12=32, var_1_14=1, var_1_15=-255, var_1_16=-255, var_1_17=1, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=-255, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=-255, var_1_43=10, var_1_47=0, var_1_8=1] [L164] CALL assume_abort_if_not(var_1_19 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=4294967305, var_1_12=32, var_1_14=1, var_1_15=-255, var_1_16=-255, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=-255, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=-255, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=4294967305, var_1_12=32, var_1_14=1, var_1_15=-255, var_1_16=-255, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=-255, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=-255, var_1_43=10, var_1_47=0, var_1_8=1] [L164] RET assume_abort_if_not(var_1_19 <= 0) VAL [isInitial=1, var_1_10=-50, var_1_11=4294967305, var_1_12=32, var_1_14=1, var_1_15=-255, var_1_16=-255, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=-255, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=-255, var_1_43=10, var_1_47=0, var_1_8=1] [L165] var_1_33 = __VERIFIER_nondet_ushort() [L166] CALL assume_abort_if_not(var_1_33 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=4294967305, var_1_12=32, var_1_14=1, var_1_15=-255, var_1_16=-255, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=-255, var_1_31=0, var_1_32=1, var_1_38=25, var_1_39=200, var_1_3=-255, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=4294967305, var_1_12=32, var_1_14=1, var_1_15=-255, var_1_16=-255, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=-255, var_1_31=0, var_1_32=1, var_1_38=25, var_1_39=200, var_1_3=-255, var_1_43=10, var_1_47=0, var_1_8=1] [L166] RET assume_abort_if_not(var_1_33 >= 0) VAL [isInitial=1, var_1_10=-50, var_1_11=4294967305, var_1_12=32, var_1_14=1, var_1_15=-255, var_1_16=-255, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=-255, var_1_31=0, var_1_32=1, var_1_38=25, var_1_39=200, var_1_3=-255, var_1_43=10, var_1_47=0, var_1_8=1] [L167] CALL assume_abort_if_not(var_1_33 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=4294967305, var_1_12=32, var_1_14=1, var_1_15=-255, var_1_16=-255, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=-255, var_1_31=0, var_1_32=1, var_1_38=25, var_1_39=200, var_1_3=-255, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=4294967305, var_1_12=32, var_1_14=1, var_1_15=-255, var_1_16=-255, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=-255, var_1_31=0, var_1_32=1, var_1_38=25, var_1_39=200, var_1_3=-255, var_1_43=10, var_1_47=0, var_1_8=1] [L167] RET assume_abort_if_not(var_1_33 <= 65535) VAL [isInitial=1, var_1_10=-50, var_1_11=4294967305, var_1_12=32, var_1_14=1, var_1_15=-255, var_1_16=-255, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=-255, var_1_31=0, var_1_32=1, var_1_38=25, var_1_39=200, var_1_3=-255, var_1_43=10, var_1_47=0, var_1_8=1] [L168] CALL assume_abort_if_not(var_1_33 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=4294967305, var_1_12=32, var_1_14=1, var_1_15=-255, var_1_16=-255, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=-255, var_1_31=0, var_1_32=1, var_1_33=131074, var_1_38=25, var_1_39=200, var_1_3=-255, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=4294967305, var_1_12=32, var_1_14=1, var_1_15=-255, var_1_16=-255, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=-255, var_1_31=0, var_1_32=1, var_1_33=131074, var_1_38=25, var_1_39=200, var_1_3=-255, var_1_43=10, var_1_47=0, var_1_8=1] [L168] RET assume_abort_if_not(var_1_33 != 0) VAL [isInitial=1, var_1_10=-50, var_1_11=4294967305, var_1_12=32, var_1_14=1, var_1_15=-255, var_1_16=-255, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=-255, var_1_31=0, var_1_32=1, var_1_33=131074, var_1_38=25, var_1_39=200, var_1_3=-255, var_1_43=10, var_1_47=0, var_1_8=1] [L169] var_1_39 = __VERIFIER_nondet_ushort() [L170] CALL assume_abort_if_not(var_1_39 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=4294967305, var_1_12=32, var_1_14=1, var_1_15=-255, var_1_16=-255, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=-255, var_1_31=0, var_1_32=1, var_1_33=131074, var_1_38=25, var_1_3=-255, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=4294967305, var_1_12=32, var_1_14=1, var_1_15=-255, var_1_16=-255, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=-255, var_1_31=0, var_1_32=1, var_1_33=131074, var_1_38=25, var_1_3=-255, var_1_43=10, var_1_47=0, var_1_8=1] [L170] RET assume_abort_if_not(var_1_39 >= 0) VAL [isInitial=1, var_1_10=-50, var_1_11=4294967305, var_1_12=32, var_1_14=1, var_1_15=-255, var_1_16=-255, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=-255, var_1_31=0, var_1_32=1, var_1_33=131074, var_1_38=25, var_1_3=-255, var_1_43=10, var_1_47=0, var_1_8=1] [L171] CALL assume_abort_if_not(var_1_39 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=4294967305, var_1_12=32, var_1_14=1, var_1_15=-255, var_1_16=-255, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=-255, var_1_31=0, var_1_32=1, var_1_33=131074, var_1_38=25, var_1_3=-255, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=4294967305, var_1_12=32, var_1_14=1, var_1_15=-255, var_1_16=-255, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=-255, var_1_31=0, var_1_32=1, var_1_33=131074, var_1_38=25, var_1_3=-255, var_1_43=10, var_1_47=0, var_1_8=1] [L171] RET assume_abort_if_not(var_1_39 <= 65535) VAL [isInitial=1, var_1_10=-50, var_1_11=4294967305, var_1_12=32, var_1_14=1, var_1_15=-255, var_1_16=-255, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=-255, var_1_31=0, var_1_32=1, var_1_33=131074, var_1_38=25, var_1_3=-255, var_1_43=10, var_1_47=0, var_1_8=1] [L172] CALL assume_abort_if_not(var_1_39 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=4294967305, var_1_12=32, var_1_14=1, var_1_15=-255, var_1_16=-255, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=-255, var_1_31=0, var_1_32=1, var_1_33=131074, var_1_38=25, var_1_39=2, var_1_3=-255, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=4294967305, var_1_12=32, var_1_14=1, var_1_15=-255, var_1_16=-255, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=-255, var_1_31=0, var_1_32=1, var_1_33=131074, var_1_38=25, var_1_39=2, var_1_3=-255, var_1_43=10, var_1_47=0, var_1_8=1] [L172] RET assume_abort_if_not(var_1_39 != 0) VAL [isInitial=1, var_1_10=-50, var_1_11=4294967305, var_1_12=32, var_1_14=1, var_1_15=-255, var_1_16=-255, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=-255, var_1_31=0, var_1_32=1, var_1_33=131074, var_1_38=25, var_1_39=2, var_1_3=-255, var_1_43=10, var_1_47=0, var_1_8=1] [L185] RET updateVariables() [L186] CALL step() [L55] COND TRUE var_1_6 == (var_1_4 / var_1_13) [L56] var_1_12 = var_1_11 VAL [isInitial=1, var_1_10=-50, var_1_11=4294967305, var_1_12=4294967305, var_1_14=1, var_1_15=-255, var_1_16=-255, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=-255, var_1_31=0, var_1_32=1, var_1_33=131074, var_1_38=25, var_1_39=2, var_1_3=-255, var_1_43=10, var_1_47=0, var_1_8=1] [L58] var_1_20 = var_1_11 [L59] var_1_21 = 8 VAL [isInitial=1, var_1_10=-50, var_1_11=4294967305, var_1_12=4294967305, var_1_14=1, var_1_15=-255, var_1_16=-255, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=4294967305, var_1_21=8, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=-255, var_1_31=0, var_1_32=1, var_1_33=131074, var_1_38=25, var_1_39=2, var_1_3=-255, var_1_43=10, var_1_47=0, var_1_8=1] [L60] EXPR 2u >> var_1_11 VAL [isInitial=1, var_1_10=-50, var_1_11=4294967305, var_1_12=4294967305, var_1_14=1, var_1_15=-255, var_1_16=-255, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=4294967305, var_1_21=8, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=-255, var_1_31=0, var_1_32=1, var_1_33=131074, var_1_38=25, var_1_39=2, var_1_3=-255, var_1_43=10, var_1_47=0, var_1_8=1] [L60] COND FALSE !((var_1_21 + var_1_12) > (2u >> var_1_11)) [L67] COND FALSE !(! var_1_2) VAL [isInitial=1, var_1_10=-50, var_1_11=4294967305, var_1_12=4294967305, var_1_14=1, var_1_15=-255, var_1_16=-255, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=4294967305, var_1_21=8, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=-255, var_1_31=0, var_1_32=1, var_1_33=131074, var_1_38=25, var_1_39=2, var_1_3=-255, var_1_43=10, var_1_47=0, var_1_8=1] [L78] unsigned char stepLocal_1 = var_1_14; [L79] unsigned char stepLocal_0 = var_1_14; VAL [isInitial=1, stepLocal_0=1, stepLocal_1=1, var_1_10=-50, var_1_11=4294967305, var_1_12=4294967305, var_1_14=1, var_1_15=-255, var_1_16=-255, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=4294967305, var_1_21=8, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=-255, var_1_31=0, var_1_32=1, var_1_33=131074, var_1_38=25, var_1_39=2, var_1_3=-255, var_1_43=10, var_1_47=0, var_1_8=1] [L80] COND TRUE var_1_14 || stepLocal_0 VAL [isInitial=1, stepLocal_1=1, var_1_10=-50, var_1_11=4294967305, var_1_12=4294967305, var_1_14=1, var_1_15=-255, var_1_16=-255, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=4294967305, var_1_21=8, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=-255, var_1_31=0, var_1_32=1, var_1_33=131074, var_1_38=25, var_1_39=2, var_1_3=-255, var_1_43=10, var_1_47=0, var_1_8=1] [L81] COND TRUE stepLocal_1 || var_1_14 [L82] var_1_1 = (((((((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5)))) > (var_1_6)) ? (((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5)))) : (var_1_6))) - var_1_7) VAL [isInitial=1, var_1_10=-50, var_1_11=4294967305, var_1_12=4294967305, var_1_14=1, var_1_15=-255, var_1_16=-255, var_1_17=1, var_1_19=0, var_1_20=4294967305, var_1_21=8, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=-255, var_1_31=0, var_1_32=1, var_1_33=131074, var_1_38=25, var_1_39=2, var_1_3=-255, var_1_43=10, var_1_47=0, var_1_8=1] [L89] COND FALSE !(var_1_6 > (- var_1_7)) [L94] var_1_8 = var_1_20 VAL [isInitial=1, var_1_10=-50, var_1_11=4294967305, var_1_12=4294967305, var_1_14=1, var_1_15=-255, var_1_16=-255, var_1_17=1, var_1_19=0, var_1_20=4294967305, var_1_21=8, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=-255, var_1_31=0, var_1_32=1, var_1_33=131074, var_1_38=25, var_1_39=2, var_1_3=-255, var_1_43=10, var_1_47=0, var_1_8=9] [L96] var_1_22 = var_1_8 [L97] var_1_23 = var_1_12 VAL [isInitial=1, var_1_10=-50, var_1_11=4294967305, var_1_12=4294967305, var_1_14=1, var_1_15=-255, var_1_16=-255, var_1_17=1, var_1_19=0, var_1_20=4294967305, var_1_21=8, var_1_22=9, var_1_23=9, var_1_25=32, var_1_29=1, var_1_2=-255, var_1_31=0, var_1_32=1, var_1_33=131074, var_1_38=25, var_1_39=2, var_1_3=-255, var_1_43=10, var_1_47=0, var_1_8=9] [L98] COND FALSE !(var_1_11 < var_1_12) VAL [isInitial=1, var_1_10=-50, var_1_11=4294967305, var_1_12=4294967305, var_1_14=1, var_1_15=-255, var_1_16=-255, var_1_17=1, var_1_19=0, var_1_20=4294967305, var_1_21=8, var_1_22=9, var_1_23=9, var_1_25=32, var_1_29=1, var_1_2=-255, var_1_31=0, var_1_32=1, var_1_33=131074, var_1_38=25, var_1_39=2, var_1_3=-255, var_1_43=10, var_1_47=0, var_1_8=9] [L103] var_1_29 = var_1_19 VAL [isInitial=1, var_1_10=-50, var_1_11=4294967305, var_1_12=4294967305, var_1_14=1, var_1_15=-255, var_1_16=-255, var_1_17=1, var_1_19=0, var_1_20=4294967305, var_1_21=8, var_1_22=9, var_1_23=9, var_1_25=32, var_1_29=0, var_1_2=-255, var_1_31=0, var_1_32=1, var_1_33=131074, var_1_38=25, var_1_39=2, var_1_3=-255, var_1_43=10, var_1_47=0, var_1_8=9] [L104] COND TRUE var_1_11 >= var_1_11 [L105] var_1_31 = ((((var_1_11) > (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))))) ? (var_1_11) : (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11)))))) VAL [isInitial=1, var_1_10=-50, var_1_11=4294967305, var_1_12=4294967305, var_1_14=1, var_1_15=-255, var_1_16=-255, var_1_17=1, var_1_19=0, var_1_20=4294967305, var_1_21=8, var_1_22=9, var_1_23=9, var_1_25=32, var_1_29=0, var_1_2=-255, var_1_31=4294967305, var_1_32=1, var_1_33=131074, var_1_38=25, var_1_39=2, var_1_3=-255, var_1_43=10, var_1_47=0, var_1_8=9] [L107] COND TRUE var_1_20 < (~ (var_1_11 / var_1_33)) VAL [isInitial=1, var_1_10=-50, var_1_11=4294967305, var_1_12=4294967305, var_1_14=1, var_1_15=-255, var_1_16=-255, var_1_17=1, var_1_19=0, var_1_20=4294967305, var_1_21=8, var_1_22=9, var_1_23=9, var_1_25=32, var_1_29=0, var_1_2=-255, var_1_31=4294967305, var_1_32=1, var_1_33=131074, var_1_38=25, var_1_39=2, var_1_3=-255, var_1_43=10, var_1_47=0, var_1_8=9] [L108] COND TRUE \read(var_1_17) VAL [isInitial=1, var_1_10=-50, var_1_11=4294967305, var_1_12=4294967305, var_1_14=1, var_1_15=-255, var_1_16=-255, var_1_17=1, var_1_19=0, var_1_20=4294967305, var_1_21=8, var_1_22=9, var_1_23=9, var_1_25=32, var_1_29=0, var_1_2=-255, var_1_31=4294967305, var_1_32=1, var_1_33=131074, var_1_38=25, var_1_39=2, var_1_3=-255, var_1_43=10, var_1_47=0, var_1_8=9] [L109] COND TRUE (var_1_13 * var_1_6) == var_1_5 [L110] var_1_32 = var_1_19 VAL [isInitial=1, var_1_10=-50, var_1_11=4294967305, var_1_12=4294967305, var_1_14=1, var_1_15=-255, var_1_16=-255, var_1_17=1, var_1_19=0, var_1_20=4294967305, var_1_21=8, var_1_22=9, var_1_23=9, var_1_25=32, var_1_29=0, var_1_2=-255, var_1_31=4294967305, var_1_32=0, var_1_33=131074, var_1_38=25, var_1_39=2, var_1_3=-255, var_1_43=10, var_1_47=0, var_1_8=9] [L122] COND FALSE !(\read(var_1_19)) VAL [isInitial=1, var_1_10=-50, var_1_11=4294967305, var_1_12=4294967305, var_1_14=1, var_1_15=-255, var_1_16=-255, var_1_17=1, var_1_19=0, var_1_20=4294967305, var_1_21=8, var_1_22=9, var_1_23=9, var_1_25=32, var_1_29=0, var_1_2=-255, var_1_31=4294967305, var_1_32=0, var_1_33=131074, var_1_38=25, var_1_39=2, var_1_3=-255, var_1_43=10, var_1_47=0, var_1_8=9] [L127] COND TRUE ((((var_1_11) < (var_1_33)) ? (var_1_11) : (var_1_33))) < (var_1_39 + var_1_12) [L128] var_1_43 = ((((var_1_11) < ((((((100 + var_1_11)) > (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))))) ? ((100 + var_1_11)) : (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11)))))))) ? (var_1_11) : ((((((100 + var_1_11)) > (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))))) ? ((100 + var_1_11)) : (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))))))))) VAL [isInitial=1, var_1_10=-50, var_1_11=4294967305, var_1_12=4294967305, var_1_14=1, var_1_15=-255, var_1_16=-255, var_1_17=1, var_1_19=0, var_1_20=4294967305, var_1_21=8, var_1_22=9, var_1_23=9, var_1_25=32, var_1_29=0, var_1_2=-255, var_1_31=4294967305, var_1_32=0, var_1_33=131074, var_1_38=25, var_1_39=2, var_1_3=-255, var_1_43=4294967305, var_1_47=0, var_1_8=9] [L130] var_1_47 = var_1_11 VAL [isInitial=1, var_1_10=-50, var_1_11=4294967305, var_1_12=4294967305, var_1_14=1, var_1_15=-255, var_1_16=-255, var_1_17=1, var_1_19=0, var_1_20=4294967305, var_1_21=8, var_1_22=9, var_1_23=9, var_1_25=32, var_1_29=0, var_1_2=-255, var_1_31=4294967305, var_1_32=0, var_1_33=131074, var_1_38=25, var_1_39=2, var_1_3=-255, var_1_43=4294967305, var_1_47=4294967305, var_1_8=9] [L186] RET step() [L187] CALL, EXPR property() [L177] EXPR (((var_1_14 || var_1_14) ? ((var_1_14 || var_1_14) ? (var_1_1 == ((float) (((((((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5)))) > (var_1_6)) ? (((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5)))) : (var_1_6))) - var_1_7))) : (var_1_1 == ((float) 1.0000000075E8f))) : (var_1_1 == ((float) var_1_7))) && ((var_1_6 > (- var_1_7)) ? ((var_1_5 == (((((var_1_6 * var_1_7)) > (var_1_1)) ? ((var_1_6 * var_1_7)) : (var_1_1)))) ? (var_1_8 == ((unsigned long int) 8u)) : 1) : (var_1_8 == ((unsigned long int) var_1_20)))) && (((var_1_21 + var_1_12) > (2u >> var_1_11)) ? ((var_1_12 != var_1_21) ? (var_1_10 == ((signed short int) var_1_11)) : (var_1_10 == ((signed short int) 128))) : 1) VAL [isInitial=1, var_1_10=-50, var_1_11=4294967305, var_1_12=4294967305, var_1_14=1, var_1_15=-255, var_1_16=-255, var_1_17=1, var_1_19=0, var_1_20=4294967305, var_1_21=8, var_1_22=9, var_1_23=9, var_1_25=32, var_1_29=0, var_1_2=-255, var_1_31=4294967305, var_1_32=0, var_1_33=131074, var_1_38=25, var_1_39=2, var_1_3=-255, var_1_43=4294967305, var_1_47=4294967305, var_1_8=9] [L177-L178] return ((((((((var_1_14 || var_1_14) ? ((var_1_14 || var_1_14) ? (var_1_1 == ((float) (((((((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5)))) > (var_1_6)) ? (((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5)))) : (var_1_6))) - var_1_7))) : (var_1_1 == ((float) 1.0000000075E8f))) : (var_1_1 == ((float) var_1_7))) && ((var_1_6 > (- var_1_7)) ? ((var_1_5 == (((((var_1_6 * var_1_7)) > (var_1_1)) ? ((var_1_6 * var_1_7)) : (var_1_1)))) ? (var_1_8 == ((unsigned long int) 8u)) : 1) : (var_1_8 == ((unsigned long int) var_1_20)))) && (((var_1_21 + var_1_12) > (2u >> var_1_11)) ? ((var_1_12 != var_1_21) ? (var_1_10 == ((signed short int) var_1_11)) : (var_1_10 == ((signed short int) 128))) : 1)) && ((var_1_6 == (var_1_4 / var_1_13)) ? (var_1_12 == ((unsigned char) var_1_11)) : 1)) && ((! var_1_2) ? ((var_1_2 || var_1_3) ? (var_1_14 == ((unsigned char) ((! (! var_1_15)) && (var_1_16 && var_1_17)))) : ((((((var_1_12) > (var_1_12)) ? (var_1_12) : (var_1_12))) >= var_1_21) ? (var_1_14 == ((unsigned char) (var_1_2 || var_1_16))) : (var_1_14 == ((unsigned char) (! var_1_19))))) : 1)) && (var_1_20 == ((unsigned char) var_1_11))) && (var_1_21 == ((unsigned short int) 8))) && (var_1_22 == ((unsigned short int) var_1_8)) ; [L187] RET, EXPR property() [L187] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=-50, var_1_11=4294967305, var_1_12=4294967305, var_1_14=1, var_1_15=-255, var_1_16=-255, var_1_17=1, var_1_19=0, var_1_20=4294967305, var_1_21=8, var_1_22=9, var_1_23=9, var_1_25=32, var_1_29=0, var_1_2=-255, var_1_31=4294967305, var_1_32=0, var_1_33=131074, var_1_38=25, var_1_39=2, var_1_3=-255, var_1_43=4294967305, var_1_47=4294967305, var_1_8=9] [L19] reach_error() VAL [isInitial=1, var_1_10=-50, var_1_11=4294967305, var_1_12=4294967305, var_1_14=1, var_1_15=-255, var_1_16=-255, var_1_17=1, var_1_19=0, var_1_20=4294967305, var_1_21=8, var_1_22=9, var_1_23=9, var_1_25=32, var_1_29=0, var_1_2=-255, var_1_31=4294967305, var_1_32=0, var_1_33=131074, var_1_38=25, var_1_39=2, var_1_3=-255, var_1_43=4294967305, var_1_47=4294967305, var_1_8=9] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 90 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 12.1s, OverallIterations: 8, TraceHistogramMax: 26, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1176 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1110 mSDsluCounter, 2969 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1977 mSDsCounter, 370 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1665 IncrementalHoareTripleChecker+Invalid, 2035 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 370 mSolverCounterUnsat, 992 mSDtfsCounter, 1665 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1163 GetRequests, 1075 SyntacticMatches, 3 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 761 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=806occurred in iteration=7, InterpolantAutomatonStates: 80, 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, 7 MinimizatonAttempts, 575 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 4.9s InterpolantComputationTime, 2256 NumberOfCodeBlocks, 2256 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 2068 ConstructedInterpolants, 0 QuantifiedInterpolants, 5889 SizeOfPredicates, 9 NumberOfNonLiveVariables, 1588 ConjunctsInSsa, 39 ConjunctsInUnsatCore, 12 InterpolantComputations, 4 PerfectInterpolantSequences, 15136/15600 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-02-05 22:18:12,494 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_fillercodestructure_filler-pe-ci_file-27.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 f14202f951fe89438d327807ffbecb479f5f15295ecb3a059a45561896451f31 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 22:18:14,813 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 22:18:14,946 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-02-05 22:18:14,955 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 22:18:14,958 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 22:18:14,988 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 22:18:14,990 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 22:18:14,990 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 22:18:14,990 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 22:18:14,991 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 22:18:14,991 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 22:18:14,992 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 22:18:14,992 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 22:18:14,992 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 22:18:14,992 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 22:18:14,992 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 22:18:14,993 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 22:18:14,993 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 22:18:14,993 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 22:18:14,993 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 22:18:14,993 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 22:18:14,993 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 22:18:14,994 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 22:18:14,994 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-05 22:18:14,994 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-05 22:18:14,994 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-05 22:18:14,994 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 22:18:14,994 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 22:18:14,994 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 22:18:14,994 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 22:18:14,994 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 22:18:14,995 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 22:18:14,995 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 22:18:14,995 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 22:18:14,995 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 22:18:14,995 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 22:18:14,996 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 22:18:14,996 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 22:18:14,996 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 22:18:14,996 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-05 22:18:14,996 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-05 22:18:14,996 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 22:18:14,996 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 22:18:14,996 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 22:18:14,996 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 22:18:14,997 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 -> f14202f951fe89438d327807ffbecb479f5f15295ecb3a059a45561896451f31 [2025-02-05 22:18:15,324 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 22:18:15,332 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 22:18:15,334 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 22:18:15,337 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 22:18:15,340 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 22:18:15,342 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-27.i [2025-02-05 22:18:16,737 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e1f9a5061/fae5b7d831904740abd49354b891cfb2/FLAGeedc0e300 [2025-02-05 22:18:16,952 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 22:18:16,952 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-27.i [2025-02-05 22:18:16,962 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e1f9a5061/fae5b7d831904740abd49354b891cfb2/FLAGeedc0e300 [2025-02-05 22:18:16,984 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e1f9a5061/fae5b7d831904740abd49354b891cfb2 [2025-02-05 22:18:16,986 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 22:18:16,988 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 22:18:16,989 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 22:18:16,989 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 22:18:16,993 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 22:18:16,993 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:18:16" (1/1) ... [2025-02-05 22:18:16,994 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41ec933 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:18:16, skipping insertion in model container [2025-02-05 22:18:16,995 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:18:16" (1/1) ... [2025-02-05 22:18:17,016 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 22:18:17,151 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-27.i[919,932] [2025-02-05 22:18:17,234 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 22:18:17,256 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 22:18:17,267 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-27.i[919,932] [2025-02-05 22:18:17,315 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 22:18:17,341 INFO L204 MainTranslator]: Completed translation [2025-02-05 22:18:17,342 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:18:17 WrapperNode [2025-02-05 22:18:17,342 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 22:18:17,343 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 22:18:17,344 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 22:18:17,344 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 22:18:17,349 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:18:17" (1/1) ... [2025-02-05 22:18:17,364 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:18:17" (1/1) ... [2025-02-05 22:18:17,393 INFO L138 Inliner]: procedures = 27, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 176 [2025-02-05 22:18:17,394 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 22:18:17,394 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 22:18:17,394 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 22:18:17,394 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 22:18:17,402 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:18:17" (1/1) ... [2025-02-05 22:18:17,402 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:18:17" (1/1) ... [2025-02-05 22:18:17,406 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:18:17" (1/1) ... [2025-02-05 22:18:17,419 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-05 22:18:17,419 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:18:17" (1/1) ... [2025-02-05 22:18:17,419 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:18:17" (1/1) ... [2025-02-05 22:18:17,428 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:18:17" (1/1) ... [2025-02-05 22:18:17,431 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:18:17" (1/1) ... [2025-02-05 22:18:17,433 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:18:17" (1/1) ... [2025-02-05 22:18:17,434 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:18:17" (1/1) ... [2025-02-05 22:18:17,437 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 22:18:17,441 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 22:18:17,441 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 22:18:17,441 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 22:18:17,442 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:18:17" (1/1) ... [2025-02-05 22:18:17,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 22:18:17,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 22:18:17,479 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 22:18:17,481 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 22:18:17,499 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 22:18:17,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-05 22:18:17,500 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 22:18:17,500 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 22:18:17,500 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 22:18:17,500 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 22:18:17,587 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 22:18:17,589 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 22:18:23,357 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-02-05 22:18:23,357 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 22:18:23,371 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 22:18:23,371 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 22:18:23,371 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:18:23 BoogieIcfgContainer [2025-02-05 22:18:23,371 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 22:18:23,374 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 22:18:23,374 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 22:18:23,378 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 22:18:23,379 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 10:18:16" (1/3) ... [2025-02-05 22:18:23,380 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58129932 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:18:23, skipping insertion in model container [2025-02-05 22:18:23,380 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:18:17" (2/3) ... [2025-02-05 22:18:23,380 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58129932 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:18:23, skipping insertion in model container [2025-02-05 22:18:23,381 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:18:23" (3/3) ... [2025-02-05 22:18:23,382 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-27.i [2025-02-05 22:18:23,396 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 22:18:23,398 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-27.i that has 2 procedures, 83 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 22:18:23,467 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 22:18:23,481 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;@47fadf39, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 22:18:23,481 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 22:18:23,487 INFO L276 IsEmpty]: Start isEmpty. Operand has 83 states, 54 states have (on average 1.4444444444444444) internal successors, (78), 55 states have internal predecessors, (78), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-02-05 22:18:23,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-02-05 22:18:23,502 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:18:23,503 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:18:23,503 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:18:23,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:18:23,510 INFO L85 PathProgramCache]: Analyzing trace with hash 348824607, now seen corresponding path program 1 times [2025-02-05 22:18:23,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 22:18:23,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1777482177] [2025-02-05 22:18:23,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:18:23,524 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 22:18:23,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 22:18:23,527 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-05 22:18:23,528 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-02-05 22:18:23,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-02-05 22:18:23,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-02-05 22:18:23,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:18:23,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:18:23,991 INFO L256 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 22:18:24,004 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 22:18:24,060 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 450 proven. 0 refuted. 0 times theorem prover too weak. 850 trivial. 0 not checked. [2025-02-05 22:18:24,060 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 22:18:24,061 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 22:18:24,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1777482177] [2025-02-05 22:18:24,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1777482177] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:18:24,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:18:24,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 22:18:24,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211163484] [2025-02-05 22:18:24,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:18:24,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 22:18:24,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 22:18:24,083 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 22:18:24,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 22:18:24,085 INFO L87 Difference]: Start difference. First operand has 83 states, 54 states have (on average 1.4444444444444444) internal successors, (78), 55 states have internal predecessors, (78), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-02-05 22:18:24,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:18:24,106 INFO L93 Difference]: Finished difference Result 160 states and 281 transitions. [2025-02-05 22:18:24,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 22:18:24,110 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 169 [2025-02-05 22:18:24,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:18:24,119 INFO L225 Difference]: With dead ends: 160 [2025-02-05 22:18:24,119 INFO L226 Difference]: Without dead ends: 80 [2025-02-05 22:18:24,124 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 22:18:24,128 INFO L435 NwaCegarLoop]: 122 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, 122 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 22:18:24,129 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 22:18:24,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-02-05 22:18:24,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2025-02-05 22:18:24,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 52 states have (on average 1.3461538461538463) internal successors, (70), 52 states have internal predecessors, (70), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-02-05 22:18:24,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 122 transitions. [2025-02-05 22:18:24,177 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 122 transitions. Word has length 169 [2025-02-05 22:18:24,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:18:24,178 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 122 transitions. [2025-02-05 22:18:24,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-02-05 22:18:24,178 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 122 transitions. [2025-02-05 22:18:24,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-02-05 22:18:24,181 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:18:24,182 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:18:24,197 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-02-05 22:18:24,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 22:18:24,383 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:18:24,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:18:24,383 INFO L85 PathProgramCache]: Analyzing trace with hash 455511577, now seen corresponding path program 1 times [2025-02-05 22:18:24,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 22:18:24,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [272115160] [2025-02-05 22:18:24,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:18:24,384 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 22:18:24,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 22:18:24,388 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-05 22:18:24,389 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-02-05 22:18:24,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-02-05 22:18:24,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-02-05 22:18:24,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:18:24,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:18:24,874 INFO L256 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-05 22:18:24,879 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 22:18:25,983 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 619 proven. 48 refuted. 0 times theorem prover too weak. 633 trivial. 0 not checked. [2025-02-05 22:18:25,984 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 22:18:26,514 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-02-05 22:18:26,515 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 22:18:26,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [272115160] [2025-02-05 22:18:26,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [272115160] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-05 22:18:26,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 22:18:26,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2025-02-05 22:18:26,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357891085] [2025-02-05 22:18:26,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:18:26,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 22:18:26,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 22:18:26,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 22:18:26,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-05 22:18:26,517 INFO L87 Difference]: Start difference. First operand 80 states and 122 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-02-05 22:18:30,334 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.91s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-05 22:18:30,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:18:30,338 INFO L93 Difference]: Finished difference Result 161 states and 244 transitions. [2025-02-05 22:18:30,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 22:18:30,367 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 169 [2025-02-05 22:18:30,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:18:30,369 INFO L225 Difference]: With dead ends: 161 [2025-02-05 22:18:30,369 INFO L226 Difference]: Without dead ends: 84 [2025-02-05 22:18:30,370 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 330 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-05 22:18:30,370 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 72 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2025-02-05 22:18:30,371 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 148 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2025-02-05 22:18:30,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2025-02-05 22:18:30,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2025-02-05 22:18:30,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 55 states have (on average 1.309090909090909) internal successors, (72), 55 states have internal predecessors, (72), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-02-05 22:18:30,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 124 transitions. [2025-02-05 22:18:30,383 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 124 transitions. Word has length 169 [2025-02-05 22:18:30,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:18:30,383 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 124 transitions. [2025-02-05 22:18:30,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-02-05 22:18:30,384 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 124 transitions. [2025-02-05 22:18:30,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-02-05 22:18:30,386 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:18:30,386 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:18:30,400 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-02-05 22:18:30,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 22:18:30,587 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:18:30,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:18:30,588 INFO L85 PathProgramCache]: Analyzing trace with hash -1487480270, now seen corresponding path program 1 times [2025-02-05 22:18:30,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 22:18:30,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1847464660] [2025-02-05 22:18:30,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:18:30,589 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 22:18:30,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 22:18:30,591 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-05 22:18:30,592 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-02-05 22:18:30,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-02-05 22:18:30,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-02-05 22:18:30,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:18:30,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:18:30,979 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 22:18:30,986 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 22:18:32,319 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-02-05 22:18:32,320 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 22:18:32,320 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 22:18:32,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1847464660] [2025-02-05 22:18:32,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1847464660] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:18:32,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:18:32,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 22:18:32,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405605763] [2025-02-05 22:18:32,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:18:32,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 22:18:32,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 22:18:32,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 22:18:32,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 22:18:32,322 INFO L87 Difference]: Start difference. First operand 84 states and 124 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 2 states have internal predecessors, (43), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-02-05 22:18:36,602 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-05 22:18:38,025 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-05 22:18:38,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:18:38,036 INFO L93 Difference]: Finished difference Result 246 states and 366 transitions. [2025-02-05 22:18:38,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 22:18:38,065 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 2 states have internal predecessors, (43), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 170 [2025-02-05 22:18:38,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:18:38,067 INFO L225 Difference]: With dead ends: 246 [2025-02-05 22:18:38,067 INFO L226 Difference]: Without dead ends: 165 [2025-02-05 22:18:38,068 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 22:18:38,069 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 36 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2025-02-05 22:18:38,069 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 256 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 1 Unknown, 0 Unchecked, 5.7s Time] [2025-02-05 22:18:38,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2025-02-05 22:18:38,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 161. [2025-02-05 22:18:38,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 104 states have (on average 1.2884615384615385) internal successors, (134), 104 states have internal predecessors, (134), 52 states have call successors, (52), 4 states have call predecessors, (52), 4 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2025-02-05 22:18:38,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 238 transitions. [2025-02-05 22:18:38,096 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 238 transitions. Word has length 170 [2025-02-05 22:18:38,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:18:38,097 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 238 transitions. [2025-02-05 22:18:38,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 2 states have internal predecessors, (43), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-02-05 22:18:38,098 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 238 transitions. [2025-02-05 22:18:38,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-02-05 22:18:38,102 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:18:38,102 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:18:38,122 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-02-05 22:18:38,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 22:18:38,303 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:18:38,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:18:38,304 INFO L85 PathProgramCache]: Analyzing trace with hash 1382373559, now seen corresponding path program 1 times [2025-02-05 22:18:38,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 22:18:38,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [673682975] [2025-02-05 22:18:38,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:18:38,305 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 22:18:38,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 22:18:38,307 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-05 22:18:38,309 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-02-05 22:18:38,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-02-05 22:18:38,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-02-05 22:18:38,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:18:38,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:18:38,717 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-05 22:18:38,721 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 22:18:41,125 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 788 proven. 90 refuted. 0 times theorem prover too weak. 422 trivial. 0 not checked. [2025-02-05 22:18:41,125 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 22:18:43,273 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 117 proven. 99 refuted. 0 times theorem prover too weak. 1084 trivial. 0 not checked. [2025-02-05 22:18:43,274 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 22:18:43,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [673682975] [2025-02-05 22:18:43,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [673682975] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 22:18:43,274 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-05 22:18:43,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 19 [2025-02-05 22:18:43,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136372290] [2025-02-05 22:18:43,274 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-05 22:18:43,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-05 22:18:43,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 22:18:43,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-05 22:18:43,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=246, Unknown=0, NotChecked=0, Total=342 [2025-02-05 22:18:43,278 INFO L87 Difference]: Start difference. First operand 161 states and 238 transitions. Second operand has 19 states, 19 states have (on average 3.8947368421052633) internal successors, (74), 19 states have internal predecessors, (74), 4 states have call successors, (39), 4 states have call predecessors, (39), 10 states have return successors, (40), 4 states have call predecessors, (40), 4 states have call successors, (40) [2025-02-05 22:18:50,170 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-05 22:18:54,175 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-05 22:18:56,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:18:56,781 INFO L93 Difference]: Finished difference Result 492 states and 692 transitions. [2025-02-05 22:18:56,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2025-02-05 22:18:56,782 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.8947368421052633) internal successors, (74), 19 states have internal predecessors, (74), 4 states have call successors, (39), 4 states have call predecessors, (39), 10 states have return successors, (40), 4 states have call predecessors, (40), 4 states have call successors, (40) Word has length 171 [2025-02-05 22:18:56,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:18:56,785 INFO L225 Difference]: With dead ends: 492 [2025-02-05 22:18:56,785 INFO L226 Difference]: Without dead ends: 334 [2025-02-05 22:18:56,788 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 373 GetRequests, 327 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 575 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=589, Invalid=1573, Unknown=0, NotChecked=0, Total=2162 [2025-02-05 22:18:56,789 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 585 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 471 mSolverCounterSat, 353 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 598 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 826 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 353 IncrementalHoareTripleChecker+Valid, 471 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.6s IncrementalHoareTripleChecker+Time [2025-02-05 22:18:56,789 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [598 Valid, 459 Invalid, 826 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [353 Valid, 471 Invalid, 2 Unknown, 0 Unchecked, 11.6s Time] [2025-02-05 22:18:56,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2025-02-05 22:18:56,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 299. [2025-02-05 22:18:56,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 192 states have (on average 1.2083333333333333) internal successors, (232), 193 states have internal predecessors, (232), 90 states have call successors, (90), 16 states have call predecessors, (90), 16 states have return successors, (90), 89 states have call predecessors, (90), 90 states have call successors, (90) [2025-02-05 22:18:56,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 412 transitions. [2025-02-05 22:18:56,839 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 412 transitions. Word has length 171 [2025-02-05 22:18:56,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:18:56,840 INFO L471 AbstractCegarLoop]: Abstraction has 299 states and 412 transitions. [2025-02-05 22:18:56,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.8947368421052633) internal successors, (74), 19 states have internal predecessors, (74), 4 states have call successors, (39), 4 states have call predecessors, (39), 10 states have return successors, (40), 4 states have call predecessors, (40), 4 states have call successors, (40) [2025-02-05 22:18:56,840 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 412 transitions. [2025-02-05 22:18:56,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-02-05 22:18:56,843 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:18:56,843 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:18:56,861 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 (5)] Forceful destruction successful, exit code 0 [2025-02-05 22:18:57,043 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 22:18:57,044 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:18:57,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:18:57,045 INFO L85 PathProgramCache]: Analyzing trace with hash -1794411725, now seen corresponding path program 1 times [2025-02-05 22:18:57,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 22:18:57,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1492376291] [2025-02-05 22:18:57,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:18:57,046 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 22:18:57,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 22:18:57,048 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 22:18:57,051 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 22:18:57,085 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-02-05 22:18:57,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-02-05 22:18:57,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:18:57,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:18:57,453 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-05 22:18:57,456 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 22:18:58,588 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 805 proven. 54 refuted. 0 times theorem prover too weak. 441 trivial. 0 not checked. [2025-02-05 22:18:58,588 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 22:18:59,339 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 22:18:59,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1492376291] [2025-02-05 22:18:59,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1492376291] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 22:18:59,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [626756691] [2025-02-05 22:18:59,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:18:59,339 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-02-05 22:18:59,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-02-05 22:18:59,342 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-02-05 22:18:59,343 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2025-02-05 22:18:59,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-02-05 22:19:00,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-02-05 22:19:00,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:19:00,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:19:00,294 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-05 22:19:00,297 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 22:19:01,358 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 805 proven. 54 refuted. 0 times theorem prover too weak. 441 trivial. 0 not checked. [2025-02-05 22:19:01,358 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 22:19:01,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [626756691] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 22:19:01,895 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-05 22:19:01,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2025-02-05 22:19:01,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617472437] [2025-02-05 22:19:01,895 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-05 22:19:01,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 22:19:01,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 22:19:01,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 22:19:01,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-05 22:19:01,896 INFO L87 Difference]: Start difference. First operand 299 states and 412 transitions. Second operand has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 3 states have call successors, (26), 3 states have call predecessors, (26), 5 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) [2025-02-05 22:19:07,460 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.96s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-05 22:19:07,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:19:07,669 INFO L93 Difference]: Finished difference Result 623 states and 828 transitions. [2025-02-05 22:19:07,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 22:19:07,710 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 3 states have call successors, (26), 3 states have call predecessors, (26), 5 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) Word has length 171 [2025-02-05 22:19:07,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:19:07,715 INFO L225 Difference]: With dead ends: 623 [2025-02-05 22:19:07,715 INFO L226 Difference]: Without dead ends: 352 [2025-02-05 22:19:07,716 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 394 GetRequests, 382 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2025-02-05 22:19:07,717 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 89 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2025-02-05 22:19:07,717 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 278 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2025-02-05 22:19:07,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2025-02-05 22:19:07,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 324. [2025-02-05 22:19:07,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 210 states have (on average 1.161904761904762) internal successors, (244), 211 states have internal predecessors, (244), 90 states have call successors, (90), 23 states have call predecessors, (90), 23 states have return successors, (90), 89 states have call predecessors, (90), 90 states have call successors, (90) [2025-02-05 22:19:07,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 424 transitions. [2025-02-05 22:19:07,763 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 424 transitions. Word has length 171 [2025-02-05 22:19:07,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:19:07,763 INFO L471 AbstractCegarLoop]: Abstraction has 324 states and 424 transitions. [2025-02-05 22:19:07,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 3 states have call successors, (26), 3 states have call predecessors, (26), 5 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) [2025-02-05 22:19:07,765 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 424 transitions. [2025-02-05 22:19:07,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-02-05 22:19:07,767 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:19:07,767 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:19:07,783 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Forceful destruction successful, exit code 0 [2025-02-05 22:19:07,980 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 (6)] Ended with exit code 0 [2025-02-05 22:19:08,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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 22:19:08,168 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:19:08,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:19:08,169 INFO L85 PathProgramCache]: Analyzing trace with hash -168212298, now seen corresponding path program 1 times [2025-02-05 22:19:08,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 22:19:08,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1049967971] [2025-02-05 22:19:08,169 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:19:08,169 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 22:19:08,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 22:19:08,171 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-05 22:19:08,172 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2025-02-05 22:19:08,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-02-05 22:19:08,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-02-05 22:19:08,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:19:08,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:19:08,577 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-05 22:19:08,581 INFO L279 TraceCheckSpWp]: Computing forward predicates...