./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-97.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-97.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 32bb1a8f237f620d8564fbe646b4542e6d02d07be2c2e5b8eafb2c14f730fdc9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 11:16:05,280 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 11:16:05,341 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 11:16:05,346 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 11:16:05,349 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 11:16:05,369 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 11:16:05,370 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 11:16:05,370 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 11:16:05,370 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 11:16:05,371 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 11:16:05,371 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 11:16:05,371 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 11:16:05,372 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 11:16:05,372 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 11:16:05,372 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 11:16:05,372 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 11:16:05,372 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 11:16:05,372 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 11:16:05,373 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 11:16:05,373 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 11:16:05,373 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 11:16:05,373 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 11:16:05,373 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 11:16:05,373 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 11:16:05,373 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 11:16:05,373 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 11:16:05,373 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 11:16:05,373 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 11:16:05,373 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 11:16:05,373 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 11:16:05,374 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 11:16:05,374 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 11:16:05,374 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 11:16:05,374 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 11:16:05,374 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 11:16:05,374 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 11:16:05,374 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 11:16:05,374 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 11:16:05,374 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 11:16:05,374 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 11:16:05,374 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 11:16:05,374 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 11:16:05,374 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 11:16:05,374 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 32bb1a8f237f620d8564fbe646b4542e6d02d07be2c2e5b8eafb2c14f730fdc9 [2025-03-08 11:16:05,582 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 11:16:05,590 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 11:16:05,592 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 11:16:05,593 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 11:16:05,593 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 11:16:05,594 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-97.i [2025-03-08 11:16:06,736 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a8174543/e8c94028517b40b0add7587b1ae02c29/FLAG52b2b734c [2025-03-08 11:16:06,960 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 11:16:06,961 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-97.i [2025-03-08 11:16:06,967 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a8174543/e8c94028517b40b0add7587b1ae02c29/FLAG52b2b734c [2025-03-08 11:16:07,309 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a8174543/e8c94028517b40b0add7587b1ae02c29 [2025-03-08 11:16:07,311 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 11:16:07,312 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 11:16:07,313 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 11:16:07,313 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 11:16:07,316 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 11:16:07,317 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 11:16:07" (1/1) ... [2025-03-08 11:16:07,317 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27c66aac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:16:07, skipping insertion in model container [2025-03-08 11:16:07,317 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 11:16:07" (1/1) ... [2025-03-08 11:16:07,330 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 11:16:07,428 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-97.i[915,928] [2025-03-08 11:16:07,481 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 11:16:07,490 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 11:16:07,497 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-97.i[915,928] [2025-03-08 11:16:07,534 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 11:16:07,551 INFO L204 MainTranslator]: Completed translation [2025-03-08 11:16:07,552 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:16:07 WrapperNode [2025-03-08 11:16:07,552 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 11:16:07,552 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 11:16:07,552 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 11:16:07,553 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 11:16:07,557 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:16:07" (1/1) ... [2025-03-08 11:16:07,564 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:16:07" (1/1) ... [2025-03-08 11:16:07,590 INFO L138 Inliner]: procedures = 26, calls = 48, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 273 [2025-03-08 11:16:07,591 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 11:16:07,591 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 11:16:07,591 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 11:16:07,591 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 11:16:07,597 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:16:07" (1/1) ... [2025-03-08 11:16:07,598 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:16:07" (1/1) ... [2025-03-08 11:16:07,601 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:16:07" (1/1) ... [2025-03-08 11:16:07,616 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 11:16:07,616 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:16:07" (1/1) ... [2025-03-08 11:16:07,616 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:16:07" (1/1) ... [2025-03-08 11:16:07,622 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:16:07" (1/1) ... [2025-03-08 11:16:07,627 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:16:07" (1/1) ... [2025-03-08 11:16:07,629 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:16:07" (1/1) ... [2025-03-08 11:16:07,630 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:16:07" (1/1) ... [2025-03-08 11:16:07,632 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 11:16:07,633 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 11:16:07,633 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 11:16:07,633 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 11:16:07,634 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:16:07" (1/1) ... [2025-03-08 11:16:07,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 11:16:07,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:16:07,661 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 11:16:07,664 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 11:16:07,680 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 11:16:07,681 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 11:16:07,681 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 11:16:07,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 11:16:07,681 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 11:16:07,681 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 11:16:07,743 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 11:16:07,744 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 11:16:08,058 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L195: havoc property_#t~ite28#1;havoc property_#t~ite27#1;havoc property_#t~bitwise26#1;havoc property_#t~short29#1;havoc property_#t~ite31#1;havoc property_#t~bitwise30#1;havoc property_#t~short32#1; [2025-03-08 11:16:08,085 INFO L? ?]: Removed 26 outVars from TransFormulas that were not future-live. [2025-03-08 11:16:08,085 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 11:16:08,107 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 11:16:08,108 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 11:16:08,109 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:16:08 BoogieIcfgContainer [2025-03-08 11:16:08,109 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 11:16:08,110 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 11:16:08,111 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 11:16:08,114 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 11:16:08,115 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 11:16:07" (1/3) ... [2025-03-08 11:16:08,116 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5151391f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 11:16:08, skipping insertion in model container [2025-03-08 11:16:08,116 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:16:07" (2/3) ... [2025-03-08 11:16:08,116 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5151391f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 11:16:08, skipping insertion in model container [2025-03-08 11:16:08,116 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:16:08" (3/3) ... [2025-03-08 11:16:08,117 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-97.i [2025-03-08 11:16:08,128 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 11:16:08,131 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-97.i that has 2 procedures, 119 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 11:16:08,173 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 11:16:08,184 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;@5ce022ce, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 11:16:08,184 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 11:16:08,190 INFO L276 IsEmpty]: Start isEmpty. Operand has 119 states, 81 states have (on average 1.4320987654320987) internal successors, (116), 82 states have internal predecessors, (116), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2025-03-08 11:16:08,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2025-03-08 11:16:08,200 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:16:08,201 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:16:08,201 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:16:08,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:16:08,205 INFO L85 PathProgramCache]: Analyzing trace with hash 2041982850, now seen corresponding path program 1 times [2025-03-08 11:16:08,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:16:08,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190360801] [2025-03-08 11:16:08,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:16:08,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:16:08,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 222 statements into 1 equivalence classes. [2025-03-08 11:16:08,322 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 222 of 222 statements. [2025-03-08 11:16:08,325 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:16:08,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:16:08,501 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 68 refuted. 0 times theorem prover too weak. 2312 trivial. 0 not checked. [2025-03-08 11:16:08,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:16:08,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190360801] [2025-03-08 11:16:08,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190360801] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 11:16:08,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [789906582] [2025-03-08 11:16:08,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:16:08,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 11:16:08,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:16:08,504 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 11:16:08,522 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 11:16:08,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 222 statements into 1 equivalence classes. [2025-03-08 11:16:08,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 222 of 222 statements. [2025-03-08 11:16:08,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:16:08,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:16:08,676 INFO L256 TraceCheckSpWp]: Trace formula consists of 501 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 11:16:08,684 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 11:16:08,716 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 2312 trivial. 0 not checked. [2025-03-08 11:16:08,720 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 11:16:08,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [789906582] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:16:08,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 11:16:08,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 11:16:08,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933694620] [2025-03-08 11:16:08,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:16:08,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 11:16:08,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:16:08,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 11:16:08,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 11:16:08,748 INFO L87 Difference]: Start difference. First operand has 119 states, 81 states have (on average 1.4320987654320987) internal successors, (116), 82 states have internal predecessors, (116), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) Second operand has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (35), 2 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 2 states have call successors, (35) [2025-03-08 11:16:08,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:16:08,776 INFO L93 Difference]: Finished difference Result 232 states and 402 transitions. [2025-03-08 11:16:08,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 11:16:08,778 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (35), 2 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 2 states have call successors, (35) Word has length 222 [2025-03-08 11:16:08,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:16:08,784 INFO L225 Difference]: With dead ends: 232 [2025-03-08 11:16:08,785 INFO L226 Difference]: Without dead ends: 116 [2025-03-08 11:16:08,788 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 223 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 11:16:08,791 INFO L435 NwaCegarLoop]: 177 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 11:16:08,791 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 177 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 11:16:08,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-03-08 11:16:08,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2025-03-08 11:16:08,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 79 states have (on average 1.4050632911392404) internal successors, (111), 79 states have internal predecessors, (111), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2025-03-08 11:16:08,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 181 transitions. [2025-03-08 11:16:08,828 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 181 transitions. Word has length 222 [2025-03-08 11:16:08,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:16:08,828 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 181 transitions. [2025-03-08 11:16:08,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (35), 2 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 2 states have call successors, (35) [2025-03-08 11:16:08,829 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 181 transitions. [2025-03-08 11:16:08,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2025-03-08 11:16:08,832 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:16:08,833 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:16:08,841 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 11:16:09,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 11:16:09,033 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:16:09,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:16:09,034 INFO L85 PathProgramCache]: Analyzing trace with hash 1942564289, now seen corresponding path program 1 times [2025-03-08 11:16:09,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:16:09,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618763664] [2025-03-08 11:16:09,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:16:09,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:16:09,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 222 statements into 1 equivalence classes. [2025-03-08 11:16:09,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 222 of 222 statements. [2025-03-08 11:16:09,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:16:09,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:16:09,317 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2025-03-08 11:16:09,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:16:09,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618763664] [2025-03-08 11:16:09,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618763664] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:16:09,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:16:09,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:16:09,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335939366] [2025-03-08 11:16:09,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:16:09,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:16:09,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:16:09,323 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:16:09,323 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:16:09,323 INFO L87 Difference]: Start difference. First operand 116 states and 181 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-03-08 11:16:09,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:16:09,373 INFO L93 Difference]: Finished difference Result 260 states and 405 transitions. [2025-03-08 11:16:09,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:16:09,374 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 222 [2025-03-08 11:16:09,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:16:09,378 INFO L225 Difference]: With dead ends: 260 [2025-03-08 11:16:09,378 INFO L226 Difference]: Without dead ends: 147 [2025-03-08 11:16:09,379 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-03-08 11:16:09,380 INFO L435 NwaCegarLoop]: 219 mSDtfsCounter, 127 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 11:16:09,381 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 312 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 11:16:09,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2025-03-08 11:16:09,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 146. [2025-03-08 11:16:09,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 92 states have (on average 1.3369565217391304) internal successors, (123), 93 states have internal predecessors, (123), 51 states have call successors, (51), 2 states have call predecessors, (51), 2 states have return successors, (51), 50 states have call predecessors, (51), 51 states have call successors, (51) [2025-03-08 11:16:09,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 225 transitions. [2025-03-08 11:16:09,408 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 225 transitions. Word has length 222 [2025-03-08 11:16:09,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:16:09,408 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 225 transitions. [2025-03-08 11:16:09,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-03-08 11:16:09,409 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 225 transitions. [2025-03-08 11:16:09,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2025-03-08 11:16:09,412 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:16:09,412 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:16:09,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 11:16:09,412 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:16:09,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:16:09,413 INFO L85 PathProgramCache]: Analyzing trace with hash -1608091974, now seen corresponding path program 1 times [2025-03-08 11:16:09,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:16:09,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601593568] [2025-03-08 11:16:09,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:16:09,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:16:09,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 223 statements into 1 equivalence classes. [2025-03-08 11:16:09,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 223 of 223 statements. [2025-03-08 11:16:09,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:16:09,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:16:09,524 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2025-03-08 11:16:09,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:16:09,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601593568] [2025-03-08 11:16:09,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601593568] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:16:09,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:16:09,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:16:09,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73287475] [2025-03-08 11:16:09,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:16:09,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:16:09,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:16:09,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:16:09,529 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:16:09,529 INFO L87 Difference]: Start difference. First operand 146 states and 225 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-03-08 11:16:09,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:16:09,600 INFO L93 Difference]: Finished difference Result 366 states and 562 transitions. [2025-03-08 11:16:09,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:16:09,600 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 223 [2025-03-08 11:16:09,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:16:09,603 INFO L225 Difference]: With dead ends: 366 [2025-03-08 11:16:09,604 INFO L226 Difference]: Without dead ends: 249 [2025-03-08 11:16:09,604 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-03-08 11:16:09,605 INFO L435 NwaCegarLoop]: 314 mSDtfsCounter, 165 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 11:16:09,605 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 455 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 11:16:09,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2025-03-08 11:16:09,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 236. [2025-03-08 11:16:09,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 145 states have (on average 1.2758620689655173) internal successors, (185), 147 states have internal predecessors, (185), 86 states have call successors, (86), 4 states have call predecessors, (86), 4 states have return successors, (86), 84 states have call predecessors, (86), 86 states have call successors, (86) [2025-03-08 11:16:09,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 357 transitions. [2025-03-08 11:16:09,638 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 357 transitions. Word has length 223 [2025-03-08 11:16:09,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:16:09,639 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 357 transitions. [2025-03-08 11:16:09,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-03-08 11:16:09,640 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 357 transitions. [2025-03-08 11:16:09,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2025-03-08 11:16:09,643 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:16:09,643 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:16:09,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 11:16:09,644 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:16:09,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:16:09,645 INFO L85 PathProgramCache]: Analyzing trace with hash -100540165, now seen corresponding path program 1 times [2025-03-08 11:16:09,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:16:09,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390184701] [2025-03-08 11:16:09,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:16:09,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:16:09,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 223 statements into 1 equivalence classes. [2025-03-08 11:16:09,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 223 of 223 statements. [2025-03-08 11:16:09,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:16:09,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:16:10,052 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2025-03-08 11:16:10,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:16:10,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390184701] [2025-03-08 11:16:10,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390184701] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:16:10,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:16:10,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 11:16:10,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138501645] [2025-03-08 11:16:10,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:16:10,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 11:16:10,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:16:10,055 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 11:16:10,055 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 11:16:10,055 INFO L87 Difference]: Start difference. First operand 236 states and 357 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-03-08 11:16:10,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:16:10,452 INFO L93 Difference]: Finished difference Result 689 states and 1044 transitions. [2025-03-08 11:16:10,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 11:16:10,453 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 223 [2025-03-08 11:16:10,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:16:10,459 INFO L225 Difference]: With dead ends: 689 [2025-03-08 11:16:10,459 INFO L226 Difference]: Without dead ends: 482 [2025-03-08 11:16:10,460 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 11:16:10,461 INFO L435 NwaCegarLoop]: 277 mSDtfsCounter, 196 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 784 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 11:16:10,461 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 784 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 11:16:10,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2025-03-08 11:16:10,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 331. [2025-03-08 11:16:10,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 220 states have (on average 1.3272727272727274) internal successors, (292), 221 states have internal predecessors, (292), 105 states have call successors, (105), 5 states have call predecessors, (105), 5 states have return successors, (105), 104 states have call predecessors, (105), 105 states have call successors, (105) [2025-03-08 11:16:10,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 502 transitions. [2025-03-08 11:16:10,500 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 502 transitions. Word has length 223 [2025-03-08 11:16:10,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:16:10,501 INFO L471 AbstractCegarLoop]: Abstraction has 331 states and 502 transitions. [2025-03-08 11:16:10,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-03-08 11:16:10,501 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 502 transitions. [2025-03-08 11:16:10,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2025-03-08 11:16:10,503 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:16:10,503 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:16:10,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 11:16:10,503 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:16:10,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:16:10,504 INFO L85 PathProgramCache]: Analyzing trace with hash -1743932007, now seen corresponding path program 1 times [2025-03-08 11:16:10,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:16:10,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025392790] [2025-03-08 11:16:10,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:16:10,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:16:10,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 224 statements into 1 equivalence classes. [2025-03-08 11:16:10,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 224 of 224 statements. [2025-03-08 11:16:10,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:16:10,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:16:10,944 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2025-03-08 11:16:10,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:16:10,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025392790] [2025-03-08 11:16:10,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025392790] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:16:10,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:16:10,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 11:16:10,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719278239] [2025-03-08 11:16:10,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:16:10,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 11:16:10,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:16:10,946 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 11:16:10,947 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-08 11:16:10,947 INFO L87 Difference]: Start difference. First operand 331 states and 502 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-03-08 11:16:11,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:16:11,434 INFO L93 Difference]: Finished difference Result 763 states and 1146 transitions. [2025-03-08 11:16:11,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 11:16:11,434 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 224 [2025-03-08 11:16:11,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:16:11,438 INFO L225 Difference]: With dead ends: 763 [2025-03-08 11:16:11,439 INFO L226 Difference]: Without dead ends: 495 [2025-03-08 11:16:11,439 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-08 11:16:11,440 INFO L435 NwaCegarLoop]: 202 mSDtfsCounter, 230 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 748 SdHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 11:16:11,440 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 748 Invalid, 427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 11:16:11,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2025-03-08 11:16:11,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 467. [2025-03-08 11:16:11,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 467 states, 319 states have (on average 1.322884012539185) internal successors, (422), 320 states have internal predecessors, (422), 140 states have call successors, (140), 7 states have call predecessors, (140), 7 states have return successors, (140), 139 states have call predecessors, (140), 140 states have call successors, (140) [2025-03-08 11:16:11,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 702 transitions. [2025-03-08 11:16:11,510 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 702 transitions. Word has length 224 [2025-03-08 11:16:11,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:16:11,512 INFO L471 AbstractCegarLoop]: Abstraction has 467 states and 702 transitions. [2025-03-08 11:16:11,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-03-08 11:16:11,513 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 702 transitions. [2025-03-08 11:16:11,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2025-03-08 11:16:11,515 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:16:11,515 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:16:11,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 11:16:11,517 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:16:11,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:16:11,517 INFO L85 PathProgramCache]: Analyzing trace with hash -2010398599, now seen corresponding path program 1 times [2025-03-08 11:16:11,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:16:11,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167531371] [2025-03-08 11:16:11,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:16:11,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:16:11,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 225 statements into 1 equivalence classes. [2025-03-08 11:16:11,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 225 of 225 statements. [2025-03-08 11:16:11,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:16:11,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:16:11,711 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2025-03-08 11:16:11,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:16:11,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167531371] [2025-03-08 11:16:11,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167531371] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:16:11,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:16:11,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:16:11,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314175223] [2025-03-08 11:16:11,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:16:11,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:16:11,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:16:11,713 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:16:11,714 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:16:11,714 INFO L87 Difference]: Start difference. First operand 467 states and 702 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-03-08 11:16:11,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:16:11,754 INFO L93 Difference]: Finished difference Result 872 states and 1309 transitions. [2025-03-08 11:16:11,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:16:11,755 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 225 [2025-03-08 11:16:11,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:16:11,758 INFO L225 Difference]: With dead ends: 872 [2025-03-08 11:16:11,758 INFO L226 Difference]: Without dead ends: 468 [2025-03-08 11:16:11,763 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:16:11,765 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 0 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 11:16:11,766 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 345 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 11:16:11,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2025-03-08 11:16:11,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 468. [2025-03-08 11:16:11,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 468 states, 320 states have (on average 1.315625) internal successors, (421), 321 states have internal predecessors, (421), 140 states have call successors, (140), 7 states have call predecessors, (140), 7 states have return successors, (140), 139 states have call predecessors, (140), 140 states have call successors, (140) [2025-03-08 11:16:11,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 701 transitions. [2025-03-08 11:16:11,816 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 701 transitions. Word has length 225 [2025-03-08 11:16:11,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:16:11,817 INFO L471 AbstractCegarLoop]: Abstraction has 468 states and 701 transitions. [2025-03-08 11:16:11,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-03-08 11:16:11,817 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 701 transitions. [2025-03-08 11:16:11,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2025-03-08 11:16:11,819 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:16:11,819 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:16:11,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 11:16:11,819 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:16:11,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:16:11,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1991165690, now seen corresponding path program 1 times [2025-03-08 11:16:11,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:16:11,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730888543] [2025-03-08 11:16:11,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:16:11,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:16:11,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 225 statements into 1 equivalence classes. [2025-03-08 11:16:11,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 225 of 225 statements. [2025-03-08 11:16:11,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:16:11,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:16:12,063 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2025-03-08 11:16:12,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:16:12,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730888543] [2025-03-08 11:16:12,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730888543] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:16:12,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:16:12,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 11:16:12,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210499269] [2025-03-08 11:16:12,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:16:12,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 11:16:12,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:16:12,067 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 11:16:12,067 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 11:16:12,067 INFO L87 Difference]: Start difference. First operand 468 states and 701 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-03-08 11:16:12,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:16:12,469 INFO L93 Difference]: Finished difference Result 736 states and 1105 transitions. [2025-03-08 11:16:12,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 11:16:12,470 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 225 [2025-03-08 11:16:12,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:16:12,475 INFO L225 Difference]: With dead ends: 736 [2025-03-08 11:16:12,475 INFO L226 Difference]: Without dead ends: 597 [2025-03-08 11:16:12,476 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 11:16:12,477 INFO L435 NwaCegarLoop]: 403 mSDtfsCounter, 285 mSDsluCounter, 703 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 1106 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 11:16:12,478 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 1106 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 11:16:12,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2025-03-08 11:16:12,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 475. [2025-03-08 11:16:12,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 475 states, 327 states have (on average 1.3180428134556574) internal successors, (431), 328 states have internal predecessors, (431), 140 states have call successors, (140), 7 states have call predecessors, (140), 7 states have return successors, (140), 139 states have call predecessors, (140), 140 states have call successors, (140) [2025-03-08 11:16:12,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 711 transitions. [2025-03-08 11:16:12,545 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 711 transitions. Word has length 225 [2025-03-08 11:16:12,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:16:12,546 INFO L471 AbstractCegarLoop]: Abstraction has 475 states and 711 transitions. [2025-03-08 11:16:12,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-03-08 11:16:12,546 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 711 transitions. [2025-03-08 11:16:12,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2025-03-08 11:16:12,547 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:16:12,547 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:16:12,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 11:16:12,548 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:16:12,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:16:12,548 INFO L85 PathProgramCache]: Analyzing trace with hash 926625027, now seen corresponding path program 1 times [2025-03-08 11:16:12,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:16:12,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677761413] [2025-03-08 11:16:12,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:16:12,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:16:12,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 225 statements into 1 equivalence classes. [2025-03-08 11:16:12,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 225 of 225 statements. [2025-03-08 11:16:12,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:16:12,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:16:12,877 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2025-03-08 11:16:12,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:16:12,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677761413] [2025-03-08 11:16:12,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677761413] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:16:12,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:16:12,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 11:16:12,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674745494] [2025-03-08 11:16:12,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:16:12,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 11:16:12,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:16:12,878 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 11:16:12,878 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 11:16:12,878 INFO L87 Difference]: Start difference. First operand 475 states and 711 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-03-08 11:16:12,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:16:12,977 INFO L93 Difference]: Finished difference Result 898 states and 1344 transitions. [2025-03-08 11:16:12,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 11:16:12,978 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 225 [2025-03-08 11:16:12,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:16:12,981 INFO L225 Difference]: With dead ends: 898 [2025-03-08 11:16:12,982 INFO L226 Difference]: Without dead ends: 486 [2025-03-08 11:16:12,983 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 11:16:12,984 INFO L435 NwaCegarLoop]: 285 mSDtfsCounter, 153 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 694 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 11:16:12,984 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 694 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 11:16:12,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2025-03-08 11:16:13,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 475. [2025-03-08 11:16:13,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 475 states, 327 states have (on average 1.2935779816513762) internal successors, (423), 328 states have internal predecessors, (423), 140 states have call successors, (140), 7 states have call predecessors, (140), 7 states have return successors, (140), 139 states have call predecessors, (140), 140 states have call successors, (140) [2025-03-08 11:16:13,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 703 transitions. [2025-03-08 11:16:13,046 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 703 transitions. Word has length 225 [2025-03-08 11:16:13,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:16:13,047 INFO L471 AbstractCegarLoop]: Abstraction has 475 states and 703 transitions. [2025-03-08 11:16:13,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-03-08 11:16:13,048 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 703 transitions. [2025-03-08 11:16:13,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2025-03-08 11:16:13,050 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:16:13,050 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:16:13,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 11:16:13,050 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:16:13,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:16:13,051 INFO L85 PathProgramCache]: Analyzing trace with hash -1657338026, now seen corresponding path program 1 times [2025-03-08 11:16:13,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:16:13,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080559411] [2025-03-08 11:16:13,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:16:13,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:16:13,069 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-03-08 11:16:13,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-03-08 11:16:13,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:16:13,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:16:13,265 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2025-03-08 11:16:13,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:16:13,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080559411] [2025-03-08 11:16:13,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080559411] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:16:13,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:16:13,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 11:16:13,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530925114] [2025-03-08 11:16:13,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:16:13,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 11:16:13,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:16:13,267 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 11:16:13,267 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 11:16:13,267 INFO L87 Difference]: Start difference. First operand 475 states and 703 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-03-08 11:16:13,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:16:13,944 INFO L93 Difference]: Finished difference Result 1422 states and 2078 transitions. [2025-03-08 11:16:13,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 11:16:13,945 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 229 [2025-03-08 11:16:13,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:16:13,951 INFO L225 Difference]: With dead ends: 1422 [2025-03-08 11:16:13,952 INFO L226 Difference]: Without dead ends: 1010 [2025-03-08 11:16:13,953 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-08 11:16:13,954 INFO L435 NwaCegarLoop]: 217 mSDtfsCounter, 364 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 289 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 364 SdHoareTripleChecker+Valid, 747 SdHoareTripleChecker+Invalid, 515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 289 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 11:16:13,954 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [364 Valid, 747 Invalid, 515 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [289 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 11:16:13,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1010 states. [2025-03-08 11:16:14,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1010 to 774. [2025-03-08 11:16:14,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 774 states, 552 states have (on average 1.2844202898550725) internal successors, (709), 553 states have internal predecessors, (709), 210 states have call successors, (210), 11 states have call predecessors, (210), 11 states have return successors, (210), 209 states have call predecessors, (210), 210 states have call successors, (210) [2025-03-08 11:16:14,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 774 states and 1129 transitions. [2025-03-08 11:16:14,082 INFO L78 Accepts]: Start accepts. Automaton has 774 states and 1129 transitions. Word has length 229 [2025-03-08 11:16:14,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:16:14,083 INFO L471 AbstractCegarLoop]: Abstraction has 774 states and 1129 transitions. [2025-03-08 11:16:14,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-03-08 11:16:14,083 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 1129 transitions. [2025-03-08 11:16:14,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2025-03-08 11:16:14,085 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:16:14,085 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:16:14,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 11:16:14,086 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:16:14,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:16:14,086 INFO L85 PathProgramCache]: Analyzing trace with hash -2094437890, now seen corresponding path program 1 times [2025-03-08 11:16:14,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:16:14,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752001697] [2025-03-08 11:16:14,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:16:14,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:16:14,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-03-08 11:16:14,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-03-08 11:16:14,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:16:14,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:16:18,943 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2025-03-08 11:16:18,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:16:18,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752001697] [2025-03-08 11:16:18,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752001697] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:16:18,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:16:18,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 11:16:18,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112848796] [2025-03-08 11:16:18,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:16:18,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 11:16:18,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:16:18,946 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 11:16:18,946 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2025-03-08 11:16:18,946 INFO L87 Difference]: Start difference. First operand 774 states and 1129 transitions. Second operand has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-03-08 11:16:20,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:16:20,526 INFO L93 Difference]: Finished difference Result 1500 states and 2121 transitions. [2025-03-08 11:16:20,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 11:16:20,527 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 229 [2025-03-08 11:16:20,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:16:20,535 INFO L225 Difference]: With dead ends: 1500 [2025-03-08 11:16:20,535 INFO L226 Difference]: Without dead ends: 1224 [2025-03-08 11:16:20,537 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2025-03-08 11:16:20,537 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 312 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 11:16:20,537 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [312 Valid, 547 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 11:16:20,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1224 states. [2025-03-08 11:16:20,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1224 to 1149. [2025-03-08 11:16:20,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1149 states, 912 states have (on average 1.292763157894737) internal successors, (1179), 918 states have internal predecessors, (1179), 220 states have call successors, (220), 16 states have call predecessors, (220), 16 states have return successors, (220), 214 states have call predecessors, (220), 220 states have call successors, (220) [2025-03-08 11:16:20,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1149 states to 1149 states and 1619 transitions. [2025-03-08 11:16:20,643 INFO L78 Accepts]: Start accepts. Automaton has 1149 states and 1619 transitions. Word has length 229 [2025-03-08 11:16:20,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:16:20,644 INFO L471 AbstractCegarLoop]: Abstraction has 1149 states and 1619 transitions. [2025-03-08 11:16:20,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-03-08 11:16:20,644 INFO L276 IsEmpty]: Start isEmpty. Operand 1149 states and 1619 transitions. [2025-03-08 11:16:20,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2025-03-08 11:16:20,647 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:16:20,648 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:16:20,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 11:16:20,648 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:16:20,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:16:20,649 INFO L85 PathProgramCache]: Analyzing trace with hash -849673409, now seen corresponding path program 1 times [2025-03-08 11:16:20,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:16:20,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566892605] [2025-03-08 11:16:20,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:16:20,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:16:20,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-03-08 11:16:20,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-03-08 11:16:20,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:16:20,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 11:16:20,737 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 11:16:20,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-03-08 11:16:20,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-03-08 11:16:20,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:16:20,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 11:16:20,869 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 11:16:20,869 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 11:16:20,870 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 11:16:20,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 11:16:20,873 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:16:20,987 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 11:16:20,990 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 11:16:20 BoogieIcfgContainer [2025-03-08 11:16:20,990 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 11:16:20,991 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 11:16:20,991 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 11:16:20,991 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 11:16:20,992 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:16:08" (3/4) ... [2025-03-08 11:16:20,993 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 11:16:20,994 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 11:16:20,994 INFO L158 Benchmark]: Toolchain (without parser) took 13682.50ms. Allocated memory was 167.8MB in the beginning and 293.6MB in the end (delta: 125.8MB). Free memory was 121.2MB in the beginning and 179.9MB in the end (delta: -58.7MB). Peak memory consumption was 71.2MB. Max. memory is 16.1GB. [2025-03-08 11:16:20,994 INFO L158 Benchmark]: CDTParser took 0.82ms. Allocated memory is still 201.3MB. Free memory is still 119.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 11:16:20,994 INFO L158 Benchmark]: CACSL2BoogieTranslator took 239.06ms. Allocated memory is still 167.8MB. Free memory was 121.2MB in the beginning and 105.7MB in the end (delta: 15.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 11:16:20,995 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.25ms. Allocated memory is still 167.8MB. Free memory was 105.7MB in the beginning and 101.5MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 11:16:20,995 INFO L158 Benchmark]: Boogie Preprocessor took 41.34ms. Allocated memory is still 167.8MB. Free memory was 101.5MB in the beginning and 95.7MB in the end (delta: 5.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 11:16:20,995 INFO L158 Benchmark]: IcfgBuilder took 476.09ms. Allocated memory is still 167.8MB. Free memory was 95.7MB in the beginning and 64.1MB in the end (delta: 31.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-08 11:16:20,995 INFO L158 Benchmark]: TraceAbstraction took 12880.09ms. Allocated memory was 167.8MB in the beginning and 293.6MB in the end (delta: 125.8MB). Free memory was 63.3MB in the beginning and 180.0MB in the end (delta: -116.6MB). Peak memory consumption was 4.0MB. Max. memory is 16.1GB. [2025-03-08 11:16:20,995 INFO L158 Benchmark]: Witness Printer took 2.80ms. Allocated memory is still 293.6MB. Free memory was 180.0MB in the beginning and 179.9MB in the end (delta: 92.3kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 11:16:20,998 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.82ms. Allocated memory is still 201.3MB. Free memory is still 119.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 239.06ms. Allocated memory is still 167.8MB. Free memory was 121.2MB in the beginning and 105.7MB in the end (delta: 15.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.25ms. Allocated memory is still 167.8MB. Free memory was 105.7MB in the beginning and 101.5MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 41.34ms. Allocated memory is still 167.8MB. Free memory was 101.5MB in the beginning and 95.7MB in the end (delta: 5.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 476.09ms. Allocated memory is still 167.8MB. Free memory was 95.7MB in the beginning and 64.1MB in the end (delta: 31.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 12880.09ms. Allocated memory was 167.8MB in the beginning and 293.6MB in the end (delta: 125.8MB). Free memory was 63.3MB in the beginning and 180.0MB in the end (delta: -116.6MB). Peak memory consumption was 4.0MB. Max. memory is 16.1GB. * Witness Printer took 2.80ms. Allocated memory is still 293.6MB. Free memory was 180.0MB in the beginning and 179.9MB in the end (delta: 92.3kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 136, overapproximation of someBinaryFLOATComparisonOperation at line 189, overapproximation of someBinaryFLOATComparisonOperation at line 81, overapproximation of someBinaryFLOATComparisonOperation at line 86, overapproximation of someBinaryFLOATComparisonOperation at line 185, overapproximation of someBinaryFLOATComparisonOperation at line 195, overapproximation of someBinaryFLOATComparisonOperation at line 187, overapproximation of someBinaryFLOATComparisonOperation at line 138. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 2; [L23] signed long int var_1_5 = 5; [L24] unsigned char var_1_8 = 0; [L25] float var_1_9 = 128.6; [L26] float var_1_10 = 32.5; [L27] unsigned char var_1_11 = 16; [L28] unsigned char var_1_12 = 64; [L29] unsigned char var_1_13 = 4; [L30] unsigned char var_1_14 = 4; [L31] unsigned long int var_1_15 = 0; [L32] signed short int var_1_16 = 0; [L33] signed char var_1_17 = 1; [L34] signed char var_1_18 = -1; [L35] signed char var_1_19 = 0; [L36] signed long int var_1_20 = -64; [L37] unsigned char var_1_22 = 0; [L38] unsigned char var_1_23 = 0; [L39] signed short int var_1_24 = -4; [L40] signed short int var_1_25 = -100; [L41] unsigned long int var_1_26 = 32; [L42] unsigned char var_1_27 = 1; [L43] unsigned long int var_1_28 = 100; [L44] unsigned long int var_1_29 = 1000000000; [L45] unsigned long int var_1_30 = 1000000000; [L46] unsigned long int var_1_31 = 10; [L47] unsigned long int var_1_32 = 10000; [L48] unsigned long int var_1_33 = 0; [L49] signed long int var_1_34 = -10; [L50] signed char var_1_35 = 25; [L51] signed char var_1_36 = -2; [L52] unsigned long int var_1_37 = 32; [L53] float var_1_38 = 4.6; [L54] float var_1_39 = 25.5; [L55] float var_1_40 = 99.25; [L56] signed long int last_1_var_1_5 = 5; VAL [isInitial=0, last_1_var_1_5=5, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0, var_1_9=643/5] [L199] isInitial = 1 [L200] FCALL initially() [L201] COND TRUE 1 [L202] CALL updateLastVariables() [L192] last_1_var_1_5 = var_1_5 VAL [isInitial=1, last_1_var_1_5=5, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0, var_1_9=643/5] [L202] RET updateLastVariables() [L203] CALL updateVariables() [L135] var_1_9 = __VERIFIER_nondet_float() [L136] CALL assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L136] RET assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_5=5, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L137] var_1_10 = __VERIFIER_nondet_float() [L138] CALL assume_abort_if_not((var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L138] RET assume_abort_if_not((var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L139] var_1_11 = __VERIFIER_nondet_uchar() [L140] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L140] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L141] CALL assume_abort_if_not(var_1_11 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L141] RET assume_abort_if_not(var_1_11 <= 127) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L142] var_1_12 = __VERIFIER_nondet_uchar() [L143] CALL assume_abort_if_not(var_1_12 >= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L143] RET assume_abort_if_not(var_1_12 >= 63) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L144] CALL assume_abort_if_not(var_1_12 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L144] RET assume_abort_if_not(var_1_12 <= 127) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L145] var_1_13 = __VERIFIER_nondet_uchar() [L146] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L146] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L147] CALL assume_abort_if_not(var_1_13 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L147] RET assume_abort_if_not(var_1_13 <= 63) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L148] var_1_14 = __VERIFIER_nondet_uchar() [L149] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L149] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L150] CALL assume_abort_if_not(var_1_14 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L150] RET assume_abort_if_not(var_1_14 <= 127) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L151] var_1_18 = __VERIFIER_nondet_char() [L152] CALL assume_abort_if_not(var_1_18 >= -31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L152] RET assume_abort_if_not(var_1_18 >= -31) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L153] CALL assume_abort_if_not(var_1_18 <= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L153] RET assume_abort_if_not(var_1_18 <= 32) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L154] var_1_19 = __VERIFIER_nondet_char() [L155] CALL assume_abort_if_not(var_1_19 >= -15) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L155] RET assume_abort_if_not(var_1_19 >= -15) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L156] CALL assume_abort_if_not(var_1_19 <= 16) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L156] RET assume_abort_if_not(var_1_19 <= 16) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L157] var_1_23 = __VERIFIER_nondet_uchar() [L158] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L158] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L159] CALL assume_abort_if_not(var_1_23 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L159] RET assume_abort_if_not(var_1_23 <= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=-100, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L160] var_1_25 = __VERIFIER_nondet_short() [L161] CALL assume_abort_if_not(var_1_25 >= -32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=10, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=10, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L161] RET assume_abort_if_not(var_1_25 >= -32767) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=10, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L162] CALL assume_abort_if_not(var_1_25 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=10, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=10, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L162] RET assume_abort_if_not(var_1_25 <= 32766) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=10, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L163] var_1_27 = __VERIFIER_nondet_uchar() [L164] CALL assume_abort_if_not(var_1_27 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=10, var_1_26=32, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=10, var_1_26=32, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L164] RET assume_abort_if_not(var_1_27 >= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=10, var_1_26=32, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L165] CALL assume_abort_if_not(var_1_27 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=10, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=10, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L165] RET assume_abort_if_not(var_1_27 <= 1) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=10, var_1_26=32, var_1_27=1, var_1_28=100, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L166] var_1_28 = __VERIFIER_nondet_ulong() [L167] CALL assume_abort_if_not(var_1_28 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=10, var_1_26=32, var_1_27=1, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=10, var_1_26=32, var_1_27=1, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L167] RET assume_abort_if_not(var_1_28 >= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=10, var_1_26=32, var_1_27=1, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L168] CALL assume_abort_if_not(var_1_28 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=10, var_1_26=32, var_1_27=1, var_1_28=-2, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=10, var_1_26=32, var_1_27=1, var_1_28=-2, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L168] RET assume_abort_if_not(var_1_28 <= 4294967294) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=10, var_1_26=32, var_1_27=1, var_1_28=-2, var_1_29=1000000000, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L169] var_1_29 = __VERIFIER_nondet_ulong() [L170] CALL assume_abort_if_not(var_1_29 >= 536870911) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=10, var_1_26=32, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=10, var_1_26=32, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L170] RET assume_abort_if_not(var_1_29 >= 536870911) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=10, var_1_26=32, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L171] CALL assume_abort_if_not(var_1_29 <= 1073741824) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=10, var_1_26=32, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=10, var_1_26=32, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L171] RET assume_abort_if_not(var_1_29 <= 1073741824) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=10, var_1_26=32, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=1000000000, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L172] var_1_30 = __VERIFIER_nondet_ulong() [L173] CALL assume_abort_if_not(var_1_30 >= 536870912) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=10, var_1_26=32, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=1073741823, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=10, var_1_26=32, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=1073741823, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L173] RET assume_abort_if_not(var_1_30 >= 536870912) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=10, var_1_26=32, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=1073741823, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L174] CALL assume_abort_if_not(var_1_30 <= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=10, var_1_26=32, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=1073741823, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=10, var_1_26=32, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=1073741823, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L174] RET assume_abort_if_not(var_1_30 <= 1073741823) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=10, var_1_26=32, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=1073741823, var_1_31=10, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L175] var_1_31 = __VERIFIER_nondet_ulong() [L176] CALL assume_abort_if_not(var_1_31 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=10, var_1_26=32, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=1073741823, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=10, var_1_26=32, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=1073741823, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L176] RET assume_abort_if_not(var_1_31 >= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=10, var_1_26=32, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=1073741823, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L177] CALL assume_abort_if_not(var_1_31 <= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=10, var_1_26=32, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=1073741823, var_1_31=0, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=10, var_1_26=32, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=1073741823, var_1_31=0, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L177] RET assume_abort_if_not(var_1_31 <= 1073741823) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=10, var_1_26=32, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=1073741823, var_1_31=0, var_1_32=10000, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L178] var_1_32 = __VERIFIER_nondet_ulong() [L179] CALL assume_abort_if_not(var_1_32 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=10, var_1_26=32, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=1073741823, var_1_31=0, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=10, var_1_26=32, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=1073741823, var_1_31=0, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L179] RET assume_abort_if_not(var_1_32 >= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=10, var_1_26=32, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=1073741823, var_1_31=0, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L180] CALL assume_abort_if_not(var_1_32 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=10, var_1_26=32, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=1073741823, var_1_31=0, var_1_32=536870911, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=10, var_1_26=32, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=1073741823, var_1_31=0, var_1_32=536870911, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L180] RET assume_abort_if_not(var_1_32 <= 2147483647) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=10, var_1_26=32, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=1073741823, var_1_31=0, var_1_32=536870911, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-2, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L181] var_1_36 = __VERIFIER_nondet_char() [L182] CALL assume_abort_if_not(var_1_36 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=10, var_1_26=32, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=1073741823, var_1_31=0, var_1_32=536870911, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-127, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=10, var_1_26=32, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=1073741823, var_1_31=0, var_1_32=536870911, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-127, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L182] RET assume_abort_if_not(var_1_36 >= -127) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=10, var_1_26=32, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=1073741823, var_1_31=0, var_1_32=536870911, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-127, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L183] CALL assume_abort_if_not(var_1_36 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=10, var_1_26=32, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=1073741823, var_1_31=0, var_1_32=536870911, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-127, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=10, var_1_26=32, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=1073741823, var_1_31=0, var_1_32=536870911, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-127, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L183] RET assume_abort_if_not(var_1_36 <= 126) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=10, var_1_26=32, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=1073741823, var_1_31=0, var_1_32=536870911, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-127, var_1_37=32, var_1_38=23/5, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L184] var_1_38 = __VERIFIER_nondet_float() [L185] CALL assume_abort_if_not((var_1_38 >= -922337.2036854776000e+13F && var_1_38 <= -1.0e-20F) || (var_1_38 <= 9223372.036854776000e+12F && var_1_38 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=10, var_1_26=32, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=1073741823, var_1_31=0, var_1_32=536870911, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-127, var_1_37=32, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=10, var_1_26=32, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=1073741823, var_1_31=0, var_1_32=536870911, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-127, var_1_37=32, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L185] RET assume_abort_if_not((var_1_38 >= -922337.2036854776000e+13F && var_1_38 <= -1.0e-20F) || (var_1_38 <= 9223372.036854776000e+12F && var_1_38 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=10, var_1_26=32, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=1073741823, var_1_31=0, var_1_32=536870911, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-127, var_1_37=32, var_1_39=51/2, var_1_40=397/4, var_1_5=5, var_1_8=0] [L186] var_1_39 = __VERIFIER_nondet_float() [L187] CALL assume_abort_if_not((var_1_39 >= -922337.2036854776000e+13F && var_1_39 <= -1.0e-20F) || (var_1_39 <= 9223372.036854776000e+12F && var_1_39 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=10, var_1_26=32, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=1073741823, var_1_31=0, var_1_32=536870911, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-127, var_1_37=32, var_1_40=397/4, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=10, var_1_26=32, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=1073741823, var_1_31=0, var_1_32=536870911, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-127, var_1_37=32, var_1_40=397/4, var_1_5=5, var_1_8=0] [L187] RET assume_abort_if_not((var_1_39 >= -922337.2036854776000e+13F && var_1_39 <= -1.0e-20F) || (var_1_39 <= 9223372.036854776000e+12F && var_1_39 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=10, var_1_26=32, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=1073741823, var_1_31=0, var_1_32=536870911, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-127, var_1_37=32, var_1_40=397/4, var_1_5=5, var_1_8=0] [L188] var_1_40 = __VERIFIER_nondet_float() [L189] CALL assume_abort_if_not((var_1_40 >= -922337.2036854776000e+13F && var_1_40 <= -1.0e-20F) || (var_1_40 <= 9223372.036854776000e+12F && var_1_40 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=10, var_1_26=32, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=1073741823, var_1_31=0, var_1_32=536870911, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-127, var_1_37=32, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=10, var_1_26=32, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=1073741823, var_1_31=0, var_1_32=536870911, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-127, var_1_37=32, var_1_5=5, var_1_8=0] [L189] RET assume_abort_if_not((var_1_40 >= -922337.2036854776000e+13F && var_1_40 <= -1.0e-20F) || (var_1_40 <= 9223372.036854776000e+12F && var_1_40 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=10, var_1_26=32, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=1073741823, var_1_31=0, var_1_32=536870911, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-127, var_1_37=32, var_1_5=5, var_1_8=0] [L203] RET updateVariables() [L204] CALL step() [L60] var_1_24 = var_1_25 VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=10, var_1_25=10, var_1_26=32, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=1073741823, var_1_31=0, var_1_32=536870911, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-127, var_1_37=32, var_1_5=5, var_1_8=0] [L61] COND TRUE var_1_24 <= var_1_25 VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=10, var_1_25=10, var_1_26=32, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=1073741823, var_1_31=0, var_1_32=536870911, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-127, var_1_37=32, var_1_5=5, var_1_8=0] [L62] COND TRUE \read(var_1_27) [L63] var_1_26 = var_1_28 VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=10, var_1_25=10, var_1_26=-2, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=1073741823, var_1_31=0, var_1_32=536870911, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-127, var_1_37=32, var_1_5=5, var_1_8=0] [L70] COND FALSE !(var_1_32 != var_1_29) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=10, var_1_25=10, var_1_26=-2, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=1073741823, var_1_31=0, var_1_32=536870911, var_1_33=0, var_1_34=-10, var_1_35=25, var_1_36=-127, var_1_37=32, var_1_5=5, var_1_8=0] [L75] COND TRUE ((((((((10) < 0 ) ? -(10) : (10)))) > (var_1_24)) ? (((((10) < 0 ) ? -(10) : (10)))) : (var_1_24))) == var_1_25 [L76] var_1_34 = var_1_29 VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=10, var_1_25=10, var_1_26=-2, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=1073741823, var_1_31=0, var_1_32=536870911, var_1_33=0, var_1_34=536870911, var_1_35=25, var_1_36=-127, var_1_37=32, var_1_5=5, var_1_8=0] [L78] COND TRUE \read(var_1_27) [L79] var_1_35 = var_1_36 VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=10, var_1_25=10, var_1_26=-2, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=1073741823, var_1_31=0, var_1_32=536870911, var_1_33=0, var_1_34=536870911, var_1_35=-127, var_1_36=-127, var_1_37=32, var_1_5=5, var_1_8=0] [L81] COND FALSE !((var_1_38 * var_1_39) <= var_1_40) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=10, var_1_25=10, var_1_26=-2, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=1073741823, var_1_31=0, var_1_32=536870911, var_1_33=0, var_1_34=536870911, var_1_35=-127, var_1_36=-127, var_1_37=32, var_1_5=5, var_1_8=0] [L86] COND FALSE !(var_1_9 > var_1_10) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=10, var_1_25=10, var_1_26=-2, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=1073741823, var_1_31=0, var_1_32=536870911, var_1_33=0, var_1_34=536870911, var_1_35=-127, var_1_36=-127, var_1_37=32, var_1_5=5, var_1_8=0] [L89] var_1_20 = var_1_8 [L90] var_1_22 = var_1_23 VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=10, var_1_25=10, var_1_26=-2, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=1073741823, var_1_31=0, var_1_32=536870911, var_1_33=0, var_1_34=536870911, var_1_35=-127, var_1_36=-127, var_1_37=32, var_1_5=5, var_1_8=0] [L91] COND FALSE !(\read(var_1_22)) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=10, var_1_25=10, var_1_26=-2, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=1073741823, var_1_31=0, var_1_32=536870911, var_1_33=0, var_1_34=536870911, var_1_35=-127, var_1_36=-127, var_1_37=32, var_1_5=5, var_1_8=0] [L94] var_1_16 = (((((var_1_15) < (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12))))) ? (var_1_15) : (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12)))))) - var_1_11) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=-127, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=10, var_1_25=10, var_1_26=-2, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=1073741823, var_1_31=0, var_1_32=536870911, var_1_33=0, var_1_34=536870911, var_1_35=-127, var_1_36=-127, var_1_37=32, var_1_5=5, var_1_8=0] [L95] COND FALSE !(\read(var_1_22)) [L102] var_1_17 = -32 VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=10, var_1_25=10, var_1_26=-2, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=1073741823, var_1_31=0, var_1_32=536870911, var_1_33=0, var_1_34=536870911, var_1_35=-127, var_1_36=-127, var_1_37=32, var_1_5=5, var_1_8=0] [L104] unsigned long int stepLocal_1 = var_1_20 + var_1_15; [L105] signed long int stepLocal_0 = var_1_20; VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, stepLocal_1=0, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=10, var_1_25=10, var_1_26=-2, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=1073741823, var_1_31=0, var_1_32=536870911, var_1_33=0, var_1_34=536870911, var_1_35=-127, var_1_36=-127, var_1_37=32, var_1_5=5, var_1_8=0] [L106] COND TRUE stepLocal_1 < -200 VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=10, var_1_25=10, var_1_26=-2, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=1073741823, var_1_31=0, var_1_32=536870911, var_1_33=0, var_1_34=536870911, var_1_35=-127, var_1_36=-127, var_1_37=32, var_1_5=5, var_1_8=0] [L107] COND FALSE !(\read(var_1_22)) [L114] var_1_1 = var_1_20 VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=32, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=10, var_1_25=10, var_1_26=-2, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=1073741823, var_1_31=0, var_1_32=536870911, var_1_33=0, var_1_34=536870911, var_1_35=-127, var_1_36=-127, var_1_37=32, var_1_5=5, var_1_8=0] [L119] signed long int stepLocal_4 = 256; [L120] unsigned char stepLocal_3 = var_1_22; [L121] unsigned long int stepLocal_2 = var_1_15; VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, stepLocal_2=0, stepLocal_3=0, stepLocal_4=256, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=32, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=10, var_1_25=10, var_1_26=-2, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=1073741823, var_1_31=0, var_1_32=536870911, var_1_33=0, var_1_34=536870911, var_1_35=-127, var_1_36=-127, var_1_37=32, var_1_5=5, var_1_8=0] [L122] COND FALSE !(stepLocal_4 > (var_1_15 - (last_1_var_1_5 + var_1_8))) VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, stepLocal_2=0, stepLocal_3=0, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=32, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=10, var_1_25=10, var_1_26=-2, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=1073741823, var_1_31=0, var_1_32=536870911, var_1_33=0, var_1_34=536870911, var_1_35=-127, var_1_36=-127, var_1_37=32, var_1_5=5, var_1_8=0] [L125] COND FALSE !(stepLocal_3 || var_1_22) [L130] var_1_5 = -10000 VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, stepLocal_2=0, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=32, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=10, var_1_25=10, var_1_26=-2, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=1073741823, var_1_31=0, var_1_32=536870911, var_1_33=0, var_1_34=536870911, var_1_35=-127, var_1_36=-127, var_1_37=32, var_1_5=-10000, var_1_8=0] [L204] RET step() [L205] CALL, EXPR property() [L195] EXPR (((var_1_20 + var_1_15) < -200) ? (var_1_22 ? ((var_1_20 > (- var_1_15)) ? (var_1_1 == ((unsigned long int) var_1_20)) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) && ((256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000)))) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=32, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=10, var_1_25=10, var_1_26=-2, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=1073741823, var_1_31=0, var_1_32=536870911, var_1_33=0, var_1_34=536870911, var_1_35=-127, var_1_36=-127, var_1_37=32, var_1_5=-10000, var_1_8=0] [L195] EXPR (256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000))) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=32, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=10, var_1_25=10, var_1_26=-2, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=1073741823, var_1_31=0, var_1_32=536870911, var_1_33=0, var_1_34=536870911, var_1_35=-127, var_1_36=-127, var_1_37=32, var_1_5=-10000, var_1_8=0] [L195] EXPR (var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000)) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=32, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=10, var_1_25=10, var_1_26=-2, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=1073741823, var_1_31=0, var_1_32=536870911, var_1_33=0, var_1_34=536870911, var_1_35=-127, var_1_36=-127, var_1_37=32, var_1_5=-10000, var_1_8=0] [L195] EXPR (256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000))) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=32, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=10, var_1_25=10, var_1_26=-2, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=1073741823, var_1_31=0, var_1_32=536870911, var_1_33=0, var_1_34=536870911, var_1_35=-127, var_1_36=-127, var_1_37=32, var_1_5=-10000, var_1_8=0] [L195] EXPR (((var_1_20 + var_1_15) < -200) ? (var_1_22 ? ((var_1_20 > (- var_1_15)) ? (var_1_1 == ((unsigned long int) var_1_20)) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) && ((256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000)))) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=32, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=10, var_1_25=10, var_1_26=-2, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=1073741823, var_1_31=0, var_1_32=536870911, var_1_33=0, var_1_34=536870911, var_1_35=-127, var_1_36=-127, var_1_37=32, var_1_5=-10000, var_1_8=0] [L195] EXPR (((((((var_1_20 + var_1_15) < -200) ? (var_1_22 ? ((var_1_20 > (- var_1_15)) ? (var_1_1 == ((unsigned long int) var_1_20)) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) && ((256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000))))) && ((var_1_9 > var_1_10) ? (var_1_8 == ((unsigned char) (((((var_1_11 + (var_1_12 - var_1_13))) < ((5 + var_1_14))) ? ((var_1_11 + (var_1_12 - var_1_13))) : ((5 + var_1_14)))))) : 1)) && (var_1_22 ? (var_1_15 == ((unsigned long int) var_1_8)) : 1)) && (var_1_16 == ((signed short int) (((((var_1_15) < (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12))))) ? (var_1_15) : (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12)))))) - var_1_11)))) && (var_1_22 ? ((var_1_14 < (var_1_13 & (var_1_15 / 2))) ? (var_1_17 == ((signed char) (var_1_13 + (var_1_18 + (var_1_19 + 5))))) : (var_1_17 == ((signed char) var_1_18))) : (var_1_17 == ((signed char) -32))) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=32, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=10, var_1_25=10, var_1_26=-2, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=1073741823, var_1_31=0, var_1_32=536870911, var_1_33=0, var_1_34=536870911, var_1_35=-127, var_1_36=-127, var_1_37=32, var_1_5=-10000, var_1_8=0] [L195-L196] return (((((((((var_1_20 + var_1_15) < -200) ? (var_1_22 ? ((var_1_20 > (- var_1_15)) ? (var_1_1 == ((unsigned long int) var_1_20)) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) && ((256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000))))) && ((var_1_9 > var_1_10) ? (var_1_8 == ((unsigned char) (((((var_1_11 + (var_1_12 - var_1_13))) < ((5 + var_1_14))) ? ((var_1_11 + (var_1_12 - var_1_13))) : ((5 + var_1_14)))))) : 1)) && (var_1_22 ? (var_1_15 == ((unsigned long int) var_1_8)) : 1)) && (var_1_16 == ((signed short int) (((((var_1_15) < (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12))))) ? (var_1_15) : (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12)))))) - var_1_11)))) && (var_1_22 ? ((var_1_14 < (var_1_13 & (var_1_15 / 2))) ? (var_1_17 == ((signed char) (var_1_13 + (var_1_18 + (var_1_19 + 5))))) : (var_1_17 == ((signed char) var_1_18))) : (var_1_17 == ((signed char) -32)))) && (var_1_20 == ((signed long int) var_1_8))) && (var_1_22 == ((unsigned char) var_1_23)) ; [L205] RET, EXPR property() [L205] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=32, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=10, var_1_25=10, var_1_26=-2, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=1073741823, var_1_31=0, var_1_32=536870911, var_1_33=0, var_1_34=536870911, var_1_35=-127, var_1_36=-127, var_1_37=32, var_1_5=-10000, var_1_8=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=32, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=10, var_1_25=10, var_1_26=-2, var_1_27=1, var_1_28=-2, var_1_29=536870911, var_1_30=1073741823, var_1_31=0, var_1_32=536870911, var_1_33=0, var_1_34=536870911, var_1_35=-127, var_1_36=-127, var_1_37=32, var_1_5=-10000, var_1_8=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 119 locations, 221 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 12.7s, OverallIterations: 11, TraceHistogramMax: 35, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1832 SdHoareTripleChecker+Valid, 2.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1832 mSDsluCounter, 5915 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3491 mSDsCounter, 606 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1308 IncrementalHoareTripleChecker+Invalid, 1914 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 606 mSolverCounterUnsat, 2424 mSDtfsCounter, 1308 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 290 GetRequests, 249 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1149occurred in iteration=10, InterpolantAutomatonStates: 47, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 10 MinimizatonAttempts, 637 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 6.8s InterpolantComputationTime, 2698 NumberOfCodeBlocks, 2698 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 2458 ConstructedInterpolants, 0 QuantifiedInterpolants, 12048 SizeOfPredicates, 0 NumberOfNonLiveVariables, 501 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 11 InterpolantComputations, 10 PerfectInterpolantSequences, 26112/26180 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-08 11:16:21,023 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-97.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 32bb1a8f237f620d8564fbe646b4542e6d02d07be2c2e5b8eafb2c14f730fdc9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 11:16:22,891 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 11:16:22,973 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 11:16:22,981 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 11:16:22,981 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 11:16:23,003 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 11:16:23,005 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 11:16:23,005 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 11:16:23,005 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 11:16:23,005 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 11:16:23,006 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 11:16:23,006 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 11:16:23,007 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 11:16:23,007 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 11:16:23,007 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 11:16:23,007 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 11:16:23,007 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 11:16:23,007 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 11:16:23,007 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 11:16:23,007 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 11:16:23,007 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 11:16:23,008 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 11:16:23,008 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 11:16:23,008 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 11:16:23,008 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 11:16:23,008 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 11:16:23,008 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 11:16:23,008 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 11:16:23,008 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 11:16:23,008 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 11:16:23,008 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 11:16:23,008 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 11:16:23,008 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 11:16:23,008 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 11:16:23,008 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 11:16:23,008 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 11:16:23,008 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 11:16:23,008 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 11:16:23,008 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 11:16:23,008 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 11:16:23,008 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 11:16:23,008 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 11:16:23,008 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 11:16:23,009 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 11:16:23,009 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 11:16:23,009 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 32bb1a8f237f620d8564fbe646b4542e6d02d07be2c2e5b8eafb2c14f730fdc9 [2025-03-08 11:16:23,257 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 11:16:23,263 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 11:16:23,265 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 11:16:23,267 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 11:16:23,267 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 11:16:23,268 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-97.i [2025-03-08 11:16:24,508 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7bc23d7b4/5e6ae35704794d7eb176c3f8c5670a77/FLAGaac4a0297 [2025-03-08 11:16:24,719 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 11:16:24,720 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-97.i [2025-03-08 11:16:24,731 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7bc23d7b4/5e6ae35704794d7eb176c3f8c5670a77/FLAGaac4a0297 [2025-03-08 11:16:24,750 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7bc23d7b4/5e6ae35704794d7eb176c3f8c5670a77 [2025-03-08 11:16:24,752 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 11:16:24,753 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 11:16:24,754 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 11:16:24,754 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 11:16:24,758 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 11:16:24,759 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 11:16:24" (1/1) ... [2025-03-08 11:16:24,761 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61698d97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:16:24, skipping insertion in model container [2025-03-08 11:16:24,761 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 11:16:24" (1/1) ... [2025-03-08 11:16:24,781 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 11:16:24,894 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-97.i[915,928] [2025-03-08 11:16:24,967 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 11:16:24,984 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 11:16:24,992 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-97.i[915,928] [2025-03-08 11:16:25,016 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 11:16:25,033 INFO L204 MainTranslator]: Completed translation [2025-03-08 11:16:25,034 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:16:25 WrapperNode [2025-03-08 11:16:25,035 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 11:16:25,035 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 11:16:25,035 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 11:16:25,035 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 11:16:25,041 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:16:25" (1/1) ... [2025-03-08 11:16:25,054 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:16:25" (1/1) ... [2025-03-08 11:16:25,084 INFO L138 Inliner]: procedures = 27, calls = 48, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 208 [2025-03-08 11:16:25,085 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 11:16:25,085 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 11:16:25,086 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 11:16:25,086 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 11:16:25,091 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:16:25" (1/1) ... [2025-03-08 11:16:25,092 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:16:25" (1/1) ... [2025-03-08 11:16:25,100 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:16:25" (1/1) ... [2025-03-08 11:16:25,117 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 11:16:25,117 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:16:25" (1/1) ... [2025-03-08 11:16:25,117 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:16:25" (1/1) ... [2025-03-08 11:16:25,132 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:16:25" (1/1) ... [2025-03-08 11:16:25,133 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:16:25" (1/1) ... [2025-03-08 11:16:25,134 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:16:25" (1/1) ... [2025-03-08 11:16:25,140 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:16:25" (1/1) ... [2025-03-08 11:16:25,142 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 11:16:25,143 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 11:16:25,143 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 11:16:25,143 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 11:16:25,144 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:16:25" (1/1) ... [2025-03-08 11:16:25,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 11:16:25,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:16:25,169 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 11:16:25,172 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 11:16:25,192 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 11:16:25,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 11:16:25,192 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 11:16:25,192 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 11:16:25,192 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 11:16:25,193 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 11:16:25,261 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 11:16:25,263 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 11:16:25,750 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2025-03-08 11:16:25,750 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 11:16:25,758 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 11:16:25,761 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 11:16:25,761 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:16:25 BoogieIcfgContainer [2025-03-08 11:16:25,762 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 11:16:25,764 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 11:16:25,764 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 11:16:25,768 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 11:16:25,769 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 11:16:24" (1/3) ... [2025-03-08 11:16:25,770 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@790b7b6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 11:16:25, skipping insertion in model container [2025-03-08 11:16:25,771 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:16:25" (2/3) ... [2025-03-08 11:16:25,771 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@790b7b6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 11:16:25, skipping insertion in model container [2025-03-08 11:16:25,771 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:16:25" (3/3) ... [2025-03-08 11:16:25,772 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-97.i [2025-03-08 11:16:25,783 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 11:16:25,785 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-97.i that has 2 procedures, 95 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 11:16:25,825 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 11:16:25,832 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;@6b49458d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 11:16:25,833 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 11:16:25,835 INFO L276 IsEmpty]: Start isEmpty. Operand has 95 states, 57 states have (on average 1.3859649122807018) internal successors, (79), 58 states have internal predecessors, (79), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2025-03-08 11:16:25,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2025-03-08 11:16:25,848 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:16:25,849 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:16:25,850 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:16:25,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:16:25,854 INFO L85 PathProgramCache]: Analyzing trace with hash 706924844, now seen corresponding path program 1 times [2025-03-08 11:16:25,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 11:16:25,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1056114598] [2025-03-08 11:16:25,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:16:25,862 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 11:16:25,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 11:16:25,865 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 11:16:25,867 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-08 11:16:25,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 218 statements into 1 equivalence classes. [2025-03-08 11:16:26,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 218 of 218 statements. [2025-03-08 11:16:26,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:16:26,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:16:26,168 INFO L256 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 11:16:26,176 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 11:16:26,221 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 648 proven. 0 refuted. 0 times theorem prover too weak. 1732 trivial. 0 not checked. [2025-03-08 11:16:26,222 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 11:16:26,222 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 11:16:26,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1056114598] [2025-03-08 11:16:26,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1056114598] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:16:26,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:16:26,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 11:16:26,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642405387] [2025-03-08 11:16:26,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:16:26,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 11:16:26,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 11:16:26,244 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 11:16:26,246 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 11:16:26,247 INFO L87 Difference]: Start difference. First operand has 95 states, 57 states have (on average 1.3859649122807018) internal successors, (79), 58 states have internal predecessors, (79), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (35), 2 states have call predecessors, (35), 2 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2025-03-08 11:16:26,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:16:26,278 INFO L93 Difference]: Finished difference Result 184 states and 328 transitions. [2025-03-08 11:16:26,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 11:16:26,280 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (35), 2 states have call predecessors, (35), 2 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) Word has length 218 [2025-03-08 11:16:26,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:16:26,286 INFO L225 Difference]: With dead ends: 184 [2025-03-08 11:16:26,286 INFO L226 Difference]: Without dead ends: 92 [2025-03-08 11:16:26,288 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 217 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 11:16:26,290 INFO L435 NwaCegarLoop]: 144 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, 144 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 11:16:26,291 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 11:16:26,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-03-08 11:16:26,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2025-03-08 11:16:26,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 55 states have (on average 1.3454545454545455) internal successors, (74), 55 states have internal predecessors, (74), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2025-03-08 11:16:26,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 144 transitions. [2025-03-08 11:16:26,330 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 144 transitions. Word has length 218 [2025-03-08 11:16:26,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:16:26,331 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 144 transitions. [2025-03-08 11:16:26,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (35), 2 states have call predecessors, (35), 2 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2025-03-08 11:16:26,331 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 144 transitions. [2025-03-08 11:16:26,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2025-03-08 11:16:26,334 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:16:26,334 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:16:26,343 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-08 11:16:26,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 11:16:26,535 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:16:26,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:16:26,536 INFO L85 PathProgramCache]: Analyzing trace with hash -843790613, now seen corresponding path program 1 times [2025-03-08 11:16:26,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 11:16:26,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [776353718] [2025-03-08 11:16:26,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:16:26,537 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 11:16:26,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 11:16:26,539 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 11:16:26,541 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-08 11:16:26,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 218 statements into 1 equivalence classes. [2025-03-08 11:16:26,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 218 of 218 statements. [2025-03-08 11:16:26,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:16:26,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:16:26,769 INFO L256 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 11:16:26,776 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 11:16:26,825 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2025-03-08 11:16:26,826 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 11:16:26,826 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 11:16:26,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [776353718] [2025-03-08 11:16:26,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [776353718] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:16:26,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:16:26,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:16:26,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916777707] [2025-03-08 11:16:26,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:16:26,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:16:26,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 11:16:26,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:16:26,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:16:26,828 INFO L87 Difference]: Start difference. First operand 92 states and 144 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-03-08 11:16:26,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:16:26,876 INFO L93 Difference]: Finished difference Result 212 states and 331 transitions. [2025-03-08 11:16:26,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:16:26,876 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 218 [2025-03-08 11:16:26,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:16:26,878 INFO L225 Difference]: With dead ends: 212 [2025-03-08 11:16:26,878 INFO L226 Difference]: Without dead ends: 123 [2025-03-08 11:16:26,879 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 216 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:16:26,879 INFO L435 NwaCegarLoop]: 186 mSDtfsCounter, 90 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 11:16:26,879 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 279 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 11:16:26,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2025-03-08 11:16:26,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 122. [2025-03-08 11:16:26,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 68 states have (on average 1.2647058823529411) internal successors, (86), 69 states have internal predecessors, (86), 51 states have call successors, (51), 2 states have call predecessors, (51), 2 states have return successors, (51), 50 states have call predecessors, (51), 51 states have call successors, (51) [2025-03-08 11:16:26,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 188 transitions. [2025-03-08 11:16:26,906 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 188 transitions. Word has length 218 [2025-03-08 11:16:26,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:16:26,906 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 188 transitions. [2025-03-08 11:16:26,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-03-08 11:16:26,907 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 188 transitions. [2025-03-08 11:16:26,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2025-03-08 11:16:26,909 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:16:26,909 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:16:26,917 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-08 11:16:27,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 11:16:27,113 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:16:27,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:16:27,114 INFO L85 PathProgramCache]: Analyzing trace with hash 1018275002, now seen corresponding path program 1 times [2025-03-08 11:16:27,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 11:16:27,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1194887008] [2025-03-08 11:16:27,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:16:27,114 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 11:16:27,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 11:16:27,116 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 11:16:27,117 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-08 11:16:27,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes. [2025-03-08 11:16:27,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements. [2025-03-08 11:16:27,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:16:27,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:16:27,308 INFO L256 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 11:16:27,312 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 11:16:27,660 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2025-03-08 11:16:27,661 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 11:16:27,661 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 11:16:27,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1194887008] [2025-03-08 11:16:27,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1194887008] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:16:27,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:16:27,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 11:16:27,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247929884] [2025-03-08 11:16:27,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:16:27,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 11:16:27,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 11:16:27,662 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 11:16:27,663 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 11:16:27,663 INFO L87 Difference]: Start difference. First operand 122 states and 188 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-03-08 11:16:27,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:16:27,965 INFO L93 Difference]: Finished difference Result 353 states and 545 transitions. [2025-03-08 11:16:27,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 11:16:27,966 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 219 [2025-03-08 11:16:27,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:16:27,968 INFO L225 Difference]: With dead ends: 353 [2025-03-08 11:16:27,968 INFO L226 Difference]: Without dead ends: 260 [2025-03-08 11:16:27,969 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 11:16:27,970 INFO L435 NwaCegarLoop]: 258 mSDtfsCounter, 143 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 699 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 11:16:27,970 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 699 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 11:16:27,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2025-03-08 11:16:28,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 247. [2025-03-08 11:16:28,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 136 states have (on average 1.25) internal successors, (170), 137 states have internal predecessors, (170), 105 states have call successors, (105), 5 states have call predecessors, (105), 5 states have return successors, (105), 104 states have call predecessors, (105), 105 states have call successors, (105) [2025-03-08 11:16:28,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 380 transitions. [2025-03-08 11:16:28,007 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 380 transitions. Word has length 219 [2025-03-08 11:16:28,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:16:28,008 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 380 transitions. [2025-03-08 11:16:28,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-03-08 11:16:28,008 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 380 transitions. [2025-03-08 11:16:28,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2025-03-08 11:16:28,010 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:16:28,010 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:16:28,019 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-03-08 11:16:28,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 11:16:28,210 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:16:28,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:16:28,211 INFO L85 PathProgramCache]: Analyzing trace with hash -1479740935, now seen corresponding path program 1 times [2025-03-08 11:16:28,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 11:16:28,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1771185637] [2025-03-08 11:16:28,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:16:28,212 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 11:16:28,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 11:16:28,214 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 11:16:28,214 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-03-08 11:16:28,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes. [2025-03-08 11:16:28,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements. [2025-03-08 11:16:28,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:16:28,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:16:28,413 INFO L256 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-08 11:16:28,419 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 11:16:28,630 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 1204 proven. 57 refuted. 0 times theorem prover too weak. 1119 trivial. 0 not checked. [2025-03-08 11:16:28,630 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 11:16:28,889 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 45 proven. 57 refuted. 0 times theorem prover too weak. 2278 trivial. 0 not checked. [2025-03-08 11:16:28,890 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 11:16:28,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1771185637] [2025-03-08 11:16:28,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1771185637] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 11:16:28,890 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 11:16:28,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2025-03-08 11:16:28,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114535180] [2025-03-08 11:16:28,891 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 11:16:28,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 11:16:28,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 11:16:28,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 11:16:28,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-08 11:16:28,893 INFO L87 Difference]: Start difference. First operand 247 states and 380 transitions. Second operand has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 2 states have call successors, (54), 2 states have call predecessors, (54), 4 states have return successors, (55), 2 states have call predecessors, (55), 2 states have call successors, (55) [2025-03-08 11:16:29,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:16:29,313 INFO L93 Difference]: Finished difference Result 356 states and 534 transitions. [2025-03-08 11:16:29,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 11:16:29,315 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 2 states have call successors, (54), 2 states have call predecessors, (54), 4 states have return successors, (55), 2 states have call predecessors, (55), 2 states have call successors, (55) Word has length 219 [2025-03-08 11:16:29,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:16:29,320 INFO L225 Difference]: With dead ends: 356 [2025-03-08 11:16:29,320 INFO L226 Difference]: Without dead ends: 172 [2025-03-08 11:16:29,322 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 444 GetRequests, 430 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2025-03-08 11:16:29,323 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 113 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 11:16:29,324 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 201 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 11:16:29,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2025-03-08 11:16:29,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 162. [2025-03-08 11:16:29,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 86 states have (on average 1.1395348837209303) internal successors, (98), 87 states have internal predecessors, (98), 70 states have call successors, (70), 5 states have call predecessors, (70), 5 states have return successors, (70), 69 states have call predecessors, (70), 70 states have call successors, (70) [2025-03-08 11:16:29,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 238 transitions. [2025-03-08 11:16:29,356 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 238 transitions. Word has length 219 [2025-03-08 11:16:29,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:16:29,358 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 238 transitions. [2025-03-08 11:16:29,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 2 states have call successors, (54), 2 states have call predecessors, (54), 4 states have return successors, (55), 2 states have call predecessors, (55), 2 states have call successors, (55) [2025-03-08 11:16:29,358 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 238 transitions. [2025-03-08 11:16:29,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2025-03-08 11:16:29,360 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:16:29,361 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:16:29,371 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2025-03-08 11:16:29,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 11:16:29,562 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:16:29,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:16:29,562 INFO L85 PathProgramCache]: Analyzing trace with hash 1784868040, now seen corresponding path program 1 times [2025-03-08 11:16:29,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 11:16:29,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1352624586] [2025-03-08 11:16:29,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:16:29,563 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 11:16:29,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 11:16:29,567 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 11:16:29,568 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2025-03-08 11:16:29,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 220 statements into 1 equivalence classes. [2025-03-08 11:16:29,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 220 of 220 statements. [2025-03-08 11:16:29,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:16:29,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:16:29,757 INFO L256 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-08 11:16:29,760 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 11:16:30,606 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2025-03-08 11:16:30,606 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 11:16:30,607 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 11:16:30,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1352624586] [2025-03-08 11:16:30,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1352624586] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:16:30,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:16:30,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 11:16:30,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525234248] [2025-03-08 11:16:30,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:16:30,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 11:16:30,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 11:16:30,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 11:16:30,608 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 11:16:30,608 INFO L87 Difference]: Start difference. First operand 162 states and 238 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-03-08 11:16:30,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:16:30,894 INFO L93 Difference]: Finished difference Result 359 states and 521 transitions. [2025-03-08 11:16:30,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 11:16:30,895 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 220 [2025-03-08 11:16:30,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:16:30,897 INFO L225 Difference]: With dead ends: 359 [2025-03-08 11:16:30,897 INFO L226 Difference]: Without dead ends: 264 [2025-03-08 11:16:30,897 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 216 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-08 11:16:30,898 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 82 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 11:16:30,898 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 437 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 11:16:30,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2025-03-08 11:16:30,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 255. [2025-03-08 11:16:30,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 141 states have (on average 1.1631205673758864) internal successors, (164), 142 states have internal predecessors, (164), 105 states have call successors, (105), 8 states have call predecessors, (105), 8 states have return successors, (105), 104 states have call predecessors, (105), 105 states have call successors, (105) [2025-03-08 11:16:30,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 374 transitions. [2025-03-08 11:16:30,942 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 374 transitions. Word has length 220 [2025-03-08 11:16:30,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:16:30,943 INFO L471 AbstractCegarLoop]: Abstraction has 255 states and 374 transitions. [2025-03-08 11:16:30,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-03-08 11:16:30,943 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 374 transitions. [2025-03-08 11:16:30,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2025-03-08 11:16:30,945 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:16:30,945 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:16:30,953 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2025-03-08 11:16:31,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 11:16:31,146 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:16:31,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:16:31,147 INFO L85 PathProgramCache]: Analyzing trace with hash -356764228, now seen corresponding path program 1 times [2025-03-08 11:16:31,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 11:16:31,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [565192107] [2025-03-08 11:16:31,148 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:16:31,148 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 11:16:31,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 11:16:31,150 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 11:16:31,152 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2025-03-08 11:16:31,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 221 statements into 1 equivalence classes. [2025-03-08 11:16:31,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 221 of 221 statements. [2025-03-08 11:16:31,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:16:31,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:16:31,563 INFO L256 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-08 11:16:31,568 INFO L279 TraceCheckSpWp]: Computing forward predicates...