./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-cn_file-63.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-cn_file-63.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 590452d92377852c876a6e949041483825ba0e70e1c24fb971a3d48a7c77ddb6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 01:36:53,302 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 01:36:53,356 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 01:36:53,361 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 01:36:53,363 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 01:36:53,382 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 01:36:53,383 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 01:36:53,383 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 01:36:53,384 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 01:36:53,384 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 01:36:53,384 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 01:36:53,385 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 01:36:53,385 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 01:36:53,385 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 01:36:53,385 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 01:36:53,385 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 01:36:53,385 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 01:36:53,385 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 01:36:53,385 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 01:36:53,385 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 01:36:53,385 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 01:36:53,385 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 01:36:53,385 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 01:36:53,385 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 01:36:53,385 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 01:36:53,386 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 01:36:53,386 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 01:36:53,386 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 01:36:53,386 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 01:36:53,386 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 01:36:53,386 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 01:36:53,386 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 01:36:53,386 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 01:36:53,386 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 01:36:53,386 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 01:36:53,386 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 01:36:53,386 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 01:36:53,386 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 01:36:53,386 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 01:36:53,386 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 01:36:53,386 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 01:36:53,386 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 01:36:53,386 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 01:36:53,386 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 590452d92377852c876a6e949041483825ba0e70e1c24fb971a3d48a7c77ddb6 [2025-03-17 01:36:53,575 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 01:36:53,580 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 01:36:53,584 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 01:36:53,585 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 01:36:53,585 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 01:36:53,586 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-cn_file-63.i [2025-03-17 01:36:54,733 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c4dad1d1/6fb8862329e84cf78770d7ba0c0aa25d/FLAG02441616b [2025-03-17 01:36:54,983 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 01:36:54,983 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-cn_file-63.i [2025-03-17 01:36:54,995 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c4dad1d1/6fb8862329e84cf78770d7ba0c0aa25d/FLAG02441616b [2025-03-17 01:36:55,011 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c4dad1d1/6fb8862329e84cf78770d7ba0c0aa25d [2025-03-17 01:36:55,013 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 01:36:55,014 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 01:36:55,015 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 01:36:55,016 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 01:36:55,019 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 01:36:55,020 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 01:36:55" (1/1) ... [2025-03-17 01:36:55,020 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c0736d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:36:55, skipping insertion in model container [2025-03-17 01:36:55,021 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 01:36:55" (1/1) ... [2025-03-17 01:36:55,040 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 01:36:55,142 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-cn_file-63.i[919,932] [2025-03-17 01:36:55,226 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 01:36:55,238 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 01:36:55,248 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-cn_file-63.i[919,932] [2025-03-17 01:36:55,280 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 01:36:55,294 INFO L204 MainTranslator]: Completed translation [2025-03-17 01:36:55,295 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:36:55 WrapperNode [2025-03-17 01:36:55,295 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 01:36:55,296 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 01:36:55,297 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 01:36:55,297 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 01:36:55,301 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:36:55" (1/1) ... [2025-03-17 01:36:55,315 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:36:55" (1/1) ... [2025-03-17 01:36:55,355 INFO L138 Inliner]: procedures = 26, calls = 53, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 306 [2025-03-17 01:36:55,355 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 01:36:55,356 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 01:36:55,356 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 01:36:55,356 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 01:36:55,362 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:36:55" (1/1) ... [2025-03-17 01:36:55,362 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:36:55" (1/1) ... [2025-03-17 01:36:55,369 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:36:55" (1/1) ... [2025-03-17 01:36:55,391 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-17 01:36:55,395 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:36:55" (1/1) ... [2025-03-17 01:36:55,397 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:36:55" (1/1) ... [2025-03-17 01:36:55,407 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:36:55" (1/1) ... [2025-03-17 01:36:55,408 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:36:55" (1/1) ... [2025-03-17 01:36:55,410 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:36:55" (1/1) ... [2025-03-17 01:36:55,415 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:36:55" (1/1) ... [2025-03-17 01:36:55,418 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 01:36:55,423 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 01:36:55,423 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 01:36:55,423 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 01:36:55,424 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:36:55" (1/1) ... [2025-03-17 01:36:55,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 01:36:55,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 01:36:55,464 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 01:36:55,470 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 01:36:55,484 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 01:36:55,484 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 01:36:55,484 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 01:36:55,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 01:36:55,484 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 01:36:55,484 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 01:36:55,548 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 01:36:55,550 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 01:36:55,885 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L222: havoc property_#t~bitwise33#1;havoc property_#t~bitwise34#1;havoc property_#t~short35#1; [2025-03-17 01:36:55,920 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2025-03-17 01:36:55,920 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 01:36:55,938 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 01:36:55,939 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 01:36:55,939 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 01:36:55 BoogieIcfgContainer [2025-03-17 01:36:55,939 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 01:36:55,942 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 01:36:55,943 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 01:36:55,946 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 01:36:55,947 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 01:36:55" (1/3) ... [2025-03-17 01:36:55,947 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4332a7db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 01:36:55, skipping insertion in model container [2025-03-17 01:36:55,948 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:36:55" (2/3) ... [2025-03-17 01:36:55,948 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4332a7db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 01:36:55, skipping insertion in model container [2025-03-17 01:36:55,948 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 01:36:55" (3/3) ... [2025-03-17 01:36:55,949 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-cn_file-63.i [2025-03-17 01:36:55,958 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 01:36:55,959 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pr-cn_file-63.i that has 2 procedures, 122 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 01:36:55,999 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 01:36:56,009 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;@49a4b518, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 01:36:56,010 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 01:36:56,014 INFO L276 IsEmpty]: Start isEmpty. Operand has 122 states, 79 states have (on average 1.4303797468354431) internal successors, (113), 80 states have internal predecessors, (113), 40 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-17 01:36:56,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2025-03-17 01:36:56,026 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:36:56,027 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:36:56,027 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:36:56,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:36:56,031 INFO L85 PathProgramCache]: Analyzing trace with hash 450633673, now seen corresponding path program 1 times [2025-03-17 01:36:56,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:36:56,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120239523] [2025-03-17 01:36:56,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:36:56,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:36:56,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 256 statements into 1 equivalence classes. [2025-03-17 01:36:56,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 256 of 256 statements. [2025-03-17 01:36:56,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:36:56,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:36:56,371 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 3042 trivial. 0 not checked. [2025-03-17 01:36:56,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:36:56,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120239523] [2025-03-17 01:36:56,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120239523] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 01:36:56,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1947660527] [2025-03-17 01:36:56,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:36:56,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 01:36:56,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 01:36:56,375 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 01:36:56,377 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 01:36:56,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 256 statements into 1 equivalence classes. [2025-03-17 01:36:56,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 256 of 256 statements. [2025-03-17 01:36:56,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:36:56,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:36:56,556 INFO L256 TraceCheckSpWp]: Trace formula consists of 589 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 01:36:56,566 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 01:36:56,598 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 3042 trivial. 0 not checked. [2025-03-17 01:36:56,598 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 01:36:56,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1947660527] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:36:56,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 01:36:56,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 01:36:56,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436755950] [2025-03-17 01:36:56,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:36:56,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 01:36:56,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:36:56,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 01:36:56,623 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 01:36:56,625 INFO L87 Difference]: Start difference. First operand has 122 states, 79 states have (on average 1.4303797468354431) internal successors, (113), 80 states have internal predecessors, (113), 40 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) Second operand has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (40), 2 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 2 states have call successors, (40) [2025-03-17 01:36:56,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:36:56,671 INFO L93 Difference]: Finished difference Result 241 states and 424 transitions. [2025-03-17 01:36:56,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 01:36:56,673 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (40), 2 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 2 states have call successors, (40) Word has length 256 [2025-03-17 01:36:56,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:36:56,680 INFO L225 Difference]: With dead ends: 241 [2025-03-17 01:36:56,680 INFO L226 Difference]: Without dead ends: 120 [2025-03-17 01:36:56,684 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 257 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 01:36:56,686 INFO L435 NwaCegarLoop]: 183 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 01:36:56,686 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 183 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 01:36:56,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-03-17 01:36:56,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2025-03-17 01:36:56,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 78 states have (on average 1.3974358974358974) internal successors, (109), 78 states have internal predecessors, (109), 40 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-17 01:36:56,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 189 transitions. [2025-03-17 01:36:56,724 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 189 transitions. Word has length 256 [2025-03-17 01:36:56,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:36:56,726 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 189 transitions. [2025-03-17 01:36:56,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (40), 2 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 2 states have call successors, (40) [2025-03-17 01:36:56,727 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 189 transitions. [2025-03-17 01:36:56,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2025-03-17 01:36:56,731 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:36:56,731 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:36:56,739 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 01:36:56,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-17 01:36:56,932 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:36:56,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:36:56,933 INFO L85 PathProgramCache]: Analyzing trace with hash 2044566963, now seen corresponding path program 1 times [2025-03-17 01:36:56,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:36:56,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026184744] [2025-03-17 01:36:56,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:36:56,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:36:56,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 256 statements into 1 equivalence classes. [2025-03-17 01:36:57,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 256 of 256 statements. [2025-03-17 01:36:57,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:36:57,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:36:57,194 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2025-03-17 01:36:57,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:36:57,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026184744] [2025-03-17 01:36:57,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026184744] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:36:57,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:36:57,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 01:36:57,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025414693] [2025-03-17 01:36:57,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:36:57,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 01:36:57,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:36:57,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 01:36:57,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 01:36:57,201 INFO L87 Difference]: Start difference. First operand 120 states and 189 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-17 01:36:57,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:36:57,287 INFO L93 Difference]: Finished difference Result 285 states and 450 transitions. [2025-03-17 01:36:57,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 01:36:57,288 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 256 [2025-03-17 01:36:57,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:36:57,290 INFO L225 Difference]: With dead ends: 285 [2025-03-17 01:36:57,290 INFO L226 Difference]: Without dead ends: 166 [2025-03-17 01:36:57,291 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 01:36:57,292 INFO L435 NwaCegarLoop]: 208 mSDtfsCounter, 57 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 01:36:57,292 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 376 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 01:36:57,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2025-03-17 01:36:57,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 142. [2025-03-17 01:36:57,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 100 states have (on average 1.45) internal successors, (145), 100 states have internal predecessors, (145), 40 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-17 01:36:57,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 225 transitions. [2025-03-17 01:36:57,307 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 225 transitions. Word has length 256 [2025-03-17 01:36:57,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:36:57,309 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 225 transitions. [2025-03-17 01:36:57,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-17 01:36:57,309 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 225 transitions. [2025-03-17 01:36:57,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2025-03-17 01:36:57,312 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:36:57,312 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:36:57,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 01:36:57,312 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:36:57,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:36:57,313 INFO L85 PathProgramCache]: Analyzing trace with hash -1257766509, now seen corresponding path program 1 times [2025-03-17 01:36:57,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:36:57,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082972458] [2025-03-17 01:36:57,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:36:57,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:36:57,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 256 statements into 1 equivalence classes. [2025-03-17 01:36:57,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 256 of 256 statements. [2025-03-17 01:36:57,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:36:57,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:36:58,005 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2025-03-17 01:36:58,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:36:58,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082972458] [2025-03-17 01:36:58,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082972458] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:36:58,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:36:58,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 01:36:58,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309101318] [2025-03-17 01:36:58,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:36:58,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 01:36:58,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:36:58,008 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 01:36:58,008 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-17 01:36:58,009 INFO L87 Difference]: Start difference. First operand 142 states and 225 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-17 01:36:58,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:36:58,286 INFO L93 Difference]: Finished difference Result 483 states and 764 transitions. [2025-03-17 01:36:58,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 01:36:58,287 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 256 [2025-03-17 01:36:58,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:36:58,289 INFO L225 Difference]: With dead ends: 483 [2025-03-17 01:36:58,290 INFO L226 Difference]: Without dead ends: 342 [2025-03-17 01:36:58,291 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-17 01:36:58,291 INFO L435 NwaCegarLoop]: 399 mSDtfsCounter, 390 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 390 SdHoareTripleChecker+Valid, 698 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 01:36:58,292 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [390 Valid, 698 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 01:36:58,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2025-03-17 01:36:58,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 185. [2025-03-17 01:36:58,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 143 states have (on average 1.5174825174825175) internal successors, (217), 143 states have internal predecessors, (217), 40 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-17 01:36:58,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 297 transitions. [2025-03-17 01:36:58,312 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 297 transitions. Word has length 256 [2025-03-17 01:36:58,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:36:58,313 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 297 transitions. [2025-03-17 01:36:58,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-17 01:36:58,314 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 297 transitions. [2025-03-17 01:36:58,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2025-03-17 01:36:58,316 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:36:58,316 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:36:58,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 01:36:58,317 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:36:58,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:36:58,317 INFO L85 PathProgramCache]: Analyzing trace with hash -1621239177, now seen corresponding path program 1 times [2025-03-17 01:36:58,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:36:58,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572673905] [2025-03-17 01:36:58,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:36:58,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:36:58,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 257 statements into 1 equivalence classes. [2025-03-17 01:36:58,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 257 of 257 statements. [2025-03-17 01:36:58,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:36:58,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:36:58,857 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2025-03-17 01:36:58,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:36:58,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572673905] [2025-03-17 01:36:58,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572673905] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:36:58,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:36:58,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 01:36:58,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135776351] [2025-03-17 01:36:58,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:36:58,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 01:36:58,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:36:58,860 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 01:36:58,860 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 01:36:58,860 INFO L87 Difference]: Start difference. First operand 185 states and 297 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-17 01:36:59,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:36:59,226 INFO L93 Difference]: Finished difference Result 482 states and 767 transitions. [2025-03-17 01:36:59,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 01:36:59,228 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 257 [2025-03-17 01:36:59,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:36:59,230 INFO L225 Difference]: With dead ends: 482 [2025-03-17 01:36:59,230 INFO L226 Difference]: Without dead ends: 298 [2025-03-17 01:36:59,231 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-17 01:36:59,231 INFO L435 NwaCegarLoop]: 318 mSDtfsCounter, 153 mSDsluCounter, 904 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 1222 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 01:36:59,231 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 1222 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 01:36:59,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2025-03-17 01:36:59,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 205. [2025-03-17 01:36:59,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 163 states have (on average 1.521472392638037) internal successors, (248), 163 states have internal predecessors, (248), 40 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-17 01:36:59,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 328 transitions. [2025-03-17 01:36:59,255 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 328 transitions. Word has length 257 [2025-03-17 01:36:59,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:36:59,256 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 328 transitions. [2025-03-17 01:36:59,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-17 01:36:59,256 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 328 transitions. [2025-03-17 01:36:59,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2025-03-17 01:36:59,259 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:36:59,259 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:36:59,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 01:36:59,259 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:36:59,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:36:59,260 INFO L85 PathProgramCache]: Analyzing trace with hash -978687371, now seen corresponding path program 1 times [2025-03-17 01:36:59,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:36:59,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283985390] [2025-03-17 01:36:59,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:36:59,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:36:59,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 258 statements into 1 equivalence classes. [2025-03-17 01:36:59,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 258 of 258 statements. [2025-03-17 01:36:59,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:36:59,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:36:59,787 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2025-03-17 01:36:59,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:36:59,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283985390] [2025-03-17 01:36:59,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283985390] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:36:59,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:36:59,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 01:36:59,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530254087] [2025-03-17 01:36:59,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:36:59,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 01:36:59,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:36:59,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 01:36:59,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 01:36:59,789 INFO L87 Difference]: Start difference. First operand 205 states and 328 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-17 01:37:00,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:37:00,123 INFO L93 Difference]: Finished difference Result 528 states and 838 transitions. [2025-03-17 01:37:00,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 01:37:00,124 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 258 [2025-03-17 01:37:00,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:37:00,127 INFO L225 Difference]: With dead ends: 528 [2025-03-17 01:37:00,128 INFO L226 Difference]: Without dead ends: 324 [2025-03-17 01:37:00,129 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-17 01:37:00,129 INFO L435 NwaCegarLoop]: 294 mSDtfsCounter, 141 mSDsluCounter, 1130 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 1424 SdHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 01:37:00,130 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 1424 Invalid, 335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 333 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 01:37:00,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2025-03-17 01:37:00,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 241. [2025-03-17 01:37:00,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 199 states have (on average 1.5376884422110553) internal successors, (306), 199 states have internal predecessors, (306), 40 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-17 01:37:00,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 386 transitions. [2025-03-17 01:37:00,141 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 386 transitions. Word has length 258 [2025-03-17 01:37:00,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:37:00,142 INFO L471 AbstractCegarLoop]: Abstraction has 241 states and 386 transitions. [2025-03-17 01:37:00,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-17 01:37:00,142 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 386 transitions. [2025-03-17 01:37:00,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2025-03-17 01:37:00,144 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:37:00,144 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:37:00,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 01:37:00,145 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:37:00,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:37:00,145 INFO L85 PathProgramCache]: Analyzing trace with hash -1245825139, now seen corresponding path program 1 times [2025-03-17 01:37:00,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:37:00,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577583679] [2025-03-17 01:37:00,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:37:00,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:37:00,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 258 statements into 1 equivalence classes. [2025-03-17 01:37:00,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 258 of 258 statements. [2025-03-17 01:37:00,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:37:00,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:37:00,712 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2025-03-17 01:37:00,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:37:00,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577583679] [2025-03-17 01:37:00,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577583679] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:37:00,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:37:00,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 01:37:00,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16734142] [2025-03-17 01:37:00,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:37:00,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 01:37:00,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:37:00,714 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 01:37:00,715 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-17 01:37:00,715 INFO L87 Difference]: Start difference. First operand 241 states and 386 transitions. Second operand has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-17 01:37:01,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:37:01,071 INFO L93 Difference]: Finished difference Result 606 states and 956 transitions. [2025-03-17 01:37:01,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 01:37:01,072 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 258 [2025-03-17 01:37:01,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:37:01,074 INFO L225 Difference]: With dead ends: 606 [2025-03-17 01:37:01,074 INFO L226 Difference]: Without dead ends: 366 [2025-03-17 01:37:01,075 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-03-17 01:37:01,075 INFO L435 NwaCegarLoop]: 229 mSDtfsCounter, 155 mSDsluCounter, 1219 mSDsCounter, 0 mSdLazyCounter, 373 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 1448 SdHoareTripleChecker+Invalid, 382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 01:37:01,076 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 1448 Invalid, 382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 373 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 01:37:01,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2025-03-17 01:37:01,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 254. [2025-03-17 01:37:01,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 212 states have (on average 1.5) internal successors, (318), 212 states have internal predecessors, (318), 40 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-17 01:37:01,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 398 transitions. [2025-03-17 01:37:01,085 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 398 transitions. Word has length 258 [2025-03-17 01:37:01,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:37:01,085 INFO L471 AbstractCegarLoop]: Abstraction has 254 states and 398 transitions. [2025-03-17 01:37:01,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-17 01:37:01,086 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 398 transitions. [2025-03-17 01:37:01,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2025-03-17 01:37:01,096 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:37:01,096 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:37:01,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 01:37:01,096 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:37:01,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:37:01,097 INFO L85 PathProgramCache]: Analyzing trace with hash -483843019, now seen corresponding path program 1 times [2025-03-17 01:37:01,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:37:01,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730095723] [2025-03-17 01:37:01,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:37:01,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:37:01,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 259 statements into 1 equivalence classes. [2025-03-17 01:37:01,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 259 of 259 statements. [2025-03-17 01:37:01,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:37:01,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:37:01,568 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2025-03-17 01:37:01,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:37:01,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730095723] [2025-03-17 01:37:01,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730095723] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:37:01,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:37:01,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 01:37:01,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517963481] [2025-03-17 01:37:01,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:37:01,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 01:37:01,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:37:01,569 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 01:37:01,569 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-17 01:37:01,569 INFO L87 Difference]: Start difference. First operand 254 states and 398 transitions. Second operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-17 01:37:02,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:37:02,898 INFO L93 Difference]: Finished difference Result 1119 states and 1734 transitions. [2025-03-17 01:37:02,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 01:37:02,899 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 259 [2025-03-17 01:37:02,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:37:02,903 INFO L225 Difference]: With dead ends: 1119 [2025-03-17 01:37:02,903 INFO L226 Difference]: Without dead ends: 866 [2025-03-17 01:37:02,904 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2025-03-17 01:37:02,904 INFO L435 NwaCegarLoop]: 294 mSDtfsCounter, 964 mSDsluCounter, 730 mSDsCounter, 0 mSdLazyCounter, 617 mSolverCounterSat, 806 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 964 SdHoareTripleChecker+Valid, 1024 SdHoareTripleChecker+Invalid, 1423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 806 IncrementalHoareTripleChecker+Valid, 617 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-17 01:37:02,905 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [964 Valid, 1024 Invalid, 1423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [806 Valid, 617 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-17 01:37:02,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 866 states. [2025-03-17 01:37:02,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 866 to 292. [2025-03-17 01:37:02,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 250 states have (on average 1.524) internal successors, (381), 250 states have internal predecessors, (381), 40 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-17 01:37:02,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 461 transitions. [2025-03-17 01:37:02,938 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 461 transitions. Word has length 259 [2025-03-17 01:37:02,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:37:02,939 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 461 transitions. [2025-03-17 01:37:02,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-17 01:37:02,940 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 461 transitions. [2025-03-17 01:37:02,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2025-03-17 01:37:02,944 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:37:02,944 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:37:02,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 01:37:02,945 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:37:02,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:37:02,945 INFO L85 PathProgramCache]: Analyzing trace with hash -354760300, now seen corresponding path program 1 times [2025-03-17 01:37:02,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:37:02,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787378952] [2025-03-17 01:37:02,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:37:02,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:37:02,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 259 statements into 1 equivalence classes. [2025-03-17 01:37:02,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 259 of 259 statements. [2025-03-17 01:37:02,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:37:02,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:37:03,427 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2025-03-17 01:37:03,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:37:03,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787378952] [2025-03-17 01:37:03,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787378952] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:37:03,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:37:03,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 01:37:03,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202296451] [2025-03-17 01:37:03,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:37:03,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 01:37:03,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:37:03,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 01:37:03,428 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-17 01:37:03,428 INFO L87 Difference]: Start difference. First operand 292 states and 461 transitions. Second operand has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-17 01:37:03,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:37:03,667 INFO L93 Difference]: Finished difference Result 711 states and 1107 transitions. [2025-03-17 01:37:03,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 01:37:03,668 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 259 [2025-03-17 01:37:03,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:37:03,670 INFO L225 Difference]: With dead ends: 711 [2025-03-17 01:37:03,670 INFO L226 Difference]: Without dead ends: 420 [2025-03-17 01:37:03,671 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-03-17 01:37:03,671 INFO L435 NwaCegarLoop]: 222 mSDtfsCounter, 136 mSDsluCounter, 916 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 1138 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 01:37:03,671 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 1138 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 01:37:03,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2025-03-17 01:37:03,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 283. [2025-03-17 01:37:03,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 241 states have (on average 1.5186721991701244) internal successors, (366), 241 states have internal predecessors, (366), 40 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-17 01:37:03,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 446 transitions. [2025-03-17 01:37:03,681 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 446 transitions. Word has length 259 [2025-03-17 01:37:03,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:37:03,681 INFO L471 AbstractCegarLoop]: Abstraction has 283 states and 446 transitions. [2025-03-17 01:37:03,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-17 01:37:03,681 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 446 transitions. [2025-03-17 01:37:03,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2025-03-17 01:37:03,683 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:37:03,684 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:37:03,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 01:37:03,684 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:37:03,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:37:03,684 INFO L85 PathProgramCache]: Analyzing trace with hash 797564559, now seen corresponding path program 1 times [2025-03-17 01:37:03,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:37:03,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387412574] [2025-03-17 01:37:03,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:37:03,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:37:03,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 259 statements into 1 equivalence classes. [2025-03-17 01:37:03,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 259 of 259 statements. [2025-03-17 01:37:03,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:37:03,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:37:04,264 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2025-03-17 01:37:04,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:37:04,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387412574] [2025-03-17 01:37:04,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387412574] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:37:04,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:37:04,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 01:37:04,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798203003] [2025-03-17 01:37:04,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:37:04,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 01:37:04,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:37:04,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 01:37:04,265 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-03-17 01:37:04,266 INFO L87 Difference]: Start difference. First operand 283 states and 446 transitions. Second operand has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-17 01:37:04,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:37:04,503 INFO L93 Difference]: Finished difference Result 689 states and 1076 transitions. [2025-03-17 01:37:04,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 01:37:04,504 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 259 [2025-03-17 01:37:04,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:37:04,506 INFO L225 Difference]: With dead ends: 689 [2025-03-17 01:37:04,506 INFO L226 Difference]: Without dead ends: 407 [2025-03-17 01:37:04,507 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-03-17 01:37:04,507 INFO L435 NwaCegarLoop]: 228 mSDtfsCounter, 117 mSDsluCounter, 1286 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 1514 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 01:37:04,508 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 1514 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 01:37:04,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2025-03-17 01:37:04,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 310. [2025-03-17 01:37:04,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 268 states have (on average 1.5186567164179106) internal successors, (407), 268 states have internal predecessors, (407), 40 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-17 01:37:04,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 487 transitions. [2025-03-17 01:37:04,522 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 487 transitions. Word has length 259 [2025-03-17 01:37:04,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:37:04,522 INFO L471 AbstractCegarLoop]: Abstraction has 310 states and 487 transitions. [2025-03-17 01:37:04,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-17 01:37:04,523 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 487 transitions. [2025-03-17 01:37:04,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2025-03-17 01:37:04,526 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:37:04,527 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:37:04,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 01:37:04,527 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:37:04,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:37:04,528 INFO L85 PathProgramCache]: Analyzing trace with hash 1558956780, now seen corresponding path program 1 times [2025-03-17 01:37:04,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:37:04,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459778534] [2025-03-17 01:37:04,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:37:04,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:37:04,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 259 statements into 1 equivalence classes. [2025-03-17 01:37:04,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 259 of 259 statements. [2025-03-17 01:37:04,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:37:04,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:37:04,597 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2025-03-17 01:37:04,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:37:04,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459778534] [2025-03-17 01:37:04,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459778534] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:37:04,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:37:04,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 01:37:04,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231627564] [2025-03-17 01:37:04,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:37:04,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 01:37:04,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:37:04,599 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 01:37:04,599 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 01:37:04,599 INFO L87 Difference]: Start difference. First operand 310 states and 487 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-17 01:37:04,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:37:04,641 INFO L93 Difference]: Finished difference Result 775 states and 1208 transitions. [2025-03-17 01:37:04,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 01:37:04,642 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 259 [2025-03-17 01:37:04,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:37:04,645 INFO L225 Difference]: With dead ends: 775 [2025-03-17 01:37:04,645 INFO L226 Difference]: Without dead ends: 466 [2025-03-17 01:37:04,646 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 01:37:04,647 INFO L435 NwaCegarLoop]: 214 mSDtfsCounter, 155 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 01:37:04,647 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 382 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 01:37:04,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2025-03-17 01:37:04,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 338. [2025-03-17 01:37:04,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 296 states have (on average 1.5033783783783783) internal successors, (445), 296 states have internal predecessors, (445), 40 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-17 01:37:04,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 525 transitions. [2025-03-17 01:37:04,663 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 525 transitions. Word has length 259 [2025-03-17 01:37:04,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:37:04,664 INFO L471 AbstractCegarLoop]: Abstraction has 338 states and 525 transitions. [2025-03-17 01:37:04,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-17 01:37:04,664 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 525 transitions. [2025-03-17 01:37:04,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2025-03-17 01:37:04,666 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:37:04,666 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:37:04,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 01:37:04,666 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:37:04,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:37:04,667 INFO L85 PathProgramCache]: Analyzing trace with hash 235880021, now seen corresponding path program 1 times [2025-03-17 01:37:04,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:37:04,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423302145] [2025-03-17 01:37:04,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:37:04,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:37:04,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 259 statements into 1 equivalence classes. [2025-03-17 01:37:04,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 259 of 259 statements. [2025-03-17 01:37:04,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:37:04,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:37:04,730 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2025-03-17 01:37:04,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:37:04,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423302145] [2025-03-17 01:37:04,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423302145] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:37:04,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:37:04,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 01:37:04,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716482721] [2025-03-17 01:37:04,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:37:04,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 01:37:04,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:37:04,734 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 01:37:04,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 01:37:04,734 INFO L87 Difference]: Start difference. First operand 338 states and 525 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-17 01:37:04,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:37:04,778 INFO L93 Difference]: Finished difference Result 774 states and 1198 transitions. [2025-03-17 01:37:04,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 01:37:04,779 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 259 [2025-03-17 01:37:04,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:37:04,782 INFO L225 Difference]: With dead ends: 774 [2025-03-17 01:37:04,782 INFO L226 Difference]: Without dead ends: 437 [2025-03-17 01:37:04,783 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 01:37:04,784 INFO L435 NwaCegarLoop]: 221 mSDtfsCounter, 165 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 01:37:04,784 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 389 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 01:37:04,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2025-03-17 01:37:04,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 349. [2025-03-17 01:37:04,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 307 states have (on average 1.498371335504886) internal successors, (460), 307 states have internal predecessors, (460), 40 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-17 01:37:04,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 540 transitions. [2025-03-17 01:37:04,801 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 540 transitions. Word has length 259 [2025-03-17 01:37:04,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:37:04,802 INFO L471 AbstractCegarLoop]: Abstraction has 349 states and 540 transitions. [2025-03-17 01:37:04,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-17 01:37:04,802 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 540 transitions. [2025-03-17 01:37:04,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2025-03-17 01:37:04,805 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:37:04,805 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:37:04,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 01:37:04,805 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:37:04,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:37:04,805 INFO L85 PathProgramCache]: Analyzing trace with hash -1942608165, now seen corresponding path program 1 times [2025-03-17 01:37:04,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:37:04,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329136077] [2025-03-17 01:37:04,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:37:04,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:37:04,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 259 statements into 1 equivalence classes. [2025-03-17 01:37:04,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 259 of 259 statements. [2025-03-17 01:37:04,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:37:04,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:37:04,890 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2025-03-17 01:37:04,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:37:04,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329136077] [2025-03-17 01:37:04,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329136077] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:37:04,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:37:04,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 01:37:04,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539041022] [2025-03-17 01:37:04,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:37:04,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 01:37:04,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:37:04,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 01:37:04,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 01:37:04,892 INFO L87 Difference]: Start difference. First operand 349 states and 540 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-17 01:37:04,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:37:04,937 INFO L93 Difference]: Finished difference Result 796 states and 1227 transitions. [2025-03-17 01:37:04,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 01:37:04,937 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 259 [2025-03-17 01:37:04,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:37:04,940 INFO L225 Difference]: With dead ends: 796 [2025-03-17 01:37:04,940 INFO L226 Difference]: Without dead ends: 448 [2025-03-17 01:37:04,941 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 01:37:04,941 INFO L435 NwaCegarLoop]: 314 mSDtfsCounter, 141 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 01:37:04,941 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 481 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 01:37:04,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2025-03-17 01:37:04,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 335. [2025-03-17 01:37:04,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 293 states have (on average 1.484641638225256) internal successors, (435), 293 states have internal predecessors, (435), 40 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-17 01:37:04,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 515 transitions. [2025-03-17 01:37:04,954 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 515 transitions. Word has length 259 [2025-03-17 01:37:04,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:37:04,955 INFO L471 AbstractCegarLoop]: Abstraction has 335 states and 515 transitions. [2025-03-17 01:37:04,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-17 01:37:04,955 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 515 transitions. [2025-03-17 01:37:04,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2025-03-17 01:37:04,957 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:37:04,957 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:37:04,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 01:37:04,957 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:37:04,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:37:04,958 INFO L85 PathProgramCache]: Analyzing trace with hash 1353955516, now seen corresponding path program 1 times [2025-03-17 01:37:04,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:37:04,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326215096] [2025-03-17 01:37:04,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:37:04,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:37:04,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 259 statements into 1 equivalence classes. [2025-03-17 01:37:04,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 259 of 259 statements. [2025-03-17 01:37:04,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:37:04,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:37:05,037 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2025-03-17 01:37:05,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:37:05,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326215096] [2025-03-17 01:37:05,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326215096] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:37:05,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:37:05,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 01:37:05,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592717357] [2025-03-17 01:37:05,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:37:05,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 01:37:05,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:37:05,040 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 01:37:05,040 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 01:37:05,040 INFO L87 Difference]: Start difference. First operand 335 states and 515 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-17 01:37:05,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:37:05,086 INFO L93 Difference]: Finished difference Result 752 states and 1152 transitions. [2025-03-17 01:37:05,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 01:37:05,087 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 259 [2025-03-17 01:37:05,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:37:05,089 INFO L225 Difference]: With dead ends: 752 [2025-03-17 01:37:05,089 INFO L226 Difference]: Without dead ends: 418 [2025-03-17 01:37:05,091 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 01:37:05,092 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 146 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 01:37:05,092 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 343 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 01:37:05,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2025-03-17 01:37:05,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 335. [2025-03-17 01:37:05,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 293 states have (on average 1.47098976109215) internal successors, (431), 293 states have internal predecessors, (431), 40 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-17 01:37:05,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 511 transitions. [2025-03-17 01:37:05,104 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 511 transitions. Word has length 259 [2025-03-17 01:37:05,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:37:05,104 INFO L471 AbstractCegarLoop]: Abstraction has 335 states and 511 transitions. [2025-03-17 01:37:05,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-17 01:37:05,104 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 511 transitions. [2025-03-17 01:37:05,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2025-03-17 01:37:05,106 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:37:05,106 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:37:05,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 01:37:05,106 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:37:05,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:37:05,107 INFO L85 PathProgramCache]: Analyzing trace with hash -2117196169, now seen corresponding path program 1 times [2025-03-17 01:37:05,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:37:05,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148042138] [2025-03-17 01:37:05,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:37:05,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:37:05,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 260 statements into 1 equivalence classes. [2025-03-17 01:37:05,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 260 of 260 statements. [2025-03-17 01:37:05,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:37:05,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:37:05,267 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2025-03-17 01:37:05,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:37:05,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148042138] [2025-03-17 01:37:05,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148042138] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:37:05,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:37:05,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 01:37:05,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427182017] [2025-03-17 01:37:05,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:37:05,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 01:37:05,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:37:05,269 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 01:37:05,269 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 01:37:05,270 INFO L87 Difference]: Start difference. First operand 335 states and 511 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-17 01:37:05,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:37:05,882 INFO L93 Difference]: Finished difference Result 1081 states and 1657 transitions. [2025-03-17 01:37:05,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 01:37:05,883 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 260 [2025-03-17 01:37:05,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:37:05,886 INFO L225 Difference]: With dead ends: 1081 [2025-03-17 01:37:05,886 INFO L226 Difference]: Without dead ends: 747 [2025-03-17 01:37:05,887 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-17 01:37:05,888 INFO L435 NwaCegarLoop]: 280 mSDtfsCounter, 532 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 613 mSolverCounterSat, 162 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 532 SdHoareTripleChecker+Valid, 639 SdHoareTripleChecker+Invalid, 775 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 162 IncrementalHoareTripleChecker+Valid, 613 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 01:37:05,889 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [532 Valid, 639 Invalid, 775 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [162 Valid, 613 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 01:37:05,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 747 states. [2025-03-17 01:37:05,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 747 to 388. [2025-03-17 01:37:05,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 388 states, 346 states have (on average 1.4653179190751444) internal successors, (507), 346 states have internal predecessors, (507), 40 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-17 01:37:05,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 587 transitions. [2025-03-17 01:37:05,911 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 587 transitions. Word has length 260 [2025-03-17 01:37:05,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:37:05,912 INFO L471 AbstractCegarLoop]: Abstraction has 388 states and 587 transitions. [2025-03-17 01:37:05,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-17 01:37:05,913 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 587 transitions. [2025-03-17 01:37:05,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2025-03-17 01:37:05,915 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:37:05,915 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:37:05,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 01:37:05,915 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:37:05,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:37:05,916 INFO L85 PathProgramCache]: Analyzing trace with hash 1884368120, now seen corresponding path program 1 times [2025-03-17 01:37:05,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:37:05,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285431323] [2025-03-17 01:37:05,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:37:05,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:37:05,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 260 statements into 1 equivalence classes. [2025-03-17 01:37:05,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 260 of 260 statements. [2025-03-17 01:37:05,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:37:05,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:37:06,238 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2025-03-17 01:37:06,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:37:06,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285431323] [2025-03-17 01:37:06,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285431323] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:37:06,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:37:06,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 01:37:06,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628137164] [2025-03-17 01:37:06,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:37:06,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 01:37:06,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:37:06,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 01:37:06,240 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-17 01:37:06,240 INFO L87 Difference]: Start difference. First operand 388 states and 587 transitions. Second operand has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-17 01:37:06,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:37:06,430 INFO L93 Difference]: Finished difference Result 873 states and 1311 transitions. [2025-03-17 01:37:06,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 01:37:06,430 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 260 [2025-03-17 01:37:06,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:37:06,433 INFO L225 Difference]: With dead ends: 873 [2025-03-17 01:37:06,433 INFO L226 Difference]: Without dead ends: 486 [2025-03-17 01:37:06,435 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-03-17 01:37:06,435 INFO L435 NwaCegarLoop]: 222 mSDtfsCounter, 119 mSDsluCounter, 907 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 1129 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 01:37:06,436 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 1129 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 01:37:06,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2025-03-17 01:37:06,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 366. [2025-03-17 01:37:06,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 324 states have (on average 1.4537037037037037) internal successors, (471), 324 states have internal predecessors, (471), 40 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-17 01:37:06,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 551 transitions. [2025-03-17 01:37:06,451 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 551 transitions. Word has length 260 [2025-03-17 01:37:06,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:37:06,452 INFO L471 AbstractCegarLoop]: Abstraction has 366 states and 551 transitions. [2025-03-17 01:37:06,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-17 01:37:06,453 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 551 transitions. [2025-03-17 01:37:06,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2025-03-17 01:37:06,454 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:37:06,454 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:37:06,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 01:37:06,454 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:37:06,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:37:06,455 INFO L85 PathProgramCache]: Analyzing trace with hash 410722745, now seen corresponding path program 1 times [2025-03-17 01:37:06,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:37:06,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579884615] [2025-03-17 01:37:06,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:37:06,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:37:06,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 260 statements into 1 equivalence classes. [2025-03-17 01:37:06,477 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 260 of 260 statements. [2025-03-17 01:37:06,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:37:06,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:37:06,514 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2025-03-17 01:37:06,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:37:06,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579884615] [2025-03-17 01:37:06,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579884615] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:37:06,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:37:06,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 01:37:06,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201631772] [2025-03-17 01:37:06,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:37:06,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 01:37:06,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:37:06,516 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 01:37:06,516 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 01:37:06,516 INFO L87 Difference]: Start difference. First operand 366 states and 551 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-17 01:37:06,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:37:06,567 INFO L93 Difference]: Finished difference Result 822 states and 1238 transitions. [2025-03-17 01:37:06,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 01:37:06,567 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 260 [2025-03-17 01:37:06,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:37:06,570 INFO L225 Difference]: With dead ends: 822 [2025-03-17 01:37:06,570 INFO L226 Difference]: Without dead ends: 457 [2025-03-17 01:37:06,572 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 01:37:06,573 INFO L435 NwaCegarLoop]: 302 mSDtfsCounter, 149 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 01:37:06,573 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 470 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 01:37:06,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2025-03-17 01:37:06,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 326. [2025-03-17 01:37:06,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 284 states have (on average 1.454225352112676) internal successors, (413), 284 states have internal predecessors, (413), 40 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-17 01:37:06,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 493 transitions. [2025-03-17 01:37:06,590 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 493 transitions. Word has length 260 [2025-03-17 01:37:06,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:37:06,591 INFO L471 AbstractCegarLoop]: Abstraction has 326 states and 493 transitions. [2025-03-17 01:37:06,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-17 01:37:06,592 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 493 transitions. [2025-03-17 01:37:06,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2025-03-17 01:37:06,593 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:37:06,594 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:37:06,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 01:37:06,594 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:37:06,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:37:06,594 INFO L85 PathProgramCache]: Analyzing trace with hash -747125037, now seen corresponding path program 1 times [2025-03-17 01:37:06,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:37:06,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504796922] [2025-03-17 01:37:06,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:37:06,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:37:06,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 260 statements into 1 equivalence classes. [2025-03-17 01:37:06,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 260 of 260 statements. [2025-03-17 01:37:06,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:37:06,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:37:07,418 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2025-03-17 01:37:07,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:37:07,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504796922] [2025-03-17 01:37:07,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504796922] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:37:07,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:37:07,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 01:37:07,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448710306] [2025-03-17 01:37:07,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:37:07,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 01:37:07,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:37:07,420 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 01:37:07,420 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-17 01:37:07,420 INFO L87 Difference]: Start difference. First operand 326 states and 493 transitions. Second operand has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-17 01:37:07,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:37:07,831 INFO L93 Difference]: Finished difference Result 944 states and 1409 transitions. [2025-03-17 01:37:07,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 01:37:07,831 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 260 [2025-03-17 01:37:07,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:37:07,834 INFO L225 Difference]: With dead ends: 944 [2025-03-17 01:37:07,834 INFO L226 Difference]: Without dead ends: 619 [2025-03-17 01:37:07,835 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-17 01:37:07,836 INFO L435 NwaCegarLoop]: 188 mSDtfsCounter, 356 mSDsluCounter, 809 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 356 SdHoareTripleChecker+Valid, 997 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 01:37:07,836 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [356 Valid, 997 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 01:37:07,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2025-03-17 01:37:07,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 605. [2025-03-17 01:37:07,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 605 states, 554 states have (on average 1.46028880866426) internal successors, (809), 556 states have internal predecessors, (809), 46 states have call successors, (46), 4 states have call predecessors, (46), 4 states have return successors, (46), 44 states have call predecessors, (46), 46 states have call successors, (46) [2025-03-17 01:37:07,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 901 transitions. [2025-03-17 01:37:07,875 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 901 transitions. Word has length 260 [2025-03-17 01:37:07,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:37:07,875 INFO L471 AbstractCegarLoop]: Abstraction has 605 states and 901 transitions. [2025-03-17 01:37:07,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-17 01:37:07,875 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 901 transitions. [2025-03-17 01:37:07,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2025-03-17 01:37:07,877 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:37:07,877 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:37:07,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 01:37:07,877 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:37:07,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:37:07,878 INFO L85 PathProgramCache]: Analyzing trace with hash -1755922180, now seen corresponding path program 1 times [2025-03-17 01:37:07,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:37:07,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396324470] [2025-03-17 01:37:07,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:37:07,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:37:07,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 260 statements into 1 equivalence classes. [2025-03-17 01:37:07,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 260 of 260 statements. [2025-03-17 01:37:07,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:37:07,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:37:08,020 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2025-03-17 01:37:08,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:37:08,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396324470] [2025-03-17 01:37:08,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396324470] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:37:08,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:37:08,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 01:37:08,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910080242] [2025-03-17 01:37:08,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:37:08,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 01:37:08,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:37:08,021 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 01:37:08,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 01:37:08,022 INFO L87 Difference]: Start difference. First operand 605 states and 901 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-17 01:37:08,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:37:08,203 INFO L93 Difference]: Finished difference Result 1253 states and 1875 transitions. [2025-03-17 01:37:08,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 01:37:08,204 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 260 [2025-03-17 01:37:08,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:37:08,208 INFO L225 Difference]: With dead ends: 1253 [2025-03-17 01:37:08,208 INFO L226 Difference]: Without dead ends: 649 [2025-03-17 01:37:08,209 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 01:37:08,209 INFO L435 NwaCegarLoop]: 311 mSDtfsCounter, 368 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 368 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 01:37:08,210 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [368 Valid, 389 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 01:37:08,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2025-03-17 01:37:08,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 517. [2025-03-17 01:37:08,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 517 states, 466 states have (on average 1.4527896995708154) internal successors, (677), 468 states have internal predecessors, (677), 46 states have call successors, (46), 4 states have call predecessors, (46), 4 states have return successors, (46), 44 states have call predecessors, (46), 46 states have call successors, (46) [2025-03-17 01:37:08,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 769 transitions. [2025-03-17 01:37:08,236 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 769 transitions. Word has length 260 [2025-03-17 01:37:08,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:37:08,236 INFO L471 AbstractCegarLoop]: Abstraction has 517 states and 769 transitions. [2025-03-17 01:37:08,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-17 01:37:08,236 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 769 transitions. [2025-03-17 01:37:08,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2025-03-17 01:37:08,238 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:37:08,238 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:37:08,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-17 01:37:08,238 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:37:08,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:37:08,238 INFO L85 PathProgramCache]: Analyzing trace with hash -504841306, now seen corresponding path program 1 times [2025-03-17 01:37:08,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:37:08,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883767325] [2025-03-17 01:37:08,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:37:08,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:37:08,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 260 statements into 1 equivalence classes. [2025-03-17 01:37:08,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 260 of 260 statements. [2025-03-17 01:37:08,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:37:08,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:37:08,509 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2025-03-17 01:37:08,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:37:08,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883767325] [2025-03-17 01:37:08,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883767325] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:37:08,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:37:08,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 01:37:08,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804694784] [2025-03-17 01:37:08,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:37:08,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 01:37:08,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:37:08,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 01:37:08,510 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 01:37:08,510 INFO L87 Difference]: Start difference. First operand 517 states and 769 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-17 01:37:08,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:37:08,739 INFO L93 Difference]: Finished difference Result 1319 states and 1967 transitions. [2025-03-17 01:37:08,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 01:37:08,740 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 260 [2025-03-17 01:37:08,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:37:08,743 INFO L225 Difference]: With dead ends: 1319 [2025-03-17 01:37:08,743 INFO L226 Difference]: Without dead ends: 803 [2025-03-17 01:37:08,744 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-17 01:37:08,745 INFO L435 NwaCegarLoop]: 176 mSDtfsCounter, 148 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 617 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 01:37:08,745 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 617 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 01:37:08,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 803 states. [2025-03-17 01:37:08,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 803 to 592. [2025-03-17 01:37:08,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 592 states, 499 states have (on average 1.4228456913827656) internal successors, (710), 501 states have internal predecessors, (710), 86 states have call successors, (86), 6 states have call predecessors, (86), 6 states have return successors, (86), 84 states have call predecessors, (86), 86 states have call successors, (86) [2025-03-17 01:37:08,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 882 transitions. [2025-03-17 01:37:08,799 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 882 transitions. Word has length 260 [2025-03-17 01:37:08,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:37:08,799 INFO L471 AbstractCegarLoop]: Abstraction has 592 states and 882 transitions. [2025-03-17 01:37:08,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-17 01:37:08,799 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 882 transitions. [2025-03-17 01:37:08,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2025-03-17 01:37:08,801 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:37:08,801 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:37:08,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-17 01:37:08,802 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:37:08,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:37:08,802 INFO L85 PathProgramCache]: Analyzing trace with hash 1364165332, now seen corresponding path program 1 times [2025-03-17 01:37:08,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:37:08,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702400083] [2025-03-17 01:37:08,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:37:08,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:37:08,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 260 statements into 1 equivalence classes. [2025-03-17 01:37:08,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 260 of 260 statements. [2025-03-17 01:37:08,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:37:08,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 01:37:08,884 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 01:37:08,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 260 statements into 1 equivalence classes. [2025-03-17 01:37:08,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 260 of 260 statements. [2025-03-17 01:37:08,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:37:08,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 01:37:09,056 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 01:37:09,056 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 01:37:09,057 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 01:37:09,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-17 01:37:09,060 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:37:09,187 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 01:37:09,190 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 01:37:09 BoogieIcfgContainer [2025-03-17 01:37:09,190 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 01:37:09,191 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 01:37:09,191 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 01:37:09,191 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 01:37:09,191 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 01:36:55" (3/4) ... [2025-03-17 01:37:09,192 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 01:37:09,193 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 01:37:09,193 INFO L158 Benchmark]: Toolchain (without parser) took 14179.49ms. Allocated memory was 167.8MB in the beginning and 444.6MB in the end (delta: 276.8MB). Free memory was 127.9MB in the beginning and 270.7MB in the end (delta: -142.7MB). Peak memory consumption was 131.0MB. Max. memory is 16.1GB. [2025-03-17 01:37:09,195 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 126.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 01:37:09,195 INFO L158 Benchmark]: CACSL2BoogieTranslator took 281.28ms. Allocated memory is still 167.8MB. Free memory was 127.5MB in the beginning and 110.9MB in the end (delta: 16.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 01:37:09,195 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.72ms. Allocated memory is still 167.8MB. Free memory was 110.9MB in the beginning and 106.3MB in the end (delta: 4.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 01:37:09,195 INFO L158 Benchmark]: Boogie Preprocessor took 66.77ms. Allocated memory is still 167.8MB. Free memory was 106.3MB in the beginning and 100.7MB in the end (delta: 5.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 01:37:09,196 INFO L158 Benchmark]: IcfgBuilder took 517.22ms. Allocated memory is still 167.8MB. Free memory was 100.7MB in the beginning and 66.1MB in the end (delta: 34.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-17 01:37:09,196 INFO L158 Benchmark]: TraceAbstraction took 13248.49ms. Allocated memory was 167.8MB in the beginning and 444.6MB in the end (delta: 276.8MB). Free memory was 65.6MB in the beginning and 270.7MB in the end (delta: -205.0MB). Peak memory consumption was 63.9MB. Max. memory is 16.1GB. [2025-03-17 01:37:09,197 INFO L158 Benchmark]: Witness Printer took 2.29ms. Allocated memory is still 444.6MB. Free memory is still 270.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 01:37:09,198 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.18ms. Allocated memory is still 201.3MB. Free memory is still 126.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 281.28ms. Allocated memory is still 167.8MB. Free memory was 127.5MB in the beginning and 110.9MB in the end (delta: 16.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.72ms. Allocated memory is still 167.8MB. Free memory was 110.9MB in the beginning and 106.3MB in the end (delta: 4.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 66.77ms. Allocated memory is still 167.8MB. Free memory was 106.3MB in the beginning and 100.7MB in the end (delta: 5.6MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 517.22ms. Allocated memory is still 167.8MB. Free memory was 100.7MB in the beginning and 66.1MB in the end (delta: 34.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 13248.49ms. Allocated memory was 167.8MB in the beginning and 444.6MB in the end (delta: 276.8MB). Free memory was 65.6MB in the beginning and 270.7MB in the end (delta: -205.0MB). Peak memory consumption was 63.9MB. Max. memory is 16.1GB. * Witness Printer took 2.29ms. Allocated memory is still 444.6MB. Free memory is still 270.7MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 222, overapproximation of someUnaryDOUBLEoperation at line 52, overapproximation of someBinaryDOUBLEComparisonOperation at line 199, overapproximation of someBinaryDOUBLEComparisonOperation at line 101, overapproximation of someBinaryDOUBLEComparisonOperation at line 105, overapproximation of someBinaryDOUBLEComparisonOperation at line 167, overapproximation of someBinaryDOUBLEComparisonOperation at line 116, overapproximation of someBinaryDOUBLEComparisonOperation at line 163, overapproximation of someBinaryDOUBLEComparisonOperation at line 222, overapproximation of someBinaryDOUBLEComparisonOperation at line 171, overapproximation of someBinaryDOUBLEComparisonOperation at line 85, overapproximation of someBinaryDOUBLEComparisonOperation at line 201, overapproximation of someBinaryDOUBLEComparisonOperation at line 165, overapproximation of someBinaryDOUBLEComparisonOperation at line 161, overapproximation of someBinaryDOUBLEComparisonOperation at line 197, overapproximation of someBinaryDOUBLEComparisonOperation at line 169, overapproximation of someBinaryDOUBLEComparisonOperation at line 203. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = 64; [L23] unsigned char var_1_7 = 0; [L24] unsigned short int var_1_11 = 500; [L25] unsigned char var_1_13 = 64; [L26] unsigned char var_1_15 = 1; [L27] unsigned char var_1_16 = 8; [L28] double var_1_17 = 7.5; [L29] double var_1_18 = 31.125; [L30] double var_1_19 = 10.5; [L31] double var_1_20 = 0.0; [L32] double var_1_21 = 16.75; [L33] double var_1_22 = 2.5; [L34] double var_1_23 = 64.5; [L35] signed long int var_1_24 = 10; [L36] signed char var_1_26 = 16; [L37] signed char var_1_27 = 4; [L38] signed char var_1_28 = -10; [L39] float var_1_29 = 63.794; [L40] unsigned short int var_1_30 = 1; [L41] signed long int var_1_31 = -2; [L42] unsigned char var_1_32 = 64; [L43] unsigned char var_1_33 = 8; [L44] unsigned long int var_1_34 = 128; [L45] unsigned long int var_1_35 = 50; [L46] unsigned long int var_1_36 = 16; [L47] unsigned long int var_1_37 = 4; [L48] unsigned char var_1_38 = 8; [L49] unsigned char var_1_39 = 10; [L50] double var_1_40 = 8.35; [L51] double var_1_41 = 63.75; [L52] double var_1_42 = -0.125; [L53] double var_1_43 = -0.8; [L54] double var_1_44 = -0.5; [L55] unsigned short int var_1_45 = 50; [L56] unsigned char var_1_46 = 0; [L57] unsigned char var_1_47 = 5; [L58] unsigned char var_1_48 = 1; [L59] signed char var_1_49 = -16; [L60] signed char var_1_50 = 2; [L61] signed char var_1_51 = 16; [L62] signed char var_1_52 = 0; [L63] signed long int var_1_53 = 256; [L64] double var_1_54 = 1.25; [L65] unsigned long int var_1_55 = 5; [L66] signed long int last_1_var_1_1 = 64; [L67] unsigned char last_1_var_1_13 = 64; [L226] isInitial = 1 [L227] FCALL initially() [L228] COND TRUE 1 [L229] CALL updateLastVariables() [L218] last_1_var_1_1 = var_1_1 [L219] last_1_var_1_13 = var_1_13 [L229] RET updateLastVariables() [L230] CALL updateVariables() [L151] var_1_7 = __VERIFIER_nondet_uchar() [L152] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_34=128, var_1_35=50, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_34=128, var_1_35=50, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5] [L152] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_34=128, var_1_35=50, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5] [L153] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_34=128, var_1_35=50, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_34=128, var_1_35=50, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L153] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_34=128, var_1_35=50, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L154] var_1_15 = __VERIFIER_nondet_uchar() [L155] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_34=128, var_1_35=50, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_34=128, var_1_35=50, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L155] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_34=128, var_1_35=50, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L156] CALL assume_abort_if_not(var_1_15 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_34=128, var_1_35=50, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_34=128, var_1_35=50, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L156] RET assume_abort_if_not(var_1_15 <= 254) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_34=128, var_1_35=50, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L157] var_1_16 = __VERIFIER_nondet_uchar() [L158] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_34=128, var_1_35=50, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_34=128, var_1_35=50, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L158] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_34=128, var_1_35=50, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L159] CALL assume_abort_if_not(var_1_16 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=-256, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_34=128, var_1_35=50, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=-256, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_34=128, var_1_35=50, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L159] RET assume_abort_if_not(var_1_16 <= 254) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=-256, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_34=128, var_1_35=50, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L160] var_1_18 = __VERIFIER_nondet_double() [L161] CALL assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=-256, var_1_17=15/2, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_34=128, var_1_35=50, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=-256, var_1_17=15/2, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_34=128, var_1_35=50, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L161] RET assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=-256, var_1_17=15/2, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_34=128, var_1_35=50, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L162] var_1_19 = __VERIFIER_nondet_double() [L163] CALL assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_34=128, var_1_35=50, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_34=128, var_1_35=50, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L163] RET assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_34=128, var_1_35=50, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L164] var_1_20 = __VERIFIER_nondet_double() [L165] CALL assume_abort_if_not((var_1_20 >= 4611686.018427382800e+12F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_34=128, var_1_35=50, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_34=128, var_1_35=50, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L165] RET assume_abort_if_not((var_1_20 >= 4611686.018427382800e+12F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_34=128, var_1_35=50, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L166] var_1_21 = __VERIFIER_nondet_double() [L167] CALL assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 4611686.018427382800e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_34=128, var_1_35=50, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_34=128, var_1_35=50, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L167] RET assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 4611686.018427382800e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_34=128, var_1_35=50, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L168] var_1_22 = __VERIFIER_nondet_double() [L169] CALL assume_abort_if_not((var_1_22 >= -922337.2036854765600e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_34=128, var_1_35=50, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_34=128, var_1_35=50, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L169] RET assume_abort_if_not((var_1_22 >= -922337.2036854765600e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_34=128, var_1_35=50, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L170] var_1_23 = __VERIFIER_nondet_double() [L171] CALL assume_abort_if_not((var_1_23 >= -922337.2036854765600e+13F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 9223372.036854765600e+12F && var_1_23 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_34=128, var_1_35=50, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_34=128, var_1_35=50, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L171] RET assume_abort_if_not((var_1_23 >= -922337.2036854765600e+13F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 9223372.036854765600e+12F && var_1_23 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_34=128, var_1_35=50, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L172] var_1_27 = __VERIFIER_nondet_char() [L173] CALL assume_abort_if_not(var_1_27 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_34=128, var_1_35=50, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_34=128, var_1_35=50, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L173] RET assume_abort_if_not(var_1_27 >= -63) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_34=128, var_1_35=50, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L174] CALL assume_abort_if_not(var_1_27 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_34=128, var_1_35=50, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_34=128, var_1_35=50, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L174] RET assume_abort_if_not(var_1_27 <= 63) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_34=128, var_1_35=50, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L175] var_1_28 = __VERIFIER_nondet_char() [L176] CALL assume_abort_if_not(var_1_28 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_34=128, var_1_35=50, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_34=128, var_1_35=50, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L176] RET assume_abort_if_not(var_1_28 >= -63) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_34=128, var_1_35=50, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L177] CALL assume_abort_if_not(var_1_28 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_34=128, var_1_35=50, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_34=128, var_1_35=50, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L177] RET assume_abort_if_not(var_1_28 <= 63) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_34=128, var_1_35=50, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L178] var_1_34 = __VERIFIER_nondet_ulong() [L179] CALL assume_abort_if_not(var_1_34 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_35=50, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_35=50, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L179] RET assume_abort_if_not(var_1_34 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_35=50, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L180] CALL assume_abort_if_not(var_1_34 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_35=50, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_35=50, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L180] RET assume_abort_if_not(var_1_34 <= 4294967295) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_35=50, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L181] var_1_35 = __VERIFIER_nondet_ulong() [L182] CALL assume_abort_if_not(var_1_35 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L182] RET assume_abort_if_not(var_1_35 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L183] CALL assume_abort_if_not(var_1_35 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L183] RET assume_abort_if_not(var_1_35 <= 4294967295) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L184] var_1_36 = __VERIFIER_nondet_ulong() [L185] CALL assume_abort_if_not(var_1_36 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L185] RET assume_abort_if_not(var_1_36 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L186] CALL assume_abort_if_not(var_1_36 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L186] RET assume_abort_if_not(var_1_36 <= 4294967295) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L187] var_1_37 = __VERIFIER_nondet_ulong() [L188] CALL assume_abort_if_not(var_1_37 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L188] RET assume_abort_if_not(var_1_37 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L189] CALL assume_abort_if_not(var_1_37 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L189] RET assume_abort_if_not(var_1_37 <= 4294967295) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L190] var_1_38 = __VERIFIER_nondet_uchar() [L191] CALL assume_abort_if_not(var_1_38 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L191] RET assume_abort_if_not(var_1_38 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L192] CALL assume_abort_if_not(var_1_38 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=-224, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=-224, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L192] RET assume_abort_if_not(var_1_38 <= 254) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=-224, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L193] var_1_39 = __VERIFIER_nondet_uchar() [L194] CALL assume_abort_if_not(var_1_39 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=-224, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=-224, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L194] RET assume_abort_if_not(var_1_39 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=-224, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L195] CALL assume_abort_if_not(var_1_39 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=-224, var_1_39=31, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=-224, var_1_39=31, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L195] RET assume_abort_if_not(var_1_39 <= 254) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=-224, var_1_39=31, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L196] var_1_41 = __VERIFIER_nondet_double() [L197] CALL assume_abort_if_not((var_1_41 >= -922337.2036854765600e+13F && var_1_41 <= -1.0e-20F) || (var_1_41 <= 9223372.036854765600e+12F && var_1_41 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=-224, var_1_39=31, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=-224, var_1_39=31, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L197] RET assume_abort_if_not((var_1_41 >= -922337.2036854765600e+13F && var_1_41 <= -1.0e-20F) || (var_1_41 <= 9223372.036854765600e+12F && var_1_41 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=-224, var_1_39=31, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L198] var_1_42 = __VERIFIER_nondet_double() [L199] CALL assume_abort_if_not((var_1_42 >= -922337.2036854765600e+13F && var_1_42 <= -1.0e-20F) || (var_1_42 <= 9223372.036854765600e+12F && var_1_42 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=-224, var_1_39=31, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=-224, var_1_39=31, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L199] RET assume_abort_if_not((var_1_42 >= -922337.2036854765600e+13F && var_1_42 <= -1.0e-20F) || (var_1_42 <= 9223372.036854765600e+12F && var_1_42 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=-224, var_1_39=31, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L200] var_1_43 = __VERIFIER_nondet_double() [L201] CALL assume_abort_if_not((var_1_43 >= -461168.6018427382800e+13F && var_1_43 <= -1.0e-20F) || (var_1_43 <= 4611686.018427382800e+12F && var_1_43 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=-224, var_1_39=31, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=-224, var_1_39=31, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L201] RET assume_abort_if_not((var_1_43 >= -461168.6018427382800e+13F && var_1_43 <= -1.0e-20F) || (var_1_43 <= 4611686.018427382800e+12F && var_1_43 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=-224, var_1_39=31, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L202] var_1_44 = __VERIFIER_nondet_double() [L203] CALL assume_abort_if_not((var_1_44 >= -461168.6018427382800e+13F && var_1_44 <= -1.0e-20F) || (var_1_44 <= 4611686.018427382800e+12F && var_1_44 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=-224, var_1_39=31, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=-224, var_1_39=31, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L203] RET assume_abort_if_not((var_1_44 >= -461168.6018427382800e+13F && var_1_44 <= -1.0e-20F) || (var_1_44 <= 4611686.018427382800e+12F && var_1_44 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=-224, var_1_39=31, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L204] var_1_47 = __VERIFIER_nondet_uchar() [L205] CALL assume_abort_if_not(var_1_47 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=-224, var_1_39=31, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=-224, var_1_39=31, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L205] RET assume_abort_if_not(var_1_47 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=-224, var_1_39=31, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L206] CALL assume_abort_if_not(var_1_47 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=-224, var_1_39=31, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=-224, var_1_39=31, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L206] RET assume_abort_if_not(var_1_47 <= 127) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=-224, var_1_39=31, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L207] var_1_50 = __VERIFIER_nondet_char() [L208] CALL assume_abort_if_not(var_1_50 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=-224, var_1_39=31, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=0, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=-224, var_1_39=31, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=0, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L208] RET assume_abort_if_not(var_1_50 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=-224, var_1_39=31, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=0, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L209] CALL assume_abort_if_not(var_1_50 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=-224, var_1_39=31, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=0, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=-224, var_1_39=31, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=0, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L209] RET assume_abort_if_not(var_1_50 <= 63) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=-224, var_1_39=31, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=0, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L210] var_1_51 = __VERIFIER_nondet_char() [L211] CALL assume_abort_if_not(var_1_51 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=-224, var_1_39=31, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=0, var_1_51=63, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=-224, var_1_39=31, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=0, var_1_51=63, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L211] RET assume_abort_if_not(var_1_51 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=-224, var_1_39=31, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=0, var_1_51=63, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L212] CALL assume_abort_if_not(var_1_51 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=-224, var_1_39=31, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=0, var_1_51=63, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=-224, var_1_39=31, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=0, var_1_51=63, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L212] RET assume_abort_if_not(var_1_51 <= 63) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=-224, var_1_39=31, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=0, var_1_51=63, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L213] var_1_52 = __VERIFIER_nondet_char() [L214] CALL assume_abort_if_not(var_1_52 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=-224, var_1_39=31, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=0, var_1_51=63, var_1_52=-63, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=-224, var_1_39=31, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=0, var_1_51=63, var_1_52=-63, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L214] RET assume_abort_if_not(var_1_52 >= -63) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=-224, var_1_39=31, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=0, var_1_51=63, var_1_52=-63, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L215] CALL assume_abort_if_not(var_1_52 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=-224, var_1_39=31, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=0, var_1_51=63, var_1_52=-63, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=-224, var_1_39=31, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=0, var_1_51=63, var_1_52=-63, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L215] RET assume_abort_if_not(var_1_52 <= 63) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=-224, var_1_39=31, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=0, var_1_51=63, var_1_52=-63, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L230] RET updateVariables() [L231] CALL step() [L71] signed long int stepLocal_1 = last_1_var_1_1; VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=-224, var_1_39=31, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=0, var_1_51=63, var_1_52=-63, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L72] COND FALSE !(stepLocal_1 != last_1_var_1_13) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=-224, var_1_39=31, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=0, var_1_51=63, var_1_52=-63, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L75] var_1_31 = var_1_13 [L76] var_1_55 = var_1_46 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=64, var_1_32=64, var_1_33=8, var_1_38=-224, var_1_39=31, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=0, var_1_51=63, var_1_52=-63, var_1_53=256, var_1_54=5/4, var_1_55=0, var_1_7=0] [L77] COND FALSE !(\read(var_1_7)) [L80] var_1_17 = var_1_22 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=-256, var_1_17=505, var_1_1=64, var_1_22=505, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=64, var_1_32=64, var_1_33=8, var_1_38=-224, var_1_39=31, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=0, var_1_51=63, var_1_52=-63, var_1_53=256, var_1_54=5/4, var_1_55=0, var_1_7=0] [L82] COND FALSE !(\read(var_1_7)) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=-256, var_1_17=505, var_1_1=64, var_1_22=505, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=64, var_1_32=64, var_1_33=8, var_1_38=-224, var_1_39=31, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=0, var_1_51=63, var_1_52=-63, var_1_53=256, var_1_54=5/4, var_1_55=0, var_1_7=0] [L85] COND FALSE !(var_1_44 > (var_1_43 + var_1_41)) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=-256, var_1_17=505, var_1_1=64, var_1_22=505, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=64, var_1_32=64, var_1_33=8, var_1_38=-224, var_1_39=31, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=0, var_1_51=63, var_1_52=-63, var_1_53=256, var_1_54=5/4, var_1_55=0, var_1_7=0] [L92] var_1_48 = var_1_39 [L93] var_1_32 = var_1_16 [L94] var_1_54 = var_1_44 [L95] var_1_30 = var_1_32 [L96] unsigned char stepLocal_0 = var_1_13; VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_0=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=-256, var_1_17=505, var_1_1=64, var_1_22=505, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=-256, var_1_33=8, var_1_38=-224, var_1_39=31, var_1_40=167/20, var_1_44=506, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=31, var_1_49=-16, var_1_50=0, var_1_51=63, var_1_52=-63, var_1_53=256, var_1_54=506, var_1_55=0, var_1_7=0] [L97] EXPR var_1_32 >> var_1_32 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_0=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=-256, var_1_17=505, var_1_1=64, var_1_22=505, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=-256, var_1_33=8, var_1_38=-224, var_1_39=31, var_1_40=167/20, var_1_44=506, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=31, var_1_49=-16, var_1_50=0, var_1_51=63, var_1_52=-63, var_1_53=256, var_1_54=506, var_1_55=0, var_1_7=0] [L97] COND TRUE (var_1_32 >> var_1_32) < stepLocal_0 [L98] var_1_11 = var_1_32 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=1, var_1_16=-256, var_1_17=505, var_1_1=64, var_1_22=505, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=-256, var_1_33=8, var_1_38=-224, var_1_39=31, var_1_40=167/20, var_1_44=506, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=31, var_1_49=-16, var_1_50=0, var_1_51=63, var_1_52=-63, var_1_53=256, var_1_54=506, var_1_55=0, var_1_7=0] [L100] COND TRUE (-32 & var_1_38) > var_1_35 [L101] var_1_40 = ((((var_1_41) > (var_1_42)) ? (var_1_41) : (var_1_42))) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=1, var_1_16=-256, var_1_17=505, var_1_1=64, var_1_22=505, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=-256, var_1_33=8, var_1_35=0, var_1_38=-224, var_1_39=31, var_1_40=507, var_1_41=507, var_1_42=507, var_1_44=506, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=31, var_1_49=-16, var_1_50=0, var_1_51=63, var_1_52=-63, var_1_53=256, var_1_54=506, var_1_55=0, var_1_7=0] [L105] COND TRUE var_1_44 >= ((((var_1_41) < 0 ) ? -(var_1_41) : (var_1_41))) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=1, var_1_16=-256, var_1_17=505, var_1_1=64, var_1_22=505, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=-256, var_1_33=8, var_1_35=0, var_1_38=-224, var_1_39=31, var_1_40=507, var_1_41=507, var_1_42=507, var_1_44=506, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=31, var_1_49=-16, var_1_50=0, var_1_51=63, var_1_52=-63, var_1_53=256, var_1_54=506, var_1_55=0, var_1_7=0] [L106] COND FALSE !(var_1_36 > var_1_34) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=1, var_1_16=-256, var_1_17=505, var_1_1=64, var_1_22=505, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=-256, var_1_33=8, var_1_34=0, var_1_35=0, var_1_36=-4294967296, var_1_38=-224, var_1_39=31, var_1_40=507, var_1_41=507, var_1_42=507, var_1_44=506, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=31, var_1_49=-16, var_1_50=0, var_1_51=63, var_1_52=-63, var_1_53=256, var_1_54=506, var_1_55=0, var_1_7=0] [L116] COND TRUE var_1_41 < var_1_40 [L117] var_1_49 = ((var_1_50 - var_1_51) + var_1_52) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=1, var_1_16=-256, var_1_17=505, var_1_1=64, var_1_22=505, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=-256, var_1_33=8, var_1_34=0, var_1_35=0, var_1_36=-4294967296, var_1_38=-224, var_1_39=31, var_1_40=507, var_1_41=507, var_1_42=507, var_1_44=506, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=31, var_1_49=-126, var_1_50=0, var_1_51=63, var_1_52=-63, var_1_53=256, var_1_54=506, var_1_55=0, var_1_7=0] [L121] COND TRUE var_1_11 >= var_1_30 [L122] var_1_26 = (var_1_27 + var_1_28) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=1, var_1_16=-256, var_1_17=505, var_1_1=64, var_1_22=505, var_1_24=10, var_1_26=0, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=-256, var_1_33=8, var_1_34=0, var_1_35=0, var_1_36=-4294967296, var_1_38=-224, var_1_39=31, var_1_40=507, var_1_41=507, var_1_42=507, var_1_44=506, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=31, var_1_49=-126, var_1_50=0, var_1_51=63, var_1_52=-63, var_1_53=256, var_1_54=506, var_1_55=0, var_1_7=0] [L124] var_1_53 = var_1_33 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=1, var_1_16=-256, var_1_17=505, var_1_1=64, var_1_22=505, var_1_24=10, var_1_26=0, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=-256, var_1_33=8, var_1_34=0, var_1_35=0, var_1_36=-4294967296, var_1_38=-224, var_1_39=31, var_1_40=507, var_1_41=507, var_1_42=507, var_1_44=506, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=31, var_1_49=-126, var_1_50=0, var_1_51=63, var_1_52=-63, var_1_53=8, var_1_54=506, var_1_55=0, var_1_7=0] [L125] EXPR (var_1_31 + 4u) | var_1_30 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=1, var_1_16=-256, var_1_17=505, var_1_1=64, var_1_22=505, var_1_24=10, var_1_26=0, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=-256, var_1_33=8, var_1_34=0, var_1_35=0, var_1_36=-4294967296, var_1_38=-224, var_1_39=31, var_1_40=507, var_1_41=507, var_1_42=507, var_1_44=506, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=31, var_1_49=-126, var_1_50=0, var_1_51=63, var_1_52=-63, var_1_53=8, var_1_54=506, var_1_55=0, var_1_7=0] [L125] COND TRUE 32u < ((var_1_31 + 4u) | var_1_30) [L126] var_1_1 = (var_1_26 + (var_1_26 + var_1_32)) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=1, var_1_16=-256, var_1_17=505, var_1_1=0, var_1_22=505, var_1_24=10, var_1_26=0, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=-256, var_1_33=8, var_1_34=0, var_1_35=0, var_1_36=-4294967296, var_1_38=-224, var_1_39=31, var_1_40=507, var_1_41=507, var_1_42=507, var_1_44=506, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=31, var_1_49=-126, var_1_50=0, var_1_51=63, var_1_52=-63, var_1_53=8, var_1_54=506, var_1_55=0, var_1_7=0] [L134] unsigned short int stepLocal_2 = var_1_30; VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_2=0, var_1_11=0, var_1_13=64, var_1_15=1, var_1_16=-256, var_1_17=505, var_1_1=0, var_1_22=505, var_1_24=10, var_1_26=0, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=-256, var_1_33=8, var_1_34=0, var_1_35=0, var_1_36=-4294967296, var_1_38=-224, var_1_39=31, var_1_40=507, var_1_41=507, var_1_42=507, var_1_44=506, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=31, var_1_49=-126, var_1_50=0, var_1_51=63, var_1_52=-63, var_1_53=8, var_1_54=506, var_1_55=0, var_1_7=0] [L135] COND TRUE ! var_1_7 [L136] var_1_24 = (var_1_11 - ((((((((var_1_30) > (var_1_13)) ? (var_1_30) : (var_1_13)))) < ((var_1_30 + var_1_15))) ? (((((var_1_30) > (var_1_13)) ? (var_1_30) : (var_1_13)))) : ((var_1_30 + var_1_15))))) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_2=0, var_1_11=0, var_1_13=64, var_1_15=1, var_1_16=-256, var_1_17=505, var_1_1=0, var_1_22=505, var_1_24=-1, var_1_26=0, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=-256, var_1_33=8, var_1_34=0, var_1_35=0, var_1_36=-4294967296, var_1_38=-224, var_1_39=31, var_1_40=507, var_1_41=507, var_1_42=507, var_1_44=506, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=31, var_1_49=-126, var_1_50=0, var_1_51=63, var_1_52=-63, var_1_53=8, var_1_54=506, var_1_55=0, var_1_7=0] [L144] EXPR var_1_34 ^ var_1_35 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_2=0, var_1_11=0, var_1_13=64, var_1_15=1, var_1_16=-256, var_1_17=505, var_1_1=0, var_1_22=505, var_1_24=-1, var_1_26=0, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=-256, var_1_33=8, var_1_34=0, var_1_35=0, var_1_36=-4294967296, var_1_38=-224, var_1_39=31, var_1_40=507, var_1_41=507, var_1_42=507, var_1_44=506, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=31, var_1_49=-126, var_1_50=0, var_1_51=63, var_1_52=-63, var_1_53=8, var_1_54=506, var_1_55=0, var_1_7=0] [L144] EXPR var_1_36 | var_1_37 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_2=0, var_1_11=0, var_1_13=64, var_1_15=1, var_1_16=-256, var_1_17=505, var_1_1=0, var_1_22=505, var_1_24=-1, var_1_26=0, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=-256, var_1_33=8, var_1_34=0, var_1_35=0, var_1_36=-4294967296, var_1_37=-4294967295, var_1_38=-224, var_1_39=31, var_1_40=507, var_1_41=507, var_1_42=507, var_1_44=506, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=31, var_1_49=-126, var_1_50=0, var_1_51=63, var_1_52=-63, var_1_53=8, var_1_54=506, var_1_55=0, var_1_7=0] [L144] COND TRUE (var_1_34 ^ var_1_35) < (var_1_36 | var_1_37) [L145] var_1_33 = ((((var_1_38) > (var_1_39)) ? (var_1_38) : (var_1_39))) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_2=0, var_1_11=0, var_1_13=64, var_1_15=1, var_1_16=-256, var_1_17=505, var_1_1=0, var_1_22=505, var_1_24=-1, var_1_26=0, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=-256, var_1_33=32, var_1_34=0, var_1_35=0, var_1_36=-4294967296, var_1_37=-4294967295, var_1_38=-224, var_1_39=31, var_1_40=507, var_1_41=507, var_1_42=507, var_1_44=506, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=31, var_1_49=-126, var_1_50=0, var_1_51=63, var_1_52=-63, var_1_53=8, var_1_54=506, var_1_55=0, var_1_7=0] [L231] RET step() [L232] CALL, EXPR property() [L222] EXPR (var_1_31 + 4u) | var_1_30 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=1, var_1_16=-256, var_1_17=505, var_1_1=0, var_1_22=505, var_1_24=-1, var_1_26=0, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=-256, var_1_33=32, var_1_34=0, var_1_35=0, var_1_36=-4294967296, var_1_37=-4294967295, var_1_38=-224, var_1_39=31, var_1_40=507, var_1_41=507, var_1_42=507, var_1_44=506, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=31, var_1_49=-126, var_1_50=0, var_1_51=63, var_1_52=-63, var_1_53=8, var_1_54=506, var_1_55=0, var_1_7=0] [L222] EXPR ((32u < ((var_1_31 + 4u) | var_1_30)) ? (var_1_1 == ((signed long int) (var_1_26 + (var_1_26 + var_1_32)))) : ((! var_1_7) ? (var_1_1 == ((signed long int) ((((var_1_26) < ((var_1_11 - var_1_32))) ? (var_1_26) : ((var_1_11 - var_1_32)))))) : (var_1_1 == ((signed long int) (var_1_32 - var_1_13))))) && (((var_1_32 >> var_1_32) < var_1_13) ? (var_1_11 == ((unsigned short int) var_1_32)) : 1) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=1, var_1_16=-256, var_1_17=505, var_1_1=0, var_1_22=505, var_1_24=-1, var_1_26=0, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=-256, var_1_33=32, var_1_34=0, var_1_35=0, var_1_36=-4294967296, var_1_37=-4294967295, var_1_38=-224, var_1_39=31, var_1_40=507, var_1_41=507, var_1_42=507, var_1_44=506, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=31, var_1_49=-126, var_1_50=0, var_1_51=63, var_1_52=-63, var_1_53=8, var_1_54=506, var_1_55=0, var_1_7=0] [L222] EXPR var_1_32 >> var_1_32 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=1, var_1_16=-256, var_1_17=505, var_1_1=0, var_1_22=505, var_1_24=-1, var_1_26=0, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=-256, var_1_33=32, var_1_34=0, var_1_35=0, var_1_36=-4294967296, var_1_37=-4294967295, var_1_38=-224, var_1_39=31, var_1_40=507, var_1_41=507, var_1_42=507, var_1_44=506, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=31, var_1_49=-126, var_1_50=0, var_1_51=63, var_1_52=-63, var_1_53=8, var_1_54=506, var_1_55=0, var_1_7=0] [L222] EXPR ((32u < ((var_1_31 + 4u) | var_1_30)) ? (var_1_1 == ((signed long int) (var_1_26 + (var_1_26 + var_1_32)))) : ((! var_1_7) ? (var_1_1 == ((signed long int) ((((var_1_26) < ((var_1_11 - var_1_32))) ? (var_1_26) : ((var_1_11 - var_1_32)))))) : (var_1_1 == ((signed long int) (var_1_32 - var_1_13))))) && (((var_1_32 >> var_1_32) < var_1_13) ? (var_1_11 == ((unsigned short int) var_1_32)) : 1) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=1, var_1_16=-256, var_1_17=505, var_1_1=0, var_1_22=505, var_1_24=-1, var_1_26=0, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=-256, var_1_33=32, var_1_34=0, var_1_35=0, var_1_36=-4294967296, var_1_37=-4294967295, var_1_38=-224, var_1_39=31, var_1_40=507, var_1_41=507, var_1_42=507, var_1_44=506, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=31, var_1_49=-126, var_1_50=0, var_1_51=63, var_1_52=-63, var_1_53=8, var_1_54=506, var_1_55=0, var_1_7=0] [L222-L223] return ((((((((((32u < ((var_1_31 + 4u) | var_1_30)) ? (var_1_1 == ((signed long int) (var_1_26 + (var_1_26 + var_1_32)))) : ((! var_1_7) ? (var_1_1 == ((signed long int) ((((var_1_26) < ((var_1_11 - var_1_32))) ? (var_1_26) : ((var_1_11 - var_1_32)))))) : (var_1_1 == ((signed long int) (var_1_32 - var_1_13))))) && (((var_1_32 >> var_1_32) < var_1_13) ? (var_1_11 == ((unsigned short int) var_1_32)) : 1)) && ((last_1_var_1_1 != last_1_var_1_13) ? (var_1_13 == ((unsigned char) ((((var_1_15) < (var_1_16)) ? (var_1_15) : (var_1_16))))) : 1)) && (var_1_7 ? (var_1_17 == ((double) ((((((var_1_18 + var_1_19) - (var_1_20 - var_1_21))) < (((((var_1_22) > (var_1_23)) ? (var_1_22) : (var_1_23))))) ? (((var_1_18 + var_1_19) - (var_1_20 - var_1_21))) : (((((var_1_22) > (var_1_23)) ? (var_1_22) : (var_1_23)))))))) : (var_1_17 == ((double) var_1_22)))) && ((! var_1_7) ? (var_1_24 == ((signed long int) (var_1_11 - ((((((((var_1_30) > (var_1_13)) ? (var_1_30) : (var_1_13)))) < ((var_1_30 + var_1_15))) ? (((((var_1_30) > (var_1_13)) ? (var_1_30) : (var_1_13)))) : ((var_1_30 + var_1_15))))))) : ((var_1_11 < var_1_30) ? (var_1_24 == ((signed long int) -4)) : (var_1_24 == ((signed long int) var_1_26))))) && ((var_1_11 >= var_1_30) ? (var_1_26 == ((signed char) (var_1_27 + var_1_28))) : 1)) && (var_1_7 ? (var_1_29 == ((float) var_1_20)) : 1)) && (var_1_30 == ((unsigned short int) var_1_32))) && (var_1_31 == ((signed long int) var_1_13))) && (var_1_32 == ((unsigned char) var_1_16)) ; [L232] RET, EXPR property() [L232] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=1, var_1_16=-256, var_1_17=505, var_1_1=0, var_1_22=505, var_1_24=-1, var_1_26=0, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=-256, var_1_33=32, var_1_34=0, var_1_35=0, var_1_36=-4294967296, var_1_37=-4294967295, var_1_38=-224, var_1_39=31, var_1_40=507, var_1_41=507, var_1_42=507, var_1_44=506, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=31, var_1_49=-126, var_1_50=0, var_1_51=63, var_1_52=-63, var_1_53=8, var_1_54=506, var_1_55=0, var_1_7=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=1, var_1_16=-256, var_1_17=505, var_1_1=0, var_1_22=505, var_1_24=-1, var_1_26=0, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=-256, var_1_33=32, var_1_34=0, var_1_35=0, var_1_36=-4294967296, var_1_37=-4294967295, var_1_38=-224, var_1_39=31, var_1_40=507, var_1_41=507, var_1_42=507, var_1_44=506, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=31, var_1_49=-126, var_1_50=0, var_1_51=63, var_1_52=-63, var_1_53=8, var_1_54=506, var_1_55=0, var_1_7=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 122 locations, 233 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 13.1s, OverallIterations: 20, TraceHistogramMax: 40, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 5.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4392 SdHoareTripleChecker+Valid, 4.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4392 mSDsluCounter, 14863 SdHoareTripleChecker+Invalid, 3.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10082 mSDsCounter, 1149 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4001 IncrementalHoareTripleChecker+Invalid, 5150 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1149 mSolverCounterUnsat, 4781 mSDtfsCounter, 4001 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 407 GetRequests, 315 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=605occurred in iteration=17, InterpolantAutomatonStates: 101, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 19 MinimizatonAttempts, 2656 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 5.6s InterpolantComputationTime, 5430 NumberOfCodeBlocks, 5430 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 5150 ConstructedInterpolants, 0 QuantifiedInterpolants, 9774 SizeOfPredicates, 0 NumberOfNonLiveVariables, 589 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 20 InterpolantComputations, 19 PerfectInterpolantSequences, 62322/62400 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-17 01:37:09,221 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-cn_file-63.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 590452d92377852c876a6e949041483825ba0e70e1c24fb971a3d48a7c77ddb6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 01:37:10,996 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 01:37:11,063 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-17 01:37:11,074 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 01:37:11,075 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 01:37:11,097 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 01:37:11,097 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 01:37:11,097 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 01:37:11,098 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 01:37:11,098 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 01:37:11,098 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 01:37:11,098 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 01:37:11,098 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 01:37:11,098 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 01:37:11,098 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 01:37:11,098 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 01:37:11,098 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 01:37:11,098 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 01:37:11,098 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 01:37:11,098 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 01:37:11,098 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 01:37:11,098 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 01:37:11,099 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 01:37:11,099 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 01:37:11,099 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 01:37:11,099 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 01:37:11,099 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 01:37:11,099 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 01:37:11,099 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 01:37:11,099 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 01:37:11,099 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 01:37:11,099 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 01:37:11,099 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 01:37:11,099 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 01:37:11,099 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 01:37:11,099 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 01:37:11,099 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 01:37:11,099 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 01:37:11,099 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 01:37:11,099 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 01:37:11,100 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 01:37:11,100 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 01:37:11,100 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 01:37:11,100 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 01:37:11,100 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 01:37:11,100 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 590452d92377852c876a6e949041483825ba0e70e1c24fb971a3d48a7c77ddb6 [2025-03-17 01:37:11,349 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 01:37:11,356 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 01:37:11,362 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 01:37:11,362 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 01:37:11,363 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 01:37:11,366 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-cn_file-63.i [2025-03-17 01:37:12,577 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41756050d/52acc870adaf4059bc04e553b3528a5e/FLAGf5d7a4aab [2025-03-17 01:37:12,795 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 01:37:12,796 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-cn_file-63.i [2025-03-17 01:37:12,805 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41756050d/52acc870adaf4059bc04e553b3528a5e/FLAGf5d7a4aab [2025-03-17 01:37:12,822 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41756050d/52acc870adaf4059bc04e553b3528a5e [2025-03-17 01:37:12,824 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 01:37:12,825 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 01:37:12,826 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 01:37:12,827 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 01:37:12,831 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 01:37:12,832 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 01:37:12" (1/1) ... [2025-03-17 01:37:12,832 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c5c8c27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:37:12, skipping insertion in model container [2025-03-17 01:37:12,834 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 01:37:12" (1/1) ... [2025-03-17 01:37:12,854 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 01:37:12,956 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-cn_file-63.i[919,932] [2025-03-17 01:37:13,038 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 01:37:13,056 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 01:37:13,067 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-cn_file-63.i[919,932] [2025-03-17 01:37:13,115 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 01:37:13,139 INFO L204 MainTranslator]: Completed translation [2025-03-17 01:37:13,140 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:37:13 WrapperNode [2025-03-17 01:37:13,140 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 01:37:13,141 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 01:37:13,141 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 01:37:13,141 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 01:37:13,145 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:37:13" (1/1) ... [2025-03-17 01:37:13,155 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:37:13" (1/1) ... [2025-03-17 01:37:13,192 INFO L138 Inliner]: procedures = 27, calls = 53, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 244 [2025-03-17 01:37:13,192 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 01:37:13,193 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 01:37:13,193 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 01:37:13,195 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 01:37:13,201 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:37:13" (1/1) ... [2025-03-17 01:37:13,201 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:37:13" (1/1) ... [2025-03-17 01:37:13,206 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:37:13" (1/1) ... [2025-03-17 01:37:13,227 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-17 01:37:13,227 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:37:13" (1/1) ... [2025-03-17 01:37:13,227 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:37:13" (1/1) ... [2025-03-17 01:37:13,240 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:37:13" (1/1) ... [2025-03-17 01:37:13,241 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:37:13" (1/1) ... [2025-03-17 01:37:13,244 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:37:13" (1/1) ... [2025-03-17 01:37:13,247 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:37:13" (1/1) ... [2025-03-17 01:37:13,249 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 01:37:13,250 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 01:37:13,250 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 01:37:13,251 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 01:37:13,251 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:37:13" (1/1) ... [2025-03-17 01:37:13,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 01:37:13,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 01:37:13,275 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 01:37:13,278 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 01:37:13,295 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 01:37:13,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 01:37:13,295 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 01:37:13,295 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 01:37:13,295 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 01:37:13,295 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 01:37:13,372 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 01:37:13,373 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 01:37:21,691 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-03-17 01:37:21,691 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 01:37:21,700 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 01:37:21,700 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 01:37:21,700 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 01:37:21 BoogieIcfgContainer [2025-03-17 01:37:21,700 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 01:37:21,705 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 01:37:21,705 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 01:37:21,709 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 01:37:21,709 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 01:37:12" (1/3) ... [2025-03-17 01:37:21,710 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17243815 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 01:37:21, skipping insertion in model container [2025-03-17 01:37:21,710 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:37:13" (2/3) ... [2025-03-17 01:37:21,710 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17243815 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 01:37:21, skipping insertion in model container [2025-03-17 01:37:21,710 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 01:37:21" (3/3) ... [2025-03-17 01:37:21,712 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-cn_file-63.i [2025-03-17 01:37:21,721 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 01:37:21,722 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pr-cn_file-63.i that has 2 procedures, 100 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 01:37:21,784 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 01:37:21,792 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;@42dbc6bc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 01:37:21,792 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 01:37:21,795 INFO L276 IsEmpty]: Start isEmpty. Operand has 100 states, 57 states have (on average 1.3859649122807018) internal successors, (79), 58 states have internal predecessors, (79), 40 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-17 01:37:21,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2025-03-17 01:37:21,807 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:37:21,808 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:37:21,808 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:37:21,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:37:21,814 INFO L85 PathProgramCache]: Analyzing trace with hash 1578972355, now seen corresponding path program 1 times [2025-03-17 01:37:21,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 01:37:21,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [110192090] [2025-03-17 01:37:21,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:37:21,825 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 01:37:21,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 01:37:21,828 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 01:37:21,829 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-17 01:37:21,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 247 statements into 1 equivalence classes. [2025-03-17 01:37:22,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 247 of 247 statements. [2025-03-17 01:37:22,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:37:22,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:37:22,360 INFO L256 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 01:37:22,367 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 01:37:22,413 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 1158 proven. 0 refuted. 0 times theorem prover too weak. 1962 trivial. 0 not checked. [2025-03-17 01:37:22,413 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 01:37:22,414 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 01:37:22,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [110192090] [2025-03-17 01:37:22,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [110192090] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:37:22,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:37:22,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 01:37:22,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764897450] [2025-03-17 01:37:22,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:37:22,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 01:37:22,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 01:37:22,436 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 01:37:22,436 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 01:37:22,438 INFO L87 Difference]: Start difference. First operand has 100 states, 57 states have (on average 1.3859649122807018) internal successors, (79), 58 states have internal predecessors, (79), 40 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) Second operand has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) [2025-03-17 01:37:22,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:37:22,462 INFO L93 Difference]: Finished difference Result 197 states and 356 transitions. [2025-03-17 01:37:22,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 01:37:22,463 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) Word has length 247 [2025-03-17 01:37:22,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:37:22,467 INFO L225 Difference]: With dead ends: 197 [2025-03-17 01:37:22,467 INFO L226 Difference]: Without dead ends: 98 [2025-03-17 01:37:22,470 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 01:37:22,471 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-03-17 01:37:22,472 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-03-17 01:37:22,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-03-17 01:37:22,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2025-03-17 01:37:22,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 56 states have (on average 1.3392857142857142) internal successors, (75), 56 states have internal predecessors, (75), 40 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-17 01:37:22,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 155 transitions. [2025-03-17 01:37:22,514 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 155 transitions. Word has length 247 [2025-03-17 01:37:22,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:37:22,514 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 155 transitions. [2025-03-17 01:37:22,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) [2025-03-17 01:37:22,515 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 155 transitions. [2025-03-17 01:37:22,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2025-03-17 01:37:22,517 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:37:22,517 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:37:22,533 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-17 01:37:22,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 01:37:22,718 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:37:22,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:37:22,720 INFO L85 PathProgramCache]: Analyzing trace with hash 966559641, now seen corresponding path program 1 times [2025-03-17 01:37:22,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 01:37:22,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1827646770] [2025-03-17 01:37:22,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:37:22,721 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 01:37:22,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 01:37:22,723 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 01:37:22,724 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-17 01:37:22,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 247 statements into 1 equivalence classes. [2025-03-17 01:37:23,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 247 of 247 statements. [2025-03-17 01:37:23,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:37:23,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:37:23,233 INFO L256 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 01:37:23,244 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 01:37:25,674 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2025-03-17 01:37:25,675 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 01:37:25,675 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 01:37:25,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1827646770] [2025-03-17 01:37:25,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1827646770] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:37:25,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:37:25,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 01:37:25,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409096703] [2025-03-17 01:37:25,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:37:25,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 01:37:25,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 01:37:25,677 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 01:37:25,677 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 01:37:25,677 INFO L87 Difference]: Start difference. First operand 98 states and 155 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-17 01:37:30,511 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 01:37:34,719 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 01:37:34,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:37:34,719 INFO L93 Difference]: Finished difference Result 293 states and 464 transitions. [2025-03-17 01:37:34,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 01:37:34,751 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 247 [2025-03-17 01:37:34,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:37:34,754 INFO L225 Difference]: With dead ends: 293 [2025-03-17 01:37:34,754 INFO L226 Difference]: Without dead ends: 196 [2025-03-17 01:37:34,755 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 243 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-17 01:37:34,755 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 103 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 81 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.9s IncrementalHoareTripleChecker+Time [2025-03-17 01:37:34,755 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 508 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 109 Invalid, 1 Unknown, 0 Unchecked, 8.9s Time] [2025-03-17 01:37:34,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2025-03-17 01:37:34,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 169. [2025-03-17 01:37:34,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 86 states have (on average 1.2209302325581395) internal successors, (105), 86 states have internal predecessors, (105), 80 states have call successors, (80), 2 states have call predecessors, (80), 2 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) [2025-03-17 01:37:34,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 265 transitions. [2025-03-17 01:37:34,797 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 265 transitions. Word has length 247 [2025-03-17 01:37:34,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:37:34,799 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 265 transitions. [2025-03-17 01:37:34,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-17 01:37:34,800 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 265 transitions. [2025-03-17 01:37:34,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2025-03-17 01:37:34,802 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:37:34,803 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:37:34,821 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-17 01:37:35,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 01:37:35,003 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:37:35,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:37:35,004 INFO L85 PathProgramCache]: Analyzing trace with hash 557735416, now seen corresponding path program 1 times [2025-03-17 01:37:35,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 01:37:35,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [914668636] [2025-03-17 01:37:35,005 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:37:35,005 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 01:37:35,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 01:37:35,007 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 01:37:35,009 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-17 01:37:35,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 247 statements into 1 equivalence classes. [2025-03-17 01:37:35,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 247 of 247 statements. [2025-03-17 01:37:35,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:37:35,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:37:35,503 INFO L256 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 01:37:35,508 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 01:37:35,635 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2025-03-17 01:37:35,635 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 01:37:35,635 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 01:37:35,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [914668636] [2025-03-17 01:37:35,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [914668636] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:37:35,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:37:35,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 01:37:35,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791608176] [2025-03-17 01:37:35,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:37:35,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 01:37:35,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 01:37:35,637 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 01:37:35,637 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 01:37:35,637 INFO L87 Difference]: Start difference. First operand 169 states and 265 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-17 01:37:39,851 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.97s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 01:37:39,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:37:39,930 INFO L93 Difference]: Finished difference Result 290 states and 458 transitions. [2025-03-17 01:37:39,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 01:37:39,931 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 247 [2025-03-17 01:37:39,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:37:39,933 INFO L225 Difference]: With dead ends: 290 [2025-03-17 01:37:39,933 INFO L226 Difference]: Without dead ends: 193 [2025-03-17 01:37:39,934 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 245 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 01:37:39,934 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 25 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2025-03-17 01:37:39,934 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 299 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2025-03-17 01:37:39,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2025-03-17 01:37:39,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 186. [2025-03-17 01:37:39,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 103 states have (on average 1.2912621359223302) internal successors, (133), 103 states have internal predecessors, (133), 80 states have call successors, (80), 2 states have call predecessors, (80), 2 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) [2025-03-17 01:37:39,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 293 transitions. [2025-03-17 01:37:39,953 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 293 transitions. Word has length 247 [2025-03-17 01:37:39,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:37:39,955 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 293 transitions. [2025-03-17 01:37:39,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-17 01:37:39,955 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 293 transitions. [2025-03-17 01:37:39,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2025-03-17 01:37:39,958 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:37:39,958 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:37:39,977 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2025-03-17 01:37:40,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 01:37:40,159 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:37:40,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:37:40,160 INFO L85 PathProgramCache]: Analyzing trace with hash 913972760, now seen corresponding path program 1 times [2025-03-17 01:37:40,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 01:37:40,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1182823140] [2025-03-17 01:37:40,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:37:40,160 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 01:37:40,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 01:37:40,163 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 01:37:40,163 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-03-17 01:37:40,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 247 statements into 1 equivalence classes. [2025-03-17 01:37:40,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 247 of 247 statements. [2025-03-17 01:37:40,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:37:40,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:37:40,611 INFO L256 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-17 01:37:40,617 INFO L279 TraceCheckSpWp]: Computing forward predicates...