./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-84.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-84.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9814b6f663b6f8344bf47c3f11a6e8397e36d86baf563eb7b8c9e4a0d3ef60c6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 21:52:43,269 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 21:52:43,322 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 21:52:43,325 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 21:52:43,326 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 21:52:43,345 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 21:52:43,346 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 21:52:43,347 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 21:52:43,347 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 21:52:43,347 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 21:52:43,347 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 21:52:43,347 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 21:52:43,348 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 21:52:43,348 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 21:52:43,348 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 21:52:43,348 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 21:52:43,349 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 21:52:43,349 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 21:52:43,349 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 21:52:43,349 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 21:52:43,349 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 21:52:43,349 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 21:52:43,349 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 21:52:43,349 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 21:52:43,349 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 21:52:43,349 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 21:52:43,349 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 21:52:43,349 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 21:52:43,349 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 21:52:43,349 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 21:52:43,349 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 21:52:43,349 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 21:52:43,349 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 21:52:43,350 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 21:52:43,350 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 21:52:43,350 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 21:52:43,350 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 21:52:43,350 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 21:52:43,350 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 21:52:43,350 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 21:52:43,350 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 21:52:43,350 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 21:52:43,350 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 21:52:43,350 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9814b6f663b6f8344bf47c3f11a6e8397e36d86baf563eb7b8c9e4a0d3ef60c6 [2025-02-05 21:52:43,593 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 21:52:43,601 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 21:52:43,604 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 21:52:43,605 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 21:52:43,605 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 21:52:43,607 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-84.i [2025-02-05 21:52:44,686 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/15499504b/ed352274f75244f6be18d55244625eb1/FLAG6bb247e64 [2025-02-05 21:52:44,962 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 21:52:44,971 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-84.i [2025-02-05 21:52:44,986 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/15499504b/ed352274f75244f6be18d55244625eb1/FLAG6bb247e64 [2025-02-05 21:52:45,265 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/15499504b/ed352274f75244f6be18d55244625eb1 [2025-02-05 21:52:45,267 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 21:52:45,268 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 21:52:45,268 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 21:52:45,269 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 21:52:45,271 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 21:52:45,272 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 09:52:45" (1/1) ... [2025-02-05 21:52:45,272 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42a44859 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:52:45, skipping insertion in model container [2025-02-05 21:52:45,272 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 09:52:45" (1/1) ... [2025-02-05 21:52:45,288 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 21:52:45,382 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-84.i[915,928] [2025-02-05 21:52:45,449 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 21:52:45,460 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 21:52:45,469 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-84.i[915,928] [2025-02-05 21:52:45,504 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 21:52:45,521 INFO L204 MainTranslator]: Completed translation [2025-02-05 21:52:45,522 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:52:45 WrapperNode [2025-02-05 21:52:45,522 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 21:52:45,523 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 21:52:45,523 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 21:52:45,523 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 21:52:45,528 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:52:45" (1/1) ... [2025-02-05 21:52:45,538 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:52:45" (1/1) ... [2025-02-05 21:52:45,571 INFO L138 Inliner]: procedures = 26, calls = 55, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 265 [2025-02-05 21:52:45,572 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 21:52:45,573 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 21:52:45,573 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 21:52:45,573 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 21:52:45,578 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:52:45" (1/1) ... [2025-02-05 21:52:45,579 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:52:45" (1/1) ... [2025-02-05 21:52:45,586 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:52:45" (1/1) ... [2025-02-05 21:52:45,607 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-05 21:52:45,611 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:52:45" (1/1) ... [2025-02-05 21:52:45,611 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:52:45" (1/1) ... [2025-02-05 21:52:45,621 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:52:45" (1/1) ... [2025-02-05 21:52:45,626 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:52:45" (1/1) ... [2025-02-05 21:52:45,627 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:52:45" (1/1) ... [2025-02-05 21:52:45,628 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:52:45" (1/1) ... [2025-02-05 21:52:45,630 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 21:52:45,630 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 21:52:45,630 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 21:52:45,631 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 21:52:45,631 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:52:45" (1/1) ... [2025-02-05 21:52:45,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 21:52:45,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:52:45,658 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 21:52:45,661 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 21:52:45,678 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 21:52:45,678 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 21:52:45,678 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 21:52:45,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 21:52:45,678 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 21:52:45,679 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 21:52:45,751 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 21:52:45,752 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 21:52:46,058 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L191: havoc property_#t~bitwise27#1;havoc property_#t~short28#1;havoc property_#t~bitwise29#1;havoc property_#t~short30#1; [2025-02-05 21:52:46,098 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2025-02-05 21:52:46,098 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 21:52:46,114 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 21:52:46,115 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 21:52:46,115 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 09:52:46 BoogieIcfgContainer [2025-02-05 21:52:46,115 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 21:52:46,117 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 21:52:46,117 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 21:52:46,120 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 21:52:46,120 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 09:52:45" (1/3) ... [2025-02-05 21:52:46,121 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@388652bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 09:52:46, skipping insertion in model container [2025-02-05 21:52:46,121 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:52:45" (2/3) ... [2025-02-05 21:52:46,122 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@388652bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 09:52:46, skipping insertion in model container [2025-02-05 21:52:46,122 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 09:52:46" (3/3) ... [2025-02-05 21:52:46,123 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-84.i [2025-02-05 21:52:46,133 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 21:52:46,137 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-84.i that has 2 procedures, 120 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 21:52:46,182 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 21:52:46,192 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;@46f41980, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 21:52:46,192 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 21:52:46,196 INFO L276 IsEmpty]: Start isEmpty. Operand has 120 states, 75 states have (on average 1.3866666666666667) internal successors, (104), 76 states have internal predecessors, (104), 42 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-02-05 21:52:46,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2025-02-05 21:52:46,209 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:52:46,209 INFO L218 NwaCegarLoop]: trace histogram [42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:52:46,210 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:52:46,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:52:46,214 INFO L85 PathProgramCache]: Analyzing trace with hash -1205534104, now seen corresponding path program 1 times [2025-02-05 21:52:46,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:52:46,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431574575] [2025-02-05 21:52:46,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:52:46,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:52:46,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 261 statements into 1 equivalence classes. [2025-02-05 21:52:46,324 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 261 of 261 statements. [2025-02-05 21:52:46,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:52:46,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:52:46,558 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 0 proven. 82 refuted. 0 times theorem prover too weak. 3362 trivial. 0 not checked. [2025-02-05 21:52:46,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:52:46,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431574575] [2025-02-05 21:52:46,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431574575] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 21:52:46,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1154761040] [2025-02-05 21:52:46,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:52:46,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:52:46,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:52:46,564 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 21:52:46,565 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 21:52:46,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 261 statements into 1 equivalence classes. [2025-02-05 21:52:46,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 261 of 261 statements. [2025-02-05 21:52:46,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:52:46,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:52:46,717 INFO L256 TraceCheckSpWp]: Trace formula consists of 571 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 21:52:46,723 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:52:46,751 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 3362 trivial. 0 not checked. [2025-02-05 21:52:46,751 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 21:52:46,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1154761040] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:52:46,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 21:52:46,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-05 21:52:46,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384491254] [2025-02-05 21:52:46,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:52:46,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 21:52:46,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:52:46,771 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 21:52:46,771 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 21:52:46,773 INFO L87 Difference]: Start difference. First operand has 120 states, 75 states have (on average 1.3866666666666667) internal successors, (104), 76 states have internal predecessors, (104), 42 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) Second operand has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (42), 2 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 2 states have call successors, (42) [2025-02-05 21:52:46,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:52:46,802 INFO L93 Difference]: Finished difference Result 234 states and 413 transitions. [2025-02-05 21:52:46,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 21:52:46,804 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (42), 2 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 2 states have call successors, (42) Word has length 261 [2025-02-05 21:52:46,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:52:46,809 INFO L225 Difference]: With dead ends: 234 [2025-02-05 21:52:46,809 INFO L226 Difference]: Without dead ends: 117 [2025-02-05 21:52:46,812 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 262 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 21:52:46,814 INFO L435 NwaCegarLoop]: 179 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, 179 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-02-05 21:52:46,815 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 179 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:52:46,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2025-02-05 21:52:46,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2025-02-05 21:52:46,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 73 states have (on average 1.356164383561644) internal successors, (99), 73 states have internal predecessors, (99), 42 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-02-05 21:52:46,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 183 transitions. [2025-02-05 21:52:46,851 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 183 transitions. Word has length 261 [2025-02-05 21:52:46,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:52:46,852 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 183 transitions. [2025-02-05 21:52:46,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (42), 2 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 2 states have call successors, (42) [2025-02-05 21:52:46,852 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 183 transitions. [2025-02-05 21:52:46,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2025-02-05 21:52:46,855 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:52:46,855 INFO L218 NwaCegarLoop]: trace histogram [42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:52:46,862 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-05 21:52:47,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-05 21:52:47,056 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:52:47,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:52:47,057 INFO L85 PathProgramCache]: Analyzing trace with hash 1924898982, now seen corresponding path program 1 times [2025-02-05 21:52:47,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:52:47,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920948359] [2025-02-05 21:52:47,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:52:47,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:52:47,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 261 statements into 1 equivalence classes. [2025-02-05 21:52:47,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 261 of 261 statements. [2025-02-05 21:52:47,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:52:47,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:52:47,542 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3444 trivial. 0 not checked. [2025-02-05 21:52:47,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:52:47,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920948359] [2025-02-05 21:52:47,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920948359] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:52:47,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:52:47,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:52:47,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684470764] [2025-02-05 21:52:47,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:52:47,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:52:47,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:52:47,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:52:47,549 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:52:47,549 INFO L87 Difference]: Start difference. First operand 117 states and 183 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) [2025-02-05 21:52:47,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:52:47,591 INFO L93 Difference]: Finished difference Result 231 states and 363 transitions. [2025-02-05 21:52:47,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:52:47,591 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) Word has length 261 [2025-02-05 21:52:47,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:52:47,594 INFO L225 Difference]: With dead ends: 231 [2025-02-05 21:52:47,595 INFO L226 Difference]: Without dead ends: 117 [2025-02-05 21:52:47,595 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:52:47,596 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 180 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:52:47,596 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 175 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:52:47,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2025-02-05 21:52:47,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2025-02-05 21:52:47,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 73 states have (on average 1.3424657534246576) internal successors, (98), 73 states have internal predecessors, (98), 42 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-02-05 21:52:47,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 182 transitions. [2025-02-05 21:52:47,613 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 182 transitions. Word has length 261 [2025-02-05 21:52:47,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:52:47,615 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 182 transitions. [2025-02-05 21:52:47,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) [2025-02-05 21:52:47,616 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 182 transitions. [2025-02-05 21:52:47,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2025-02-05 21:52:47,618 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:52:47,618 INFO L218 NwaCegarLoop]: trace histogram [42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:52:47,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 21:52:47,619 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:52:47,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:52:47,619 INFO L85 PathProgramCache]: Analyzing trace with hash 2053981701, now seen corresponding path program 1 times [2025-02-05 21:52:47,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:52:47,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190184908] [2025-02-05 21:52:47,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:52:47,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:52:47,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 261 statements into 1 equivalence classes. [2025-02-05 21:52:47,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 261 of 261 statements. [2025-02-05 21:52:47,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:52:47,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:52:50,112 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3444 trivial. 0 not checked. [2025-02-05 21:52:50,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:52:50,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190184908] [2025-02-05 21:52:50,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190184908] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:52:50,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:52:50,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 21:52:50,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178416368] [2025-02-05 21:52:50,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:52:50,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 21:52:50,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:52:50,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 21:52:50,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-02-05 21:52:50,118 INFO L87 Difference]: Start difference. First operand 117 states and 182 transitions. Second operand has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) [2025-02-05 21:52:51,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:52:51,992 INFO L93 Difference]: Finished difference Result 382 states and 563 transitions. [2025-02-05 21:52:51,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 21:52:51,993 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) Word has length 261 [2025-02-05 21:52:51,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:52:51,996 INFO L225 Difference]: With dead ends: 382 [2025-02-05 21:52:51,997 INFO L226 Difference]: Without dead ends: 268 [2025-02-05 21:52:51,997 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2025-02-05 21:52:51,998 INFO L435 NwaCegarLoop]: 181 mSDtfsCounter, 265 mSDsluCounter, 976 mSDsCounter, 0 mSdLazyCounter, 540 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 1157 SdHoareTripleChecker+Invalid, 570 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:52:51,998 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 1157 Invalid, 570 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 540 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-05 21:52:51,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2025-02-05 21:52:52,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 169. [2025-02-05 21:52:52,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 122 states have (on average 1.3852459016393444) internal successors, (169), 123 states have internal predecessors, (169), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 43 states have call predecessors, (44), 44 states have call successors, (44) [2025-02-05 21:52:52,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 257 transitions. [2025-02-05 21:52:52,026 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 257 transitions. Word has length 261 [2025-02-05 21:52:52,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:52:52,027 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 257 transitions. [2025-02-05 21:52:52,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) [2025-02-05 21:52:52,027 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 257 transitions. [2025-02-05 21:52:52,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2025-02-05 21:52:52,029 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:52:52,029 INFO L218 NwaCegarLoop]: trace histogram [42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:52:52,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 21:52:52,030 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:52:52,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:52:52,031 INFO L85 PathProgramCache]: Analyzing trace with hash -1564099306, now seen corresponding path program 1 times [2025-02-05 21:52:52,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:52:52,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832058043] [2025-02-05 21:52:52,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:52:52,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:52:52,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 262 statements into 1 equivalence classes. [2025-02-05 21:52:52,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 262 of 262 statements. [2025-02-05 21:52:52,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:52:52,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:52:54,120 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3444 trivial. 0 not checked. [2025-02-05 21:52:54,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:52:54,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832058043] [2025-02-05 21:52:54,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832058043] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:52:54,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:52:54,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 21:52:54,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490451468] [2025-02-05 21:52:54,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:52:54,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 21:52:54,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:52:54,122 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 21:52:54,122 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-02-05 21:52:54,122 INFO L87 Difference]: Start difference. First operand 169 states and 257 transitions. Second operand has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) [2025-02-05 21:52:55,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:52:55,677 INFO L93 Difference]: Finished difference Result 580 states and 827 transitions. [2025-02-05 21:52:55,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 21:52:55,677 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) Word has length 262 [2025-02-05 21:52:55,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:52:55,680 INFO L225 Difference]: With dead ends: 580 [2025-02-05 21:52:55,680 INFO L226 Difference]: Without dead ends: 414 [2025-02-05 21:52:55,681 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2025-02-05 21:52:55,681 INFO L435 NwaCegarLoop]: 209 mSDtfsCounter, 445 mSDsluCounter, 775 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 445 SdHoareTripleChecker+Valid, 984 SdHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 21:52:55,681 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [445 Valid, 984 Invalid, 523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 465 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 21:52:55,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2025-02-05 21:52:55,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 171. [2025-02-05 21:52:55,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 124 states have (on average 1.3951612903225807) internal successors, (173), 125 states have internal predecessors, (173), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 43 states have call predecessors, (44), 44 states have call successors, (44) [2025-02-05 21:52:55,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 261 transitions. [2025-02-05 21:52:55,696 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 261 transitions. Word has length 262 [2025-02-05 21:52:55,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:52:55,697 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 261 transitions. [2025-02-05 21:52:55,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) [2025-02-05 21:52:55,697 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 261 transitions. [2025-02-05 21:52:55,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2025-02-05 21:52:55,699 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:52:55,699 INFO L218 NwaCegarLoop]: trace histogram [42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:52:55,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 21:52:55,700 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:52:55,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:52:55,701 INFO L85 PathProgramCache]: Analyzing trace with hash 1139034417, now seen corresponding path program 1 times [2025-02-05 21:52:55,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:52:55,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951636093] [2025-02-05 21:52:55,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:52:55,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:52:55,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 262 statements into 1 equivalence classes. [2025-02-05 21:52:55,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 262 of 262 statements. [2025-02-05 21:52:55,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:52:55,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:52:58,540 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3444 trivial. 0 not checked. [2025-02-05 21:52:58,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:52:58,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951636093] [2025-02-05 21:52:58,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951636093] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:52:58,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:52:58,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-05 21:52:58,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002564019] [2025-02-05 21:52:58,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:52:58,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-05 21:52:58,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:52:58,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-05 21:52:58,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-02-05 21:52:58,542 INFO L87 Difference]: Start difference. First operand 171 states and 261 transitions. Second operand has 11 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) [2025-02-05 21:53:01,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:53:01,441 INFO L93 Difference]: Finished difference Result 516 states and 754 transitions. [2025-02-05 21:53:01,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 21:53:01,442 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) Word has length 262 [2025-02-05 21:53:01,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:53:01,444 INFO L225 Difference]: With dead ends: 516 [2025-02-05 21:53:01,444 INFO L226 Difference]: Without dead ends: 348 [2025-02-05 21:53:01,445 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=130, Invalid=290, Unknown=0, NotChecked=0, Total=420 [2025-02-05 21:53:01,445 INFO L435 NwaCegarLoop]: 189 mSDtfsCounter, 473 mSDsluCounter, 535 mSDsCounter, 0 mSdLazyCounter, 920 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 473 SdHoareTripleChecker+Valid, 724 SdHoareTripleChecker+Invalid, 955 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 920 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-05 21:53:01,445 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [473 Valid, 724 Invalid, 955 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 920 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-05 21:53:01,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2025-02-05 21:53:01,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 172. [2025-02-05 21:53:01,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 125 states have (on average 1.4) internal successors, (175), 126 states have internal predecessors, (175), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 43 states have call predecessors, (44), 44 states have call successors, (44) [2025-02-05 21:53:01,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 263 transitions. [2025-02-05 21:53:01,466 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 263 transitions. Word has length 262 [2025-02-05 21:53:01,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:53:01,466 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 263 transitions. [2025-02-05 21:53:01,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) [2025-02-05 21:53:01,467 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 263 transitions. [2025-02-05 21:53:01,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2025-02-05 21:53:01,468 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:53:01,468 INFO L218 NwaCegarLoop]: trace histogram [42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:53:01,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 21:53:01,470 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:53:01,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:53:01,471 INFO L85 PathProgramCache]: Analyzing trace with hash 294562546, now seen corresponding path program 1 times [2025-02-05 21:53:01,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:53:01,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148379700] [2025-02-05 21:53:01,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:53:01,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:53:01,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 262 statements into 1 equivalence classes. [2025-02-05 21:53:01,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 262 of 262 statements. [2025-02-05 21:53:01,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:53:01,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:53:02,646 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3444 trivial. 0 not checked. [2025-02-05 21:53:02,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:53:02,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148379700] [2025-02-05 21:53:02,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148379700] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:53:02,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:53:02,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 21:53:02,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219704620] [2025-02-05 21:53:02,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:53:02,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 21:53:02,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:53:02,647 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 21:53:02,647 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 21:53:02,647 INFO L87 Difference]: Start difference. First operand 172 states and 263 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) [2025-02-05 21:53:03,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:53:03,513 INFO L93 Difference]: Finished difference Result 405 states and 608 transitions. [2025-02-05 21:53:03,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 21:53:03,513 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) Word has length 262 [2025-02-05 21:53:03,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:53:03,515 INFO L225 Difference]: With dead ends: 405 [2025-02-05 21:53:03,515 INFO L226 Difference]: Without dead ends: 236 [2025-02-05 21:53:03,516 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-05 21:53:03,516 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 41 mSDsluCounter, 599 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 770 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 21:53:03,516 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 770 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 21:53:03,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2025-02-05 21:53:03,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 217. [2025-02-05 21:53:03,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 162 states have (on average 1.3518518518518519) internal successors, (219), 165 states have internal predecessors, (219), 50 states have call successors, (50), 4 states have call predecessors, (50), 4 states have return successors, (50), 47 states have call predecessors, (50), 50 states have call successors, (50) [2025-02-05 21:53:03,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 319 transitions. [2025-02-05 21:53:03,535 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 319 transitions. Word has length 262 [2025-02-05 21:53:03,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:53:03,535 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 319 transitions. [2025-02-05 21:53:03,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) [2025-02-05 21:53:03,535 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 319 transitions. [2025-02-05 21:53:03,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2025-02-05 21:53:03,536 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:53:03,537 INFO L218 NwaCegarLoop]: trace histogram [42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:53:03,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 21:53:03,537 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:53:03,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:53:03,537 INFO L85 PathProgramCache]: Analyzing trace with hash -1195366485, now seen corresponding path program 1 times [2025-02-05 21:53:03,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:53:03,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434055701] [2025-02-05 21:53:03,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:53:03,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:53:03,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 262 statements into 1 equivalence classes. [2025-02-05 21:53:03,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 262 of 262 statements. [2025-02-05 21:53:03,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:53:03,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:53:06,010 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3444 trivial. 0 not checked. [2025-02-05 21:53:06,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:53:06,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434055701] [2025-02-05 21:53:06,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434055701] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:53:06,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:53:06,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 21:53:06,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28106942] [2025-02-05 21:53:06,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:53:06,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 21:53:06,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:53:06,012 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 21:53:06,012 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-05 21:53:06,012 INFO L87 Difference]: Start difference. First operand 217 states and 319 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) [2025-02-05 21:53:06,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:53:06,692 INFO L93 Difference]: Finished difference Result 492 states and 715 transitions. [2025-02-05 21:53:06,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 21:53:06,693 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) Word has length 262 [2025-02-05 21:53:06,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:53:06,695 INFO L225 Difference]: With dead ends: 492 [2025-02-05 21:53:06,695 INFO L226 Difference]: Without dead ends: 278 [2025-02-05 21:53:06,695 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-05 21:53:06,696 INFO L435 NwaCegarLoop]: 193 mSDtfsCounter, 60 mSDsluCounter, 670 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 863 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 21:53:06,696 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 863 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 21:53:06,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2025-02-05 21:53:06,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 224. [2025-02-05 21:53:06,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 169 states have (on average 1.349112426035503) internal successors, (228), 172 states have internal predecessors, (228), 50 states have call successors, (50), 4 states have call predecessors, (50), 4 states have return successors, (50), 47 states have call predecessors, (50), 50 states have call successors, (50) [2025-02-05 21:53:06,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 328 transitions. [2025-02-05 21:53:06,716 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 328 transitions. Word has length 262 [2025-02-05 21:53:06,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:53:06,717 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 328 transitions. [2025-02-05 21:53:06,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) [2025-02-05 21:53:06,717 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 328 transitions. [2025-02-05 21:53:06,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2025-02-05 21:53:06,718 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:53:06,718 INFO L218 NwaCegarLoop]: trace histogram [42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:53:06,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 21:53:06,718 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:53:06,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:53:06,719 INFO L85 PathProgramCache]: Analyzing trace with hash -1700925110, now seen corresponding path program 1 times [2025-02-05 21:53:06,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:53:06,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110071727] [2025-02-05 21:53:06,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:53:06,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:53:06,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 262 statements into 1 equivalence classes. [2025-02-05 21:53:06,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 262 of 262 statements. [2025-02-05 21:53:06,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:53:06,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:53:08,449 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3444 trivial. 0 not checked. [2025-02-05 21:53:08,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:53:08,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110071727] [2025-02-05 21:53:08,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110071727] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:53:08,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:53:08,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 21:53:08,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727073496] [2025-02-05 21:53:08,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:53:08,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 21:53:08,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:53:08,450 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 21:53:08,450 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-05 21:53:08,450 INFO L87 Difference]: Start difference. First operand 224 states and 328 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) [2025-02-05 21:53:09,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:53:09,286 INFO L93 Difference]: Finished difference Result 474 states and 687 transitions. [2025-02-05 21:53:09,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 21:53:09,287 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) Word has length 262 [2025-02-05 21:53:09,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:53:09,289 INFO L225 Difference]: With dead ends: 474 [2025-02-05 21:53:09,289 INFO L226 Difference]: Without dead ends: 253 [2025-02-05 21:53:09,289 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-05 21:53:09,290 INFO L435 NwaCegarLoop]: 192 mSDtfsCounter, 34 mSDsluCounter, 791 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 983 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 21:53:09,290 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 983 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 21:53:09,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2025-02-05 21:53:09,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 191. [2025-02-05 21:53:09,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 138 states have (on average 1.3333333333333333) internal successors, (184), 140 states have internal predecessors, (184), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 46 states have call predecessors, (48), 48 states have call successors, (48) [2025-02-05 21:53:09,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 280 transitions. [2025-02-05 21:53:09,306 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 280 transitions. Word has length 262 [2025-02-05 21:53:09,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:53:09,306 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 280 transitions. [2025-02-05 21:53:09,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) [2025-02-05 21:53:09,307 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 280 transitions. [2025-02-05 21:53:09,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2025-02-05 21:53:09,308 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:53:09,308 INFO L218 NwaCegarLoop]: trace histogram [42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:53:09,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 21:53:09,308 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:53:09,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:53:09,309 INFO L85 PathProgramCache]: Analyzing trace with hash 1262099523, now seen corresponding path program 1 times [2025-02-05 21:53:09,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:53:09,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010127277] [2025-02-05 21:53:09,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:53:09,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:53:09,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 263 statements into 1 equivalence classes. [2025-02-05 21:53:09,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 263 of 263 statements. [2025-02-05 21:53:09,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:53:09,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:53:11,763 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3444 trivial. 0 not checked. [2025-02-05 21:53:11,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:53:11,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010127277] [2025-02-05 21:53:11,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010127277] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:53:11,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:53:11,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 21:53:11,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700341469] [2025-02-05 21:53:11,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:53:11,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 21:53:11,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:53:11,764 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 21:53:11,764 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-02-05 21:53:11,765 INFO L87 Difference]: Start difference. First operand 191 states and 280 transitions. Second operand has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) [2025-02-05 21:53:12,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:53:12,517 INFO L93 Difference]: Finished difference Result 477 states and 689 transitions. [2025-02-05 21:53:12,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 21:53:12,517 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) Word has length 263 [2025-02-05 21:53:12,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:53:12,519 INFO L225 Difference]: With dead ends: 477 [2025-02-05 21:53:12,519 INFO L226 Difference]: Without dead ends: 289 [2025-02-05 21:53:12,520 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-02-05 21:53:12,520 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 72 mSDsluCounter, 861 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 1021 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 21:53:12,520 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 1021 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 21:53:12,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2025-02-05 21:53:12,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 222. [2025-02-05 21:53:12,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 169 states have (on average 1.3431952662721893) internal successors, (227), 171 states have internal predecessors, (227), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 46 states have call predecessors, (48), 48 states have call successors, (48) [2025-02-05 21:53:12,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 323 transitions. [2025-02-05 21:53:12,538 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 323 transitions. Word has length 263 [2025-02-05 21:53:12,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:53:12,538 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 323 transitions. [2025-02-05 21:53:12,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) [2025-02-05 21:53:12,538 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 323 transitions. [2025-02-05 21:53:12,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2025-02-05 21:53:12,540 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:53:12,540 INFO L218 NwaCegarLoop]: trace histogram [42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:53:12,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 21:53:12,540 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:53:12,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:53:12,540 INFO L85 PathProgramCache]: Analyzing trace with hash -534851836, now seen corresponding path program 1 times [2025-02-05 21:53:12,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:53:12,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826293305] [2025-02-05 21:53:12,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:53:12,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:53:12,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 263 statements into 1 equivalence classes. [2025-02-05 21:53:12,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 263 of 263 statements. [2025-02-05 21:53:12,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:53:12,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:53:14,427 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3444 trivial. 0 not checked. [2025-02-05 21:53:14,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:53:14,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826293305] [2025-02-05 21:53:14,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826293305] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:53:14,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:53:14,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-05 21:53:14,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565002025] [2025-02-05 21:53:14,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:53:14,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-05 21:53:14,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:53:14,429 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-05 21:53:14,429 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-02-05 21:53:14,430 INFO L87 Difference]: Start difference. First operand 222 states and 323 transitions. Second operand has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 11 states have internal predecessors, (56), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) [2025-02-05 21:53:15,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:53:15,091 INFO L93 Difference]: Finished difference Result 535 states and 765 transitions. [2025-02-05 21:53:15,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-05 21:53:15,091 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 11 states have internal predecessors, (56), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) Word has length 263 [2025-02-05 21:53:15,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:53:15,093 INFO L225 Difference]: With dead ends: 535 [2025-02-05 21:53:15,093 INFO L226 Difference]: Without dead ends: 316 [2025-02-05 21:53:15,093 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2025-02-05 21:53:15,094 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 124 mSDsluCounter, 994 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 1150 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 21:53:15,094 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 1150 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 369 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 21:53:15,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2025-02-05 21:53:15,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 226. [2025-02-05 21:53:15,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 173 states have (on average 1.346820809248555) internal successors, (233), 175 states have internal predecessors, (233), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 46 states have call predecessors, (48), 48 states have call successors, (48) [2025-02-05 21:53:15,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 329 transitions. [2025-02-05 21:53:15,109 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 329 transitions. Word has length 263 [2025-02-05 21:53:15,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:53:15,109 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 329 transitions. [2025-02-05 21:53:15,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 11 states have internal predecessors, (56), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) [2025-02-05 21:53:15,109 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 329 transitions. [2025-02-05 21:53:15,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2025-02-05 21:53:15,110 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:53:15,110 INFO L218 NwaCegarLoop]: trace histogram [42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:53:15,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 21:53:15,111 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:53:15,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:53:15,111 INFO L85 PathProgramCache]: Analyzing trace with hash -828254843, now seen corresponding path program 1 times [2025-02-05 21:53:15,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:53:15,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448552519] [2025-02-05 21:53:15,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:53:15,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:53:15,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 263 statements into 1 equivalence classes. [2025-02-05 21:53:15,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 263 of 263 statements. [2025-02-05 21:53:15,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:53:15,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:53:17,772 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3444 trivial. 0 not checked. [2025-02-05 21:53:17,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:53:17,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448552519] [2025-02-05 21:53:17,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448552519] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:53:17,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:53:17,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-05 21:53:17,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810385192] [2025-02-05 21:53:17,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:53:17,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-05 21:53:17,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:53:17,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-05 21:53:17,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-02-05 21:53:17,774 INFO L87 Difference]: Start difference. First operand 226 states and 329 transitions. Second operand has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 11 states have internal predecessors, (56), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) [2025-02-05 21:53:18,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:53:18,968 INFO L93 Difference]: Finished difference Result 522 states and 750 transitions. [2025-02-05 21:53:18,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-05 21:53:18,968 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 11 states have internal predecessors, (56), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) Word has length 263 [2025-02-05 21:53:18,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:53:18,970 INFO L225 Difference]: With dead ends: 522 [2025-02-05 21:53:18,971 INFO L226 Difference]: Without dead ends: 299 [2025-02-05 21:53:18,971 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2025-02-05 21:53:18,972 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 119 mSDsluCounter, 1139 mSDsCounter, 0 mSdLazyCounter, 572 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 1306 SdHoareTripleChecker+Invalid, 573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 21:53:18,973 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 1306 Invalid, 573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 572 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 21:53:18,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2025-02-05 21:53:18,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 222. [2025-02-05 21:53:18,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 169 states have (on average 1.3431952662721893) internal successors, (227), 171 states have internal predecessors, (227), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 46 states have call predecessors, (48), 48 states have call successors, (48) [2025-02-05 21:53:18,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 323 transitions. [2025-02-05 21:53:18,987 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 323 transitions. Word has length 263 [2025-02-05 21:53:18,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:53:18,988 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 323 transitions. [2025-02-05 21:53:18,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 11 states have internal predecessors, (56), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) [2025-02-05 21:53:18,988 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 323 transitions. [2025-02-05 21:53:18,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2025-02-05 21:53:18,989 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:53:18,989 INFO L218 NwaCegarLoop]: trace histogram [42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:53:18,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 21:53:18,989 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:53:18,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:53:18,990 INFO L85 PathProgramCache]: Analyzing trace with hash -1085205740, now seen corresponding path program 1 times [2025-02-05 21:53:18,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:53:18,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727786884] [2025-02-05 21:53:18,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:53:18,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:53:18,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 264 statements into 1 equivalence classes. [2025-02-05 21:53:19,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 264 of 264 statements. [2025-02-05 21:53:19,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:53:19,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:53:19,044 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3444 trivial. 0 not checked. [2025-02-05 21:53:19,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:53:19,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727786884] [2025-02-05 21:53:19,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727786884] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:53:19,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:53:19,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:53:19,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003567552] [2025-02-05 21:53:19,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:53:19,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:53:19,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:53:19,046 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:53:19,046 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:53:19,046 INFO L87 Difference]: Start difference. First operand 222 states and 323 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) [2025-02-05 21:53:19,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:53:19,124 INFO L93 Difference]: Finished difference Result 512 states and 734 transitions. [2025-02-05 21:53:19,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:53:19,125 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) Word has length 264 [2025-02-05 21:53:19,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:53:19,127 INFO L225 Difference]: With dead ends: 512 [2025-02-05 21:53:19,127 INFO L226 Difference]: Without dead ends: 293 [2025-02-05 21:53:19,128 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:53:19,128 INFO L435 NwaCegarLoop]: 192 mSDtfsCounter, 45 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:53:19,128 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 330 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:53:19,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2025-02-05 21:53:19,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 213. [2025-02-05 21:53:19,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 162 states have (on average 1.3333333333333333) internal successors, (216), 163 states have internal predecessors, (216), 46 states have call successors, (46), 4 states have call predecessors, (46), 4 states have return successors, (46), 45 states have call predecessors, (46), 46 states have call successors, (46) [2025-02-05 21:53:19,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 308 transitions. [2025-02-05 21:53:19,145 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 308 transitions. Word has length 264 [2025-02-05 21:53:19,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:53:19,145 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 308 transitions. [2025-02-05 21:53:19,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) [2025-02-05 21:53:19,145 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 308 transitions. [2025-02-05 21:53:19,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2025-02-05 21:53:19,148 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:53:19,148 INFO L218 NwaCegarLoop]: trace histogram [42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:53:19,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 21:53:19,148 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:53:19,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:53:19,149 INFO L85 PathProgramCache]: Analyzing trace with hash -1828912017, now seen corresponding path program 1 times [2025-02-05 21:53:19,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:53:19,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503762265] [2025-02-05 21:53:19,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:53:19,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:53:19,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 264 statements into 1 equivalence classes. [2025-02-05 21:53:19,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 264 of 264 statements. [2025-02-05 21:53:19,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:53:19,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:53:19,276 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3444 trivial. 0 not checked. [2025-02-05 21:53:19,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:53:19,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503762265] [2025-02-05 21:53:19,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503762265] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:53:19,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:53:19,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 21:53:19,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283806288] [2025-02-05 21:53:19,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:53:19,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 21:53:19,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:53:19,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 21:53:19,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 21:53:19,279 INFO L87 Difference]: Start difference. First operand 213 states and 308 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, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) [2025-02-05 21:53:19,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:53:19,486 INFO L93 Difference]: Finished difference Result 599 states and 869 transitions. [2025-02-05 21:53:19,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 21:53:19,487 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, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) Word has length 264 [2025-02-05 21:53:19,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:53:19,489 INFO L225 Difference]: With dead ends: 599 [2025-02-05 21:53:19,489 INFO L226 Difference]: Without dead ends: 389 [2025-02-05 21:53:19,490 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 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-02-05 21:53:19,490 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 126 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 596 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 21:53:19,490 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 596 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 21:53:19,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2025-02-05 21:53:19,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 301. [2025-02-05 21:53:19,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 205 states have (on average 1.302439024390244) internal successors, (267), 206 states have internal predecessors, (267), 88 states have call successors, (88), 7 states have call predecessors, (88), 7 states have return successors, (88), 87 states have call predecessors, (88), 88 states have call successors, (88) [2025-02-05 21:53:19,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 443 transitions. [2025-02-05 21:53:19,521 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 443 transitions. Word has length 264 [2025-02-05 21:53:19,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:53:19,522 INFO L471 AbstractCegarLoop]: Abstraction has 301 states and 443 transitions. [2025-02-05 21:53:19,522 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, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) [2025-02-05 21:53:19,522 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 443 transitions. [2025-02-05 21:53:19,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2025-02-05 21:53:19,523 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:53:19,523 INFO L218 NwaCegarLoop]: trace histogram [42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:53:19,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 21:53:19,523 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:53:19,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:53:19,524 INFO L85 PathProgramCache]: Analyzing trace with hash 138231053, now seen corresponding path program 1 times [2025-02-05 21:53:19,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:53:19,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335415586] [2025-02-05 21:53:19,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:53:19,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:53:19,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 264 statements into 1 equivalence classes. [2025-02-05 21:53:19,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 264 of 264 statements. [2025-02-05 21:53:19,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:53:19,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:53:19,577 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3444 trivial. 0 not checked. [2025-02-05 21:53:19,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:53:19,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335415586] [2025-02-05 21:53:19,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335415586] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:53:19,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:53:19,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:53:19,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594631071] [2025-02-05 21:53:19,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:53:19,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:53:19,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:53:19,579 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:53:19,579 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:53:19,579 INFO L87 Difference]: Start difference. First operand 301 states and 443 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) [2025-02-05 21:53:19,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:53:19,664 INFO L93 Difference]: Finished difference Result 553 states and 799 transitions. [2025-02-05 21:53:19,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:53:19,664 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) Word has length 264 [2025-02-05 21:53:19,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:53:19,668 INFO L225 Difference]: With dead ends: 553 [2025-02-05 21:53:19,668 INFO L226 Difference]: Without dead ends: 343 [2025-02-05 21:53:19,669 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:53:19,669 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 39 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:53:19,670 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 315 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:53:19,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2025-02-05 21:53:19,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 301. [2025-02-05 21:53:19,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 205 states have (on average 1.2829268292682927) internal successors, (263), 206 states have internal predecessors, (263), 88 states have call successors, (88), 7 states have call predecessors, (88), 7 states have return successors, (88), 87 states have call predecessors, (88), 88 states have call successors, (88) [2025-02-05 21:53:19,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 439 transitions. [2025-02-05 21:53:19,697 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 439 transitions. Word has length 264 [2025-02-05 21:53:19,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:53:19,697 INFO L471 AbstractCegarLoop]: Abstraction has 301 states and 439 transitions. [2025-02-05 21:53:19,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) [2025-02-05 21:53:19,697 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 439 transitions. [2025-02-05 21:53:19,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2025-02-05 21:53:19,698 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:53:19,698 INFO L218 NwaCegarLoop]: trace histogram [42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:53:19,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 21:53:19,699 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:53:19,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:53:19,699 INFO L85 PathProgramCache]: Analyzing trace with hash 386211932, now seen corresponding path program 1 times [2025-02-05 21:53:19,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:53:19,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687661114] [2025-02-05 21:53:19,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:53:19,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:53:19,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 265 statements into 1 equivalence classes. [2025-02-05 21:53:19,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 265 of 265 statements. [2025-02-05 21:53:19,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:53:19,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:53:21,397 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3444 trivial. 0 not checked. [2025-02-05 21:53:21,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:53:21,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687661114] [2025-02-05 21:53:21,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687661114] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:53:21,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:53:21,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-05 21:53:21,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627380380] [2025-02-05 21:53:21,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:53:21,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-05 21:53:21,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:53:21,399 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-05 21:53:21,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-02-05 21:53:21,399 INFO L87 Difference]: Start difference. First operand 301 states and 439 transitions. Second operand has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) [2025-02-05 21:53:22,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:53:22,212 INFO L93 Difference]: Finished difference Result 608 states and 867 transitions. [2025-02-05 21:53:22,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-05 21:53:22,213 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) Word has length 265 [2025-02-05 21:53:22,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:53:22,215 INFO L225 Difference]: With dead ends: 608 [2025-02-05 21:53:22,215 INFO L226 Difference]: Without dead ends: 398 [2025-02-05 21:53:22,216 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2025-02-05 21:53:22,216 INFO L435 NwaCegarLoop]: 186 mSDtfsCounter, 73 mSDsluCounter, 1025 mSDsCounter, 0 mSdLazyCounter, 540 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 1211 SdHoareTripleChecker+Invalid, 543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 21:53:22,216 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 1211 Invalid, 543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 540 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 21:53:22,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2025-02-05 21:53:22,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 328. [2025-02-05 21:53:22,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 232 states have (on average 1.3017241379310345) internal successors, (302), 233 states have internal predecessors, (302), 88 states have call successors, (88), 7 states have call predecessors, (88), 7 states have return successors, (88), 87 states have call predecessors, (88), 88 states have call successors, (88) [2025-02-05 21:53:22,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 478 transitions. [2025-02-05 21:53:22,242 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 478 transitions. Word has length 265 [2025-02-05 21:53:22,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:53:22,242 INFO L471 AbstractCegarLoop]: Abstraction has 328 states and 478 transitions. [2025-02-05 21:53:22,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) [2025-02-05 21:53:22,242 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 478 transitions. [2025-02-05 21:53:22,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2025-02-05 21:53:22,243 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:53:22,243 INFO L218 NwaCegarLoop]: trace histogram [42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:53:22,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 21:53:22,244 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:53:22,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:53:22,244 INFO L85 PathProgramCache]: Analyzing trace with hash 515294651, now seen corresponding path program 1 times [2025-02-05 21:53:22,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:53:22,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028169259] [2025-02-05 21:53:22,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:53:22,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:53:22,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 265 statements into 1 equivalence classes. [2025-02-05 21:53:22,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 265 of 265 statements. [2025-02-05 21:53:22,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:53:22,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:53:24,088 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3444 trivial. 0 not checked. [2025-02-05 21:53:24,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:53:24,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028169259] [2025-02-05 21:53:24,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028169259] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:53:24,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:53:24,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-05 21:53:24,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680607270] [2025-02-05 21:53:24,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:53:24,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-05 21:53:24,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:53:24,089 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-05 21:53:24,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-02-05 21:53:24,090 INFO L87 Difference]: Start difference. First operand 328 states and 478 transitions. Second operand has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) [2025-02-05 21:53:24,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:53:24,824 INFO L93 Difference]: Finished difference Result 613 states and 877 transitions. [2025-02-05 21:53:24,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-05 21:53:24,825 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) Word has length 265 [2025-02-05 21:53:24,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:53:24,827 INFO L225 Difference]: With dead ends: 613 [2025-02-05 21:53:24,827 INFO L226 Difference]: Without dead ends: 376 [2025-02-05 21:53:24,827 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2025-02-05 21:53:24,828 INFO L435 NwaCegarLoop]: 186 mSDtfsCounter, 57 mSDsluCounter, 1012 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 1198 SdHoareTripleChecker+Invalid, 488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 21:53:24,828 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 1198 Invalid, 488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 484 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 21:53:24,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2025-02-05 21:53:24,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 328. [2025-02-05 21:53:24,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 232 states have (on average 1.3017241379310345) internal successors, (302), 233 states have internal predecessors, (302), 88 states have call successors, (88), 7 states have call predecessors, (88), 7 states have return successors, (88), 87 states have call predecessors, (88), 88 states have call successors, (88) [2025-02-05 21:53:24,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 478 transitions. [2025-02-05 21:53:24,852 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 478 transitions. Word has length 265 [2025-02-05 21:53:24,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:53:24,852 INFO L471 AbstractCegarLoop]: Abstraction has 328 states and 478 transitions. [2025-02-05 21:53:24,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) [2025-02-05 21:53:24,852 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 478 transitions. [2025-02-05 21:53:24,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2025-02-05 21:53:24,853 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:53:24,853 INFO L218 NwaCegarLoop]: trace histogram [42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:53:24,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 21:53:24,854 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:53:24,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:53:24,854 INFO L85 PathProgramCache]: Analyzing trace with hash 870464897, now seen corresponding path program 1 times [2025-02-05 21:53:24,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:53:24,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700859083] [2025-02-05 21:53:24,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:53:24,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:53:24,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 265 statements into 1 equivalence classes. [2025-02-05 21:53:24,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 265 of 265 statements. [2025-02-05 21:53:24,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:53:24,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-05 21:53:24,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [108121256] [2025-02-05 21:53:24,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:53:24,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:53:24,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:53:24,918 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 21:53:24,920 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 21:53:24,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 265 statements into 1 equivalence classes. [2025-02-05 21:53:25,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 265 of 265 statements. [2025-02-05 21:53:25,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:53:25,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 21:53:25,042 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-05 21:53:25,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 265 statements into 1 equivalence classes. [2025-02-05 21:53:25,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 265 of 265 statements. [2025-02-05 21:53:25,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:53:25,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 21:53:25,254 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-05 21:53:25,254 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-05 21:53:25,255 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-05 21:53:25,264 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-05 21:53:25,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-02-05 21:53:25,460 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:53:25,604 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-05 21:53:25,606 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 09:53:25 BoogieIcfgContainer [2025-02-05 21:53:25,606 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-05 21:53:25,607 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-05 21:53:25,607 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-05 21:53:25,607 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-05 21:53:25,608 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 09:52:46" (3/4) ... [2025-02-05 21:53:25,610 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-05 21:53:25,610 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-05 21:53:25,611 INFO L158 Benchmark]: Toolchain (without parser) took 40343.37ms. Allocated memory was 167.8MB in the beginning and 620.8MB in the end (delta: 453.0MB). Free memory was 122.6MB in the beginning and 344.9MB in the end (delta: -222.2MB). Peak memory consumption was 234.4MB. Max. memory is 16.1GB. [2025-02-05 21:53:25,611 INFO L158 Benchmark]: CDTParser took 0.44ms. Allocated memory is still 201.3MB. Free memory is still 118.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 21:53:25,612 INFO L158 Benchmark]: CACSL2BoogieTranslator took 254.02ms. Allocated memory is still 167.8MB. Free memory was 122.6MB in the beginning and 106.9MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-05 21:53:25,612 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.17ms. Allocated memory is still 167.8MB. Free memory was 106.9MB in the beginning and 102.4MB in the end (delta: 4.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 21:53:25,612 INFO L158 Benchmark]: Boogie Preprocessor took 57.27ms. Allocated memory is still 167.8MB. Free memory was 102.4MB in the beginning and 98.5MB in the end (delta: 3.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 21:53:25,612 INFO L158 Benchmark]: IcfgBuilder took 484.75ms. Allocated memory is still 167.8MB. Free memory was 97.6MB in the beginning and 65.0MB in the end (delta: 32.7MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-02-05 21:53:25,613 INFO L158 Benchmark]: TraceAbstraction took 39489.60ms. Allocated memory was 167.8MB in the beginning and 620.8MB in the end (delta: 453.0MB). Free memory was 65.0MB in the beginning and 345.0MB in the end (delta: -280.0MB). Peak memory consumption was 167.3MB. Max. memory is 16.1GB. [2025-02-05 21:53:25,613 INFO L158 Benchmark]: Witness Printer took 3.60ms. Allocated memory is still 620.8MB. Free memory was 345.0MB in the beginning and 344.9MB in the end (delta: 129.2kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 21:53:25,614 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.44ms. Allocated memory is still 201.3MB. Free memory is still 118.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 254.02ms. Allocated memory is still 167.8MB. Free memory was 122.6MB in the beginning and 106.9MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.17ms. Allocated memory is still 167.8MB. Free memory was 106.9MB in the beginning and 102.4MB in the end (delta: 4.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 57.27ms. Allocated memory is still 167.8MB. Free memory was 102.4MB in the beginning and 98.5MB in the end (delta: 3.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 484.75ms. Allocated memory is still 167.8MB. Free memory was 97.6MB in the beginning and 65.0MB in the end (delta: 32.7MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 39489.60ms. Allocated memory was 167.8MB in the beginning and 620.8MB in the end (delta: 453.0MB). Free memory was 65.0MB in the beginning and 345.0MB in the end (delta: -280.0MB). Peak memory consumption was 167.3MB. Max. memory is 16.1GB. * Witness Printer took 3.60ms. Allocated memory is still 620.8MB. Free memory was 345.0MB in the beginning and 344.9MB in the end (delta: 129.2kB). 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 someBinaryDOUBLEComparisonOperation at line 182, overapproximation of someBinaryDOUBLEComparisonOperation at line 191, overapproximation of someBinaryDOUBLEComparisonOperation at line 80, overapproximation of someBinaryDOUBLEComparisonOperation at line 154, overapproximation of someBinaryDOUBLEComparisonOperation at line 180. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = -10; [L23] signed char var_1_3 = -16; [L24] signed char var_1_4 = 50; [L25] signed char var_1_5 = 4; [L26] unsigned long int var_1_6 = 50; [L27] signed long int var_1_7 = -8; [L28] signed long int var_1_8 = -4; [L29] signed char var_1_9 = 50; [L30] unsigned char var_1_10 = 128; [L31] unsigned char var_1_11 = 5; [L32] unsigned long int var_1_12 = 10; [L33] signed char var_1_13 = 16; [L34] unsigned short int var_1_15 = 128; [L35] signed long int var_1_16 = 2; [L36] unsigned short int var_1_17 = 61498; [L37] unsigned long int var_1_18 = 1; [L38] unsigned char var_1_19 = 0; [L39] double var_1_20 = 4.9; [L40] double var_1_21 = 1.5; [L41] signed long int var_1_22 = 0; [L42] signed long int var_1_23 = 100; [L43] signed long int var_1_24 = 2; [L44] unsigned char var_1_25 = 1; [L45] unsigned char var_1_26 = 1; [L46] unsigned char var_1_27 = 0; [L47] unsigned char var_1_28 = 0; [L48] unsigned char var_1_29 = 0; [L49] unsigned char var_1_30 = 0; [L50] unsigned char var_1_31 = 0; [L51] unsigned char var_1_32 = 1; [L52] double var_1_33 = 1.25; [L53] double var_1_34 = 1.6; [L54] double var_1_35 = 99999999999999.3; [L55] double var_1_36 = 16.4; [L56] unsigned short int var_1_37 = 1; [L57] unsigned short int var_1_38 = 256; [L58] unsigned short int last_1_var_1_15 = 128; VAL [isInitial=0, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=5/4, var_1_34=8/5, var_1_35=999999999999993/10, var_1_36=82/5, var_1_37=1, var_1_38=256, var_1_3=-16, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L195] isInitial = 1 [L196] FCALL initially() [L197] COND TRUE 1 [L198] CALL updateLastVariables() [L188] last_1_var_1_15 = var_1_15 VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=5/4, var_1_34=8/5, var_1_35=999999999999993/10, var_1_36=82/5, var_1_37=1, var_1_38=256, var_1_3=-16, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L198] RET updateLastVariables() [L199] CALL updateVariables() [L123] var_1_3 = __VERIFIER_nondet_char() [L124] CALL assume_abort_if_not(var_1_3 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=5/4, var_1_34=8/5, var_1_35=999999999999993/10, var_1_36=82/5, var_1_37=1, var_1_38=256, var_1_3=-10, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=5/4, var_1_34=8/5, var_1_35=999999999999993/10, var_1_36=82/5, var_1_37=1, var_1_38=256, var_1_3=-10, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L124] RET assume_abort_if_not(var_1_3 >= -63) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=5/4, var_1_34=8/5, var_1_35=999999999999993/10, var_1_36=82/5, var_1_37=1, var_1_38=256, var_1_3=-10, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L125] CALL assume_abort_if_not(var_1_3 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=5/4, var_1_34=8/5, var_1_35=999999999999993/10, var_1_36=82/5, var_1_37=1, var_1_38=256, var_1_3=-10, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=5/4, var_1_34=8/5, var_1_35=999999999999993/10, var_1_36=82/5, var_1_37=1, var_1_38=256, var_1_3=-10, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L125] RET assume_abort_if_not(var_1_3 <= 63) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=5/4, var_1_34=8/5, var_1_35=999999999999993/10, var_1_36=82/5, var_1_37=1, var_1_38=256, var_1_3=-10, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L126] var_1_4 = __VERIFIER_nondet_char() [L127] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=5/4, var_1_34=8/5, var_1_35=999999999999993/10, var_1_36=82/5, var_1_37=1, var_1_38=256, var_1_3=-10, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=5/4, var_1_34=8/5, var_1_35=999999999999993/10, var_1_36=82/5, var_1_37=1, var_1_38=256, var_1_3=-10, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L127] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=5/4, var_1_34=8/5, var_1_35=999999999999993/10, var_1_36=82/5, var_1_37=1, var_1_38=256, var_1_3=-10, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L128] CALL assume_abort_if_not(var_1_4 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=5/4, var_1_34=8/5, var_1_35=999999999999993/10, var_1_36=82/5, var_1_37=1, var_1_38=256, var_1_3=-10, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=5/4, var_1_34=8/5, var_1_35=999999999999993/10, var_1_36=82/5, var_1_37=1, var_1_38=256, var_1_3=-10, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L128] RET assume_abort_if_not(var_1_4 <= 63) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=5/4, var_1_34=8/5, var_1_35=999999999999993/10, var_1_36=82/5, var_1_37=1, var_1_38=256, var_1_3=-10, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L129] var_1_5 = __VERIFIER_nondet_char() [L130] CALL assume_abort_if_not(var_1_5 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=5/4, var_1_34=8/5, var_1_35=999999999999993/10, var_1_36=82/5, var_1_37=1, var_1_38=256, var_1_3=-10, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=5/4, var_1_34=8/5, var_1_35=999999999999993/10, var_1_36=82/5, var_1_37=1, var_1_38=256, var_1_3=-10, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L130] RET assume_abort_if_not(var_1_5 >= -127) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=5/4, var_1_34=8/5, var_1_35=999999999999993/10, var_1_36=82/5, var_1_37=1, var_1_38=256, var_1_3=-10, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L131] CALL assume_abort_if_not(var_1_5 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=5/4, var_1_34=8/5, var_1_35=999999999999993/10, var_1_36=82/5, var_1_37=1, var_1_38=256, var_1_3=-10, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=5/4, var_1_34=8/5, var_1_35=999999999999993/10, var_1_36=82/5, var_1_37=1, var_1_38=256, var_1_3=-10, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L131] RET assume_abort_if_not(var_1_5 <= 126) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=5/4, var_1_34=8/5, var_1_35=999999999999993/10, var_1_36=82/5, var_1_37=1, var_1_38=256, var_1_3=-10, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L132] var_1_7 = __VERIFIER_nondet_long() [L133] CALL assume_abort_if_not(var_1_7 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=5/4, var_1_34=8/5, var_1_35=999999999999993/10, var_1_36=82/5, var_1_37=1, var_1_38=256, var_1_3=-10, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=2, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=5/4, var_1_34=8/5, var_1_35=999999999999993/10, var_1_36=82/5, var_1_37=1, var_1_38=256, var_1_3=-10, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=2, var_1_8=-4, var_1_9=50] [L133] RET assume_abort_if_not(var_1_7 >= -2147483648) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=5/4, var_1_34=8/5, var_1_35=999999999999993/10, var_1_36=82/5, var_1_37=1, var_1_38=256, var_1_3=-10, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=2, var_1_8=-4, var_1_9=50] [L134] CALL assume_abort_if_not(var_1_7 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=5/4, var_1_34=8/5, var_1_35=999999999999993/10, var_1_36=82/5, var_1_37=1, var_1_38=256, var_1_3=-10, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=2, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=5/4, var_1_34=8/5, var_1_35=999999999999993/10, var_1_36=82/5, var_1_37=1, var_1_38=256, var_1_3=-10, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=2, var_1_8=-4, var_1_9=50] [L134] RET assume_abort_if_not(var_1_7 <= 2147483647) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=5/4, var_1_34=8/5, var_1_35=999999999999993/10, var_1_36=82/5, var_1_37=1, var_1_38=256, var_1_3=-10, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=2, var_1_8=-4, var_1_9=50] [L135] CALL assume_abort_if_not(var_1_7 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=5/4, var_1_34=8/5, var_1_35=999999999999993/10, var_1_36=82/5, var_1_37=1, var_1_38=256, var_1_3=-10, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=2, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=5/4, var_1_34=8/5, var_1_35=999999999999993/10, var_1_36=82/5, var_1_37=1, var_1_38=256, var_1_3=-10, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=2, var_1_8=-4, var_1_9=50] [L135] RET assume_abort_if_not(var_1_7 != 0) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=5/4, var_1_34=8/5, var_1_35=999999999999993/10, var_1_36=82/5, var_1_37=1, var_1_38=256, var_1_3=-10, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=2, var_1_8=-4, var_1_9=50] [L136] var_1_8 = __VERIFIER_nondet_long() [L137] CALL assume_abort_if_not(var_1_8 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=5/4, var_1_34=8/5, var_1_35=999999999999993/10, var_1_36=82/5, var_1_37=1, var_1_38=256, var_1_3=-10, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=5/4, var_1_34=8/5, var_1_35=999999999999993/10, var_1_36=82/5, var_1_37=1, var_1_38=256, var_1_3=-10, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L137] RET assume_abort_if_not(var_1_8 >= -2147483648) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=5/4, var_1_34=8/5, var_1_35=999999999999993/10, var_1_36=82/5, var_1_37=1, var_1_38=256, var_1_3=-10, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L138] CALL assume_abort_if_not(var_1_8 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=5/4, var_1_34=8/5, var_1_35=999999999999993/10, var_1_36=82/5, var_1_37=1, var_1_38=256, var_1_3=-10, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=5/4, var_1_34=8/5, var_1_35=999999999999993/10, var_1_36=82/5, var_1_37=1, var_1_38=256, var_1_3=-10, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L138] RET assume_abort_if_not(var_1_8 <= 2147483647) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=5/4, var_1_34=8/5, var_1_35=999999999999993/10, var_1_36=82/5, var_1_37=1, var_1_38=256, var_1_3=-10, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L139] CALL assume_abort_if_not(var_1_8 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=5/4, var_1_34=8/5, var_1_35=999999999999993/10, var_1_36=82/5, var_1_37=1, var_1_38=256, var_1_3=-10, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=5/4, var_1_34=8/5, var_1_35=999999999999993/10, var_1_36=82/5, var_1_37=1, var_1_38=256, var_1_3=-10, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L139] RET assume_abort_if_not(var_1_8 != 0) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=5/4, var_1_34=8/5, var_1_35=999999999999993/10, var_1_36=82/5, var_1_37=1, var_1_38=256, var_1_3=-10, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L140] var_1_10 = __VERIFIER_nondet_uchar() [L141] CALL assume_abort_if_not(var_1_10 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=5/4, var_1_34=8/5, var_1_35=999999999999993/10, var_1_36=82/5, var_1_37=1, var_1_38=256, var_1_3=-10, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=5/4, var_1_34=8/5, var_1_35=999999999999993/10, var_1_36=82/5, var_1_37=1, var_1_38=256, var_1_3=-10, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L141] RET assume_abort_if_not(var_1_10 >= 127) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=5/4, var_1_34=8/5, var_1_35=999999999999993/10, var_1_36=82/5, var_1_37=1, var_1_38=256, var_1_3=-10, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L142] CALL assume_abort_if_not(var_1_10 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=5/4, var_1_34=8/5, var_1_35=999999999999993/10, var_1_36=82/5, var_1_37=1, var_1_38=256, var_1_3=-10, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=5/4, var_1_34=8/5, var_1_35=999999999999993/10, var_1_36=82/5, var_1_37=1, var_1_38=256, var_1_3=-10, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L142] RET assume_abort_if_not(var_1_10 <= 255) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=5/4, var_1_34=8/5, var_1_35=999999999999993/10, var_1_36=82/5, var_1_37=1, var_1_38=256, var_1_3=-10, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L143] var_1_11 = __VERIFIER_nondet_uchar() [L144] CALL assume_abort_if_not(var_1_11 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=-386, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=5/4, var_1_34=8/5, var_1_35=999999999999993/10, var_1_36=82/5, var_1_37=1, var_1_38=256, var_1_3=-10, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=-386, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=5/4, var_1_34=8/5, var_1_35=999999999999993/10, var_1_36=82/5, var_1_37=1, var_1_38=256, var_1_3=-10, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L144] RET assume_abort_if_not(var_1_11 >= 1) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=-386, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=5/4, var_1_34=8/5, var_1_35=999999999999993/10, var_1_36=82/5, var_1_37=1, var_1_38=256, var_1_3=-10, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L145] CALL assume_abort_if_not(var_1_11 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=-386, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=5/4, var_1_34=8/5, var_1_35=999999999999993/10, var_1_36=82/5, var_1_37=1, var_1_38=256, var_1_3=-10, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=-386, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=5/4, var_1_34=8/5, var_1_35=999999999999993/10, var_1_36=82/5, var_1_37=1, var_1_38=256, var_1_3=-10, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L145] RET assume_abort_if_not(var_1_11 <= 126) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=-386, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=5/4, var_1_34=8/5, var_1_35=999999999999993/10, var_1_36=82/5, var_1_37=1, var_1_38=256, var_1_3=-10, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L146] CALL assume_abort_if_not(var_1_11 != 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=-386, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=5/4, var_1_34=8/5, var_1_35=999999999999993/10, var_1_36=82/5, var_1_37=1, var_1_38=256, var_1_3=-10, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=-386, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=5/4, var_1_34=8/5, var_1_35=999999999999993/10, var_1_36=82/5, var_1_37=1, var_1_38=256, var_1_3=-10, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L146] RET assume_abort_if_not(var_1_11 != 127) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=-386, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=5/4, var_1_34=8/5, var_1_35=999999999999993/10, var_1_36=82/5, var_1_37=1, var_1_38=256, var_1_3=-10, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L147] var_1_16 = __VERIFIER_nondet_long() [L148] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=-386, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=5/4, var_1_34=8/5, var_1_35=999999999999993/10, var_1_36=82/5, var_1_37=1, var_1_38=256, var_1_3=-10, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=-386, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=5/4, var_1_34=8/5, var_1_35=999999999999993/10, var_1_36=82/5, var_1_37=1, var_1_38=256, var_1_3=-10, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L148] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=-386, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=5/4, var_1_34=8/5, var_1_35=999999999999993/10, var_1_36=82/5, var_1_37=1, var_1_38=256, var_1_3=-10, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L149] CALL assume_abort_if_not(var_1_16 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=-386, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=5/4, var_1_34=8/5, var_1_35=999999999999993/10, var_1_36=82/5, var_1_37=1, var_1_38=256, var_1_3=-10, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=-386, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=5/4, var_1_34=8/5, var_1_35=999999999999993/10, var_1_36=82/5, var_1_37=1, var_1_38=256, var_1_3=-10, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L149] RET assume_abort_if_not(var_1_16 <= 2147483647) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=-386, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=5/4, var_1_34=8/5, var_1_35=999999999999993/10, var_1_36=82/5, var_1_37=1, var_1_38=256, var_1_3=-10, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L150] var_1_17 = __VERIFIER_nondet_ushort() [L151] CALL assume_abort_if_not(var_1_17 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=-386, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=5/4, var_1_34=8/5, var_1_35=999999999999993/10, var_1_36=82/5, var_1_37=1, var_1_38=256, var_1_3=-10, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=-386, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=5/4, var_1_34=8/5, var_1_35=999999999999993/10, var_1_36=82/5, var_1_37=1, var_1_38=256, var_1_3=-10, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L151] RET assume_abort_if_not(var_1_17 >= 32767) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=-386, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=5/4, var_1_34=8/5, var_1_35=999999999999993/10, var_1_36=82/5, var_1_37=1, var_1_38=256, var_1_3=-10, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L152] CALL assume_abort_if_not(var_1_17 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=-386, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=5/4, var_1_34=8/5, var_1_35=999999999999993/10, var_1_36=82/5, var_1_37=1, var_1_38=256, var_1_3=-10, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=-386, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=5/4, var_1_34=8/5, var_1_35=999999999999993/10, var_1_36=82/5, var_1_37=1, var_1_38=256, var_1_3=-10, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L152] RET assume_abort_if_not(var_1_17 <= 65534) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=-386, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=5/4, var_1_34=8/5, var_1_35=999999999999993/10, var_1_36=82/5, var_1_37=1, var_1_38=256, var_1_3=-10, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L153] var_1_21 = __VERIFIER_nondet_double() [L154] CALL assume_abort_if_not((var_1_21 >= -922337.2036854765600e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=-386, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=5/4, var_1_34=8/5, var_1_35=999999999999993/10, var_1_36=82/5, var_1_37=1, var_1_38=256, var_1_3=-10, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=-386, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=5/4, var_1_34=8/5, var_1_35=999999999999993/10, var_1_36=82/5, var_1_37=1, var_1_38=256, var_1_3=-10, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L154] RET assume_abort_if_not((var_1_21 >= -922337.2036854765600e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=-386, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=5/4, var_1_34=8/5, var_1_35=999999999999993/10, var_1_36=82/5, var_1_37=1, var_1_38=256, var_1_3=-10, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L155] var_1_23 = __VERIFIER_nondet_long() [L156] CALL assume_abort_if_not(var_1_23 >= -2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=-386, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=5/4, var_1_34=8/5, var_1_35=999999999999993/10, var_1_36=82/5, var_1_37=1, var_1_38=256, var_1_3=-10, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=-386, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=5/4, var_1_34=8/5, var_1_35=999999999999993/10, var_1_36=82/5, var_1_37=1, var_1_38=256, var_1_3=-10, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L156] RET assume_abort_if_not(var_1_23 >= -2147483647) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=-386, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=5/4, var_1_34=8/5, var_1_35=999999999999993/10, var_1_36=82/5, var_1_37=1, var_1_38=256, var_1_3=-10, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L157] CALL assume_abort_if_not(var_1_23 <= 2147483646) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=-386, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=5/4, var_1_34=8/5, var_1_35=999999999999993/10, var_1_36=82/5, var_1_37=1, var_1_38=256, var_1_3=-10, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=-386, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=5/4, var_1_34=8/5, var_1_35=999999999999993/10, var_1_36=82/5, var_1_37=1, var_1_38=256, var_1_3=-10, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L157] RET assume_abort_if_not(var_1_23 <= 2147483646) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=-386, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=5/4, var_1_34=8/5, var_1_35=999999999999993/10, var_1_36=82/5, var_1_37=1, var_1_38=256, var_1_3=-10, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L158] var_1_25 = __VERIFIER_nondet_uchar() [L159] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=-386, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_26=1, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=5/4, var_1_34=8/5, var_1_35=999999999999993/10, var_1_36=82/5, var_1_37=1, var_1_38=256, var_1_3=-10, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=-386, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_26=1, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=5/4, var_1_34=8/5, var_1_35=999999999999993/10, var_1_36=82/5, var_1_37=1, var_1_38=256, var_1_3=-10, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L159] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=-386, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_26=1, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=5/4, var_1_34=8/5, var_1_35=999999999999993/10, var_1_36=82/5, var_1_37=1, var_1_38=256, var_1_3=-10, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L160] CALL assume_abort_if_not(var_1_25 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=-386, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=5/4, var_1_34=8/5, var_1_35=999999999999993/10, var_1_36=82/5, var_1_37=1, var_1_38=256, var_1_3=-10, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=-386, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=5/4, var_1_34=8/5, var_1_35=999999999999993/10, var_1_36=82/5, var_1_37=1, var_1_38=256, var_1_3=-10, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L160] RET assume_abort_if_not(var_1_25 <= 1) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=-386, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=5/4, var_1_34=8/5, var_1_35=999999999999993/10, var_1_36=82/5, var_1_37=1, var_1_38=256, var_1_3=-10, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L161] var_1_26 = __VERIFIER_nondet_uchar() [L162] CALL assume_abort_if_not(var_1_26 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=-386, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=5/4, var_1_34=8/5, var_1_35=999999999999993/10, var_1_36=82/5, var_1_37=1, var_1_38=256, var_1_3=-10, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=-386, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=5/4, var_1_34=8/5, var_1_35=999999999999993/10, var_1_36=82/5, var_1_37=1, var_1_38=256, var_1_3=-10, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L162] RET assume_abort_if_not(var_1_26 >= 0) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=-386, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=5/4, var_1_34=8/5, var_1_35=999999999999993/10, var_1_36=82/5, var_1_37=1, var_1_38=256, var_1_3=-10, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L163] CALL assume_abort_if_not(var_1_26 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=-386, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_25=0, var_1_26=-255, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=5/4, var_1_34=8/5, var_1_35=999999999999993/10, var_1_36=82/5, var_1_37=1, var_1_38=256, var_1_3=-10, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=-386, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_25=0, var_1_26=-255, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=5/4, var_1_34=8/5, var_1_35=999999999999993/10, var_1_36=82/5, var_1_37=1, var_1_38=256, var_1_3=-10, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L163] RET assume_abort_if_not(var_1_26 <= 1) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=-386, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_25=0, var_1_26=-255, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=5/4, var_1_34=8/5, var_1_35=999999999999993/10, var_1_36=82/5, var_1_37=1, var_1_38=256, var_1_3=-10, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L164] var_1_28 = __VERIFIER_nondet_uchar() [L165] CALL assume_abort_if_not(var_1_28 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=-386, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_25=0, var_1_26=-255, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=5/4, var_1_34=8/5, var_1_35=999999999999993/10, var_1_36=82/5, var_1_37=1, var_1_38=256, var_1_3=-10, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=-386, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_25=0, var_1_26=-255, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=5/4, var_1_34=8/5, var_1_35=999999999999993/10, var_1_36=82/5, var_1_37=1, var_1_38=256, var_1_3=-10, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L165] RET assume_abort_if_not(var_1_28 >= 0) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=-386, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_25=0, var_1_26=-255, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=5/4, var_1_34=8/5, var_1_35=999999999999993/10, var_1_36=82/5, var_1_37=1, var_1_38=256, var_1_3=-10, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L166] CALL assume_abort_if_not(var_1_28 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=-386, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_25=0, var_1_26=-255, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=5/4, var_1_34=8/5, var_1_35=999999999999993/10, var_1_36=82/5, var_1_37=1, var_1_38=256, var_1_3=-10, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=-386, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_25=0, var_1_26=-255, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=5/4, var_1_34=8/5, var_1_35=999999999999993/10, var_1_36=82/5, var_1_37=1, var_1_38=256, var_1_3=-10, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L166] RET assume_abort_if_not(var_1_28 <= 1) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=-386, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_25=0, var_1_26=-255, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=5/4, var_1_34=8/5, var_1_35=999999999999993/10, var_1_36=82/5, var_1_37=1, var_1_38=256, var_1_3=-10, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L167] var_1_29 = __VERIFIER_nondet_uchar() [L168] CALL assume_abort_if_not(var_1_29 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=-386, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_25=0, var_1_26=-255, var_1_27=0, var_1_28=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=5/4, var_1_34=8/5, var_1_35=999999999999993/10, var_1_36=82/5, var_1_37=1, var_1_38=256, var_1_3=-10, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=-386, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_25=0, var_1_26=-255, var_1_27=0, var_1_28=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=5/4, var_1_34=8/5, var_1_35=999999999999993/10, var_1_36=82/5, var_1_37=1, var_1_38=256, var_1_3=-10, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L168] RET assume_abort_if_not(var_1_29 >= 0) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=-386, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_25=0, var_1_26=-255, var_1_27=0, var_1_28=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=5/4, var_1_34=8/5, var_1_35=999999999999993/10, var_1_36=82/5, var_1_37=1, var_1_38=256, var_1_3=-10, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L169] CALL assume_abort_if_not(var_1_29 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=-386, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_25=0, var_1_26=-255, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=5/4, var_1_34=8/5, var_1_35=999999999999993/10, var_1_36=82/5, var_1_37=1, var_1_38=256, var_1_3=-10, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=-386, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_25=0, var_1_26=-255, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=5/4, var_1_34=8/5, var_1_35=999999999999993/10, var_1_36=82/5, var_1_37=1, var_1_38=256, var_1_3=-10, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L169] RET assume_abort_if_not(var_1_29 <= 0) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=-386, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_25=0, var_1_26=-255, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=5/4, var_1_34=8/5, var_1_35=999999999999993/10, var_1_36=82/5, var_1_37=1, var_1_38=256, var_1_3=-10, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L170] var_1_30 = __VERIFIER_nondet_uchar() [L171] CALL assume_abort_if_not(var_1_30 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=-386, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_25=0, var_1_26=-255, var_1_27=0, var_1_28=0, var_1_29=0, var_1_31=0, var_1_32=1, var_1_33=5/4, var_1_34=8/5, var_1_35=999999999999993/10, var_1_36=82/5, var_1_37=1, var_1_38=256, var_1_3=-10, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=-386, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_25=0, var_1_26=-255, var_1_27=0, var_1_28=0, var_1_29=0, var_1_31=0, var_1_32=1, var_1_33=5/4, var_1_34=8/5, var_1_35=999999999999993/10, var_1_36=82/5, var_1_37=1, var_1_38=256, var_1_3=-10, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L171] RET assume_abort_if_not(var_1_30 >= 0) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=-386, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_25=0, var_1_26=-255, var_1_27=0, var_1_28=0, var_1_29=0, var_1_31=0, var_1_32=1, var_1_33=5/4, var_1_34=8/5, var_1_35=999999999999993/10, var_1_36=82/5, var_1_37=1, var_1_38=256, var_1_3=-10, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L172] CALL assume_abort_if_not(var_1_30 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=-386, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_25=0, var_1_26=-255, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=5/4, var_1_34=8/5, var_1_35=999999999999993/10, var_1_36=82/5, var_1_37=1, var_1_38=256, var_1_3=-10, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=-386, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_25=0, var_1_26=-255, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=5/4, var_1_34=8/5, var_1_35=999999999999993/10, var_1_36=82/5, var_1_37=1, var_1_38=256, var_1_3=-10, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L172] RET assume_abort_if_not(var_1_30 <= 0) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=-386, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_25=0, var_1_26=-255, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=5/4, var_1_34=8/5, var_1_35=999999999999993/10, var_1_36=82/5, var_1_37=1, var_1_38=256, var_1_3=-10, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L173] var_1_31 = __VERIFIER_nondet_uchar() [L174] CALL assume_abort_if_not(var_1_31 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=-386, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_25=0, var_1_26=-255, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_32=1, var_1_33=5/4, var_1_34=8/5, var_1_35=999999999999993/10, var_1_36=82/5, var_1_37=1, var_1_38=256, var_1_3=-10, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=-386, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_25=0, var_1_26=-255, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_32=1, var_1_33=5/4, var_1_34=8/5, var_1_35=999999999999993/10, var_1_36=82/5, var_1_37=1, var_1_38=256, var_1_3=-10, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L174] RET assume_abort_if_not(var_1_31 >= 0) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=-386, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_25=0, var_1_26=-255, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_32=1, var_1_33=5/4, var_1_34=8/5, var_1_35=999999999999993/10, var_1_36=82/5, var_1_37=1, var_1_38=256, var_1_3=-10, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L175] CALL assume_abort_if_not(var_1_31 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=-386, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_25=0, var_1_26=-255, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=5/4, var_1_34=8/5, var_1_35=999999999999993/10, var_1_36=82/5, var_1_37=1, var_1_38=256, var_1_3=-10, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=-386, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_25=0, var_1_26=-255, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=5/4, var_1_34=8/5, var_1_35=999999999999993/10, var_1_36=82/5, var_1_37=1, var_1_38=256, var_1_3=-10, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L175] RET assume_abort_if_not(var_1_31 <= 0) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=-386, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_25=0, var_1_26=-255, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=5/4, var_1_34=8/5, var_1_35=999999999999993/10, var_1_36=82/5, var_1_37=1, var_1_38=256, var_1_3=-10, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L176] var_1_32 = __VERIFIER_nondet_uchar() [L177] CALL assume_abort_if_not(var_1_32 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=-386, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_25=0, var_1_26=-255, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=5/4, var_1_34=8/5, var_1_35=999999999999993/10, var_1_36=82/5, var_1_37=1, var_1_38=256, var_1_3=-10, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=-386, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_25=0, var_1_26=-255, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=5/4, var_1_34=8/5, var_1_35=999999999999993/10, var_1_36=82/5, var_1_37=1, var_1_38=256, var_1_3=-10, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L177] RET assume_abort_if_not(var_1_32 >= 1) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=-386, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_25=0, var_1_26=-255, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=5/4, var_1_34=8/5, var_1_35=999999999999993/10, var_1_36=82/5, var_1_37=1, var_1_38=256, var_1_3=-10, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L178] CALL assume_abort_if_not(var_1_32 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=-386, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_25=0, var_1_26=-255, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=5/4, var_1_34=8/5, var_1_35=999999999999993/10, var_1_36=82/5, var_1_37=1, var_1_38=256, var_1_3=-10, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=-386, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_25=0, var_1_26=-255, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=5/4, var_1_34=8/5, var_1_35=999999999999993/10, var_1_36=82/5, var_1_37=1, var_1_38=256, var_1_3=-10, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L178] RET assume_abort_if_not(var_1_32 <= 1) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=-386, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_25=0, var_1_26=-255, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=5/4, var_1_34=8/5, var_1_35=999999999999993/10, var_1_36=82/5, var_1_37=1, var_1_38=256, var_1_3=-10, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L179] var_1_34 = __VERIFIER_nondet_double() [L180] CALL assume_abort_if_not((var_1_34 >= -922337.2036854765600e+13F && var_1_34 <= -1.0e-20F) || (var_1_34 <= 9223372.036854765600e+12F && var_1_34 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=-386, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_25=0, var_1_26=-255, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=5/4, var_1_35=999999999999993/10, var_1_36=82/5, var_1_37=1, var_1_38=256, var_1_3=-10, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=-386, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_25=0, var_1_26=-255, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=5/4, var_1_35=999999999999993/10, var_1_36=82/5, var_1_37=1, var_1_38=256, var_1_3=-10, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L180] RET assume_abort_if_not((var_1_34 >= -922337.2036854765600e+13F && var_1_34 <= -1.0e-20F) || (var_1_34 <= 9223372.036854765600e+12F && var_1_34 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=-386, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_25=0, var_1_26=-255, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=5/4, var_1_35=999999999999993/10, var_1_36=82/5, var_1_37=1, var_1_38=256, var_1_3=-10, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L181] var_1_36 = __VERIFIER_nondet_double() [L182] CALL assume_abort_if_not((var_1_36 >= -922337.2036854765600e+13F && var_1_36 <= -1.0e-20F) || (var_1_36 <= 9223372.036854765600e+12F && var_1_36 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=-386, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_25=0, var_1_26=-255, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=5/4, var_1_35=999999999999993/10, var_1_37=1, var_1_38=256, var_1_3=-10, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=-386, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_25=0, var_1_26=-255, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=5/4, var_1_35=999999999999993/10, var_1_37=1, var_1_38=256, var_1_3=-10, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L182] RET assume_abort_if_not((var_1_36 >= -922337.2036854765600e+13F && var_1_36 <= -1.0e-20F) || (var_1_36 <= 9223372.036854765600e+12F && var_1_36 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=-386, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_25=0, var_1_26=-255, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=5/4, var_1_35=999999999999993/10, var_1_37=1, var_1_38=256, var_1_3=-10, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L183] var_1_38 = __VERIFIER_nondet_ushort() [L184] CALL assume_abort_if_not(var_1_38 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=-386, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_25=0, var_1_26=-255, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=5/4, var_1_35=999999999999993/10, var_1_37=1, var_1_3=-10, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=-386, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_25=0, var_1_26=-255, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=5/4, var_1_35=999999999999993/10, var_1_37=1, var_1_3=-10, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L184] RET assume_abort_if_not(var_1_38 >= 0) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=-386, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_25=0, var_1_26=-255, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=5/4, var_1_35=999999999999993/10, var_1_37=1, var_1_3=-10, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L185] CALL assume_abort_if_not(var_1_38 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=-386, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_25=0, var_1_26=-255, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=5/4, var_1_35=999999999999993/10, var_1_37=1, var_1_38=0, var_1_3=-10, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=-386, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_25=0, var_1_26=-255, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=5/4, var_1_35=999999999999993/10, var_1_37=1, var_1_38=0, var_1_3=-10, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L185] RET assume_abort_if_not(var_1_38 <= 65534) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=-386, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_25=0, var_1_26=-255, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=5/4, var_1_35=999999999999993/10, var_1_37=1, var_1_38=0, var_1_3=-10, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L199] RET updateVariables() [L200] CALL step() [L62] var_1_22 = var_1_23 VAL [isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=-386, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=-2147483647, var_1_23=-2147483647, var_1_24=2, var_1_25=0, var_1_26=-255, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=5/4, var_1_35=999999999999993/10, var_1_37=1, var_1_38=0, var_1_3=-10, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L63] COND FALSE !(var_1_25 && var_1_26) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=-386, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=-2147483647, var_1_23=-2147483647, var_1_24=2, var_1_25=0, var_1_26=-255, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=5/4, var_1_35=999999999999993/10, var_1_37=1, var_1_38=0, var_1_3=-10, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L68] COND FALSE !(\read(var_1_25)) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=-386, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=-2147483647, var_1_23=-2147483647, var_1_24=2, var_1_25=0, var_1_26=-255, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=5/4, var_1_35=999999999999993/10, var_1_37=1, var_1_38=0, var_1_3=-10, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L79] var_1_33 = var_1_34 VAL [isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=-386, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=-2147483647, var_1_23=-2147483647, var_1_24=2, var_1_25=0, var_1_26=-255, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=2, var_1_34=2, var_1_35=999999999999993/10, var_1_37=1, var_1_38=0, var_1_3=-10, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L80] COND FALSE !(var_1_33 > var_1_34) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=-386, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=-2147483647, var_1_23=-2147483647, var_1_24=2, var_1_25=0, var_1_26=-255, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=2, var_1_34=2, var_1_35=999999999999993/10, var_1_37=1, var_1_38=0, var_1_3=-10, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L85] var_1_37 = var_1_38 VAL [isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=-386, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=-2147483647, var_1_23=-2147483647, var_1_24=2, var_1_25=0, var_1_26=-255, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=2, var_1_34=2, var_1_35=999999999999993/10, var_1_37=0, var_1_38=0, var_1_3=-10, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L86] EXPR var_1_8 & var_1_4 VAL [isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=-386, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=-2147483647, var_1_23=-2147483647, var_1_24=2, var_1_25=0, var_1_26=-255, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=2, var_1_34=2, var_1_35=999999999999993/10, var_1_37=0, var_1_38=0, var_1_3=-10, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L86] COND FALSE !(last_1_var_1_15 <= (var_1_8 & var_1_4)) [L91] var_1_9 = var_1_4 VAL [isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=-386, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=-2147483647, var_1_23=-2147483647, var_1_24=2, var_1_25=0, var_1_26=-255, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=2, var_1_34=2, var_1_35=999999999999993/10, var_1_37=0, var_1_38=0, var_1_3=-10, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L93] EXPR (var_1_4 + var_1_9) & var_1_7 VAL [isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=-386, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=-2147483647, var_1_23=-2147483647, var_1_24=2, var_1_25=0, var_1_26=-255, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=2, var_1_34=2, var_1_35=999999999999993/10, var_1_37=0, var_1_38=0, var_1_3=-10, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L93] signed long int stepLocal_3 = (var_1_4 + var_1_9) & var_1_7; [L94] COND TRUE stepLocal_3 <= (var_1_10 - ((((var_1_11) < (var_1_16)) ? (var_1_11) : (var_1_16)))) [L95] var_1_15 = (var_1_11 + 64) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=-386, var_1_12=10, var_1_13=16, var_1_15=190, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=-2147483647, var_1_23=-2147483647, var_1_24=2, var_1_25=0, var_1_26=-255, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=2, var_1_34=2, var_1_35=999999999999993/10, var_1_37=0, var_1_38=0, var_1_3=-10, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L99] signed long int stepLocal_1 = -4; [L100] signed long int stepLocal_0 = -16; VAL [isInitial=1, last_1_var_1_15=128, stepLocal_0=-16, stepLocal_1=-4, var_1_10=-128, var_1_11=-386, var_1_12=10, var_1_13=16, var_1_15=190, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=-2147483647, var_1_23=-2147483647, var_1_24=2, var_1_25=0, var_1_26=-255, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=2, var_1_34=2, var_1_35=999999999999993/10, var_1_37=0, var_1_38=0, var_1_3=-10, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L101] COND FALSE !(stepLocal_1 > (var_1_5 / ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8))))) VAL [isInitial=1, last_1_var_1_15=128, stepLocal_0=-16, var_1_10=-128, var_1_11=-386, var_1_12=10, var_1_13=16, var_1_15=190, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=-2147483647, var_1_23=-2147483647, var_1_24=2, var_1_25=0, var_1_26=-255, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=2, var_1_34=2, var_1_35=999999999999993/10, var_1_37=0, var_1_38=0, var_1_3=-10, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L106] var_1_18 = var_1_17 [L107] var_1_19 = 0 [L108] var_1_20 = var_1_21 VAL [isInitial=1, last_1_var_1_15=128, stepLocal_0=-16, var_1_10=-128, var_1_11=-386, var_1_12=10, var_1_13=16, var_1_15=190, var_1_16=126, var_1_17=65534, var_1_18=65534, var_1_19=0, var_1_1=-10, var_1_20=3, var_1_21=3, var_1_22=-2147483647, var_1_23=-2147483647, var_1_24=2, var_1_25=0, var_1_26=-255, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=2, var_1_34=2, var_1_35=999999999999993/10, var_1_37=0, var_1_38=0, var_1_3=-10, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L109] COND FALSE !(\read(var_1_19)) VAL [isInitial=1, last_1_var_1_15=128, stepLocal_0=-16, var_1_10=-128, var_1_11=-386, var_1_12=10, var_1_13=16, var_1_15=190, var_1_16=126, var_1_17=65534, var_1_18=65534, var_1_19=0, var_1_1=-10, var_1_20=3, var_1_21=3, var_1_22=-2147483647, var_1_23=-2147483647, var_1_24=2, var_1_25=0, var_1_26=-255, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=2, var_1_34=2, var_1_35=999999999999993/10, var_1_37=0, var_1_38=0, var_1_3=-10, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L112] COND TRUE var_1_3 <= var_1_1 [L113] var_1_12 = var_1_4 VAL [isInitial=1, last_1_var_1_15=128, stepLocal_0=-16, var_1_10=-128, var_1_11=-386, var_1_12=0, var_1_13=16, var_1_15=190, var_1_16=126, var_1_17=65534, var_1_18=65534, var_1_19=0, var_1_1=-10, var_1_20=3, var_1_21=3, var_1_22=-2147483647, var_1_23=-2147483647, var_1_24=2, var_1_25=0, var_1_26=-255, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=2, var_1_34=2, var_1_35=999999999999993/10, var_1_37=0, var_1_38=0, var_1_3=-10, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L117] unsigned long int stepLocal_2 = var_1_18; VAL [isInitial=1, last_1_var_1_15=128, stepLocal_0=-16, stepLocal_2=65534, var_1_10=-128, var_1_11=-386, var_1_12=0, var_1_13=16, var_1_15=190, var_1_16=126, var_1_17=65534, var_1_18=65534, var_1_19=0, var_1_1=-10, var_1_20=3, var_1_21=3, var_1_22=-2147483647, var_1_23=-2147483647, var_1_24=2, var_1_25=0, var_1_26=-255, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=2, var_1_34=2, var_1_35=999999999999993/10, var_1_37=0, var_1_38=0, var_1_3=-10, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L118] COND TRUE (~ var_1_3) < stepLocal_2 [L119] var_1_13 = (((((var_1_4 + var_1_3)) > (-5)) ? ((var_1_4 + var_1_3)) : (-5))) VAL [isInitial=1, last_1_var_1_15=128, stepLocal_0=-16, var_1_10=-128, var_1_11=-386, var_1_12=0, var_1_13=-5, var_1_15=190, var_1_16=126, var_1_17=65534, var_1_18=65534, var_1_19=0, var_1_1=-10, var_1_20=3, var_1_21=3, var_1_22=-2147483647, var_1_23=-2147483647, var_1_24=2, var_1_25=0, var_1_26=-255, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=2, var_1_34=2, var_1_35=999999999999993/10, var_1_37=0, var_1_38=0, var_1_3=-10, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L200] RET step() [L201] CALL, EXPR property() [L191] EXPR ((var_1_19 ? (var_1_1 == ((signed char) (((((var_1_3 + (1 - var_1_4))) < (var_1_5)) ? ((var_1_3 + (1 - var_1_4))) : (var_1_5))))) : 1) && ((-4 > (var_1_5 / ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8))))) ? ((var_1_4 < -16) ? (var_1_6 == ((unsigned long int) ((((32u) < 0 ) ? -(32u) : (32u))))) : 1) : 1)) && ((last_1_var_1_15 <= (var_1_8 & var_1_4)) ? ((((- 8) / (var_1_10 - var_1_11)) >= var_1_3) ? (var_1_9 == ((signed char) var_1_3)) : 1) : (var_1_9 == ((signed char) var_1_4))) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=-386, var_1_12=0, var_1_13=-5, var_1_15=190, var_1_16=126, var_1_17=65534, var_1_18=65534, var_1_19=0, var_1_1=-10, var_1_20=3, var_1_21=3, var_1_22=-2147483647, var_1_23=-2147483647, var_1_24=2, var_1_25=0, var_1_26=-255, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=2, var_1_34=2, var_1_35=999999999999993/10, var_1_37=0, var_1_38=0, var_1_3=-10, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L191] EXPR var_1_8 & var_1_4 VAL [isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=-386, var_1_12=0, var_1_13=-5, var_1_15=190, var_1_16=126, var_1_17=65534, var_1_18=65534, var_1_19=0, var_1_1=-10, var_1_20=3, var_1_21=3, var_1_22=-2147483647, var_1_23=-2147483647, var_1_24=2, var_1_25=0, var_1_26=-255, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=2, var_1_34=2, var_1_35=999999999999993/10, var_1_37=0, var_1_38=0, var_1_3=-10, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L191] EXPR ((var_1_19 ? (var_1_1 == ((signed char) (((((var_1_3 + (1 - var_1_4))) < (var_1_5)) ? ((var_1_3 + (1 - var_1_4))) : (var_1_5))))) : 1) && ((-4 > (var_1_5 / ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8))))) ? ((var_1_4 < -16) ? (var_1_6 == ((unsigned long int) ((((32u) < 0 ) ? -(32u) : (32u))))) : 1) : 1)) && ((last_1_var_1_15 <= (var_1_8 & var_1_4)) ? ((((- 8) / (var_1_10 - var_1_11)) >= var_1_3) ? (var_1_9 == ((signed char) var_1_3)) : 1) : (var_1_9 == ((signed char) var_1_4))) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=-386, var_1_12=0, var_1_13=-5, var_1_15=190, var_1_16=126, var_1_17=65534, var_1_18=65534, var_1_19=0, var_1_1=-10, var_1_20=3, var_1_21=3, var_1_22=-2147483647, var_1_23=-2147483647, var_1_24=2, var_1_25=0, var_1_26=-255, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=2, var_1_34=2, var_1_35=999999999999993/10, var_1_37=0, var_1_38=0, var_1_3=-10, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L191] EXPR (((((var_1_19 ? (var_1_1 == ((signed char) (((((var_1_3 + (1 - var_1_4))) < (var_1_5)) ? ((var_1_3 + (1 - var_1_4))) : (var_1_5))))) : 1) && ((-4 > (var_1_5 / ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8))))) ? ((var_1_4 < -16) ? (var_1_6 == ((unsigned long int) ((((32u) < 0 ) ? -(32u) : (32u))))) : 1) : 1)) && ((last_1_var_1_15 <= (var_1_8 & var_1_4)) ? ((((- 8) / (var_1_10 - var_1_11)) >= var_1_3) ? (var_1_9 == ((signed char) var_1_3)) : 1) : (var_1_9 == ((signed char) var_1_4)))) && ((var_1_3 <= var_1_1) ? (var_1_12 == ((unsigned long int) var_1_4)) : (var_1_12 == ((unsigned long int) (((((var_1_11 + var_1_4)) < (var_1_10)) ? ((var_1_11 + var_1_4)) : (var_1_10))))))) && (((~ var_1_3) < var_1_18) ? (var_1_13 == ((signed char) (((((var_1_4 + var_1_3)) > (-5)) ? ((var_1_4 + var_1_3)) : (-5))))) : 1)) && ((((var_1_4 + var_1_9) & var_1_7) <= (var_1_10 - ((((var_1_11) < (var_1_16)) ? (var_1_11) : (var_1_16))))) ? (var_1_15 == ((unsigned short int) (var_1_11 + 64))) : (var_1_15 == ((unsigned short int) ((((((((var_1_10) > ((var_1_17 - var_1_4))) ? (var_1_10) : ((var_1_17 - var_1_4))))) > (var_1_11)) ? (((((var_1_10) > ((var_1_17 - var_1_4))) ? (var_1_10) : ((var_1_17 - var_1_4))))) : (var_1_11)))))) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=-386, var_1_12=0, var_1_13=-5, var_1_15=190, var_1_16=126, var_1_17=65534, var_1_18=65534, var_1_19=0, var_1_1=-10, var_1_20=3, var_1_21=3, var_1_22=-2147483647, var_1_23=-2147483647, var_1_24=2, var_1_25=0, var_1_26=-255, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=2, var_1_34=2, var_1_35=999999999999993/10, var_1_37=0, var_1_38=0, var_1_3=-10, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L191] EXPR (var_1_4 + var_1_9) & var_1_7 VAL [isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=-386, var_1_12=0, var_1_13=-5, var_1_15=190, var_1_16=126, var_1_17=65534, var_1_18=65534, var_1_19=0, var_1_1=-10, var_1_20=3, var_1_21=3, var_1_22=-2147483647, var_1_23=-2147483647, var_1_24=2, var_1_25=0, var_1_26=-255, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=2, var_1_34=2, var_1_35=999999999999993/10, var_1_37=0, var_1_38=0, var_1_3=-10, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L191] EXPR (((((var_1_19 ? (var_1_1 == ((signed char) (((((var_1_3 + (1 - var_1_4))) < (var_1_5)) ? ((var_1_3 + (1 - var_1_4))) : (var_1_5))))) : 1) && ((-4 > (var_1_5 / ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8))))) ? ((var_1_4 < -16) ? (var_1_6 == ((unsigned long int) ((((32u) < 0 ) ? -(32u) : (32u))))) : 1) : 1)) && ((last_1_var_1_15 <= (var_1_8 & var_1_4)) ? ((((- 8) / (var_1_10 - var_1_11)) >= var_1_3) ? (var_1_9 == ((signed char) var_1_3)) : 1) : (var_1_9 == ((signed char) var_1_4)))) && ((var_1_3 <= var_1_1) ? (var_1_12 == ((unsigned long int) var_1_4)) : (var_1_12 == ((unsigned long int) (((((var_1_11 + var_1_4)) < (var_1_10)) ? ((var_1_11 + var_1_4)) : (var_1_10))))))) && (((~ var_1_3) < var_1_18) ? (var_1_13 == ((signed char) (((((var_1_4 + var_1_3)) > (-5)) ? ((var_1_4 + var_1_3)) : (-5))))) : 1)) && ((((var_1_4 + var_1_9) & var_1_7) <= (var_1_10 - ((((var_1_11) < (var_1_16)) ? (var_1_11) : (var_1_16))))) ? (var_1_15 == ((unsigned short int) (var_1_11 + 64))) : (var_1_15 == ((unsigned short int) ((((((((var_1_10) > ((var_1_17 - var_1_4))) ? (var_1_10) : ((var_1_17 - var_1_4))))) > (var_1_11)) ? (((((var_1_10) > ((var_1_17 - var_1_4))) ? (var_1_10) : ((var_1_17 - var_1_4))))) : (var_1_11)))))) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=-386, var_1_12=0, var_1_13=-5, var_1_15=190, var_1_16=126, var_1_17=65534, var_1_18=65534, var_1_19=0, var_1_1=-10, var_1_20=3, var_1_21=3, var_1_22=-2147483647, var_1_23=-2147483647, var_1_24=2, var_1_25=0, var_1_26=-255, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=2, var_1_34=2, var_1_35=999999999999993/10, var_1_37=0, var_1_38=0, var_1_3=-10, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L191-L192] return ((((((((var_1_19 ? (var_1_1 == ((signed char) (((((var_1_3 + (1 - var_1_4))) < (var_1_5)) ? ((var_1_3 + (1 - var_1_4))) : (var_1_5))))) : 1) && ((-4 > (var_1_5 / ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8))))) ? ((var_1_4 < -16) ? (var_1_6 == ((unsigned long int) ((((32u) < 0 ) ? -(32u) : (32u))))) : 1) : 1)) && ((last_1_var_1_15 <= (var_1_8 & var_1_4)) ? ((((- 8) / (var_1_10 - var_1_11)) >= var_1_3) ? (var_1_9 == ((signed char) var_1_3)) : 1) : (var_1_9 == ((signed char) var_1_4)))) && ((var_1_3 <= var_1_1) ? (var_1_12 == ((unsigned long int) var_1_4)) : (var_1_12 == ((unsigned long int) (((((var_1_11 + var_1_4)) < (var_1_10)) ? ((var_1_11 + var_1_4)) : (var_1_10))))))) && (((~ var_1_3) < var_1_18) ? (var_1_13 == ((signed char) (((((var_1_4 + var_1_3)) > (-5)) ? ((var_1_4 + var_1_3)) : (-5))))) : 1)) && ((((var_1_4 + var_1_9) & var_1_7) <= (var_1_10 - ((((var_1_11) < (var_1_16)) ? (var_1_11) : (var_1_16))))) ? (var_1_15 == ((unsigned short int) (var_1_11 + 64))) : (var_1_15 == ((unsigned short int) ((((((((var_1_10) > ((var_1_17 - var_1_4))) ? (var_1_10) : ((var_1_17 - var_1_4))))) > (var_1_11)) ? (((((var_1_10) > ((var_1_17 - var_1_4))) ? (var_1_10) : ((var_1_17 - var_1_4))))) : (var_1_11))))))) && (var_1_18 == ((unsigned long int) var_1_17))) && (var_1_19 == ((unsigned char) 0))) && (var_1_20 == ((double) var_1_21)) ; [L201] RET, EXPR property() [L201] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=-386, var_1_12=0, var_1_13=-5, var_1_15=190, var_1_16=126, var_1_17=65534, var_1_18=65534, var_1_19=0, var_1_1=-10, var_1_20=3, var_1_21=3, var_1_22=-2147483647, var_1_23=-2147483647, var_1_24=2, var_1_25=0, var_1_26=-255, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=2, var_1_34=2, var_1_35=999999999999993/10, var_1_37=0, var_1_38=0, var_1_3=-10, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=-386, var_1_12=0, var_1_13=-5, var_1_15=190, var_1_16=126, var_1_17=65534, var_1_18=65534, var_1_19=0, var_1_1=-10, var_1_20=3, var_1_21=3, var_1_22=-2147483647, var_1_23=-2147483647, var_1_24=2, var_1_25=0, var_1_26=-255, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=2, var_1_34=2, var_1_35=999999999999993/10, var_1_37=0, var_1_38=0, var_1_3=-10, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 120 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 39.3s, OverallIterations: 17, TraceHistogramMax: 42, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 13.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2153 SdHoareTripleChecker+Valid, 7.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2153 mSDsluCounter, 12962 SdHoareTripleChecker+Invalid, 6.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10078 mSDsCounter, 273 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5131 IncrementalHoareTripleChecker+Invalid, 5404 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 273 mSolverCounterUnsat, 2884 mSDtfsCounter, 5131 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 449 GetRequests, 312 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 11.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=328occurred in iteration=15, InterpolantAutomatonStates: 124, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 16 MinimizatonAttempts, 1215 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 23.8s InterpolantComputationTime, 4995 NumberOfCodeBlocks, 4995 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 4448 ConstructedInterpolants, 0 QuantifiedInterpolants, 18819 SizeOfPredicates, 0 NumberOfNonLiveVariables, 571 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 17 InterpolantComputations, 16 PerfectInterpolantSequences, 58466/58548 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-02-05 21:53:25,762 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-84.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9814b6f663b6f8344bf47c3f11a6e8397e36d86baf563eb7b8c9e4a0d3ef60c6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 21:53:27,349 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 21:53:27,435 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-02-05 21:53:27,439 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 21:53:27,440 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 21:53:27,454 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 21:53:27,455 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 21:53:27,455 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 21:53:27,455 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 21:53:27,455 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 21:53:27,455 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 21:53:27,455 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 21:53:27,456 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 21:53:27,456 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 21:53:27,456 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 21:53:27,456 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 21:53:27,456 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 21:53:27,456 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 21:53:27,456 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 21:53:27,456 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 21:53:27,456 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 21:53:27,456 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 21:53:27,456 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 21:53:27,457 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-05 21:53:27,457 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-05 21:53:27,457 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-05 21:53:27,457 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 21:53:27,457 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 21:53:27,457 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 21:53:27,457 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 21:53:27,457 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 21:53:27,457 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 21:53:27,457 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 21:53:27,457 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 21:53:27,457 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 21:53:27,457 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 21:53:27,457 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 21:53:27,458 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 21:53:27,458 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 21:53:27,458 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-05 21:53:27,458 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-05 21:53:27,458 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 21:53:27,458 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 21:53:27,458 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 21:53:27,458 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 21:53:27,458 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9814b6f663b6f8344bf47c3f11a6e8397e36d86baf563eb7b8c9e4a0d3ef60c6 [2025-02-05 21:53:27,690 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 21:53:27,699 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 21:53:27,700 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 21:53:27,701 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 21:53:27,702 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 21:53:27,703 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-84.i [2025-02-05 21:53:28,819 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5ce7bc0fd/bf5effb7e3c74ae8b39a205da683f351/FLAG92ba9b94a [2025-02-05 21:53:29,029 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 21:53:29,030 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-84.i [2025-02-05 21:53:29,037 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5ce7bc0fd/bf5effb7e3c74ae8b39a205da683f351/FLAG92ba9b94a [2025-02-05 21:53:29,385 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5ce7bc0fd/bf5effb7e3c74ae8b39a205da683f351 [2025-02-05 21:53:29,387 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 21:53:29,388 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 21:53:29,389 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 21:53:29,389 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 21:53:29,391 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 21:53:29,392 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 09:53:29" (1/1) ... [2025-02-05 21:53:29,392 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45cc4556 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:53:29, skipping insertion in model container [2025-02-05 21:53:29,392 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 09:53:29" (1/1) ... [2025-02-05 21:53:29,404 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 21:53:29,497 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-84.i[915,928] [2025-02-05 21:53:29,556 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 21:53:29,565 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 21:53:29,572 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-84.i[915,928] [2025-02-05 21:53:29,596 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 21:53:29,608 INFO L204 MainTranslator]: Completed translation [2025-02-05 21:53:29,609 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:53:29 WrapperNode [2025-02-05 21:53:29,609 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 21:53:29,610 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 21:53:29,610 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 21:53:29,610 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 21:53:29,614 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:53:29" (1/1) ... [2025-02-05 21:53:29,621 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:53:29" (1/1) ... [2025-02-05 21:53:29,649 INFO L138 Inliner]: procedures = 27, calls = 55, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 213 [2025-02-05 21:53:29,650 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 21:53:29,650 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 21:53:29,650 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 21:53:29,650 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 21:53:29,657 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:53:29" (1/1) ... [2025-02-05 21:53:29,657 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:53:29" (1/1) ... [2025-02-05 21:53:29,662 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:53:29" (1/1) ... [2025-02-05 21:53:29,676 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-05 21:53:29,679 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:53:29" (1/1) ... [2025-02-05 21:53:29,680 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:53:29" (1/1) ... [2025-02-05 21:53:29,690 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:53:29" (1/1) ... [2025-02-05 21:53:29,694 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:53:29" (1/1) ... [2025-02-05 21:53:29,696 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:53:29" (1/1) ... [2025-02-05 21:53:29,697 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:53:29" (1/1) ... [2025-02-05 21:53:29,701 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 21:53:29,705 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 21:53:29,705 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 21:53:29,705 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 21:53:29,706 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:53:29" (1/1) ... [2025-02-05 21:53:29,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 21:53:29,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:53:29,733 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 21:53:29,738 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 21:53:29,750 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 21:53:29,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-05 21:53:29,750 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 21:53:29,750 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 21:53:29,750 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 21:53:29,750 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 21:53:29,815 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 21:53:29,816 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 21:53:30,394 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-02-05 21:53:30,396 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 21:53:30,404 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 21:53:30,405 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 21:53:30,405 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 09:53:30 BoogieIcfgContainer [2025-02-05 21:53:30,405 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 21:53:30,407 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 21:53:30,407 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 21:53:30,410 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 21:53:30,411 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 09:53:29" (1/3) ... [2025-02-05 21:53:30,411 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d6a5aa8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 09:53:30, skipping insertion in model container [2025-02-05 21:53:30,411 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:53:29" (2/3) ... [2025-02-05 21:53:30,411 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d6a5aa8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 09:53:30, skipping insertion in model container [2025-02-05 21:53:30,411 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 09:53:30" (3/3) ... [2025-02-05 21:53:30,413 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-84.i [2025-02-05 21:53:30,422 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 21:53:30,423 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-84.i that has 2 procedures, 102 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 21:53:30,459 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 21:53:30,466 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;@58536a4f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 21:53:30,467 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 21:53:30,469 INFO L276 IsEmpty]: Start isEmpty. Operand has 102 states, 57 states have (on average 1.3333333333333333) internal successors, (76), 58 states have internal predecessors, (76), 42 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-02-05 21:53:30,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2025-02-05 21:53:30,478 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:53:30,479 INFO L218 NwaCegarLoop]: trace histogram [42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:53:30,479 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:53:30,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:53:30,482 INFO L85 PathProgramCache]: Analyzing trace with hash 1961608234, now seen corresponding path program 1 times [2025-02-05 21:53:30,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 21:53:30,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1115881320] [2025-02-05 21:53:30,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:53:30,489 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 21:53:30,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 21:53:30,491 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-05 21:53:30,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-02-05 21:53:30,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 255 statements into 1 equivalence classes. [2025-02-05 21:53:30,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 255 of 255 statements. [2025-02-05 21:53:30,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:53:30,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:53:30,746 INFO L256 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 21:53:30,757 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:53:30,814 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 1034 proven. 0 refuted. 0 times theorem prover too weak. 2410 trivial. 0 not checked. [2025-02-05 21:53:30,815 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 21:53:30,815 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 21:53:30,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1115881320] [2025-02-05 21:53:30,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1115881320] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:53:30,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:53:30,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 21:53:30,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010069243] [2025-02-05 21:53:30,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:53:30,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 21:53:30,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 21:53:30,833 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 21:53:30,833 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 21:53:30,835 INFO L87 Difference]: Start difference. First operand has 102 states, 57 states have (on average 1.3333333333333333) internal successors, (76), 58 states have internal predecessors, (76), 42 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) 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, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) [2025-02-05 21:53:30,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:53:30,863 INFO L93 Difference]: Finished difference Result 198 states and 357 transitions. [2025-02-05 21:53:30,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 21:53:30,865 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, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) Word has length 255 [2025-02-05 21:53:30,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:53:30,872 INFO L225 Difference]: With dead ends: 198 [2025-02-05 21:53:30,872 INFO L226 Difference]: Without dead ends: 99 [2025-02-05 21:53:30,875 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 254 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 21:53:30,878 INFO L435 NwaCegarLoop]: 155 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, 155 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:53:30,880 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:53:30,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-02-05 21:53:30,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2025-02-05 21:53:30,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 55 states have (on average 1.290909090909091) internal successors, (71), 55 states have internal predecessors, (71), 42 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-02-05 21:53:30,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 155 transitions. [2025-02-05 21:53:30,924 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 155 transitions. Word has length 255 [2025-02-05 21:53:30,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:53:30,925 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 155 transitions. [2025-02-05 21:53:30,925 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, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) [2025-02-05 21:53:30,925 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 155 transitions. [2025-02-05 21:53:30,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2025-02-05 21:53:30,929 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:53:30,930 INFO L218 NwaCegarLoop]: trace histogram [42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:53:30,939 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2025-02-05 21:53:31,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 21:53:31,131 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:53:31,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:53:31,132 INFO L85 PathProgramCache]: Analyzing trace with hash 325937384, now seen corresponding path program 1 times [2025-02-05 21:53:31,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 21:53:31,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [809962735] [2025-02-05 21:53:31,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:53:31,132 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 21:53:31,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 21:53:31,135 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-05 21:53:31,136 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-02-05 21:53:31,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 255 statements into 1 equivalence classes. [2025-02-05 21:53:31,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 255 of 255 statements. [2025-02-05 21:53:31,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:53:31,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:53:31,358 INFO L256 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 21:53:31,366 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:53:31,407 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3444 trivial. 0 not checked. [2025-02-05 21:53:31,407 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 21:53:31,407 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 21:53:31,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [809962735] [2025-02-05 21:53:31,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [809962735] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:53:31,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:53:31,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:53:31,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8165852] [2025-02-05 21:53:31,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:53:31,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:53:31,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 21:53:31,410 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:53:31,411 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:53:31,411 INFO L87 Difference]: Start difference. First operand 99 states and 155 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) [2025-02-05 21:53:31,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:53:31,480 INFO L93 Difference]: Finished difference Result 195 states and 307 transitions. [2025-02-05 21:53:31,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:53:31,488 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) Word has length 255 [2025-02-05 21:53:31,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:53:31,491 INFO L225 Difference]: With dead ends: 195 [2025-02-05 21:53:31,491 INFO L226 Difference]: Without dead ends: 99 [2025-02-05 21:53:31,492 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 253 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:53:31,492 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 152 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:53:31,493 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 152 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:53:31,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-02-05 21:53:31,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2025-02-05 21:53:31,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 55 states have (on average 1.2727272727272727) internal successors, (70), 55 states have internal predecessors, (70), 42 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-02-05 21:53:31,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 154 transitions. [2025-02-05 21:53:31,511 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 154 transitions. Word has length 255 [2025-02-05 21:53:31,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:53:31,512 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 154 transitions. [2025-02-05 21:53:31,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) [2025-02-05 21:53:31,512 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 154 transitions. [2025-02-05 21:53:31,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2025-02-05 21:53:31,517 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:53:31,518 INFO L218 NwaCegarLoop]: trace histogram [42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:53:31,526 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-02-05 21:53:31,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 21:53:31,719 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:53:31,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:53:31,719 INFO L85 PathProgramCache]: Analyzing trace with hash 2068747719, now seen corresponding path program 1 times [2025-02-05 21:53:31,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 21:53:31,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1591176304] [2025-02-05 21:53:31,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:53:31,720 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 21:53:31,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 21:53:31,722 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-05 21:53:31,723 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-02-05 21:53:31,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 255 statements into 1 equivalence classes. [2025-02-05 21:53:31,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 255 of 255 statements. [2025-02-05 21:53:31,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:53:31,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:53:31,917 INFO L256 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-02-05 21:53:31,924 INFO L279 TraceCheckSpWp]: Computing forward predicates...