./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-89.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 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-pr-ci_file-89.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 9933437b0126f19d2b07775387d6f9b8ed254522e0b90d315e6d113e1084c26a --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 11:10:33,358 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 11:10:33,410 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 11:10:33,414 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 11:10:33,414 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 11:10:33,439 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 11:10:33,440 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 11:10:33,440 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 11:10:33,440 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 11:10:33,440 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 11:10:33,440 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 11:10:33,440 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 11:10:33,440 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 11:10:33,440 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 11:10:33,440 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 11:10:33,440 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 11:10:33,440 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 11:10:33,440 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 11:10:33,440 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 11:10:33,440 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 11:10:33,441 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 11:10:33,441 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 11:10:33,441 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 11:10:33,441 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 11:10:33,441 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 11:10:33,441 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 11:10:33,441 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 11:10:33,441 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 11:10:33,441 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 11:10:33,441 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 11:10:33,441 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 11:10:33,441 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 11:10:33,441 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 11:10:33,441 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 11:10:33,441 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 11:10:33,441 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 11:10:33,441 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 11:10:33,441 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 11:10:33,441 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 11:10:33,441 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 11:10:33,442 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 11:10:33,442 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 11:10:33,442 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 11:10:33,442 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 11:10:33,442 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 11:10:33,442 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 11:10:33,442 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 11:10:33,442 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 11:10:33,442 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 -> 9933437b0126f19d2b07775387d6f9b8ed254522e0b90d315e6d113e1084c26a [2025-01-09 11:10:33,662 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 11:10:33,672 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 11:10:33,675 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 11:10:33,676 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 11:10:33,677 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 11:10:33,677 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-pr-ci_file-89.i [2025-01-09 11:10:34,908 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4b13c8551/043f1b4797384dc991748239219ea3a5/FLAG6276e4ae1 [2025-01-09 11:10:35,167 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 11:10:35,173 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-89.i [2025-01-09 11:10:35,187 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4b13c8551/043f1b4797384dc991748239219ea3a5/FLAG6276e4ae1 [2025-01-09 11:10:35,201 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4b13c8551/043f1b4797384dc991748239219ea3a5 [2025-01-09 11:10:35,203 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 11:10:35,204 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 11:10:35,205 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 11:10:35,205 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 11:10:35,208 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 11:10:35,209 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 11:10:35" (1/1) ... [2025-01-09 11:10:35,210 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45a181b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:10:35, skipping insertion in model container [2025-01-09 11:10:35,210 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 11:10:35" (1/1) ... [2025-01-09 11:10:35,227 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 11:10:35,328 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-pr-ci_file-89.i[919,932] [2025-01-09 11:10:35,388 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 11:10:35,395 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 11:10:35,401 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-pr-ci_file-89.i[919,932] [2025-01-09 11:10:35,421 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 11:10:35,435 INFO L204 MainTranslator]: Completed translation [2025-01-09 11:10:35,436 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:10:35 WrapperNode [2025-01-09 11:10:35,436 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 11:10:35,437 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 11:10:35,437 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 11:10:35,437 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 11:10:35,444 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:10:35" (1/1) ... [2025-01-09 11:10:35,453 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:10:35" (1/1) ... [2025-01-09 11:10:35,497 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 185 [2025-01-09 11:10:35,499 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 11:10:35,500 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 11:10:35,500 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 11:10:35,500 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 11:10:35,507 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:10:35" (1/1) ... [2025-01-09 11:10:35,507 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:10:35" (1/1) ... [2025-01-09 11:10:35,510 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:10:35" (1/1) ... [2025-01-09 11:10:35,534 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-01-09 11:10:35,534 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:10:35" (1/1) ... [2025-01-09 11:10:35,535 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:10:35" (1/1) ... [2025-01-09 11:10:35,544 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:10:35" (1/1) ... [2025-01-09 11:10:35,545 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:10:35" (1/1) ... [2025-01-09 11:10:35,548 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:10:35" (1/1) ... [2025-01-09 11:10:35,551 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:10:35" (1/1) ... [2025-01-09 11:10:35,554 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:10:35" (1/1) ... [2025-01-09 11:10:35,556 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 11:10:35,558 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 11:10:35,559 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 11:10:35,559 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 11:10:35,560 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:10:35" (1/1) ... [2025-01-09 11:10:35,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 11:10:35,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 11:10:35,585 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-01-09 11:10:35,588 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-01-09 11:10:35,604 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 11:10:35,604 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 11:10:35,604 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 11:10:35,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 11:10:35,604 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 11:10:35,604 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 11:10:35,654 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 11:10:35,655 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 11:10:35,932 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-01-09 11:10:35,932 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 11:10:35,939 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 11:10:35,939 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 11:10:35,939 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 11:10:35 BoogieIcfgContainer [2025-01-09 11:10:35,940 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 11:10:35,942 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 11:10:35,945 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 11:10:35,949 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 11:10:35,949 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 11:10:35" (1/3) ... [2025-01-09 11:10:35,949 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fbae3ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 11:10:35, skipping insertion in model container [2025-01-09 11:10:35,949 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:10:35" (2/3) ... [2025-01-09 11:10:35,950 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fbae3ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 11:10:35, skipping insertion in model container [2025-01-09 11:10:35,950 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 11:10:35" (3/3) ... [2025-01-09 11:10:35,952 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-89.i [2025-01-09 11:10:35,962 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 11:10:35,964 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-89.i that has 2 procedures, 81 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 11:10:36,014 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 11:10:36,023 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;@1580b3d8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 11:10:36,024 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 11:10:36,027 INFO L276 IsEmpty]: Start isEmpty. Operand has 81 states, 58 states have (on average 1.5517241379310345) internal successors, (90), 59 states have internal predecessors, (90), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-01-09 11:10:36,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-01-09 11:10:36,036 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:10:36,037 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 11:10:36,037 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:10:36,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:10:36,041 INFO L85 PathProgramCache]: Analyzing trace with hash 740965020, now seen corresponding path program 1 times [2025-01-09 11:10:36,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:10:36,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488432588] [2025-01-09 11:10:36,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:10:36,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:10:36,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-01-09 11:10:36,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-01-09 11:10:36,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:10:36,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:10:36,260 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2025-01-09 11:10:36,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:10:36,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488432588] [2025-01-09 11:10:36,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488432588] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 11:10:36,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [357487560] [2025-01-09 11:10:36,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:10:36,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 11:10:36,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 11:10:36,264 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-01-09 11:10:36,265 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-01-09 11:10:36,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-01-09 11:10:36,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-01-09 11:10:36,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:10:36,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:10:36,367 INFO L256 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 11:10:36,372 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 11:10:36,386 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2025-01-09 11:10:36,386 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 11:10:36,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [357487560] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:10:36,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 11:10:36,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 11:10:36,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491944699] [2025-01-09 11:10:36,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:10:36,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 11:10:36,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:10:36,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 11:10:36,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 11:10:36,404 INFO L87 Difference]: Start difference. First operand has 81 states, 58 states have (on average 1.5517241379310345) internal successors, (90), 59 states have internal predecessors, (90), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-01-09 11:10:36,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:10:36,419 INFO L93 Difference]: Finished difference Result 155 states and 274 transitions. [2025-01-09 11:10:36,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 11:10:36,421 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 137 [2025-01-09 11:10:36,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:10:36,425 INFO L225 Difference]: With dead ends: 155 [2025-01-09 11:10:36,425 INFO L226 Difference]: Without dead ends: 77 [2025-01-09 11:10:36,427 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 138 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-01-09 11:10:36,429 INFO L435 NwaCegarLoop]: 123 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, 123 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-01-09 11:10:36,429 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 11:10:36,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-01-09 11:10:36,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2025-01-09 11:10:36,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 55 states have (on average 1.509090909090909) internal successors, (83), 55 states have internal predecessors, (83), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-01-09 11:10:36,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 123 transitions. [2025-01-09 11:10:36,454 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 123 transitions. Word has length 137 [2025-01-09 11:10:36,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:10:36,454 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 123 transitions. [2025-01-09 11:10:36,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-01-09 11:10:36,455 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 123 transitions. [2025-01-09 11:10:36,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-01-09 11:10:36,457 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:10:36,457 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 11:10:36,463 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-01-09 11:10:36,660 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-01-09 11:10:36,660 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:10:36,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:10:36,662 INFO L85 PathProgramCache]: Analyzing trace with hash -829945956, now seen corresponding path program 1 times [2025-01-09 11:10:36,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:10:36,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139126191] [2025-01-09 11:10:36,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:10:36,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:10:36,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-01-09 11:10:36,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-01-09 11:10:36,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:10:36,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:10:36,813 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-01-09 11:10:36,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:10:36,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139126191] [2025-01-09 11:10:36,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139126191] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:10:36,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:10:36,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 11:10:36,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876152733] [2025-01-09 11:10:36,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:10:36,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 11:10:36,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:10:36,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 11:10:36,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 11:10:36,817 INFO L87 Difference]: Start difference. First operand 77 states and 123 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 11:10:36,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:10:36,862 INFO L93 Difference]: Finished difference Result 221 states and 355 transitions. [2025-01-09 11:10:36,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 11:10:36,863 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 137 [2025-01-09 11:10:36,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:10:36,864 INFO L225 Difference]: With dead ends: 221 [2025-01-09 11:10:36,864 INFO L226 Difference]: Without dead ends: 147 [2025-01-09 11:10:36,865 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 11:10:36,865 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 107 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 11:10:36,866 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 222 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 11:10:36,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2025-01-09 11:10:36,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 143. [2025-01-09 11:10:36,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 100 states have (on average 1.45) internal successors, (145), 100 states have internal predecessors, (145), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-01-09 11:10:36,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 225 transitions. [2025-01-09 11:10:36,880 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 225 transitions. Word has length 137 [2025-01-09 11:10:36,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:10:36,881 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 225 transitions. [2025-01-09 11:10:36,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 11:10:36,881 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 225 transitions. [2025-01-09 11:10:36,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-01-09 11:10:36,882 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:10:36,882 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 11:10:36,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 11:10:36,882 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:10:36,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:10:36,883 INFO L85 PathProgramCache]: Analyzing trace with hash -1222972966, now seen corresponding path program 1 times [2025-01-09 11:10:36,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:10:36,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816898754] [2025-01-09 11:10:36,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:10:36,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:10:36,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-01-09 11:10:36,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-01-09 11:10:36,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:10:36,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:10:37,043 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-01-09 11:10:37,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:10:37,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816898754] [2025-01-09 11:10:37,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816898754] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:10:37,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:10:37,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 11:10:37,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244688289] [2025-01-09 11:10:37,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:10:37,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 11:10:37,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:10:37,044 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 11:10:37,045 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 11:10:37,045 INFO L87 Difference]: Start difference. First operand 143 states and 225 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 11:10:37,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:10:37,115 INFO L93 Difference]: Finished difference Result 379 states and 593 transitions. [2025-01-09 11:10:37,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 11:10:37,117 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 137 [2025-01-09 11:10:37,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:10:37,121 INFO L225 Difference]: With dead ends: 379 [2025-01-09 11:10:37,121 INFO L226 Difference]: Without dead ends: 239 [2025-01-09 11:10:37,122 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 11:10:37,123 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 67 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 11:10:37,123 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 252 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 11:10:37,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2025-01-09 11:10:37,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 235. [2025-01-09 11:10:37,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 172 states have (on average 1.441860465116279) internal successors, (248), 174 states have internal predecessors, (248), 58 states have call successors, (58), 4 states have call predecessors, (58), 4 states have return successors, (58), 56 states have call predecessors, (58), 58 states have call successors, (58) [2025-01-09 11:10:37,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 364 transitions. [2025-01-09 11:10:37,151 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 364 transitions. Word has length 137 [2025-01-09 11:10:37,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:10:37,152 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 364 transitions. [2025-01-09 11:10:37,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 11:10:37,152 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 364 transitions. [2025-01-09 11:10:37,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-01-09 11:10:37,153 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:10:37,153 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 11:10:37,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 11:10:37,154 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:10:37,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:10:37,154 INFO L85 PathProgramCache]: Analyzing trace with hash -800271140, now seen corresponding path program 1 times [2025-01-09 11:10:37,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:10:37,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730249592] [2025-01-09 11:10:37,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:10:37,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:10:37,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-01-09 11:10:37,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-01-09 11:10:37,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:10:37,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:10:37,420 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-01-09 11:10:37,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:10:37,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730249592] [2025-01-09 11:10:37,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730249592] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:10:37,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:10:37,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 11:10:37,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410076753] [2025-01-09 11:10:37,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:10:37,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 11:10:37,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:10:37,423 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 11:10:37,424 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 11:10:37,424 INFO L87 Difference]: Start difference. First operand 235 states and 364 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 11:10:37,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:10:37,509 INFO L93 Difference]: Finished difference Result 699 states and 1086 transitions. [2025-01-09 11:10:37,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 11:10:37,509 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 137 [2025-01-09 11:10:37,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:10:37,515 INFO L225 Difference]: With dead ends: 699 [2025-01-09 11:10:37,516 INFO L226 Difference]: Without dead ends: 467 [2025-01-09 11:10:37,517 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-01-09 11:10:37,518 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 69 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 11:10:37,519 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 228 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 11:10:37,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2025-01-09 11:10:37,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 457. [2025-01-09 11:10:37,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 457 states, 332 states have (on average 1.4216867469879517) internal successors, (472), 336 states have internal predecessors, (472), 116 states have call successors, (116), 8 states have call predecessors, (116), 8 states have return successors, (116), 112 states have call predecessors, (116), 116 states have call successors, (116) [2025-01-09 11:10:37,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 704 transitions. [2025-01-09 11:10:37,586 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 704 transitions. Word has length 137 [2025-01-09 11:10:37,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:10:37,587 INFO L471 AbstractCegarLoop]: Abstraction has 457 states and 704 transitions. [2025-01-09 11:10:37,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 11:10:37,588 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 704 transitions. [2025-01-09 11:10:37,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-01-09 11:10:37,589 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:10:37,589 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 11:10:37,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 11:10:37,591 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:10:37,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:10:37,592 INFO L85 PathProgramCache]: Analyzing trace with hash 1626349068, now seen corresponding path program 1 times [2025-01-09 11:10:37,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:10:37,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261171596] [2025-01-09 11:10:37,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:10:37,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:10:37,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-01-09 11:10:37,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-01-09 11:10:37,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:10:37,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:10:37,717 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-01-09 11:10:37,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:10:37,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261171596] [2025-01-09 11:10:37,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261171596] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:10:37,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:10:37,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 11:10:37,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145865149] [2025-01-09 11:10:37,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:10:37,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 11:10:37,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:10:37,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 11:10:37,737 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 11:10:37,737 INFO L87 Difference]: Start difference. First operand 457 states and 704 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 11:10:38,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:10:38,131 INFO L93 Difference]: Finished difference Result 1481 states and 2266 transitions. [2025-01-09 11:10:38,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 11:10:38,132 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 138 [2025-01-09 11:10:38,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:10:38,142 INFO L225 Difference]: With dead ends: 1481 [2025-01-09 11:10:38,142 INFO L226 Difference]: Without dead ends: 1249 [2025-01-09 11:10:38,144 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 11:10:38,145 INFO L435 NwaCegarLoop]: 181 mSDtfsCounter, 291 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 11:10:38,147 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 374 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 11:10:38,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1249 states. [2025-01-09 11:10:38,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1249 to 473. [2025-01-09 11:10:38,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 473 states, 348 states have (on average 1.4482758620689655) internal successors, (504), 352 states have internal predecessors, (504), 116 states have call successors, (116), 8 states have call predecessors, (116), 8 states have return successors, (116), 112 states have call predecessors, (116), 116 states have call successors, (116) [2025-01-09 11:10:38,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 736 transitions. [2025-01-09 11:10:38,216 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 736 transitions. Word has length 138 [2025-01-09 11:10:38,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:10:38,216 INFO L471 AbstractCegarLoop]: Abstraction has 473 states and 736 transitions. [2025-01-09 11:10:38,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 11:10:38,216 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 736 transitions. [2025-01-09 11:10:38,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-01-09 11:10:38,220 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:10:38,220 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 11:10:38,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 11:10:38,220 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:10:38,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:10:38,221 INFO L85 PathProgramCache]: Analyzing trace with hash -1529109611, now seen corresponding path program 1 times [2025-01-09 11:10:38,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:10:38,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666111486] [2025-01-09 11:10:38,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:10:38,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:10:38,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-01-09 11:10:38,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-01-09 11:10:38,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:10:38,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 11:10:38,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1315206718] [2025-01-09 11:10:38,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:10:38,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 11:10:38,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 11:10:38,325 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 11:10:38,342 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-01-09 11:10:38,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-01-09 11:10:38,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-01-09 11:10:38,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:10:38,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 11:10:38,430 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 11:10:38,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-01-09 11:10:38,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-01-09 11:10:38,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:10:38,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 11:10:38,537 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 11:10:38,537 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 11:10:38,538 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 11:10:38,549 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-01-09 11:10:38,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 11:10:38,742 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-01-09 11:10:38,813 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 11:10:38,815 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 11:10:38 BoogieIcfgContainer [2025-01-09 11:10:38,815 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 11:10:38,816 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 11:10:38,816 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 11:10:38,816 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 11:10:38,816 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 11:10:35" (3/4) ... [2025-01-09 11:10:38,818 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 11:10:38,818 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 11:10:38,819 INFO L158 Benchmark]: Toolchain (without parser) took 3614.76ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 113.6MB in the beginning and 219.7MB in the end (delta: -106.2MB). Peak memory consumption was 32.8MB. Max. memory is 16.1GB. [2025-01-09 11:10:38,819 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 201.3MB. Free memory is still 126.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 11:10:38,819 INFO L158 Benchmark]: CACSL2BoogieTranslator took 231.03ms. Allocated memory is still 142.6MB. Free memory was 113.6MB in the beginning and 98.2MB in the end (delta: 15.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 11:10:38,819 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.65ms. Allocated memory is still 142.6MB. Free memory was 98.2MB in the beginning and 93.7MB in the end (delta: 4.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 11:10:38,820 INFO L158 Benchmark]: Boogie Preprocessor took 57.83ms. Allocated memory is still 142.6MB. Free memory was 93.7MB in the beginning and 87.5MB in the end (delta: 6.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 11:10:38,820 INFO L158 Benchmark]: RCFGBuilder took 381.45ms. Allocated memory is still 142.6MB. Free memory was 87.5MB in the beginning and 62.4MB in the end (delta: 25.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 11:10:38,820 INFO L158 Benchmark]: TraceAbstraction took 2873.10ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 61.2MB in the beginning and 219.8MB in the end (delta: -158.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 11:10:38,820 INFO L158 Benchmark]: Witness Printer took 2.77ms. Allocated memory is still 285.2MB. Free memory was 219.8MB in the beginning and 219.7MB in the end (delta: 14.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 11:10:38,821 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.27ms. Allocated memory is still 201.3MB. Free memory is still 126.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 231.03ms. Allocated memory is still 142.6MB. Free memory was 113.6MB in the beginning and 98.2MB in the end (delta: 15.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.65ms. Allocated memory is still 142.6MB. Free memory was 98.2MB in the beginning and 93.7MB in the end (delta: 4.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 57.83ms. Allocated memory is still 142.6MB. Free memory was 93.7MB in the beginning and 87.5MB in the end (delta: 6.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 381.45ms. Allocated memory is still 142.6MB. Free memory was 87.5MB in the beginning and 62.4MB in the end (delta: 25.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2873.10ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 61.2MB in the beginning and 219.8MB in the end (delta: -158.5MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.77ms. Allocated memory is still 285.2MB. Free memory was 219.8MB in the beginning and 219.7MB in the end (delta: 14.6kB). 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 someBinaryFLOATComparisonOperation at line 176, overapproximation of someBinaryFLOATComparisonOperation at line 175, overapproximation of someBinaryDOUBLEComparisonOperation at line 184, overapproximation of someBinaryDOUBLEComparisonOperation at line 164. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = 32; [L23] unsigned char var_1_4 = 0; [L24] unsigned short int var_1_8 = 32; [L25] signed long int var_1_9 = -16; [L26] unsigned short int var_1_10 = 5; [L27] unsigned char var_1_12 = 32; [L28] unsigned char var_1_13 = 1; [L29] unsigned char var_1_14 = 0; [L30] unsigned char var_1_15 = 0; [L31] double var_1_16 = 63.75; [L32] double var_1_17 = 8.5; [L33] signed short int var_1_18 = -64; [L34] unsigned char var_1_19 = 32; [L35] signed short int var_1_24 = -1; [L36] signed short int var_1_25 = 2; [L37] unsigned char var_1_26 = 100; [L38] unsigned char var_1_29 = 128; [L39] unsigned char var_1_30 = 64; [L40] signed char var_1_31 = -1; [L41] unsigned short int var_1_32 = 100; [L42] unsigned long int var_1_33 = 0; [L43] float var_1_36 = 16.8; [L44] signed char var_1_38 = 0; [L45] signed long int var_1_39 = -4; [L46] unsigned short int var_1_40 = 256; [L47] signed long int last_1_var_1_1 = 32; [L48] unsigned char last_1_var_1_12 = 32; [L49] signed short int last_1_var_1_18 = -64; VAL [isInitial=0, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=5, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=-16] [L188] isInitial = 1 [L189] FCALL initially() [L191] CALL updateLastVariables() [L179] last_1_var_1_1 = var_1_1 [L180] last_1_var_1_12 = var_1_12 [L181] last_1_var_1_18 = var_1_18 VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=5, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=-16] [L191] RET updateLastVariables() [L192] CALL updateVariables() [L147] var_1_4 = __VERIFIER_nondet_uchar() [L148] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=5, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_8=32, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=5, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_8=32, var_1_9=-16] [L148] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=5, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_8=32, var_1_9=-16] [L149] CALL assume_abort_if_not(var_1_4 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=5, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=5, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=-16] [L149] RET assume_abort_if_not(var_1_4 <= 1) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=5, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=-16] [L150] var_1_9 = __VERIFIER_nondet_long() [L151] CALL assume_abort_if_not(var_1_9 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=5, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=5, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L151] RET assume_abort_if_not(var_1_9 >= -2147483648) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=5, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L152] CALL assume_abort_if_not(var_1_9 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=5, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=5, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L152] RET assume_abort_if_not(var_1_9 <= 2147483647) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=5, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L153] CALL assume_abort_if_not(var_1_9 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=5, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=5, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L153] RET assume_abort_if_not(var_1_9 != 0) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=5, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L154] var_1_10 = __VERIFIER_nondet_ushort() [L155] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L155] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L156] CALL assume_abort_if_not(var_1_10 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=33, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=33, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L156] RET assume_abort_if_not(var_1_10 <= 65534) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=33, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L157] var_1_13 = __VERIFIER_nondet_uchar() [L158] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=33, var_1_12=32, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=33, var_1_12=32, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L158] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=33, var_1_12=32, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L159] CALL assume_abort_if_not(var_1_13 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=33, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=33, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L159] RET assume_abort_if_not(var_1_13 <= 254) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=33, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L160] var_1_15 = __VERIFIER_nondet_uchar() [L161] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=33, var_1_12=32, var_1_13=0, var_1_14=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=33, var_1_12=32, var_1_13=0, var_1_14=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L161] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=33, var_1_12=32, var_1_13=0, var_1_14=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L162] CALL assume_abort_if_not(var_1_15 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=33, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=33, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L162] RET assume_abort_if_not(var_1_15 <= 0) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=33, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L163] var_1_17 = __VERIFIER_nondet_double() [L164] CALL assume_abort_if_not((var_1_17 >= -922337.2036854765600e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=33, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=33, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L164] RET assume_abort_if_not((var_1_17 >= -922337.2036854765600e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=33, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L165] var_1_25 = __VERIFIER_nondet_short() [L166] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=33, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=33, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L166] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=33, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L167] CALL assume_abort_if_not(var_1_25 <= 9) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=33, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=33, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L167] RET assume_abort_if_not(var_1_25 <= 9) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=33, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L168] var_1_29 = __VERIFIER_nondet_uchar() [L169] CALL assume_abort_if_not(var_1_29 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=33, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=33, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L169] RET assume_abort_if_not(var_1_29 >= 127) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=33, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L170] CALL assume_abort_if_not(var_1_29 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=33, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=33, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L170] RET assume_abort_if_not(var_1_29 <= 254) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=33, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L171] var_1_30 = __VERIFIER_nondet_uchar() [L172] CALL assume_abort_if_not(var_1_30 >= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=33, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=63, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=33, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=63, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L172] RET assume_abort_if_not(var_1_30 >= 63) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=33, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=63, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L173] CALL assume_abort_if_not(var_1_30 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=33, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=63, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=33, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=63, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L173] RET assume_abort_if_not(var_1_30 <= 127) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=33, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=63, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L174] var_1_36 = __VERIFIER_nondet_float() [L175] CALL assume_abort_if_not((var_1_36 >= -922337.2036854776000e+13F && var_1_36 <= -1.0e-20F) || (var_1_36 <= 9223372.036854776000e+12F && var_1_36 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=33, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=63, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=33, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=63, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L175] RET assume_abort_if_not((var_1_36 >= -922337.2036854776000e+13F && var_1_36 <= -1.0e-20F) || (var_1_36 <= 9223372.036854776000e+12F && var_1_36 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=33, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=63, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L176] CALL assume_abort_if_not(var_1_36 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=33, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=63, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=33, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=63, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L176] RET assume_abort_if_not(var_1_36 != 0.0F) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=33, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=63, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L192] RET updateVariables() [L193] CALL step() [L53] signed long int stepLocal_1 = last_1_var_1_18; [L54] signed long int stepLocal_0 = last_1_var_1_18; VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, stepLocal_0=-64, stepLocal_1=-64, var_1_10=33, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=63, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L55] COND FALSE !(stepLocal_1 >= (last_1_var_1_18 / var_1_9)) [L62] var_1_8 = last_1_var_1_12 VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, stepLocal_0=-64, var_1_10=33, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=63, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L64] COND FALSE !(var_1_15 && var_1_15) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, stepLocal_0=-64, var_1_10=33, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=63, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L67] var_1_38 = var_1_25 [L68] var_1_18 = var_1_8 VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, stepLocal_0=-64, var_1_10=33, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=32, var_1_19=32, var_1_1=32, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=63, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L69] EXPR var_1_9 >> ((((var_1_25) < (1)) ? (var_1_25) : (1))) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, stepLocal_0=-64, var_1_10=33, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=32, var_1_19=32, var_1_1=32, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=63, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L69] COND FALSE !(((((var_1_8) < (25)) ? (var_1_8) : (25))) > (var_1_9 >> ((((var_1_25) < (1)) ? (var_1_25) : (1))))) [L76] COND FALSE !(var_1_10 < var_1_18) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, stepLocal_0=-64, var_1_10=33, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=32, var_1_19=32, var_1_1=32, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=63, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L87] unsigned short int stepLocal_2 = var_1_8; VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, stepLocal_0=-64, stepLocal_2=32, var_1_10=33, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=32, var_1_19=32, var_1_1=32, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=63, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L88] COND FALSE !(stepLocal_2 > (((((var_1_8) < (var_1_8)) ? (var_1_8) : (var_1_8))) + var_1_12)) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, stepLocal_0=-64, var_1_10=33, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=32, var_1_19=32, var_1_1=32, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=63, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L99] COND FALSE !(var_1_13 > var_1_18) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, stepLocal_0=-64, var_1_10=33, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=32, var_1_19=32, var_1_1=32, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=63, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L104] COND FALSE !(var_1_18 != var_1_12) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, stepLocal_0=-64, var_1_10=33, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=32, var_1_19=32, var_1_1=32, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=63, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L109] var_1_39 = var_1_30 [L110] var_1_40 = var_1_30 VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, stepLocal_0=-64, var_1_10=33, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=32, var_1_19=32, var_1_1=32, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=63, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_38=0, var_1_39=63, var_1_40=63, var_1_4=0, var_1_8=32, var_1_9=64] [L111] COND FALSE !(\read(var_1_14)) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, stepLocal_0=-64, var_1_10=33, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=32, var_1_19=32, var_1_1=32, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=63, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_38=0, var_1_39=63, var_1_40=63, var_1_4=0, var_1_8=32, var_1_9=64] [L118] COND FALSE !(\read(var_1_14)) [L121] var_1_16 = var_1_17 VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, stepLocal_0=-64, var_1_10=33, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=2, var_1_17=2, var_1_18=32, var_1_19=32, var_1_1=32, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=63, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_38=0, var_1_39=63, var_1_40=63, var_1_4=0, var_1_8=32, var_1_9=64] [L124] EXPR var_1_12 & var_1_12 VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, stepLocal_0=-64, var_1_10=33, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=2, var_1_17=2, var_1_18=32, var_1_19=32, var_1_1=32, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=63, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_38=0, var_1_39=63, var_1_40=63, var_1_4=0, var_1_8=32, var_1_9=64] [L124] COND TRUE (var_1_12 & var_1_12) >= var_1_12 [L125] var_1_19 = var_1_13 VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, stepLocal_0=-64, var_1_10=33, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=2, var_1_17=2, var_1_18=32, var_1_19=0, var_1_1=32, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=63, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_38=0, var_1_39=63, var_1_40=63, var_1_4=0, var_1_8=32, var_1_9=64] [L127] COND FALSE !(\read(var_1_15)) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, stepLocal_0=-64, var_1_10=33, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=2, var_1_17=2, var_1_18=32, var_1_19=0, var_1_1=32, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=63, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_38=0, var_1_39=63, var_1_40=63, var_1_4=0, var_1_8=32, var_1_9=64] [L132] COND FALSE !(var_1_15 && var_1_14) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, stepLocal_0=-64, var_1_10=33, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=2, var_1_17=2, var_1_18=32, var_1_19=0, var_1_1=32, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=63, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_38=0, var_1_39=63, var_1_40=63, var_1_4=0, var_1_8=32, var_1_9=64] [L141] COND FALSE !(\read(var_1_14)) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, stepLocal_0=-64, var_1_10=33, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=2, var_1_17=2, var_1_18=32, var_1_19=0, var_1_1=32, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=63, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_38=0, var_1_39=63, var_1_40=63, var_1_4=0, var_1_8=32, var_1_9=64] [L193] RET step() [L194] CALL, EXPR property() [L184-L185] return ((((((var_1_18 != var_1_12) ? (var_1_14 ? (var_1_1 == ((signed long int) ((((((((-5) > (var_1_12)) ? (-5) : (var_1_12)))) < (((((var_1_8) < (var_1_18)) ? (var_1_8) : (var_1_18))))) ? (((((-5) > (var_1_12)) ? (-5) : (var_1_12)))) : (((((var_1_8) < (var_1_18)) ? (var_1_8) : (var_1_18)))))))) : 1) : 1) && ((last_1_var_1_18 >= (last_1_var_1_18 / var_1_9)) ? ((last_1_var_1_18 < (last_1_var_1_1 * 256)) ? (var_1_8 == ((unsigned short int) ((((last_1_var_1_12) < (((((128) < (last_1_var_1_12)) ? (128) : (last_1_var_1_12))))) ? (last_1_var_1_12) : (((((128) < (last_1_var_1_12)) ? (128) : (last_1_var_1_12)))))))) : (var_1_8 == ((unsigned short int) last_1_var_1_12))) : (var_1_8 == ((unsigned short int) last_1_var_1_12)))) && ((var_1_10 < var_1_18) ? ((last_1_var_1_12 <= (5 - last_1_var_1_12)) ? (var_1_12 == ((unsigned char) var_1_13)) : ((last_1_var_1_12 == var_1_8) ? (var_1_12 == ((unsigned char) var_1_13)) : (var_1_12 == ((unsigned char) var_1_13)))) : 1)) && ((var_1_8 > (((((var_1_8) < (var_1_8)) ? (var_1_8) : (var_1_8))) + var_1_12)) ? ((! (var_1_8 >= var_1_12)) ? (var_1_4 ? (var_1_14 == ((unsigned char) 0)) : (var_1_14 == ((unsigned char) var_1_15))) : (var_1_14 == ((unsigned char) var_1_15))) : 1)) && (var_1_14 ? (var_1_15 ? (var_1_16 == ((double) var_1_17)) : (var_1_16 == ((double) (((((((((25.8) > (7.5)) ? (25.8) : (7.5))) - 50.25)) > (var_1_17)) ? ((((((25.8) > (7.5)) ? (25.8) : (7.5))) - 50.25)) : (var_1_17)))))) : (var_1_14 ? (var_1_16 == ((double) 5.2)) : (var_1_16 == ((double) var_1_17))))) && (var_1_18 == ((signed short int) var_1_8)) ; VAL [\result=0, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=33, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=2, var_1_17=2, var_1_18=32, var_1_19=0, var_1_1=32, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=63, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_38=0, var_1_39=63, var_1_40=63, var_1_4=0, var_1_8=32, var_1_9=64] [L194] RET, EXPR property() [L194] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=33, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=2, var_1_17=2, var_1_18=32, var_1_19=0, var_1_1=32, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=63, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_38=0, var_1_39=63, var_1_40=63, var_1_4=0, var_1_8=32, var_1_9=64] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=33, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=2, var_1_17=2, var_1_18=32, var_1_19=0, var_1_1=32, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=63, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_38=0, var_1_39=63, var_1_40=63, var_1_4=0, var_1_8=32, var_1_9=64] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 81 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.7s, OverallIterations: 6, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 534 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 534 mSDsluCounter, 1199 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 502 mSDsCounter, 60 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 125 IncrementalHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 60 mSolverCounterUnsat, 697 mSDtfsCounter, 125 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 156 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=473occurred in iteration=5, InterpolantAutomatonStates: 16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 5 MinimizatonAttempts, 794 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 1099 NumberOfCodeBlocks, 1099 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 817 ConstructedInterpolants, 0 QuantifiedInterpolants, 1301 SizeOfPredicates, 0 NumberOfNonLiveVariables, 339 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 6 InterpolantComputations, 5 PerfectInterpolantSequences, 4522/4560 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-01-09 11:10:38,837 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-pr-ci_file-89.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 9933437b0126f19d2b07775387d6f9b8ed254522e0b90d315e6d113e1084c26a --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 11:10:41,016 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 11:10:41,108 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-01-09 11:10:41,115 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 11:10:41,115 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 11:10:41,139 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 11:10:41,142 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 11:10:41,142 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 11:10:41,142 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 11:10:41,142 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 11:10:41,143 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 11:10:41,143 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 11:10:41,144 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 11:10:41,144 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 11:10:41,144 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 11:10:41,144 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 11:10:41,144 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 11:10:41,144 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 11:10:41,144 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 11:10:41,144 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 11:10:41,144 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 11:10:41,144 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 11:10:41,144 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 11:10:41,144 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 11:10:41,144 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 11:10:41,144 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 11:10:41,145 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 11:10:41,145 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 11:10:41,145 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 11:10:41,145 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 11:10:41,146 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 11:10:41,146 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 11:10:41,146 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 11:10:41,146 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 11:10:41,146 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 11:10:41,146 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 11:10:41,146 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 11:10:41,147 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 11:10:41,147 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 11:10:41,147 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 11:10:41,147 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 11:10:41,147 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 11:10:41,147 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 11:10:41,147 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 11:10:41,147 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 11:10:41,147 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 11:10:41,147 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 11:10:41,147 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 11:10:41,147 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 11:10:41,147 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 11:10:41,147 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 -> 9933437b0126f19d2b07775387d6f9b8ed254522e0b90d315e6d113e1084c26a [2025-01-09 11:10:41,387 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 11:10:41,393 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 11:10:41,395 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 11:10:41,397 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 11:10:41,397 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 11:10:41,398 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-pr-ci_file-89.i [2025-01-09 11:10:42,641 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/feb583ad7/ca3e848907ff4cceb3fdfdaf88bd24ac/FLAGe5af1b656 [2025-01-09 11:10:42,864 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 11:10:42,864 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-89.i [2025-01-09 11:10:42,870 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/feb583ad7/ca3e848907ff4cceb3fdfdaf88bd24ac/FLAGe5af1b656 [2025-01-09 11:10:42,881 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/feb583ad7/ca3e848907ff4cceb3fdfdaf88bd24ac [2025-01-09 11:10:42,883 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 11:10:42,885 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 11:10:42,886 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 11:10:42,886 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 11:10:42,889 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 11:10:42,889 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 11:10:42" (1/1) ... [2025-01-09 11:10:42,890 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@184066a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:10:42, skipping insertion in model container [2025-01-09 11:10:42,890 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 11:10:42" (1/1) ... [2025-01-09 11:10:42,903 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 11:10:43,002 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-pr-ci_file-89.i[919,932] [2025-01-09 11:10:43,054 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 11:10:43,062 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 11:10:43,072 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-pr-ci_file-89.i[919,932] [2025-01-09 11:10:43,110 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 11:10:43,126 INFO L204 MainTranslator]: Completed translation [2025-01-09 11:10:43,127 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:10:43 WrapperNode [2025-01-09 11:10:43,127 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 11:10:43,130 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 11:10:43,130 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 11:10:43,130 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 11:10:43,137 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:10:43" (1/1) ... [2025-01-09 11:10:43,152 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:10:43" (1/1) ... [2025-01-09 11:10:43,184 INFO L138 Inliner]: procedures = 27, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 167 [2025-01-09 11:10:43,188 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 11:10:43,188 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 11:10:43,188 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 11:10:43,188 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 11:10:43,196 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:10:43" (1/1) ... [2025-01-09 11:10:43,196 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:10:43" (1/1) ... [2025-01-09 11:10:43,202 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:10:43" (1/1) ... [2025-01-09 11:10:43,218 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-01-09 11:10:43,219 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:10:43" (1/1) ... [2025-01-09 11:10:43,219 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:10:43" (1/1) ... [2025-01-09 11:10:43,227 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:10:43" (1/1) ... [2025-01-09 11:10:43,231 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:10:43" (1/1) ... [2025-01-09 11:10:43,233 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:10:43" (1/1) ... [2025-01-09 11:10:43,238 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:10:43" (1/1) ... [2025-01-09 11:10:43,239 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:10:43" (1/1) ... [2025-01-09 11:10:43,244 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 11:10:43,245 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 11:10:43,245 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 11:10:43,245 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 11:10:43,246 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:10:43" (1/1) ... [2025-01-09 11:10:43,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 11:10:43,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 11:10:43,273 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-01-09 11:10:43,275 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-01-09 11:10:43,292 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 11:10:43,292 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 11:10:43,292 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 11:10:43,292 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 11:10:43,292 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 11:10:43,292 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 11:10:43,361 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 11:10:43,363 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 11:10:52,227 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-01-09 11:10:52,227 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 11:10:52,236 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 11:10:52,237 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 11:10:52,237 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 11:10:52 BoogieIcfgContainer [2025-01-09 11:10:52,237 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 11:10:52,239 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 11:10:52,239 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 11:10:52,242 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 11:10:52,243 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 11:10:42" (1/3) ... [2025-01-09 11:10:52,243 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@411e5cfa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 11:10:52, skipping insertion in model container [2025-01-09 11:10:52,244 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:10:43" (2/3) ... [2025-01-09 11:10:52,245 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@411e5cfa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 11:10:52, skipping insertion in model container [2025-01-09 11:10:52,245 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 11:10:52" (3/3) ... [2025-01-09 11:10:52,246 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-89.i [2025-01-09 11:10:52,256 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 11:10:52,257 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-89.i that has 2 procedures, 76 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 11:10:52,300 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 11:10:52,308 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;@7a736700, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 11:10:52,308 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 11:10:52,311 INFO L276 IsEmpty]: Start isEmpty. Operand has 76 states, 53 states have (on average 1.5471698113207548) internal successors, (82), 54 states have internal predecessors, (82), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-01-09 11:10:52,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-01-09 11:10:52,318 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:10:52,318 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 11:10:52,319 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:10:52,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:10:52,322 INFO L85 PathProgramCache]: Analyzing trace with hash -761167146, now seen corresponding path program 1 times [2025-01-09 11:10:52,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 11:10:52,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1230970103] [2025-01-09 11:10:52,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:10:52,330 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-01-09 11:10:52,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 11:10:52,332 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-01-09 11:10:52,334 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-01-09 11:10:52,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-01-09 11:10:52,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-01-09 11:10:52,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:10:52,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:10:52,570 INFO L256 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 11:10:52,577 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 11:10:52,600 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 374 proven. 0 refuted. 0 times theorem prover too weak. 386 trivial. 0 not checked. [2025-01-09 11:10:52,600 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 11:10:52,601 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 11:10:52,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1230970103] [2025-01-09 11:10:52,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1230970103] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:10:52,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:10:52,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 11:10:52,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755288986] [2025-01-09 11:10:52,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:10:52,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 11:10:52,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 11:10:52,616 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 11:10:52,616 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 11:10:52,617 INFO L87 Difference]: Start difference. First operand has 76 states, 53 states have (on average 1.5471698113207548) internal successors, (82), 54 states have internal predecessors, (82), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-01-09 11:10:52,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:10:52,633 INFO L93 Difference]: Finished difference Result 146 states and 259 transitions. [2025-01-09 11:10:52,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 11:10:52,634 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 135 [2025-01-09 11:10:52,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:10:52,640 INFO L225 Difference]: With dead ends: 146 [2025-01-09 11:10:52,640 INFO L226 Difference]: Without dead ends: 73 [2025-01-09 11:10:52,643 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 134 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-01-09 11:10:52,645 INFO L435 NwaCegarLoop]: 116 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, 116 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-01-09 11:10:52,645 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 11:10:52,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-01-09 11:10:52,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2025-01-09 11:10:52,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 51 states have (on average 1.4901960784313726) internal successors, (76), 51 states have internal predecessors, (76), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-01-09 11:10:52,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 116 transitions. [2025-01-09 11:10:52,670 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 116 transitions. Word has length 135 [2025-01-09 11:10:52,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:10:52,670 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 116 transitions. [2025-01-09 11:10:52,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-01-09 11:10:52,670 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 116 transitions. [2025-01-09 11:10:52,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-01-09 11:10:52,673 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:10:52,673 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 11:10:52,682 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-01-09 11:10:52,877 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-01-09 11:10:52,877 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:10:52,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:10:52,878 INFO L85 PathProgramCache]: Analyzing trace with hash 470716374, now seen corresponding path program 1 times [2025-01-09 11:10:52,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 11:10:52,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1510846098] [2025-01-09 11:10:52,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:10:52,879 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-01-09 11:10:52,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 11:10:52,881 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-01-09 11:10:52,882 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-01-09 11:10:52,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-01-09 11:10:53,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-01-09 11:10:53,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:10:53,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:10:53,101 INFO L256 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 11:10:53,106 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 11:10:54,309 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 399 proven. 27 refuted. 0 times theorem prover too weak. 334 trivial. 0 not checked. [2025-01-09 11:10:54,309 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 11:10:55,785 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 30 proven. 27 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2025-01-09 11:10:55,785 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 11:10:55,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1510846098] [2025-01-09 11:10:55,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1510846098] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 11:10:55,786 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 11:10:55,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2025-01-09 11:10:55,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698326228] [2025-01-09 11:10:55,786 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 11:10:55,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 11:10:55,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 11:10:55,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 11:10:55,788 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 11:10:55,788 INFO L87 Difference]: Start difference. First operand 73 states and 116 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 2 states have call successors, (29), 2 states have call predecessors, (29), 4 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2025-01-09 11:10:57,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:10:57,403 INFO L93 Difference]: Finished difference Result 148 states and 230 transitions. [2025-01-09 11:10:57,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 11:10:57,412 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 2 states have call successors, (29), 2 states have call predecessors, (29), 4 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) Word has length 135 [2025-01-09 11:10:57,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:10:57,413 INFO L225 Difference]: With dead ends: 148 [2025-01-09 11:10:57,413 INFO L226 Difference]: Without dead ends: 78 [2025-01-09 11:10:57,414 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 262 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2025-01-09 11:10:57,414 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 119 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-09 11:10:57,414 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 189 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-09 11:10:57,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-01-09 11:10:57,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 74. [2025-01-09 11:10:57,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 51 states have (on average 1.3529411764705883) internal successors, (69), 51 states have internal predecessors, (69), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-01-09 11:10:57,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 109 transitions. [2025-01-09 11:10:57,433 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 109 transitions. Word has length 135 [2025-01-09 11:10:57,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:10:57,434 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 109 transitions. [2025-01-09 11:10:57,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 2 states have call successors, (29), 2 states have call predecessors, (29), 4 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2025-01-09 11:10:57,434 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 109 transitions. [2025-01-09 11:10:57,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-01-09 11:10:57,435 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:10:57,435 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 11:10:57,444 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-01-09 11:10:57,636 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-01-09 11:10:57,637 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:10:57,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:10:57,638 INFO L85 PathProgramCache]: Analyzing trace with hash -1218227368, now seen corresponding path program 1 times [2025-01-09 11:10:57,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 11:10:57,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1984498639] [2025-01-09 11:10:57,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:10:57,639 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-01-09 11:10:57,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 11:10:57,641 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-01-09 11:10:57,642 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-01-09 11:10:57,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-01-09 11:10:57,841 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-01-09 11:10:57,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:10:57,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:10:57,851 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 11:10:57,855 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 11:11:00,042 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-01-09 11:11:00,043 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 11:11:00,043 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 11:11:00,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1984498639] [2025-01-09 11:11:00,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1984498639] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:11:00,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:11:00,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 11:11:00,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104072810] [2025-01-09 11:11:00,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:11:00,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 11:11:00,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 11:11:00,044 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 11:11:00,045 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 11:11:00,046 INFO L87 Difference]: Start difference. First operand 74 states and 109 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 2 states have internal predecessors, (38), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 11:11:00,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:11:00,430 INFO L93 Difference]: Finished difference Result 214 states and 318 transitions. [2025-01-09 11:11:00,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 11:11:00,430 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 2 states have internal predecessors, (38), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 135 [2025-01-09 11:11:00,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:11:00,432 INFO L225 Difference]: With dead ends: 214 [2025-01-09 11:11:00,432 INFO L226 Difference]: Without dead ends: 143 [2025-01-09 11:11:00,432 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 133 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-01-09 11:11:00,433 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 26 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 11:11:00,433 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 189 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 11:11:00,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2025-01-09 11:11:00,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 139. [2025-01-09 11:11:00,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 94 states have (on average 1.3085106382978724) internal successors, (123), 94 states have internal predecessors, (123), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-01-09 11:11:00,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 203 transitions. [2025-01-09 11:11:00,446 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 203 transitions. Word has length 135 [2025-01-09 11:11:00,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:11:00,447 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 203 transitions. [2025-01-09 11:11:00,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 2 states have internal predecessors, (38), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 11:11:00,447 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 203 transitions. [2025-01-09 11:11:00,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-01-09 11:11:00,448 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:11:00,448 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 11:11:00,457 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-01-09 11:11:00,649 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-01-09 11:11:00,649 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:11:00,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:11:00,650 INFO L85 PathProgramCache]: Analyzing trace with hash -536321956, now seen corresponding path program 1 times [2025-01-09 11:11:00,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 11:11:00,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [995728171] [2025-01-09 11:11:00,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:11:00,651 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-01-09 11:11:00,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 11:11:00,653 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-01-09 11:11:00,654 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-01-09 11:11:00,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-01-09 11:11:00,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-01-09 11:11:00,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:11:00,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:11:00,866 INFO L256 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-01-09 11:11:00,871 INFO L279 TraceCheckSpWp]: Computing forward predicates...